Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9391	P1988B Make Majority greedy implementation	0 / 0	(None)
	9390	P1988C Increasing Sequence with Fixed OR bitmasks constructive algorithms greedy	0 / 0	(None)
	9389	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees	0 / 0	(None)
	9388	P1988E Range Minimum Sum binary search brute force data structures implementation	0 / 0	(None)
	9387	P1988F Heartbeat combinatorics dp fft math	0 / 0	(None)
	9318	P1989A Catch the Coin implementation *800	0 / 0	3
	9317	P1989B Substring and Subsequence brute force greedy strings *1200	0 / 0	4
	9316	P1989C Two Movies greedy math *1400	0 / 0	4
	9315	P1989D Smithing Skill brute force data structures dp greedy math sortings two pointers *1900	0 / 0	6
	9314	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8
	9313	P1989F Simultaneous Coloring dfs and similar divide and conquer graphs *3000	0 / 0	10
	9407	P1990A Submission Bait brute force games greedy sortings	0 / 0	(None)
	9406	P1990B Array Craft constructive algorithms greedy	0 / 0	(None)
	9405	P1990C Mad MAD Sum brute force greedy math	0 / 0	(None)
	9404	P1990D Grid Puzzle bitmasks dp greedy math	0 / 0	(None)
	9403	P1990E1 Catch the Mole(Easy Version) binary search constructive algorithms data structures interactive trees	0 / 0	(None)
	9402	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar implementation interactive trees	0 / 0	(None)
	9401	P1990F Polygonal Segments data structures divide and conquer two pointers	0 / 0	(None)
	9386	P1992A Only Pluses brute force constructive algorithms greedy math sortings *800	0 / 0	3
	9385	P1992B Angry Monk greedy math sortings *800	0 / 0	3

Pick a problem randomly based on the current filter.