dp - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4432	P1179D Fedor Runs for President data structures dp trees *2700	0 / 0	10
	4430	P1180A Alex and a Rhombus dp implementation math *800	0 / 0	3
	4426	P1181C Flag brute force combinatorics dp implementation *1900	0 / 0	6
	4422	P1182A Filling Shapes dp math *1000	0 / 0	3
	4419	P1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	9
	4418	P1182E Product Oriented Recurrence dp math matrices number theory *2300	0 / 0	8
	4412	P1183E Subsequences (easy version) dp graphs implementation shortest paths *2000	0 / 0	7
	4409	P1183H Subsequences (hard version) dp strings *1900	0 / 0	6
	4387	P1185G1 Playlist for Polycarp (easy version) bitmasks combinatorics dp *2100	0 / 0	7
	4386	P1185G2 Playlist for Polycarp (hard version) combinatorics dp *2600	0 / 0	10
	4376	P1187E Tree Painting dfs and similar dp trees *2100	0 / 0	7
	4375	P1187F Expected Square Beauty dp math probabilities *2500	0 / 0	9
	4370	P1188C Array Beauty dp *2500	0 / 0	9
	4369	P1188D Make Equal dp *3100	0 / 0	10
	4365	P1189C Candies! data structures dp implementation math *1400	0 / 0	4
	4354	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(None)
	4353	P1193A Amusement Park *special problem dp math	0 / 0	(None)
	4352	P1193B Magic Tree *special problem data structures dp trees	0 / 0	(None)
	4345	P1194F Crossword Expert combinatorics dp number theory probabilities two pointers *2400	6 / 13	9
	4344	P1194G Another Meme Problem dp *2700	0 / 0	10
	4341	P1195C Basketball Exercise dp *1400	0 / 0	4
	4332	P1196D2 RGB Substring (hard version) data structures dp implementation two pointers *1600	0 / 0	5
	4326	P1197D Yet Another Subarray Problem dp greedy math *1900	0 / 0	6
	4325	P1197E Culture Code binary search combinatorics data structures dp shortest paths sortings *2300	0 / 0	8
	4324	P1197F Coloring Game dp games matrices *2700	0 / 0	10
	4320	P1198D Rectangle Painting 1 dp *2300	1 / 1	8
	4314	P1200B Block Adventure dp greedy *1200	0 / 0	4
	4312	P1200D White Lines brute force data structures dp implementation two pointers *1900	0 / 0	6
	4310	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	8
	4306	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	7
	4302	P1202B You Are Given a Decimal String... brute force dp shortest paths *1700	0 / 0	5
	4301	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
	4290	P1203F2 Complete the Projects (hard version) dp greedy *2300	0 / 0	8
	4287	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	5
	4284	P1204E Natasha, Sasha and the Prefix Sums combinatorics dp math number theory *2300	0 / 0	8
	4276	P1206B Make Product Equal One dp implementation *900	0 / 0	3
	4273	P1207C Gas Pipeline dp greedy *1500	6 / 6	5
	4263	P1208F Bits And Pieces bitmasks dfs and similar dp greedy *2600	0 / 0	10
	4256	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	7
	4255	P1209E2 Rotate Columns (hard version) bitmasks dp greedy sortings *2500	0 / 0	9
	4243	P1210G Mateusz and Escape Room dp *3500	0 / 0	10
	4235	P1211H Road Repair in Treeland special problem binary search dp trees 3100	0 / 0	10
	4222	P1214D Treasure Island dfs and similar dp flows hashing *1900	0 / 0	6
	4216	P1215B The Number of Products combinatorics dp implementation *1400	0 / 0	4
	4213	P1215E Marbles bitmasks dp *2200	0 / 0	8
	4205	P1216F Wi-Fi data structures dp greedy *2100	0 / 0	7
	4198	P1218A BubbleReactor dp graphs *2800	0 / 0	10
	4196	P1218C Jumping Transformers dp *2600	0 / 0	10
	4183	P1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	8
	4177	P1221D Make The Fence Great Again dp *1800	0 / 0	6
	4174	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	10
	4170	P1223D Sequence Sorting dp greedy two pointers *2000	0 / 0	7
	4169	P1223E Paint the Tree dp sortings trees *2100	0 / 0	7
	4168	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	10
	4161	P1225E Rock Is Push binary search dp *2200	0 / 0	8
	4159	P1225G To Make 1 bitmasks constructive algorithms dp greedy number theory *3100	0 / 0	10
	4152	P1227F1 Wrong Answer on test 233 (Easy Version) dp *2200	0 / 0	8
	4145	P1228E Another Filling the Grid combinatorics dp math *2300	0 / 0	8
	4136	P1234C Pipes dp implementation *1500	0 / 0	5
	4133	P1234F Yet Another Substring Reverse bitmasks dp *2200	0 / 0	8
	4128	P1236E Alice and the Unfair Game binary search data structures dp dsu *2500	0 / 0	9
	4121	P1237E Balanced Binary Search Trees dp math *2400	0 / 0	9
	4120	P1237F Balanced Domino Placements combinatorics dp *2600	0 / 0	10
	4119	P1237G Balanced Distribution data structures dp greedy *3500	0 / 0	10
	4115	P1238C Standard Free2play dp greedy math *1600	5 / 14	5
	4114	P1238D AB-string binary search combinatorics dp strings *1900	4 / 4	6
	4113	P1238E Keyboard Purchase bitmasks dp *2200	0 / 0	8
	4112	P1238F The Maximum Subtree dfs and similar dp graphs trees *2200	0 / 0	8
	4110	P1239A Ivan the Fool and the Probability Theory combinatorics dp math *1700	0 / 0	5
	4106	P1239E Turtle dp implementation *3100	1 / 3	10
	4101	P1242C Sum Balance bitmasks dfs and similar dp graphs *2400	0 / 0	9
	4092	P1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	6
	4087	P1245B Restricted RPS constructive algorithms dp greedy *1200	0 / 0	4
	4086	P1245C Constanze's Machine dp *1400	0 / 0	4
	4084	P1245E Hyakugoku and Ladders dp probabilities shortest paths *2300	0 / 0	8
	4083	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	8
	4079	P1248D1 The World Is Just a Programming Task (Easy Version) brute force dp greedy implementation *2000	0 / 0	7
	4071	P1249E By Elevator or Stairs? dp shortest paths *1700	0 / 0	5
	4070	P1249F Maximum Weight Subset dp trees *2200	0 / 0	8
	4066	P1250D Conference Problem dp *3000	0 / 0	10
	4063	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	4050	P1251E1 Voting (Easy Version) data structures dp greedy *2300	0 / 0	8
	4041	P1252B Cleaning Robots dp trees *2300	0 / 0	8
	4037	P1252D Find String in a Grid data structures dp strings trees *3000	0 / 0	10
	4025	P1252J Tiling Terrace brute force dp *2300	0 / 0	8
	4015	P1253C Sweets Eating dp greedy math sortings *1500	0 / 0	5
	4011	P1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	8
	3982	P1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	7
	3972	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	3969	P1257E The Contest data structures dp greedy *2000	0 / 0	7
	3957	P1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	6
	3955	P1260E Tournament brute force dp greedy *2400	0 / 0	9
	3940	P1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	9
	3931	P1264D1 Beautiful Bracket Sequence (easy version) combinatorics dp probabilities *2600	0 / 0	10
	3919	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	7
	3876	P1268B Domino for Young dp greedy math *2000	0 / 0	7
	3869	P1268E Happy Cactus dp *3400	0 / 0	10
	3841	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	7
	3839	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	7
	3832	P1272C Yet Another Broken Keyboard combinatorics dp implementation *1200	0 / 0	4

Pick a problem randomly based on the current filter.