	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2128	P1166F Vicky's Delivery Service data structures dsu graphs hashing *2400	0 / 0	(无)
	2084	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	(无)
	2049	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	(无)
	1916	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(无)
	1917	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(无)
	1855	P1207G Indie Album data structures dfs and similar hashing string suffix structures strings trees *2700	0 / 0	(无)
	1808	P1214D Treasure Island dfs and similar dp flows hashing *1900	0 / 0	(无)
	1754	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	(无)
	1748	P1225D Power Products hashing math number theory *1800	0 / 0	(无)
	1732	P1228D Complete Tripartite brute force constructive algorithms graphs hashing implementation *1900	0 / 0	(无)
	1629	P1252F Regular Forestation hashing trees *2400	0 / 0	(无)
	1596	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(无)
	1507	P1277D Let's Play the Words? data structures hashing implementation math *1900	0 / 0	(无)
	1471	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	(无)
	1458	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	(无)
	1325	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	(无)
	1312	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	(无)
	1305	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	(无)
	1284	P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	(无)
	1283	P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	(无)
	1202	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	(无)
	1080	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(无)
	903	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(无)
	902	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(无)
	900	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(无)
	788	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	(无)
	626	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	(无)
	560	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	(无)
	547	P1468F Full Turn geometry hashing number theory *1700	0 / 0	(无)
	534	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	(无)
	531	P1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	(无)
	493	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	(无)
	491	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	(无)
	405	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	(无)
	398	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	(无)
	368	P1500A Going Home brute force hashing implementation math *1800	0 / 0	(无)
	260	P1520D Same Differences data structures hashing math *1200	0 / 0	(无)
	226	P1527C Sequence Pair Weight hashing implementation math *1600	0 / 0	(无)
	190	P1533D String Searching *special problem hashing	0 / 0	(无)
	169	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	(无)
	166	P1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	(无)
	158	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	(无)
	157	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	(无)
	151	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	(无)
	68	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	(无)
	63	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	(无)
	1873	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle	0 / 0	(无)
	7237	P1574D The Strongest Build binary search data structures dfs and similar graphs greedy hashing implementation shortest paths	0 / 0	(无)
	7443	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	(无)
	7508	P1887C Minimum Array binary search brute force constructive algorithms data structures greedy hashing two pointers *2400	0 / 0	9
	7480	P1895C Torn Lucky Ticket brute force dp hashing implementation math *1400	0 / 0	4
	7954	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	7933	P1986G2 Permutation Problem (Hard Version) brute force data structures hashing math number theory *2500	0 / 0	9
	7880	P1994H Fortnite combinatorics constructive algorithms games greedy hashing interactive math number theory strings *3500	0 / 0	10
	7866	P1996G Penacony brute force data structures graphs greedy hashing	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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