dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1604	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	(None)
	1599	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	(None)
	1594	P1346E Magic Tricks special problem dp graphs 1700	0 / 0	(None)
	1590	P1346I Pac-Man 2.0 special problem dp 2900	0 / 0	(None)
	1585	P1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	(None)
	1579	P1349E Slime and Hats constructive algorithms dp greedy *3500	0 / 0	(None)
	1578	P1349F1 Slime and Sequences (Easy Version) dp fft math *3100	0 / 0	(None)
	1577	P1349F2 Slime and Sequences (Hard Version) dp fft math *3500	0 / 0	(None)
	1575	P1350B Orac and Models dp math number theory *1400	0 / 0	(None)
	1560	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	(None)
	1559	P1353F Decreasing Heights brute force dp *2200	0 / 0	(None)
	1557	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	(None)
	1553	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	(None)
	1552	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
	1549	P1355B Young Explorers dp greedy sortings *1200	0 / 0	(None)
	1509	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
	1507	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(None)
	1500	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(None)
	1499	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(None)
	1483	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.