	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1594	P1260A Heating math *1000	0 / 0	(无)
	1593	P1260B Obtain Two Zeroes binary search math *1300	0 / 0	(无)
	1592	P1260C Infinite Fence greedy math number theory *1700	0 / 0	(无)
	1591	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	(无)
	1590	P1260E Tournament brute force dp greedy *2400	0 / 0	(无)
	1589	P1260F Colored Tree data structures trees *2700	0 / 0	(无)
	1588	P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	(无)
	1587	P1263A Sweet Problem math *1100	0 / 0	(无)
	1586	P1263B PIN Codes greedy implementation *1400	0 / 0	(无)
	1585	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	(无)
	1584	P1263D Secret Passwords dfs and similar dsu graphs *1500	0 / 0	(无)
	1583	P1263E Editor data structures implementation *2100	0 / 0	(无)
	1582	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	(无)
	1581	P1264A Beautiful Regional Contest greedy implementation *1500	0 / 0	(无)
	1580	P1264B Beautiful Sequence brute force constructive algorithms greedy *1900	0 / 0	(无)
	1579	P1264C Beautiful Mirrors with queries data structures probabilities *2400	0 / 0	(无)
	1578	P1264D1 Beautiful Bracket Sequence (easy version) combinatorics dp probabilities *2600	0 / 0	(无)
	1577	P1264D2 Beautiful Bracket Sequence (hard version) combinatorics probabilities *2900	0 / 0	(无)
	1576	P1264E Beautiful League constructive algorithms flows graph matchings *2700	0 / 0	(无)
	1575	P1264F Beautiful Fibonacci Problem constructive algorithms number theory *3500	0 / 0	(无)
	1574	P1265A Beautiful String constructive algorithms greedy *1000	0 / 0	(无)
	1573	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	(无)
	1572	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	(无)
	1571	P1266A Competitive Programmer chinese remainder theorem math *1000	0 / 0	(无)
	1570	P1266B Dice Tower constructive algorithms math *1000	0 / 0	(无)
	1569	P1266C Diverse Matrix constructive algorithms greedy math number theory *1400	0 / 0	(无)
	1568	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	(无)
	1567	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	(无)
	1566	P1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	(无)
	1565	P1266G Permutation Concatenation string suffix structures *3300	0 / 0	(无)
	1564	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	(无)
	1563	P1267A __NO_TITLE__	0 / 0	(无)
	1562	P1267B Balls of Buma *900	0 / 0	(无)
	1561	P1267C __NO_TITLE__	0 / 0	(无)
	1560	P1267D DevOps Best Practices constructive algorithms *2800	0 / 0	(无)
	1559	P1267E Elections greedy *1700	0 / 0	(无)
	1558	P1267F __NO_TITLE__	0 / 0	(无)
	1557	P1267G Game Relics math probabilities *3000	0 / 0	(无)
	1556	P1267H Help BerLine constructive algorithms *3200	0 / 0	(无)
	1555	P1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	(无)
	1554	P1267J Just Arrange the Icons greedy implementation math *1800	0 / 0	(无)
	1553	P1267K Key Storage combinatorics math *2100	0 / 0	(无)
	1552	P1267L Lexicography constructive algorithms strings *1800	0 / 0	(无)
	1551	P1268A Long Beautiful Integer constructive algorithms greedy implementation strings *1700	0 / 0	(无)
	1550	P1268B Domino for Young dp greedy math *2000	0 / 0	(无)
	1549	P1268C K Integers binary search data structures *2300	0 / 0	(无)
	1548	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(无)
	1547	P1268E Happy Cactus dp *3400	0 / 0	(无)
	1546	P1269A Equation brute force math *800	0 / 0	(无)
	1545	P1269B Modulo Equality brute force sortings *1500	0 / 0	(无)
	1544	P1270A Card Game games greedy math *800	0 / 0	(无)
	1543	P1270B Interesting Subarray constructive algorithms greedy math *1200	0 / 0	(无)
	1542	P1270C Make Good bitmasks constructive algorithms math *1400	0 / 0	(无)
	1541	P1270D Strange Device constructive algorithms interactive math sortings *1900	0 / 0	(无)
	1540	P1270E Divide Points constructive algorithms geometry math *2300	0 / 0	(无)
	1539	P1270F Awesome Substrings math strings *2600	0 / 0	(无)
	1538	P1270G Subset with Zero Sum constructive algorithms dfs and similar graphs math *2700	0 / 0	(无)
	1537	P1270H Number of Components data structures *3300	0 / 0	(无)
	1536	P1270I Xor on Figures constructive algorithms fft math *3500	0 / 0	(无)
	1535	P1271A Suits brute force greedy math *800	0 / 0	(无)
	1534	P1271B Blocks greedy math *1300	0 / 0	(无)
	1533	P1271C Shawarma Tent brute force geometry greedy implementation *1300	0 / 0	(无)
	1532	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	(无)
	1531	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	(无)
	1530	P1271F Divide The Students brute force *2700	0 / 0	(无)
	1529	P1272A Three Friends brute force greedy math sortings *900	0 / 0	(无)
	1528	P1272B Snow Walking Robot constructive algorithms greedy implementation *1200	0 / 0	(无)
	1527	P1272C Yet Another Broken Keyboard combinatorics dp implementation *1200	0 / 0	(无)
	1526	P1272D Remove One Element brute force dp *1500	0 / 0	(无)
	1525	P1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	(无)
	1524	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	(无)
	1523	P1275A Скрытый друг *special problem	0 / 0	(无)
	1522	P1275B Code Review *special problem	0 / 0	(无)
	1521	P1275C #define Задача B ... *special problem	0 / 0	(无)
	1520	P1275D Storage2 *special problem	0 / 0	(无)
	1519	P1275E1 Контрольная сумма *special problem	0 / 0	(无)
	1518	P1275E2 Контрольная сумма *special problem	0 / 0	(无)
	1517	P1275E3 Контрольная сумма *special problem	0 / 0	(无)
	1516	P1275F Шардирование постов *special problem binary search interactive	0 / 0	(无)
	1515	P1276A As Simple as One and Two dp greedy *1400	0 / 0	(无)
	1514	P1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	(无)
	1513	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	(无)
	1512	P1276D Tree Elimination dp trees *2900	0 / 0	(无)
	1511	P1276E Four Stones constructive algorithms *3500	0 / 0	(无)
	1510	P1276F Asterisk Substrings string suffix structures *3400	0 / 0	(无)
	1509	P1277A Happy Birthday, Polycarp! implementation *1000	0 / 0	(无)
	1508	P1277B Make Them Odd greedy number theory *1200	0 / 0	(无)
	1507	P1277D Let's Play the Words? data structures hashing implementation math *1900	0 / 0	(无)
	1506	P1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	(无)
	1505	P1278B A and B greedy math *1500	0 / 0	(无)
	1504	P1278C Berry Jam data structures dp greedy implementation *1700	0 / 0	(无)
	1503	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	(无)
	1502	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	(无)
	1501	P1278F Cards combinatorics dp math number theory probabilities *2600	0 / 0	(无)
	1500	P1279A New Year Garland math *900	0 / 0	(无)
	1499	P1279B Verse For Santa binary search brute force implementation *1300	0 / 0	(无)
	1498	P1279C Stack of Presents data structures implementation *1400	0 / 0	(无)
	1497	P1279D Santa's Bot combinatorics math probabilities *1700	0 / 0	(无)
	1496	P1279E New Year Permutations combinatorics dp *2700	0 / 0	(无)
	1495	P1279F New Year and Handle Change binary search dp *2800	0 / 0	(无)

HGNU

根据当前过滤条件随机选择一道题

状态

支持

开发与维护

杨旭龙、王树淳、王国斌、宋文宇、朱天伦

特别鸣谢

肖飞、关玉蓉、魏银珍、周芬

Worker 0, 155ms
Powered by Hydro v4.13.4
Modified by HGNU ACM TEAM (Repo Link)