data structures - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1574	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1573	P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	10
	1565	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	10
	1564	P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	10
	1556	P1611F ATM and Students binary search data structures two pointers *1800	0 / 0	6
	1555	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	9
	1536	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	10
	1531	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	9
	1528	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	1523	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	1520	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	1507	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	8
	1502	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	5
	1499	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	9
	1494	P1620E Replace the Numbers constructive algorithms data structures dsu implementation *1900	0 / 0	6
	1490	P1621B Integers Shop data structures greedy implementation *1500	0 / 0	5
	1487	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	8
	1486	P1621F Strange Instructions data structures greedy implementation *2700	0 / 0	10
	1485	P1621G Weighted Increasing Subsequences data structures dp math *3200	0 / 0	10
	1483	P1621I Two Sequences data structures hashing string suffix structures *3500	0 / 0	10
	1481	P1622B Berland Music data structures greedy math sortings *1000	0 / 0	3
	1472	P1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	9
	1461	P1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	8
	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
	1459	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	10
	1456	P1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	5
	1446	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	1431	P1628E Groceries in Meteor Town binary search data structures dsu trees *3100	0 / 0	10
	1429	P1628F Spaceship Crisis Management binary search data structures geometry sortings *3500	0 / 0	10
	1421	P1630B Range and Partition binary search constructive algorithms data structures greedy two pointers *1800	0 / 0	6
	1404	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	7
	1403	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	9
	1397	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	9
	1396	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	10
	1391	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	9
	1390	P1634F Fibonacci Additions brute force data structures hashing implementation math *2700	0 / 0	10
	1384	P1635F Closest Pair data structures greedy *2800	0 / 0	10
	1376	P1637H Minimize Inversions Number data structures greedy math sortings *3500	0 / 0	10
	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
	1356	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	8
	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
	1334	P1647E Madoka and the Sixth-graders data structures dfs and similar greedy *2500	0 / 0	9
	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
	1320	P1650E Rescheduling the Exam binary search data structures greedy implementation math sortings *1900	0 / 0	6
	1318	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
	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
	1312	P1651F Tower Defense binary search brute force data structures *3000	0 / 0	10
	1309	P1654C Alice and the Cake data structures greedy implementation sortings *1400	0 / 0	4
	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
	1302	P1656B Subtract Operation data structures greedy math two pointers *1100	0 / 0	3
	1296	P1656H Equal LCM Subsets data structures math number theory *3200	0 / 0	10
	1284	P1658D2 388535 (Hard Version) bitmasks brute force data structures math *2300	0 / 0	8
	1283	P1658E Gojou and Matrix Game data structures dp games hashing implementation math number theory sortings *2500	0 / 0	9
	1278	P1659D Reverse Sort Sum constructive algorithms data structures greedy implementation math two pointers *1900	0 / 0	6
	1269	P1660F2 Promising String (hard version) data structures implementation math strings *2100	0 / 0	7
	1265	P1661D Progressions Covering data structures greedy *1900	0 / 0	6
	1264	P1661E Narrow Components brute force data structures dp dsu math trees *2500	1 / 9	9
	1257	P1662F Antennas data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths	0 / 0	(None)
	1251	P1662L Il Derby della Madonnina data structures dp math	0 / 0	(None)
	1235	P1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	9
	1221	P1667B Optimal Partition data structures dp *2100	0 / 0	7
	1210	P1669E 2-Letter Strings data structures math strings *1200	0 / 0	4
	1209	P1669F Eating Candies binary search data structures greedy two pointers *1100	0 / 0	3
	1204	P1670C Where is the Pizza? data structures dfs and similar dsu graphs implementation math *1400	0 / 0	4
	1186	P1672H Zigu Zagu constructive algorithms data structures greedy *2700	0 / 0	10
	1185	P1672I PermutationForces data structures greedy *3000	0 / 0	10
	1173	P1674F Desktop Rearrangement data structures greedy implementation *1800	0 / 0	6
	1159	P1676F Longest Strike data structures greedy implementation sortings two pointers *1300	0 / 0	4
	1156	P1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	5
	1155	P1677A Tokitsukaze and Strange Inequality brute force data structures dp *1600	0 / 0	5
	1154	P1677B Tokitsukaze and Meeting data structures implementation math *1700	0 / 0	5
	1151	P1677E Tokitsukaze and Beautiful Subsegments data structures *2900	0 / 0	10
	1145	P1679B Stone Age Problem data structures implementation *1200	0 / 0	4
	1144	P1679C Rooks Defenders data structures implementation *1400	0 / 0	4
	1130	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	10
	1129	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	1123	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1118	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	1117	P1684F Diverse Segments data structures two pointers *2600	0 / 0	10
	1102	P1685E The Ultimate LIS Problem data structures greedy *3500	0 / 0	10
	1092	P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	9
	1090	P1687D Cute number binary search brute force data structures dsu implementation math *2900	0 / 0	10
	1077	P1689B Mystic Permutation data structures greedy *900	0 / 0	3
	1073	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	1066	P1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	3
	1062	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1058	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	6

Pick a problem randomly based on the current filter.