Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8920	P1919H Tree Diameter interactive trees *3500	0 / 0	10
	9004	P1920A Satisfying Constraints brute force greedy math *800	0 / 0	3
	9003	P1920B Summation Game games greedy math sortings *1100	0 / 0	3
	9002	P1920C Partitioning the Array brute force math number theory *1500	0 / 0	5
	9001	P1920D Array Repetition binary search brute force dsu implementation math *1800	0 / 0	6
	9000	P1920E Counting Binary Strings combinatorics dp math *2100	0 / 0	7
	8999	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	8998	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	8997	P1921A Square greedy math *800	0 / 0	3
	8996	P1921B Arranging Cats greedy implementation *800	0 / 0	3
	8995	P1921C Sending Messages greedy math *900	0 / 0	3
	8994	P1921D Very Different Array data structures greedy sortings two pointers *1100	0 / 0	3
	8993	P1921E Eat the Chip brute force games greedy math *1600	0 / 0	5
	8992	P1921F Sum of Progression brute force data structures dp implementation math *1900	0 / 0	6
	8991	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	8990	P1922A Tricky Template constructive algorithms implementation strings *800	0 / 0	3
	8989	P1922B Forming Triangles combinatorics constructive algorithms math sortings *1200	0 / 0	4
	8988	P1922C Closest Cities greedy implementation math *1300	0 / 0	4
	8987	P1922D Berserk Monsters brute force data structures dsu implementation math *1900	0 / 0	6
	8986	P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math *1800	0 / 0	6

Pick a problem randomly based on the current filter.