Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5157	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
	5158	P1286A Garland dp greedy sortings *1800	0 / 0	(None)
	5159	P1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	(None)
	5160	P1286D LCC data structures math matrices probabilities *3100	0 / 0	(None)
	5161	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	(None)
	5162	P1287B Hyperset brute force data structures implementation *1500	0 / 0	(None)
	5163	P1288B Yet Another Meme Problem math *1100	0 / 0	(None)
	5164	P1288C Two Arrays combinatorics dp *1600	0 / 0	(None)
	5165	P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	(None)
	5166	P1288F Red-Blue Graph constructive algorithms flows *2900	0 / 0	(None)
	5167	P1290A Mind Control brute force data structures implementation *1600	0 / 0	(None)
	5168	P1290C Prefix Enlightenment dfs and similar dsu graphs *2400	0 / 0	(None)
	5169	P1290D Coffee Varieties (hard version) constructive algorithms graphs interactive *3000	0 / 0	(None)
	5170	P1290F Making Shapes dp *3500	0 / 0	(None)
	5171	P1291B Array Sharpening greedy implementation *1300	0 / 0	(None)
	5172	P1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	(None)
	5173	P1292B Aroma's Search brute force constructive algorithms geometry greedy implementation *1700	0 / 0	(None)
	5174	P1292C Xenon's Attack on the Gangs combinatorics dfs and similar dp greedy trees *2300	0 / 0	(None)
	5175	P1292E Rin and The Unknown Flower constructive algorithms greedy interactive math *3500	0 / 0	(None)
	5176	P1293A ConneR and the A.R.C binary search brute force implementation *1100	0 / 0	(None)

Pick a problem randomly based on the current filter.