binary search - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3874	P1268C K Integers binary search data structures *2300	0 / 0	8
	3839	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	7
	3791	P1279B Verse For Santa binary search brute force implementation *1300	0 / 0	4
	3784	P1279F New Year and Handle Change binary search dp *2800	0 / 0	10
	3745	P1284B New Year and Ascent Sequence binary search combinatorics data structures dp implementation sortings *1400	0 / 0	4
	3743	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	7
	3727	P1285F Classical? binary search combinatorics number theory *2900	0 / 0	10
	3710	P1288A Deadline binary search brute force math ternary search *1100	0 / 0	3
	3705	P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	7
	3697	P1290B Irreducible Anagrams binary search constructive algorithms data structures strings two pointers *1800	0 / 0	6
	3676	P1293A ConneR and the A.R.C binary search brute force implementation *1100	0 / 0	3
	3626	P1297D Bonus Distribution *special problem binary search greedy sortings	0 / 0	(None)
	3612	P1301B Motarack's Birthday binary search greedy ternary search *1500	0 / 0	5
	3611	P1301C Ayoub's function binary search combinatorics greedy math strings *1700	0 / 0	5
	3609	P1301E Nanosoft binary search data structures dp implementation *2500	0 / 0	9
	3576	P1305H Kuroni the Private Tutor binary search greedy *3500	0 / 0	10
	3572	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	6
	3571	P1307E Cow and Treats binary search combinatorics dp greedy implementation math *2500	0 / 0	9
	3564	P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	10
	3528	P1315B Homecoming binary search dp greedy strings *1300	0 / 0	4
	3496	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3483	P1323B Count Subrectangles binary search greedy implementation *1500	0 / 0	5
	3479	P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	3
	3478	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	4
	3459	P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	6
	3439	P1328B K-th Beautiful String binary search brute force combinatorics implementation math *1300	0 / 0	4
	3422	P1329E Dreamoon Loves AA binary search greedy *3300	0 / 0	10
	3386	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	5
	3375	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	9
	3370	P1335C Two Teams Composing binary search greedy implementation sortings *1100	0 / 0	3
	3366	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	3360	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	5
	3334	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	6
	3322	P1344D Résumé Review binary search greedy math *2700	0 / 0	10
	3318	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	3
	3305	P1348D Phoenix and Science binary search constructive algorithms greedy implementation math *1900	0 / 0	6
	3288	P1352C K-th Not Divisible by n binary search math *1200	0 / 0	4
	3276	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	4
	3275	P1354C1 Simple Polygon Embedding binary search geometry math ternary search *1400	0 / 0	4
	3274	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	3273	P1354D Multiset binary search data structures *1900	0 / 0	6
	3270	P1354G Find a Gift binary search interactive probabilities *2600	0 / 0	10
	3267	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	6
	3265	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	7
	3232	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	6
	3230	P1358F Tasty Cookie binary search constructive algorithms greedy implementation *2700	0 / 0	10
	3227	P1359C Mixing Water binary search math *1700	0 / 0	5
	3224	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	10
	3216	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
	3213	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	3203	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	7
	3188	P1366A Shovels and Swords binary search greedy math *1100	0 / 0	3
	3184	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	3183	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	10
	3175	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	3156	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	3155	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	7
	3154	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	3153	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	3148	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
	3147	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	3140	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	10
	3134	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	9
	3115	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	5
	3114	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3113	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	3111	P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	10
	3078	P1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	10
	3075	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	3049	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	9
	3037	P1394C Boboniu and String binary search geometry ternary search *2600	0 / 0	10
	3020	P1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	8
	3019	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	3012	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	2998	P1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	9
	2994	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	9
	2989	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	2972	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	5
	2971	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2967	P1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	10
	2961	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	2950	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	2940	P1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	5
	2936	P1416E Split binary search data structures dp greedy *3200	0 / 0	10
	2928	P1418E Expected Damage binary search combinatorics probabilities *2400	0 / 0	9
	2922	P1419D1 Sage's Birthday (easy version) binary search constructive algorithms greedy sortings *1000	0 / 0	3
	2921	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	2919	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	10
	2900	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	6
	2891	P1423K Lonely Numbers binary search math number theory two pointers *1600	0 / 0	5
	2875	P1426C Increase and Copy binary search constructive algorithms math *1100	0 / 0	3
	2864	P1427H Prison Break binary search games geometry ternary search *3500	0 / 0	10
	2859	P1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	8
	2858	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2855	P1428H Rotary Laser Lock binary search interactive *3500	0 / 0	10
	2851	P1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	5
	2842	P1431F Neural Network Problem special problem binary search greedy 2100	0 / 0	7
	2827	P1436C Binary Search binary search combinatorics *1500	0 / 0	5
	2826	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	6
	2825	P1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	9

Pick a problem randomly based on the current filter.