Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1387	P1635C Differential Sorting constructive algorithms greedy *1200	0 / 0	4
	1386	P1635D Infinite Set bitmasks dp math matrices number theory strings *1800	0 / 0	6
	1385	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	8
	1384	P1635F Closest Pair data structures greedy *2800	0 / 0	10
	1383	P1637A Sorting Parts brute force sortings *800	0 / 0	3
	1382	P1637B MEX and Array brute force dp greedy math *1100	0 / 0	3
	1381	P1637C Andrew and Stones greedy implementation *1200	0 / 0	4
	1380	P1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	6
	1379	P1637E Best Pair binary search brute force implementation *2100	0 / 0	7
	1378	P1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	9
	1377	P1637G Birthday constructive algorithms greedy math *3000	0 / 0	10
	1376	P1637H Minimize Inversions Number data structures greedy math sortings *3500	0 / 0	10
	1375	P1638A Reverse constructive algorithms greedy math *800	0 / 0	3
	1374	P1638B Odd Swap Sort data structures math sortings *1100	0 / 0	3
	1373	P1638C Inversion Graph data structures dsu graphs math *1300	0 / 0	4
	1372	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	7
	1371	P1638E Colorful Operations brute force data structures implementation *2400	0 / 0	9
	1370	P1638F Two Posters brute force data structures greedy two pointers *3200	0 / 0	10
	1369	P1639A Treasure Hunt graphs interactive	0 / 0	(None)
	1368	P1639B Treasure Hunt graphs interactive	0 / 0	(None)
	1367	P1639C Treasure Hunt graphs interactive	0 / 0	(None)
	1366	P1639D Treasure Hunt graphs interactive	0 / 0	(None)
	1365	P1639E Treasure Hunt graphs interactive	0 / 0	(None)
	1364	P1639F Treasure Hunt graphs interactive	0 / 0	(None)
	1363	P1639G Treasure Hunt graphs interactive	0 / 0	(None)
	1362	P1639H Treasure Hunt graphs interactive	0 / 0	(None)
	1361	P1639I Treasure Hunt graphs interactive	0 / 0	(None)
	1360	P1639J Treasure Hunt graphs interactive	0 / 0	(None)
	1359	P1639K Treasure Hunt graphs interactive	0 / 0	(None)
	1358	P1641A Great Sequence brute force greedy sortings *1200	0 / 0	4
	1357	P1641B Repetitions Decoding constructive algorithms implementation sortings *2000	0 / 0	7
	1356	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	8
	1355	P1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 1	10
	1354	P1641E Special Positions combinatorics divide and conquer fft math *3300	0 / 0	10
	1353	P1641F Covering Circle geometry *3500	0 / 0	10
	1352	P1642A Hard Way geometry *800	0 / 0	3
	1351	P1642B Power Walking greedy *900	0 / 0	3
	1350	P1644A Doors and Keys implementation *800	0 / 0	3
	1349	P1644B Anti-Fibonacci Permutation brute force constructive algorithms implementation *800	0 / 0	3
	1348	P1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	4
	1347	P1644D Cross Coloring data structures implementation math *1700	0 / 0	5
	1346	P1644E Expand the Path brute force combinatorics data structures implementation math *1900	0 / 0	6
	1345	P1644F Basis combinatorics fft math number theory *2900	0 / 0	10
	1344	P1646A Square Counting math *800	0 / 0	3
	1343	P1646B Quality vs Quantity brute force constructive algorithms greedy sortings two pointers *800	0 / 0	3
	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
	1339	P1646F Playing Around the Table constructive algorithms greedy implementation *2900	0 / 0	10
	1338	P1647A Madoka and Math Dad implementation math *800	0 / 0	3
	1337	P1647B Madoka and the Elegant Gift brute force constructive algorithms graphs implementation *1200	0 / 0	4
	1336	P1647C Madoka and Childish Pranks constructive algorithms greedy *1300	0 / 0	4
	1335	P1647D Madoka and the Best School in Russia constructive algorithms dp math number theory *1900	0 / 0	6
	1334	P1647E Madoka and the Sixth-graders data structures dfs and similar greedy *2500	0 / 0	9
	1333	P1647F Madoka and Laziness dp greedy *3100	0 / 0	10
	1332	P1648A Weird Sum combinatorics data structures geometry math matrices sortings *1400	0 / 0	4
	1331	P1648B Integral Array brute force constructive algorithms data structures math *1800	0 / 0	6
	1330	P1648C Tyler and Strings combinatorics data structures implementation *1900	0 / 0	6
	1329	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	1328	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	10
	1327	P1648F Two Avenues data structures dfs and similar graphs *3500	0 / 0	10
	1326	P1649A Game implementation *800	0 / 0	3
	1325	P1649B Game of Ball Passing greedy implementation *1300	0 / 0	4
	1324	P1650A Deletions of Two Adjacent Letters implementation strings *800	0 / 0	3
	1323	P1650B DIV + MOD math *900	0 / 0	3
	1322	P1650C Weight of the System of Nested Segments greedy hashing implementation sortings *1200	0 / 0	4
	1321	P1650D Twist the Permutation brute force constructive algorithms implementation math *1300	0 / 0	4
	1320	P1650E Rescheduling the Exam binary search data structures greedy implementation math sortings *1900	0 / 0	6
	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
	1317	P1651A Playoff implementation *800	0 / 0	3
	1316	P1651B Prove Him Wrong constructive algorithms greedy *800	0 / 0	3
	1315	P1651C Fault-tolerant Network brute force data structures implementation *1500	0 / 0	5
	1314	P1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths *1900	0 / 0	6
	1313	P1651E Sum of Matchings brute force combinatorics constructive algorithms dfs and similar graph matchings greedy math *2600	0 / 0	10
	1312	P1651F Tower Defense binary search brute force data structures *3000	0 / 0	10
	1311	P1654A Maximum Cake Tastiness brute force greedy implementation sortings *800	0 / 0	3
	1310	P1654B Prefix Removals strings *800	0 / 0	3
	1309	P1654C Alice and the Cake data structures greedy implementation sortings *1400	0 / 0	4
	1308	P1654D Potion Brewing Class dfs and similar math number theory trees *2100	0 / 0	7
	1307	P1654E Arithmetic Operations brute force data structures graphs math *2300	0 / 0	8
	1306	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1305	P1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	10
	1304	P1654H Three Minimums combinatorics constructive algorithms divide and conquer dp fft math *3500	0 / 0	10
	1303	P1656A Good Pairs math sortings *800	0 / 0	3
	1302	P1656B Subtract Operation data structures greedy math two pointers *1100	0 / 0	3
	1301	P1656C Make Equal With Mod constructive algorithms math number theory sortings *1200	0 / 0	4
	1300	P1656D K-good constructive algorithms math number theory *1900	0 / 0	6
	1299	P1656E Equal Tree Sums constructive algorithms dfs and similar math trees *2200	0 / 0	8
	1298	P1656F Parametric MST binary search constructive algorithms graphs greedy math sortings *2600	0 / 0	10
	1297	P1656G Cycle Palindrome constructive algorithms graphs math *3200	0 / 0	10
	1296	P1656H Equal LCM Subsets data structures math number theory *3200	0 / 0	10
	1295	P1656I Neighbour Ordering constructive algorithms graphs *3500	0 / 0	10
	1294	P1657A Integer Moves brute force math *800	0 / 0	3
	1293	P1657B XY Sequence greedy *800	0 / 0	3
	1292	P1657C Bracket Sequence Deletion greedy implementation *1200	0 / 0	4
	1291	P1657D For Gamers binary search brute force greedy math sortings *2000	0 / 0	7
	1290	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	1289	P1657F Words on Tree 2-sat dfs and similar dsu graphs trees *2600	0 / 0	10
	1288	P1658A Marin and Photoshoot constructive algorithms implementation math *800	0 / 0	3

Pick a problem randomly based on the current filter.