dp - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1696	P1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	3
	1690	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	1689	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	1682	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	5
	1680	P1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	8
	1677	P1598A Computer Game brute force dfs and similar dp implementation *800	0 / 0	3
	1673	P1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	4
	1669	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	7
	1667	P1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	9
	1642	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	6
	1640	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	8
	1639	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	10
	1636	P1601E Phys Ed Online data structures dp greedy *2900	0 / 0	10
	1630	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	8
	1629	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	10
	1627	P1603E A Perfect Problem combinatorics dp math *3200	0 / 0	10
	1626	P1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	10
	1617	P1605F PalindORme combinatorics dp *2900	0 / 0	10
	1612	P1606E Arena combinatorics dp math *2100	0 / 0	7
	1611	P1606F Tree Queries brute force dp trees *2800	0 / 0	10
	1592	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	5
	1587	P1608F MEX counting combinatorics dp implementation *3200	0 / 0	10
	1578	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	4
	1575	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	9
	1568	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	1557	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	1550	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	1549	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1544	P1613D MEX Sequences dp math *1900	0 / 0	6
	1539	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	5
	1538	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	1537	P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	8
	1530	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	1524	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	1521	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	10
	1520	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	1514	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1510	P1618D Array and Operations dp greedy math *1300	0 / 0	4
	1502	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	5
	1496	P1620C BA-String brute force dp greedy implementation math *1800	0 / 0	6
	1493	P1620F Bipartite Array dp greedy *2800	0 / 0	10
	1492	P1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	9
	1487	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	8
	1485	P1621G Weighted Increasing Subsequences data structures dp math *3200	0 / 0	10
	1467	P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	7
	1462	P1625C Road Optimization dp *1700	0 / 0	5
	1460	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	9
	1456	P1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	5
	1453	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	10
	1447	P1627D Not Adding brute force dp math number theory *1900	0 / 0	6
	1446	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	1435	P1628D1 Game on Sum (Easy Version) combinatorics dp games math *2100	0 / 0	7
	1434	P1628D2 Game on Sum (Hard Version) combinatorics dp games math *2400	0 / 0	9
	1419	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	8
	1417	P1630D Flipping Range constructive algorithms dp greedy number theory *2400	0 / 0	9
	1410	P1631B Fun with Even Subarrays dp greedy *1100	0 / 0	3
	1406	P1632C Strange Test binary search bitmasks brute force dp math *1600	0 / 0	5
	1398	P1633D Make Them Equal dp greedy *1600	0 / 0	5
	1386	P1635D Infinite Set bitmasks dp math matrices number theory strings *1800	0 / 0	6
	1382	P1637B MEX and Array brute force dp greedy math *1100	0 / 0	3
	1380	P1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	6
	1378	P1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	9
	1348	P1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	4
	1342	P1646C Factorials and Powers of Two bitmasks brute force constructive algorithms dp math *1500	0 / 0	5
	1341	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	7
	1340	P1646E Power Board brute force dp math number theory *2200	0 / 0	8
	1335	P1647D Madoka and the Best School in Russia constructive algorithms dp math number theory *1900	0 / 0	6
	1333	P1647F Madoka and Laziness dp greedy *3100	0 / 0	10
	1329	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	1319	P1650F Vitaly and Advanced Useless Algorithms dp greedy implementation *2200	0 / 0	8
	1318	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
	1304	P1654H Three Minimums combinatorics constructive algorithms divide and conquer dp fft math *3500	0 / 0	10
	1290	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	1283	P1658E Gojou and Matrix Game data structures dp games hashing implementation math number theory sortings *2500	0 / 0	9
	1279	P1659C Line Empire binary search brute force dp greedy implementation math *1500	0 / 0	5
	1273	P1660C Get an Even String dp greedy strings *1300	0 / 0	4
	1267	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
	1264	P1661E Narrow Components brute force data structures dp dsu math trees *2500	1 / 9	9
	1260	P1662C European Trip dp graphs math matrices	0 / 0	(None)
	1256	P1662G Gastronomic Event dp greedy trees	0 / 0	(None)
	1251	P1662L Il Derby della Madonnina data structures dp math	0 / 0	(None)
	1244	P1663D Is it rated - 3 *special problem combinatorics dp math	0 / 0	(None)
	1229	P1666F Fancy Stack combinatorics dp implementation *2200	0 / 0	8
	1225	P1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	7
	1221	P1667B Optimal Partition data structures dp *2100	0 / 0	7
	1219	P1667D Edge Elimination constructive algorithms dfs and similar dp trees *2900	0 / 0	10
	1218	P1667E Centroid Probabilities combinatorics dp fft math *3000	0 / 0	10
	1201	P1670F Jee, You See? bitmasks combinatorics dp *2400	0 / 0	9
	1196	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	7
	1195	P1671F Permutation Counting brute force combinatorics dp fft math *2700	0 / 0	10
	1182	P1673C Palindrome Basis brute force dp math number theory *1500	0 / 0	5
	1172	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
	1166	P1675F Vlad and Unfinished Business dfs and similar dp greedy trees *1800	0 / 0	6
	1165	P1675G Sorting Pancakes dp *2300	0 / 0	8
	1158	P1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	4
	1155	P1677A Tokitsukaze and Strange Inequality brute force data structures dp *1600	0 / 0	5
	1152	P1677D Tokitsukaze and Permutations dp math *2500	0 / 0	9
	1150	P1677F Tokitsukaze and Gems dp math *3500	0 / 0	10
	1147	P1678B2 Tokitsukaze and Good 01-String (hard version) dp greedy implementation *1800	0 / 0	6
	1143	P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	6

Pick a problem randomly based on the current filter.