	ID	题目显示标签隐藏标签	AC / 尝试	难度
	311	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	(无)
	310	P1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 0	(无)
	304	P1512F Education brute force dp greedy implementation *1900	0 / 0	(无)
	303	P1512G Short Task brute force dp math number theory *1700	0 / 0	(无)
	300	P1513C Add One dp matrices *1600	0 / 0	(无)
	287	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	(无)
	281	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	(无)
	280	P1516C Baby Ehab Partitions Again bitmasks constructive algorithms dp math *1700	0 / 0	(无)
	279	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	(无)
	278	P1516E Baby Ehab Plays with Permutations combinatorics dp math *2500	0 / 0	(无)
	274	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	(无)
	272	P1517F Reunion combinatorics dp trees *3200	0 / 0	(无)
	270	P1517H Fly Around the World dp geometry *3500	0 / 0	(无)
	268	P1519B The Cake Is a Lie dp math *800	0 / 0	(无)
	266	P1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	(无)
	264	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	(无)
	252	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	(无)
	251	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	(无)
	247	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	(无)
	246	P1523E Crypto Lights combinatorics dp math probabilities *2600	0 / 0	(无)
	245	P1523F Favorite Game bitmasks dp *3300	0 / 0	(无)
	243	P1523H Hopping Around the Array data structures dp *3500	0 / 0	(无)
	239	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	(无)
	238	P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	(无)
	237	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	(无)
	235	P1526B I Hate 1111 dp math number theory *1400	0 / 0	(无)
	234	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	(无)
	224	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(无)
	223	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(无)
	222	P1528B Kavi on Pairing Duty combinatorics dp math *1700	0 / 0	(无)
	219	P1528E Mashtali and Hagh Trees combinatorics dp trees *2900	0 / 0	(无)
	210	P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	(无)
	208	P1530H Turing's Award data structures dp *3400	0 / 0	(无)
	204	P1531C Симметричный амфитеатр *special problem constructive algorithms dp	0 / 0	(无)
	186	P1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(无)
	181	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	(无)
	177	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(无)
	176	P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	(无)
	175	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	(无)
	172	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	(无)
	171	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(无)
	170	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	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	(无)
	155	P1538A Stone Game brute force dp greedy *800	0 / 0	(无)
	150	P1538F Interesting Function binary search dp math number theory *1500	0 / 0	(无)
	147	P1539B Love Song dp implementation strings *800	0 / 0	(无)
	144	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(无)
	141	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(无)
	140	P1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	(无)
	139	P1540C2 Converging Array (Hard Version) dp math *2900	0 / 0	(无)
	131	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	(无)
	130	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	(无)
	129	P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	(无)
	118	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	(无)
	117	P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	(无)
	116	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	(无)
	109	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(无)
	1878	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(无)
	98	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(无)
	1875	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(无)
	88	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(无)
	87	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(无)
	80	P1551E Fixed Points binary search brute force dp *2000	0 / 0	(无)
	79	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(无)
	75	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(无)
	73	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(无)
	68	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	(无)
	67	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	(无)
	66	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	(无)
	61	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(无)
	56	P1554E You dfs and similar dp math number theory *2600	0 / 0	(无)
	53	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	(无)
	52	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	(无)
	45	P1556E Equilibrium data structures dp greedy *2200	0 / 0	(无)
	44	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(无)
	39	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	(无)
	38	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	(无)
	35	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(无)
	29	P1559B Mocha and Red and Blue dp greedy *900	0 / 0	(无)
	24	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(无)
	17	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(无)
	14	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(无)
	10	P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	(无)
	8	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(无)
	7225	P1566B MIN-MEX Cut bitmasks constructive algorithms dp	0 / 0	(无)
	7224	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy	0 / 0	(无)
	7221	P1566E Buds Re-hanging dfs and similar dp graphs greedy trees	0 / 0	(无)
	7220	P1566F Points Movement data structures dp	0 / 0	(无)
	7218	P1566H Xor-quiz constructive algorithms dp interactive math number theory	0 / 0	(无)
	4	P1567C Carrying Conundrum bitmasks combinatorics dp	0 / 0	(无)
	102	P1569F Palindromic Hamiltonian Path dp graphs	0 / 0	(无)
	7304	P1571E Fix the String *special problem bitmasks dp greedy	0 / 0	(无)
	7303	P1571F Kotlinforces *special problem constructive algorithms dp	0 / 0	(无)
	7302	P1571G A Battle Against a Dragon *special problem data structures dp	0 / 0	(无)
	7234	P1572A Book dp graphs implementation *1800	0 / 0	(无)
	7232	P1572C Paint dp greedy *2700	0 / 0	(无)
	7230	P1572E Polygon binary search dp *3000	0 / 0	(无)
	7235	P1574F Occurrences combinatorics dp dsu fft graphs	0 / 0	(无)
	7279	P1575D Divisible by Twenty-Five brute force dfs and similar dp	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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