Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9240	P1952I Dark Matter bitmasks geometry	0 / 0	(None)
	9239	P1952J Help, what does it mean to be "Based" brute force constructive algorithms expression parsing implementation sortings	0 / 0	(None)
	9238	P1954A Painting the Ribbon constructive algorithms greedy math *900	0 / 0	3
	9237	P1954B Make It Ugly implementation math *1200	0 / 0	4
	9236	P1954C Long Multiplication greedy math number theory *1200	0 / 0	4
	9235	P1954D Colored Balls combinatorics dp math sortings *1800	0 / 0	6
	9234	P1954E Chain Reaction binary search data structures dsu greedy implementation math number theory *2200	0 / 0	8
	9233	P1954F Unique Strings combinatorics dp math *3100	0 / 0	10
	9232	P1955A Yogurt Sale math *800	0 / 0	3
	9231	P1955B Progressive Square constructive algorithms data structures implementation sortings *1000	0 / 0	3
	9230	P1955C Inhabitant of the Deep Sea greedy implementation math *1300	0 / 0	4
	9229	P1955D Inaccurate Subsequence Search data structures two pointers *1400	0 / 0	4
	9228	P1955E Long Inversions brute force greedy implementation sortings *1700	0 / 0	5
	9227	P1955F Unfair Game dp games greedy math schedules *1800	0 / 0	6
	9226	P1955G GCD on a grid brute force dfs and similar dp implementation math number theory *1900	0 / 0	6
	9225	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8
	9224	P1956A Nene's Game binary search brute force data structures games greedy *800	0 / 0	3
	9223	P1956B Nene and the Card Game games greedy *800	0 / 0	3
	9222	P1956C Nene's Magical Matrix constructive algorithms greedy math *1600	0 / 0	5
	9221	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7

Pick a problem randomly based on the current filter.