Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2447	P207C1 Game with Two Trees *2100	0 / 0	(None)
2448	P207C3 Game with Two Trees data structures *2700	0 / 0	(None)
2449	P207D1 The Beaver's Problem - 3 *1800	0 / 0	(None)
2450	P207D2 The Beaver's Problem - 3 *2000	0 / 0	(None)
2451	P207D3 The Beaver's Problem - 3 *2000	0 / 0	(None)
2452	P207D5 The Beaver's Problem - 3 *1600	0 / 0	(None)
2453	P207D6 The Beaver's Problem - 3 *2100	0 / 0	(None)
2454	P207D8 The Beaver's Problem - 3 *2300	0 / 0	(None)
2455	P208A Dubstep strings *900	0 / 0	(None)
2456	P208C Police Station dp graphs shortest paths *1900	0 / 0	(None)
2457	P208E Blood Cousins binary search data structures dfs and similar trees *2100	0 / 0	(None)
2458	P209A Multicolored Marbles dp math *1600	0 / 0	(None)
2459	P209C Trails and Glades constructive algorithms dsu graphs greedy *2400	0 / 0	(None)
2460	P212A Privatization flows graphs *3000	0 / 0	(None)
2461	P212B Polycarpus is Looking for Good Substrings bitmasks hashing implementation *2300	0 / 0	(None)
2462	P212D Cutting a Fence binary search data structures dsu *2500	0 / 0	(None)
2463	P213A Game dfs and similar greedy *1700	0 / 0	(None)
2464	P213C Relay Race dp *2000	0 / 0	(None)
2465	P213E Two Permutations data structures hashing strings *2700	0 / 0	(None)
2466	P214B Hometask brute force constructive algorithms greedy math *1600	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories