data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	42	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	(None)
	41	P1638E Colorful Operations brute force data structures implementation *2400	0 / 0	(None)
	40	P1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	(None)
	26	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	(None)
	17	P1644D Cross Coloring data structures implementation math *1700	0 / 0	(None)
	16	P1644E Expand the Path brute force combinatorics data structures implementation math *1900	0 / 0	(None)
	7607	P1647E Madoka and the Sixth-graders binary search data structures dfs and similar dp greedy trees	0 / 0	(None)
	8	P1648A Weird Sum combinatorics data structures geometry math matrices sortings	0 / 0	(None)
	7	P1648B Integral Array brute force constructive algorithms data structures math	0 / 0	(None)
	6	P1648C Tyler and Strings combinatorics data structures implementation strings	0 / 0	(None)
	5	P1648D Serious Business data structures dp shortest paths	0 / 0	(None)
	4	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees	0 / 0	(None)
	3	P1648F Two Avenues data structures dfs and similar graphs	0 / 0	(None)
	5213	P1650E Rescheduling the Exam binary search binary search binary search data structures greedy implementation math sortings	0 / 0	(None)
	7603	P1651C Fault-tolerant Network brute force data structures implementation	0 / 0	(None)
	7602	P1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths	0 / 0	(None)
	7600	P1651F Tower Defense binary search brute force data structures	0 / 0	(None)
	7623	P1654C Alice and the Cake data structures greedy implementation sortings *1400	0 / 0	(None)
	7621	P1654E Arithmetic Operations brute force data structures divide and conquer graphs math *2300	0 / 0	(None)
	7620	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.