*3000 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2999	P436F Banners brute force data structures dp *3000	0 / 0	(None)
	3053	P457E Flow Optimality constructive algorithms flows math *3000	0 / 0	(None)
	3070	P464E The Classic Problem data structures graphs shortest paths *3000	0 / 0	(None)
	3166	P506E Mr combinatorics dp matrices strings *3000	0 / 0	(None)
	3222	P526F Pudding Monsters data structures divide and conquer *3000	0 / 0	(None)
	3234	P533A Berland Miners binary search data structures dfs and similar greedy trees *3000	0 / 0	(None)
	3236	P533D Landmarks data structures dp *3000	0 / 0	(None)
	3302	P566C Logistical Questions dfs and similar divide and conquer trees *3000	0 / 0	(None)
	3311	P568E Longest Increasing Subsequence data structures dp *3000	0 / 0	(None)
	3322	P573D Bear and Cavalry data structures divide and conquer dp *3000	0 / 0	(None)
	3350	P582E Boolean Function bitmasks dp expression parsing *3000	0 / 0	(None)
	3364	P587F Duff is Mad data structures strings *3000	0 / 0	(None)
	3401	P603E Pastoral Oddities data structures divide and conquer dsu math trees *3000	0 / 0	(None)
	3422	P618F Double Knapsack constructive algorithms two pointers *3000	0 / 0	(None)
	3490	P641F Little Artem and 2-SAT *3000	0 / 0	(None)
	3526	P666D Chain Reaction brute force geometry *3000	0 / 0	(None)
	3566	P683J The Hero with Bombs special problem 3000	0 / 0	(None)
	3600	P698F Coprime Permutation combinatorics number theory *3000	0 / 0	(None)
	3801	P773E Blog Post Rating data structures sortings *3000	0 / 0	(None)
	3819	P778E Selling Numbers dp sortings *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.