	ID	题目显示标签隐藏标签	AC / 尝试	难度
	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	(无)
	86	P1551A Polycarp and Coins greedy math *800	0 / 0	(无)
	85	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	(无)
	84	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(无)
	83	P1551C Interesting Story greedy sortings strings *1500	0 / 0	(无)
	82	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	(无)
	81	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	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	(无)
	78	P1552A Subsequence Permutation sortings strings *800	0 / 0	(无)
	77	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	(无)
	76	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(无)
	75	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(无)
	74	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	(无)
	73	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(无)
	72	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	(无)
	71	P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	(无)
	70	P1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	(无)
	69	P1553A Digits Sum math number theory *800	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	(无)
	65	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	(无)
	64	P1553F Pairwise Modulo data structures math *2300	0 / 0	(无)
	63	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	(无)
	62	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(无)
	61	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(无)
	60	P1554A Cherry greedy *800	0 / 0	(无)
	59	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	(无)
	58	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	(无)
	57	P1554D Diane constructive algorithms greedy strings *1800	0 / 0	(无)
	56	P1554E You dfs and similar dp math number theory *2600	0 / 0	(无)
	55	P1555A PizzaForces brute force math *900	0 / 0	(无)
	54	P1555B Two Tables brute force *1300	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	(无)
	51	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	(无)
	50	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	(无)
	49	P1556A A Variety of Operations math *800	0 / 0	(无)
	48	P1556B Take Your Places! implementation *1300	0 / 0	(无)
	47	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	(无)
	46	P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	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	(无)
	43	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	(无)
	42	P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	(无)
	41	P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	(无)
	40	P1557B Moamen and k-subarrays greedy sortings *1100	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	(无)
	37	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	(无)
	36	P1558A Charmed by the Game brute force math *1300	0 / 0	(无)
	35	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(无)
	34	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	(无)
	33	P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	(无)
	32	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(无)
	31	P1558F Strange Sort data structures sortings *3300	0 / 0	(无)
	30	P1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	(无)
	29	P1559B Mocha and Red and Blue dp greedy *900	0 / 0	(无)
	28	P1559C Mocha and Hiking constructive algorithms graphs *1200	0 / 0	(无)
	26	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(无)
	27	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(无)
	24	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(无)
	23	P1560A Dislike of Threes implementation *800	0 / 0	(无)
	22	P1560B Who's Opposite? math *800	0 / 0	(无)
	21	P1560C Infinity Table implementation math *800	0 / 0	(无)
	20	P1560D Make a Power of Two greedy math strings *1300	0 / 0	(无)
	19	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	(无)
	18	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(无)
	17	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(无)
	16	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	(无)
	15	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(无)
	14	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(无)
	13	P1562A The Miracle and the Sleeper greedy math *800	0 / 0	(无)
	12	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	(无)
	11	P1562C Rings constructive algorithms math *1500	0 / 0	(无)
	10	P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	(无)
	9	P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	(无)
	8	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(无)
	7	P1562F Tubular Bells interactive math number theory probabilities *2900	0 / 0	(无)
	7226	P1566A Median Maximization greedy math	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	(无)
	7223	P1566D1 Seating Arrangements (easy version) greedy sortings	0 / 0	(无)
	7222	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings	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	(无)
	7219	P1566G Four Vertices constructive algorithms graphs greedy implementation shortest paths	0 / 0	(无)
	7218	P1566H Xor-quiz constructive algorithms dp interactive math number theory	0 / 0	(无)
	6	P1567A Domino Disaster implementation strings	0 / 0	(无)
	5	P1567B MEXor Mixup bitmasks greedy	0 / 0	(无)
	4	P1567C Carrying Conundrum bitmasks combinatorics dp	0 / 0	(无)
	3	P1567D Expression Evaluation Error constructive algorithms data structures greedy implementation math	0 / 0	(无)
	2	P1567E Non-Decreasing Dilemma data structures divide and conquer implementation	0 / 0	(无)
	1	P1567F One-Four Overload constructive algorithms dfs and similar dsu graphs implementation	0 / 0	(无)
	107	P1569A Balanced Substring implementation	0 / 0	(无)
	106	P1569B Chess Tournament constructive algorithms	0 / 0	(无)
	105	P1569C Jury Meeting combinatorics math	0 / 0	(无)
	104	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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