*3000 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3838	P788D Finding lines constructive algorithms divide and conquer interactive *3000	0 / 0	(None)
	3847	P793F Julia the snail data structures divide and conquer dp *3000	0 / 0	(None)
	3862	P798E Mike and code of a permutation constructive algorithms data structures graphs sortings *3000	0 / 0	(None)
	4081	P891E Lust combinatorics math matrices *3000	0 / 0	(None)
	4180	P936D World of Tank dp greedy *3000	0 / 0	(None)
	4313	P997E Good Subsegments data structures *3000	0 / 0	(None)
	6358	P1007C Guess two numbers binary search interactive *3000	0 / 0	(None)
	6326	P1019C Sergey's problem constructive algorithms graphs *3000	0 / 0	(None)
	4456	P1063E Lasers and Mirrors constructive algorithms math *3000	0 / 0	(None)
	4490	P1076G Array Game data structures games *3000	0 / 0	(None)
	4563	P1097G Vladislav and a Great Legend combinatorics dp trees *3000	0 / 0	(None)
	4710	P1147E Rainbow Coins interactive *3000	0 / 0	(None)
	4718	P1149D Abandoning Roads brute force dp graphs greedy *3000	0 / 0	(None)
	4728	P1152F2 Neko Rules the Catniverse (Large Version) bitmasks dp matrices *3000	0 / 0	(None)
	4763	P1163F Indecisive Taxi Fee data structures graphs shortest paths *3000	0 / 0	(None)
	4777	P1168D Anagram Paths dp implementation trees *3000	0 / 0	(None)
	4797	P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	(None)
	4807	P1178G The Awesomest Vertex data structures dfs and similar *3000	0 / 0	(None)
	4887	P1201E2 Knightmare (hard) graphs interactive shortest paths *3000	0 / 0	(None)
	4932	P1211I Unusual Graph special problem graphs 3000	0 / 0	(None)

Pick a problem randomly based on the current filter.