*2000 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2807	P1102F Elongated Matrix binary search bitmasks brute force dp graphs *2000	0 / 0	(None)
	2805	P1103B Game with modulo binary search constructive algorithms interactive *2000	0 / 0	(None)
	2694	P1129B Wrong Answer constructive algorithms *2000	0 / 0	(None)
	2684	P1131D Gourmet choice dfs and similar dp dsu graphs greedy *2000	0 / 0	(None)
	2675	P1132F Clear the String dp *2000	0 / 0	(None)
	2631	P1142B Lynyrd Skynyrd data structures dfs and similar dp math trees *2000	0 / 0	(None)
	2600	P1147C Thanos Nim games *2000	0 / 0	(None)
	2547	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	(None)
	2536	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	(None)
	2510	P1165F1 Microtransactions (easy version) binary search greedy *2000	0 / 0	(None)
	2509	P1165F2 Microtransactions (hard version) binary search greedy implementation *2000	0 / 0	(None)
	2417	P1183E Subsequences (easy version) dp graphs implementation shortest paths *2000	0 / 0	(None)
	2415	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	(None)
	2394	P1185E Polycarp and Snakes brute force implementation *2000	0 / 0	(None)
	2366	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	(None)
	2326	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	(None)
	2316	P1200E Compress Words brute force hashing implementation string suffix structures strings *2000	0 / 0	(None)
	2291	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	(None)
	2261	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	(None)
	2258	P1209G1 Into Blocks (easy version) data structures dsu greedy implementation two pointers *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.