*2000 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1349	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
	1337	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
	1294	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	(None)
	1252	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(None)
	1224	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	(None)
	1220	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	(None)
	1219	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(None)
	1153	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	(None)
	1150	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	(None)
	1149	P1427D Unshuffling a Deck constructive algorithms implementation *2000	0 / 0	(None)
	1124	P1431E Chess Match special problem 2000	0 / 0	(None)
	1095	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	(None)
	1043	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	(None)
	1023	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	(None)
	1012	P1458B Glass Half Spilled dp *2000	0 / 0	(None)
	889	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	(None)
	861	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
	825	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	(None)
	757	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	(None)
	756	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.