*2800 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1400	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
	1393	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(None)
	1391	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(None)
	1372	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
	1371	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(None)
	1357	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(None)
	1341	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(None)
	1322	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(None)
	1317	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(None)
	1286	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(None)
	1269	P1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	(None)
	1268	P1404E Bricks flows graph matchings graphs *2800	0 / 0	(None)
	1228	P1413F Roads and Ramen data structures trees *2800	0 / 0	(None)
	1200	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	(None)
	1170	P1423M Milutin's Plums interactive *2800	0 / 0	(None)
	1159	P1425I Impressive Harvesting of The Orchard data structures *2800	0 / 0	(None)
	1105	P1436F Sum Over Subsets combinatorics math number theory *2800	0 / 0	(None)
	1080	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	(None)
	1016	P1455F String and Operations dp greedy *2800	0 / 0	(None)
	930	P1473G Tiles combinatorics dp fft math *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.