Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2655	P1468G Hobbits binary search geometry *2500	0 / 0	9
	2652	P1468H K and Medians constructive algorithms greedy math *2200	0 / 0	8
	2650	P1468I Plane Tiling geometry implementation math *2500	0 / 0	9
	2649	P1468J Road Reform dsu graphs greedy *1800	0 / 0	6
	2646	P1468K The Robot brute force implementation *1600	0 / 0	5
	2644	P1468L Prime Divisors Selection binary search greedy math number theory *2700	0 / 0	10
	2642	P1468M Similar Sets data structures graphs implementation *2300	0 / 0	8
	2640	P1468N Waste Sorting greedy implementation *900	0 / 0	3
	2638	P1469A Regular Bracket Sequence constructive algorithms greedy *1000	0 / 0	3
	2636	P1469B Red and Blue dp greedy *1000	0 / 0	3
	2635	P1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	5
	2633	P1469D Ceil Divisions brute force constructive algorithms math number theory *1700	0 / 0	5
	2631	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	9
	2628	P1469F Power Sockets binary search data structures greedy *2600	0 / 0	10
	2626	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	2624	P1470B Strange Definition bitmasks graphs hashing math number theory *1900	0 / 0	6
	2622	P1470C Strange Shuffle binary search brute force constructive algorithms interactive *2500	0 / 0	9
	2620	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	8
	2619	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2616	P1470F Strange Covering divide and conquer *3500	0 / 0	10
	2614	P1471A Strange Partition greedy math number theory *900	0 / 0	3
	2612	P1471B Strange List brute force greedy implementation math *1100	0 / 0	3
	2610	P1472A Cards for Friends greedy math *800	0 / 0	3
	2609	P1472B Fair Division dp greedy math *800	0 / 0	3
	2607	P1472C Long Jumps dp graphs *1100	0 / 0	3
	2605	P1472D Even-Odd Game dp games greedy sortings *1200	0 / 0	4
	2604	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	2603	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2602	P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	2601	P1473A Replacing Elements greedy implementation math sortings *800	0 / 0	3
	2600	P1473B String LCM brute force math number theory strings *1000	0 / 0	3
	2599	P1473C No More Inversions constructive algorithms math *1500	0 / 0	5
	2598	P1473D Program data structures dp implementation strings *1700	0 / 0	5
	2597	P1473E Minimum Path graphs shortest paths *2400	0 / 0	9
	2596	P1473F Strange Set flows math *2700	0 / 0	10
	2595	P1473G Tiles combinatorics dp fft math *2800	0 / 0	10
	2593	P1474A Puzzle From the Future greedy *800	0 / 0	3
	2592	P1474B Different Divisors binary search constructive algorithms greedy math number theory *1000	0 / 0	3
	2591	P1474C Array Destruction brute force constructive algorithms data structures greedy implementation sortings *1700	0 / 0	5
	2590	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2589	P1474E What Is It? constructive algorithms greedy *2500	0 / 0	9
	2588	P1474F 1 2 3 4 ... dp math matrices *3000	0 / 0	10
	2587	P1475A Odd Divisor math number theory *900	0 / 0	3
	2584	P1475B New Year's Number brute force dp math *900	0 / 0	3
	2582	P1475C Ball in Berland combinatorics graphs math *1400	0 / 0	4
	2581	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	6
	2578	P1475E Advertising Agency combinatorics math sortings *1600	0 / 0	5
	2577	P1475F Unusual Matrix 2-sat brute force constructive algorithms *1900	0 / 0	6
	2574	P1475G Strange Beauty dp math number theory sortings *1900	0 / 0	6
	2573	P1476A K-divisible Sum binary search constructive algorithms greedy math *1000	0 / 0	3
	2571	P1476B Inflation binary search brute force greedy math *1300	0 / 0	4
	2570	P1476C Longest Simple Cycle dp graphs greedy *1600	0 / 0	5
	2569	P1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	5
	2568	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2565	P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	2564	P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	10
	2561	P1477A Nezzar and Board constructive algorithms math number theory *1800	0 / 0	6
	2560	P1477B Nezzar and Binary String data structures greedy *1900	0 / 0	6
	2557	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	8
	2555	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	10
	2554	P1477E Nezzar and Tournaments data structures greedy *3300	0 / 0	10
	2551	P1477F Nezzar and Chocolate Bars combinatorics fft math probabilities *3500	0 / 0	10
	2549	P1478A Nezzar and Colorful Balls brute force greedy *800	0 / 0	3
	2547	P1478B Nezzar and Lucky Number brute force dp greedy math *1100	0 / 0	3
	2546	P1478C Nezzar and Symmetric Array implementation math sortings *1700	0 / 0	5
	2543	P1479A Searching Local Minimum binary search interactive ternary search *1700	0 / 0	5
	2541	P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	6
	2539	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2537	P1479C Continuous City bitmasks constructive algorithms *2500	0 / 0	9
	2535	P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	10
	2533	P1479E School Clubs dp fft math number theory probabilities *3500	0 / 0	10
	2531	P1480A Yet Another String Game games greedy strings *800	0 / 0	3
	2529	P1480B The Great Hero greedy implementation sortings *900	0 / 0	3
	2528	P1481A Space Navigation greedy strings *800	0 / 0	3
	2526	P1481B New Colony brute force greedy implementation *1100	0 / 0	3
	2524	P1481C Fence Painting brute force constructive algorithms greedy *1600	0 / 0	5
	2523	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2522	P1481E Sorting Books data structures dp greedy *2500	0 / 0	9
	2521	P1481F AB Tree dp greedy trees *3100	0 / 0	10
	2520	P1482A Prison Break math *800	0 / 0	3
	2519	P1482B Restore Modulo implementation math *1500	0 / 0	5
	2518	P1482C Basic Diplomacy brute force constructive algorithms greedy implementation *1600	0 / 0	5
	2517	P1482D Playlist data structures dsu implementation shortest paths *1900	0 / 0	6
	2516	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2515	P1482F Useful Edges graphs shortest paths *2400	0 / 0	9
	2514	P1482G Vabank binary search interactive *3200	0 / 0	10
	2512	P1482H Exam data structures string suffix structures trees *3400	0 / 0	10
	2510	P1485A Add and Divide brute force greedy math number theory *1000	0 / 0	3
	2509	P1485B Replace and Keep Sorted dp implementation math *1200	0 / 0	4
	2508	P1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	5
	2506	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	8
	2505	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	9
	2503	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	9
	2502	P1486A Shifting Stacks greedy implementation *900	0 / 0	3
	2501	P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	5
	2500	P1486C1 Guessing the Greatest (easy version) binary search interactive *1600	1 / 1	5
	2499	P1486C2 Guessing the Greatest (hard version) binary search interactive *1900	1 / 1	6
	2498	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2497	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2496	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	10

Pick a problem randomly based on the current filter.