binary search - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2819	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	8
	2812	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	2807	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	2798	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2794	P1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	4
	2783	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2779	P1446F Line Distance binary search data structures geometry *3200	0 / 0	10
	2772	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	2758	P1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	4
	2748	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2741	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2717	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	2705	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	5
	2704	P1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	5
	2702	P1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	6
	2700	P1463A Dungeon binary search math *1100	0 / 0	3
	2695	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	2674	P1466I The Riddle of the Sphinx binary search data structures data structures interactive *3400	0 / 0	10
	2660	P1468D Firecrackers binary search sortings *1700	0 / 0	5
	2655	P1468G Hobbits binary search geometry *2500	0 / 0	9
	2644	P1468L Prime Divisors Selection binary search greedy math number theory *2700	0 / 0	10
	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
	2622	P1470C Strange Shuffle binary search brute force constructive algorithms interactive *2500	0 / 0	9
	2619	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2604	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	2592	P1474B Different Divisors binary search constructive algorithms greedy math number theory *1000	0 / 0	3
	2581	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	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
	2565	P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	2543	P1479A Searching Local Minimum binary search interactive ternary search *1700	0 / 0	5
	2535	P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	10
	2514	P1482G Vabank binary search interactive *3200	0 / 0	10
	2508	P1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	5
	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
	2492	P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	5
	2486	P1488C Two Policemen special problem binary search brute force math 1900	0 / 0	6
	2485	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	6
	2482	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	8
	2468	P1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	3
	2464	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	2463	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2460	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	6
	2449	P1491F Magnets binary search constructive algorithms interactive *2700	0 / 0	10
	2438	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2433	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2424	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	2389	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	2371	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	2364	P1500E Subset Trick binary search data structures *3300	0 / 0	10
	2354	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2325	P1508B Almost Sorted binary search combinatorics constructive algorithms implementation *1800	0 / 0	6
	2265	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2264	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	10
	2253	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	2245	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	2232	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	9
	2215	P1520F1 Guess the K-th Zero (Easy version) binary search interactive *1600	0 / 0	5
	2214	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	2208	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	2169	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	9
	2151	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2133	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)
	2132	P1533F Binary String Partition *special problem binary search greedy	0 / 0	(None)
	2107	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2105	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2104	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2087	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2086	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2082	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	4
	2079	P1538F Interesting Function binary search dp math number theory *1500	0 / 0	5
	2078	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	2074	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	2073	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	2067	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	10
	2035	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	6
	2028	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	6
	2013	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	2011	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	2009	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	2002	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	1995	P1551E Fixed Points binary search brute force dp *2000	0 / 0	7
	1980	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1977	P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	10
	1951	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	1923	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	1907	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	6
	1906	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1903	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	4
	1894	P1566A Median Maximization binary search greedy math *800	0 / 0	3
	1863	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	6
	1841	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	10
	1838	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	1833	P1572E Polygon binary search dp geometry *3000	0 / 0	10
	1821	P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	4

Pick a problem randomly based on the current filter.