*2100 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5389	P985E Pencils and Boxes binary search data structures dp greedy two pointers *2100	0 / 0	7
	5373	P988E Divisibility by 25 brute force greedy *2100	0 / 0	7
	5372	P988F Rain and Umbrellas dp *2100	0 / 0	7
	5362	P990E Post Lamps brute force greedy *2100	0 / 0	7
	5350	P992D Nastya and a Game brute force implementation math *2100	0 / 0	7
	5346	P993C Careful Maneuvering bitmasks brute force geometry *2100	0 / 0	7
	5340	P995A Tesla constructive algorithms implementation *2100	0 / 0	7
	5315	P1000E We Need More Bosses dfs and similar graphs trees *2100	1 / 1	7
	5284	P1003E Tree Constructing constructive algorithms graphs *2100	1 / 2	7
	5270	P1005F Berland and the Shortest Paths brute force dfs and similar graphs shortest paths *2100	0 / 0	7
	5264	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	1 / 1	7
	5200	P1023E Down or Right constructive algorithms interactive matrices *2100	0 / 0	7
	5194	P1025D Recovering BST brute force dp math number theory trees *2100	0 / 0	7
	5186	P1027E Inverse Coloring combinatorics dp math *2100	0 / 0	7
	5180	P1028D Order book combinatorics data structures greedy *2100	0 / 0	7
	5171	P1029E Tree with Small Distances dp graphs greedy *2100	0 / 0	7
	5152	P1032E The Unbearable Lightness of Weights dp math *2100	0 / 0	7
	5115	P1039B Subway Pursuit binary search interactive probabilities *2100	0 / 0	7
	5088	P1044C Optimal Polygon Perimeter dp geometry *2100	0 / 0	7
	5042	P1056E Check Transcription brute force data structures hashing strings *2100	0 / 0	7
	4990	P1066F Yet another 2D Walking dp *2100	0 / 0	7
	4977	P1070E Getting Deals Done binary search data structures *2100	0 / 0	7
	4945	P1077F2 Pictures with Kittens (hard version) data structures dp *2100	0 / 0	7
	4829	P1098B Nice table brute force constructive algorithms greedy math *2100	0 / 0	7
	4785	P1106E Lunar New Year and Red Envelopes data structures dp *2100	0 / 0	7
	4771	P1108E2 Array and Segments (Hard version) data structures implementation *2100	0 / 0	7
	4770	P1108F MST Unification binary search dsu graphs greedy *2100	0 / 0	7
	4720	P1117D Magic Gems dp math matrices *2100	0 / 0	7
	4698	P1120C Compress String dp strings *2100	0 / 0	7
	4602	P1146D Frog Jumping dfs and similar math number theory *2100	0 / 0	7
	4572	P1151E Number of Components combinatorics data structures dp math *2100	0 / 0	7
	4567	P1152D Neko and Aki's Prank dp greedy trees *2100	0 / 0	7
	4552	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	7
	4527	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	7
	4513	P1163D Mysterious Code dp strings *2100	0 / 0	7
	4499	P1166E The LCMs Must be Large bitmasks brute force constructive algorithms math number theory *2100	0 / 0	7
	4493	P1167E Range Deleting binary search combinatorics data structures two pointers *2100	0 / 0	7
	4447	P1176F Destroy it! dp implementation sortings *2100	0 / 0	7
	4411	P1183F Topforces Strikes Back brute force math sortings *2100	0 / 0	7
	4407	P1184A2 Heidi Learns Hashing (Medium) brute force number theory *2100	0 / 0	7
	4396	P1184E2 Daleks' Invasion (medium) dfs and similar graphs shortest paths trees *2100	0 / 0	7
	4388	P1185F Two Pizzas bitmasks brute force *2100	0 / 0	7
	4387	P1185G1 Playlist for Polycarp (easy version) bitmasks combinatorics dp *2100	0 / 0	7
	4376	P1187E Tree Painting dfs and similar dp trees *2100	0 / 0	7
	4338	P1195E OpenStreetMap data structures two pointers *2100	0 / 0	7
	4306	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	7
	4301	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
	4291	P1203F1 Complete the Projects (easy version) greedy *2100	0 / 0	7
	4285	P1204D2 Kirk and a Binary String (hard version) data structures greedy math strings *2100	0 / 0	7
	4270	P1207F Remainder Problem brute force data structures implementation *2100	3 / 3	7
	4227	P1213F Unstable String Sort data structures dfs and similar dsu graphs greedy implementation strings *2100	0 / 0	7
	4205	P1216F Wi-Fi data structures dp greedy *2100	0 / 0	7
	4201	P1217D Coloring Edges constructive algorithms dfs and similar graphs *2100	0 / 0	7
	4190	P1218I The Light Square 2-sat dfs and similar greedy *2100	0 / 0	7
	4169	P1223E Paint the Tree dp sortings trees *2100	0 / 0	7
	4067	P1250C Trip to Saint Petersburg data structures *2100	0 / 0	7
	4032	P1252G Performance Review data structures *2100	0 / 0	7
	4023	P1252K Addition Robot data structures math matrices *2100	0 / 0	7
	4003	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	3941	P1263E Editor data structures implementation *2100	0 / 0	7
	3919	P1265E Beautiful Mirrors data structures dp math probabilities *2100	0 / 0	7
	3909	P1266E Spaceship Solitaire data structures greedy implementation *2100	0 / 0	7
	3881	P1267K Key Storage combinatorics math *2100	0 / 0	7
	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
	3800	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	7
	3743	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	7
	3642	P1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	7
	3618	P1299C Water Balance data structures geometry greedy *2100	0 / 0	7
	3538	P1312E Array Shrinking dp greedy *2100	0 / 0	7
	3496	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3394	P1332E Height All the Same combinatorics constructive algorithms math matrices *2100	0 / 0	7
	3384	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	3327	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	3272	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	7
	3265	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	7
	3216	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
	3203	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	7
	3197	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	1 / 1	7
	3190	P1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	7
	3184	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	3176	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	3155	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	7
	3142	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	3075	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	3074	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	3063	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	7
	3050	P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	7
	3042	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	2960	P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2956	P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7
	2948	P1413E Solo mid Oracle greedy math ternary search *2100	0 / 0	7
	2929	P1418D Trash Problem data structures implementation *2100	0 / 0	7
	2920	P1419E Decryption constructive algorithms implementation math number theory *2100	0 / 0	7
	2915	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2842	P1431F Neural Network Problem special problem binary search greedy 2100	0 / 0	7
	2841	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	7
	2832	P1433F Zero Remainder Sum dp *2100	0 / 0	7
	2831	P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	7
	2783	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7

Pick a problem randomly based on the current filter.