*1500 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3617	P926G Large Bouquets *1500	0 / 0	(None)
	3604	P930A Peculiar apple-tree dfs and similar graphs trees *1500	0 / 0	(None)
	3555	P940C Phone Numbers constructive algorithms implementation strings *1500	0 / 0	(None)
	3499	P958F1 Lightsabers (easy) implementation *1500	0 / 0	(None)
	3494	P959C Mahmoud and Ehab and the wrong algorithm constructive algorithms trees *1500	0 / 0	(None)
	3489	P960B Minimize the error data structures greedy sortings *1500	0 / 0	(None)
	3447	P976C Nested Segments greedy implementation sortings *1500	0 / 0	(None)
	3439	P977E Cyclic Components dfs and similar dsu graphs *1500	0 / 0	(None)
	3434	P978D Almost Arithmetic Progression brute force implementation math *1500	0 / 0	(None)
	3432	P978F Mentors binary search data structures implementation *1500	0 / 0	(None)
	3409	P982C Cut 'em all! dfs and similar dp graphs greedy trees *1500	0 / 0	(None)
	3396	P985C Liebig's Barrels greedy *1500	0 / 0	(None)
	3369	P990C Bracket Sequences Concatenation Problem implementation *1500	0 / 0	(None)
	3362	P991C Candies binary search implementation *1500	0 / 0	(None)
	3361	P991D Bishwock dp greedy *1500	0 / 0	(None)
	3337	P997A Convert to Ones brute force greedy implementation math *1500	0 / 0	(None)
	3323	P1000B Light It Up greedy *1500	0 / 0	(None)
	3306	P1002A3 Generate superposition of two basis states *1500	0 / 0	(None)
	3295	P1002E1 Bernstein-Vazirani algorithm *1500	0 / 0	(None)
	3278	P1005D Polycarp and Div 3 dp greedy number theory *1500	0 / 0	(None)

Pick a problem randomly based on the current filter.