binary search - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3540	CF1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
3529	CF1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	(None)
3511	CF1366A Shovels and Swords binary search greedy math *1100	0 / 0	(None)
3507	CF1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
3506	CF1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
3497	CF1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
3476	CF1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
3475	CF1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	(None)
3474	CF1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
3473	CF1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(None)
3467	CF1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(None)
3466	CF1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
3459	CF1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(None)
3452	CF1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(None)
3431	CF1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(None)
3430	CF1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
3429	CF1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
3427	CF1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	(None)
3389	CF1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	(None)
3386	CF1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	(None)
3358	CF1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	(None)
3344	CF1394C Boboniu and String binary search geometry ternary search *2600	0 / 0	(None)
3326	CF1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	(None)
3325	CF1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(None)
3317	CF1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
3300	CF1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	(None)
3296	CF1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	(None)
3291	CF1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	(None)
3272	CF1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	(None)
3271	CF1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(None)
3266	CF1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	(None)
3260	CF1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(None)
3248	CF1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(None)
3237	CF1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	(None)
3232	CF1416E Split binary search data structures dp greedy *3200	0 / 0	(None)
3223	CF1418E Expected Damage binary search combinatorics probabilities *2400	0 / 0	(None)
3217	CF1419D1 Sage's Birthday (easy version) binary search constructive algorithms greedy sortings *1000	0 / 0	(None)
3216	CF1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	(None)
3214	CF1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	(None)
3193	CF1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	(None)
3182	CF1423K Lonely Numbers binary search math number theory two pointers *1600	0 / 0	(None)
3164	CF1426C Increase and Copy binary search constructive algorithms math *1100	0 / 0	(None)
3152	CF1427H Prison Break binary search games geometry ternary search *3500	0 / 0	(None)
3147	CF1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	(None)
3145	CF1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(None)
3142	CF1428H Rotary Laser Lock binary search interactive *3500	0 / 0	(None)
3138	CF1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	(None)
3128	CF1431F Neural Network Problem special problem binary search greedy 2100	0 / 0	(None)
3111	CF1436C Binary Search binary search combinatorics *1500	0 / 0	(None)
3110	CF1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	(None)
3109	CF1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	(None)
3103	CF1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	(None)
3095	CF1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(None)
3089	CF1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	(None)
3078	CF1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	(None)
3074	CF1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	(None)
3062	CF1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	(None)
3058	CF1446F Line Distance binary search data structures geometry *3200	0 / 0	(None)
3050	CF1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	(None)
3034	CF1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	(None)
3023	CF1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	(None)
3016	CF1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	(None)
2994	CF1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	(None)
2986	CF1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	(None)
2985	CF1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	(None)
2984	CF1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	(None)
2983	CF1463A Dungeon binary search math *1100	0 / 0	(None)
2979	CF1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	(None)
2965	CF1466I The Riddle of the Sphinx binary search data structures data structures interactive *3400	0 / 0	(None)
2955	CF1468D Firecrackers binary search sortings *1700	0 / 0	(None)
2952	CF1468G Hobbits binary search geometry *2500	0 / 0	(None)
2947	CF1468L Prime Divisors Selection binary search greedy math number theory *2700	0 / 0	(None)
2938	CF1469F Power Sockets binary search data structures greedy *2600	0 / 0	(None)
2937	CF1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	(None)
2934	CF1470C Strange Shuffle binary search brute force constructive algorithms interactive *2500	0 / 0	(None)
2932	CF1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	(None)
2923	CF1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	(None)
2911	CF1474B Different Divisors binary search constructive algorithms greedy math number theory *1000	0 / 0	(None)
2903	CF1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	(None)
2898	CF1476A K-divisible Sum binary search constructive algorithms greedy math *1000	0 / 0	(None)
2897	CF1476B Inflation binary search brute force greedy math *1300	0 / 0	(None)
2893	CF1476F Lanterns binary search data structures dp *3000	0 / 0	(None)
2881	CF1479A Searching Local Minimum binary search interactive ternary search *1700	0 / 0	(None)
2876	CF1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	(None)
2859	CF1482G Vabank binary search interactive *3200	0 / 0	(None)
2853	CF1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	(None)
2848	CF1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	(None)
2847	CF1486C1 Guessing the Greatest (easy version) binary search interactive *1600	0 / 0	(None)
2845	CF1486C2 Guessing the Greatest (hard version) binary search interactive *1900	0 / 0	(None)
2844	CF1486D Max Median binary search data structures dp *2100	0 / 0	(None)
2843	CF1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(None)
2838	CF1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	(None)
2831	CF1488C Two Policemen special problem binary search brute force math 1900	0 / 0	(None)
2830	CF1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	(None)
2828	CF1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	(None)
2820	CF1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	(None)
2818	CF1490E Accidental Victory binary search data structures greedy *1400	0 / 0	(None)
2817	CF1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	(None)
2816	CF1490G Old Floppy Drive binary search data structures math *1900	0 / 0	(None)
2809	CF1491F Magnets binary search constructive algorithms interactive *2700	0 / 0	(None)

Lucky

Pick a problem randomly based on the current filter.

Categories

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

Status

Development

Support

About

Categories

Status

Development

Support

About

Don't have an account?

SIGN IN