*2500 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1707	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	(None)
	1692	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)
	1664	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	(None)
	1651	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	(None)
	1552	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
	1494	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
	1451	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(None)
	1408	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(None)
	1402	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(None)
	1380	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(None)
	1354	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	(None)
	1300	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(None)
	1256	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	(None)
	1207	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	(None)
	1194	P1420E Battle Lemmings dp greedy *2500	0 / 0	(None)
	1175	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(None)
	1148	P1427E Xum bitmasks constructive algorithms math matrices number theory *2500	0 / 0	(None)
	1093	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(None)
	1071	P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	(None)
	1036	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.