dp - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3829	P1272D Remove One Element brute force dp *1500	0 / 0	5
	3826	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	8
	3824	P1276A As Simple as One and Two dp greedy *1400	0 / 0	4
	3817	P1276D Tree Elimination dp trees *2900	0 / 0	10
	3801	P1278C Berry Jam data structures dp greedy implementation *1700	0 / 0	5
	3795	P1278F Cards combinatorics dp math number theory probabilities *2600	0 / 0	10
	3785	P1279E New Year Permutations combinatorics dp *2700	0 / 0	10
	3784	P1279F New Year and Handle Change binary search dp *2800	0 / 0	10
	3775	P1280D Miss Punyverse dp greedy trees *2500	1 / 1	9
	3763	P1282B1 K for the Price of One (Easy Version) dp greedy sortings *1400	0 / 0	4
	3762	P1282B2 K for the Price of One (Hard Version) dp greedy sortings *1600	0 / 0	5
	3748	P1283E New Year Parties dp greedy *1800	0 / 0	6
	3745	P1284B New Year and Ascent Sequence binary search combinatorics data structures dp implementation sortings *1400	0 / 0	4
	3736	P1285B Just Eat It! dp greedy implementation *1300	0 / 0	4
	3732	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3729	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3726	P1286A Garland dp greedy sortings *1800	0 / 0	6
	3714	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	10
	3708	P1288C Two Arrays combinatorics dp *1600	0 / 0	5
	3705	P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	7
	3689	P1290F Making Shapes dp *3500	0 / 0	10
	3680	P1292C Xenon's Attack on the Gangs combinatorics dfs and similar dp greedy trees *2300	0 / 0	8
	3679	P1292D Chaotic V. dp graphs greedy math number theory trees *2700	0 / 0	10
	3677	P1292F Nora's Toy Boxes bitmasks combinatorics dp *3500	0 / 0	10
	3666	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	7
	3663	P1295C Obtain The String dp greedy strings *1600	0 / 0	5
	3657	P1295F Good Contest combinatorics dp probabilities *2700	0 / 0	10
	3646	P1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	6
	3645	P1296E2 String Coloring (hard version) data structures dp *2000	0 / 0	7
	3623	P1297G M-numbers *special problem dp math	0 / 0	(None)
	3622	P1297H Paint the String *special problem dp strings	0 / 0	(None)
	3617	P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	10
	3609	P1301E Nanosoft binary search data structures dp implementation *2500	0 / 0	9
	3593	P1303E Erase Subsequences dp strings *2200	0 / 0	8
	3588	P1304C Air Conditioner dp greedy implementation sortings two pointers *1500	0 / 0	5
	3585	P1304F1 Animal Observation (easy version) data structures dp *2300	0 / 0	8
	3584	P1304F2 Animal Observation (hard version) data structures dp greedy *2400	0 / 0	9
	3577	P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	10
	3573	P1307C Cow and Message brute force dp math strings *1500	0 / 0	5
	3571	P1307E Cow and Treats binary search combinatorics dp greedy implementation math *2500	0 / 0	9
	3566	P1310B Double Elimination dp implementation *2500	0 / 0	9
	3564	P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	10
	3561	P1310D Tourism dp graphs probabilities *2300	0 / 0	8
	3559	P1310E Strange Function dp *2900	0 / 0	10
	3538	P1312E Array Shrinking dp greedy *2100	0 / 0	7
	3536	P1312G Autocompletion data structures dfs and similar dp *2600	0 / 0	10
	3533	P1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	5
	3532	P1313C2 Skyscrapers (hard version) data structures dp greedy *1900	0 / 0	6
	3531	P1313D Happy New Year bitmasks dp implementation *2500	0 / 0	9
	3528	P1315B Homecoming binary search dp greedy strings *1300	0 / 0	4
	3515	P1316E Team Building bitmasks dp greedy sortings *2300	0 / 7	8
	3512	P1320A Journey Planning data structures dp greedy math sortings *1400	0 / 0	4
	3503	P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3491	P1322D Reality Show bitmasks dp *2800	0 / 0	10
	3487	P1322F Assigning Fares dp trees *3500	0 / 0	10
	3485	P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	3
	3477	P1324E Sleeping Schedule dp implementation *1700	0 / 0	5
	3476	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	3455	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	3453	P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	10
	3452	P1326G Spiderweb Trees dp geometry trees *3500	0 / 0	10
	3446	P1327E Count The Blocks combinatorics dp math *1800	1 / 3	6
	3445	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	9
	3443	P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	10
	3436	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	6
	3406	P1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
	3393	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	9
	3375	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	9
	3366	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	3364	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
	3361	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	5
	3359	P1336C Kaavi and Magic Spell dp strings *2200	0 / 0	8
	3349	P1338D Nested Rubber Bands constructive algorithms dfs and similar dp math trees *2700	0 / 0	10
	3347	P1339A Filling Diamonds brute force dp implementation math *900	0 / 0	3
	3344	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	5
	3343	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	9
	3332	P1342F Make It Ascending bitmasks brute force dp *3000	0 / 0	10
	3329	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	4
	3323	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	10
	3318	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	3
	3313	P1346E Magic Tricks special problem dp graphs 1700	0 / 0	5
	3309	P1346I Pac-Man 2.0 special problem dp 2900	0 / 0	10
	3304	P1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	9
	3298	P1349E Slime and Hats constructive algorithms dp greedy *3500	0 / 0	10
	3297	P1349F1 Slime and Sequences (Easy Version) dp fft math *3100	0 / 0	10
	3296	P1349F2 Slime and Sequences (Hard Version) dp fft math *3500	0 / 0	10
	3294	P1350B Orac and Models dp math number theory *1400	0 / 0	4
	3279	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	6
	3278	P1353F Decreasing Heights brute force dp *2200	0 / 0	8
	3276	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	4
	3272	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	7
	3271	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	9
	3268	P1355B Young Explorers dp greedy sortings *1200	0 / 0	4
	3228	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	3
	3226	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	3219	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	4
	3218	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	3202	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	3201	P1363F Rotating Substrings dp strings *2600	0 / 0	10
	3184	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7

Pick a problem randomly based on the current filter.