*2000 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3666	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	7
	3645	P1296E2 String Coloring (hard version) data structures dp *2000	0 / 0	7
	3610	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	7
	3586	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3550	P1311D Three Integers brute force math *2000	0 / 0	7
	3518	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 1	7
	3508	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3324	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	3312	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	7
	3301	P1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	7
	3300	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	3274	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	3226	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	3225	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	7
	3202	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	3185	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	7
	3156	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	3114	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3106	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	3081	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	7
	3068	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	3056	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	3013	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	2971	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2943	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	7
	2939	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	7
	2938	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2872	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2869	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	7
	2868	P1427D Unshuffling a Deck constructive algorithms implementation *2000	0 / 0	7
	2843	P1431E Chess Match special problem 2000	0 / 0	7
	2814	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	7
	2762	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	7
	2742	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	2731	P1458B Glass Half Spilled dp *2000	0 / 0	7
	2523	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2491	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2433	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2330	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2328	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2271	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	1 / 1	7
	2265	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2210	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	7
	2192	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2098	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	1995	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1925	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	1889	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	1875	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	7
	1848	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	7
	1818	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	1753	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	1730	P1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	7
	1660	P1599C Bubble Strike combinatorics math probabilities ternary search *2000	0 / 0	7
	1568	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	1550	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	1543	P1613E Crazy Robot dfs and similar graphs *2000	1 / 1	7
	1524	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	1508	P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	1501	P1619F Let's Play the Hat? brute force constructive algorithms greedy math *2000	0 / 0	7
	1500	P1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	7
	1495	P1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	7
	1479	P1622D Shuffle combinatorics math two pointers *2000	0 / 0	7
	1467	P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	7
	1466	P1624F Interacdive Problem binary search constructive algorithms interactive *2000	0 / 0	7
	1404	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	7
	1392	P1634D Finding Zero constructive algorithms interactive math *2000	0 / 0	7
	1372	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	7
	1357	P1641B Repetitions Decoding constructive algorithms implementation sortings *2000	0 / 0	7
	1341	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	7
	1291	P1657D For Gamers binary search brute force greedy math sortings *2000	0 / 0	7
	1236	P1665D GCD Guess bitmasks chinese remainder theorem constructive algorithms games interactive math number theory *2000	0 / 0	7
	1189	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	7
	1174	P1674E Breaking the Wall binary search brute force constructive algorithms greedy math *2000	0 / 0	7
	1172	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
	1136	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1125	P1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	7
	1110	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1062	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1021	P1696E Placing Jinas combinatorics math *2000	0 / 0	7
	962	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	7
	909	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	7
	884	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	883	P1716D Chip Move brute force dp math *2000	0 / 0	7
	872	P1718B Fibonacci Strings greedy implementation math number theory *2000	0 / 0	7
	843	P1725C Circular Mirror binary search combinatorics geometry math two pointers *2000	0 / 0	7
	829	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	800	P1731E Graph Cost dp greedy math number theory *2000	0 / 0	7
	787	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	721	P1741F Multi-Colored Segments binary search data structures math sortings *2000	0 / 0	7
	678	P1744F MEX vs MED math two pointers *2000	0 / 0	7
	614	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	541	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	529	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	458	P1770D Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation *2000	0 / 0	7
	318	P1783D Different Arrays brute force dp implementation *2000	0 / 0	7
	286	P1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	7
	215	P1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	7
	147	P1804D Accommodation brute force dp greedy implementation *2000	0 / 0	7
	48	P1815B Sum Graph brute force constructive algorithms graphs implementation interactive shortest paths trees *2000	0 / 0	7

Pick a problem randomly based on the current filter.