	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7526	P1883C Raspberries dp math *1000	0 / 0	3
	7525	P1883D In Love data structures greedy *1500	0 / 0	5
	7524	P1883E Look Back bitmasks greedy *1700	0 / 0	5
	7523	P1883F You Are So Beautiful data structures *1400	0 / 0	4
	7522	P1883G1 Dances (Easy version) binary search greedy two pointers *1400	0 / 0	4
	7521	P1883G2 Dances (Hard Version) binary search greedy sortings two pointers *1900	0 / 0	6
	7520	P1884A Simple Design brute force greedy math *800	0 / 0	3
	7519	P1884B Haunted House binary search greedy math two pointers *1100	0 / 0	3
	7518	P1884C Medium Design brute force data structures dp greedy sortings *1700	0 / 0	5
	7517	P1884D Counting Rhyme dp math number theory *2100	0 / 0	7
	7516	P1884E Hard Design greedy implementation math *2800	0 / 0	10
	7515	P1886A Sum of Three brute force constructive algorithms math *800	0 / 0	3
	7514	P1886B Fear of the Dark binary search geometry math *1200	0 / 0	4
	7513	P1886C Decreasing String implementation strings *1600	0 / 0	5
	7512	P1886D Monocarp and the Set combinatorics data structures math *2100	0 / 0	7
	7511	P1886E I Wanna be the Team Leader bitmasks constructive algorithms dp greedy math sortings two pointers *2400	0 / 0	9
	7510	P1886F Diamond Theft data structures greedy *3300	0 / 0	10
	7509	P1887B Time Travel binary search graphs shortest paths *1900	0 / 0	6
	7508	P1887C Minimum Array binary search brute force constructive algorithms data structures greedy hashing two pointers *2400	0 / 0	9
	7507	P1887D Split binary search data structures divide and conquer dsu math trees two pointers *2700	0 / 0	10
	7506	P1887E Good Colorings binary search constructive algorithms graphs interactive *3100	0 / 0	10
	7505	P1887F Minimum Segments constructive algorithms *3400	0 / 0	10
	7504	P1889A Qingshan Loves Strings 2 constructive algorithms greedy implementation *1300	0 / 0	4
	7503	P1889B Doremy's Connecting Plan constructive algorithms greedy math sortings *1700	0 / 0	5
	7502	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings *2000	0 / 0	7
	7501	P1889C2 Doremy's Drying Plan (Hard Version) data structures dp *2600	0 / 0	10
	7500	P1889D Game of Stacks brute force dfs and similar graphs implementation trees *3000	0 / 0	10
	7499	P1889E Doremy's Swapping Trees dfs and similar graphs trees *3500	0 / 0	10
	7498	P1889F Doremy's Average Tree data structures dp greedy trees *3500	0 / 0	10
	7497	P1890A Doremy's Paint 3 constructive algorithms *800	0 / 0	3
	7496	P1890B Qingshan Loves Strings constructive algorithms implementation *800	0 / 0	3
	7495	P1891A Sorting with Twos constructive algorithms sortings *800	0 / 0	3
	7494	P1891B Deja Vu brute force math sortings *1100	0 / 0	3
	7493	P1891C Smilo and Monsters binary search constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	7492	P1891D Suspicious logarithms binary search brute force math *1900	0 / 0	6
	7491	P1891E Brukhovich and Exams brute force greedy implementation math sortings *2500	0 / 0	9
	7490	P1891F A Growing Tree data structures dfs and similar trees *2000	0 / 0	7
	7489	P1893A Anonymous Informant brute force dfs and similar graphs implementation *1400	0 / 0	4
	7488	P1893B Neutral Tonality constructive algorithms greedy sortings two pointers *1700	0 / 0	5
	7487	P1893C Freedom of Choice brute force greedy implementation *2000	0 / 0	7
	7486	P1893D Colorful Constructive constructive algorithms data structures greedy *2600	0 / 0	10
	7485	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	7484	P1894A Secret Sport implementation strings *800	0 / 0	3
	7483	P1894B Two Out of Three constructive algorithms *1000	0 / 0	3
	7482	P1895A Treasure Chest math *800	0 / 0	3
	7481	P1895B Points and Minimum Distance greedy math sortings *800	0 / 0	3
	7480	P1895C Torn Lucky Ticket brute force dp hashing implementation math *1400	0 / 0	4
	7479	P1895D XOR Construction bitmasks constructive algorithms data structures math string suffix structures trees *1900	0 / 0	6
	7478	P1895E Infinite Card Game binary search brute force data structures dfs and similar dp dsu games graphs greedy sortings two pointers *2300	0 / 0	8
	7477	P1895F Fancy Arrays combinatorics dp math matrices *2600	0 / 0	10
	7476	P1895G Two Characters, Two Colors binary search data structures dp flows greedy *3100	0 / 0	10
	7959	P1983G Your Loss bitmasks brute force dp trees *3000	0 / 0	10
	7958	P1984A Strange Splitting constructive algorithms *800	0 / 0	3
	7957	P1984B Large Addition implementation math *1100	0 / 0	3
	7956	P1984C1 Magnitude (Easy Version) dp greedy math *1300	0 / 0	4
	7955	P1984C2 Magnitude (Hard Version) combinatorics dp greedy math *1700	0 / 0	5
	7954	P1984D "a" String Problem brute force hashing implementation math string suffix structures strings *2000	0 / 0	7
	7953	P1984E Shuffle dp greedy trees *2400	0 / 0	9
	7952	P1984F Reconstruction brute force dp math *2500	0 / 0	9
	7951	P1984G Magic Trick II constructive algorithms implementation sortings *3200	0 / 0	10
	7950	P1984H Tower Capturing combinatorics dp geometry *3300	0 / 0	10
	7949	P1985A Creating Words implementation strings *800	0 / 0	3
	7948	P1985B Maximum Multiple Sum brute force math number theory *800	0 / 0	3
	7947	P1985C Good Prefixes greedy *1000	0 / 0	3
	7946	P1985D Manhattan Circle implementation math *900	0 / 0	3
	7945	P1985E Secret Box brute force combinatorics math *1200	0 / 0	4
	7944	P1985F Final Boss binary search data structures *1500	0 / 0	5
	7943	P1985G D-Function combinatorics math number theory *1600	0 / 0	5
	7942	P1985H1 Maximize the Largest Component (Easy Version) brute force data structures dfs and similar dsu graphs implementation *1700	0 / 0	5
	7941	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	7940	P1986A X Axis brute force geometry math sortings *800	0 / 0	3
	7939	P1986B Matrix Stabilization brute force data structures greedy sortings *1000	0 / 0	3
	7938	P1986C Update Queries data structures greedy sortings *1100	0 / 0	3
	7937	P1986D Mathematical Problem brute force dp greedy implementation math two pointers *1400	0 / 0	4
	7936	P1986E Beautiful Array greedy math number theory sortings *1700	0 / 0	5
	7935	P1986F Non-academic Problem dfs and similar graphs trees *1900	0 / 0	6
	7934	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8
	7933	P1986G2 Permutation Problem (Hard Version) brute force data structures hashing math number theory *2500	0 / 0	9
	7932	P1987A Upload More RAM greedy math *800	0 / 0	3
	7931	P1987B K-Sort greedy *1000	0 / 0	3
	7930	P1987C Basil's Garden dp greedy *1200	0 / 0	4
	7929	P1987D World is Mine dp games *1800	0 / 0	6
	7928	P1987E Wonderful Tree! brute force data structures dfs and similar dsu greedy trees *2000	0 / 0	7
	7927	P1987F1 Interesting Problem (Easy Version) dp *2500	0 / 0	9
	7926	P1987F2 Interesting Problem (Hard Version) dp *2600	0 / 0	10
	7925	P1987G1 Spinning Round (Easy Version) divide and conquer dp trees *2900	0 / 0	10
	7924	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
	7923	P1987H Fumo Temple interactive *3500	0 / 0	10
	7922	P1988A Split the Multiset brute force greedy implementation math *900	0 / 0	3
	7921	P1988B Make Majority greedy implementation *900	0 / 0	3
	7920	P1988C Increasing Sequence with Fixed OR bitmasks constructive algorithms greedy *1300	0 / 0	4
	7919	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees *2000	0 / 0	7
	7918	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
	7917	P1988F Heartbeat combinatorics dp fft math *3000	0 / 0	10
	7916	P1989A Catch the Coin implementation *800	0 / 0	3
	7915	P1989B Substring and Subsequence brute force greedy strings *1200	0 / 0	4
	7914	P1989C Two Movies greedy math *1400	0 / 0	4
	7913	P1989D Smithing Skill brute force data structures dp greedy math sortings two pointers *1900	0 / 0	6
	7912	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8
	7911	P1989F Simultaneous Coloring dfs and similar divide and conquer graphs *3000	0 / 0	10

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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