binary search - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2803	CF1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	(None)
2797	CF1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	(None)
2790	CF1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	(None)
2768	CF1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	(None)
2754	CF1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	(None)
2751	CF1500E Subset Trick binary search data structures *3300	0 / 0	(None)
2743	CF1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
2718	CF1508B Almost Sorted binary search combinatorics constructive algorithms implementation *1800	0 / 0	(None)
2672	CF1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	(None)
2671	CF1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)
2661	CF1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	(None)
2656	CF1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	(None)
2650	CF1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	(None)
2632	CF1520F1 Guess the K-th Zero (Easy version) binary search interactive *1600	0 / 0	(None)
2631	CF1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	(None)
2625	CF1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	(None)
2595	CF1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(None)
2583	CF1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	(None)
2565	CF1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)
2564	CF1533F Binary String Partition *special problem binary search greedy	0 / 0	(None)
2546	CF1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	(None)
2544	CF1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	(None)
2543	CF1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	(None)
2531	CF1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	(None)
2530	CF1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	(None)
2526	CF1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	(None)
2520	CF1538F Interesting Function binary search dp math number theory *1500	0 / 0	(None)
2519	CF1538G Gift Set binary search greedy math ternary search *2100	0 / 0	(None)
2515	CF1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	(None)
2514	CF1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(None)
2507	CF1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	(None)
2474	CF1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(None)
2471	CF1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
2460	CF1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	(None)
2459	CF1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
2458	CF1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
2454	CF1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(None)
2450	CF1551E Fixed Points binary search brute force dp *2000	0 / 0	(None)
2442	CF1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(None)
2440	CF1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	(None)
2426	CF1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	(None)
2396	CF1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
2383	CF1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	(None)
2382	CF1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
2378	CF1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(None)
2369	CF1566A Median Maximization binary search greedy math *800	0 / 0	(None)
2349	CF1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	(None)
2337	CF1571I Physical Examination special problem binary search data structures 3200	0 / 0	(None)
2334	CF1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
2330	CF1572E Polygon binary search dp geometry *3000	0 / 0	(None)
2323	CF1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	(None)
2322	CF1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)
2318	CF1575B Building an Amusement Park binary search geometry *2300	0 / 0	(None)
2309	CF1575J Jeopardy of Dropped Balls binary search brute force dsu implementation *1500	0 / 0	(None)
2291	CF1578L Labyrinth binary search dsu greedy *2400	0 / 0	(None)
2266	CF1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	(None)
2264	CF1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	(None)
2250	CF1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	(None)
2249	CF1584E Game with Stones binary search data structures games greedy *2300	0 / 0	(None)
2237	CF1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	(None)
2236	CF1592A Gamer Hemose binary search greedy math sortings *800	0 / 0	(None)
2232	CF1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	(None)
2226	CF1593C Save More Mice binary search greedy greedy *1000	0 / 0	(None)
2206	CF1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	(None)
2183	CF1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	(None)
2166	CF1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	(None)
2144	CF1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	(None)
2142	CF1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	(None)
2139	CF1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	(None)
2130	CF1610C Keshi Is Throwing a Party binary search greedy *1600	0 / 0	(None)
2128	CF1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	(None)
2121	CF1611B Team Composition: Programmers and Mathematicians binary search constructive algorithms math *800	0 / 0	(None)
2116	CF1611F ATM and Students binary search data structures two pointers *1800	0 / 0	(None)
2111	CF1612C Chat Ban binary search math *1300	0 / 0	(None)
2104	CF1613C Poisoned Dagger binary search *1200	0 / 0	(None)
2094	CF1614E Divan and a Cottage binary search data structures *2600	0 / 0	(None)
2085	CF1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
2072	CF1617C Paprika and Permutation binary search greedy math sortings *1300	0 / 0	(None)
2056	CF1619D New Year's Problem binary search greedy sortings *1800	0 / 0	(None)
2053	CF1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	(None)
2039	CF1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	(None)
2031	CF1622C Set or Decrease binary search brute force greedy sortings *1600	0 / 0	(None)
2025	CF1623C Balanced Stone Heaps binary search greedy *1600	0 / 0	(None)
2018	CF1624D Palindromes Coloring binary search greedy sortings strings *1400	0 / 0	(None)
2016	CF1624F Interacdive Problem binary search constructive algorithms interactive *2000	0 / 0	(None)
2008	CF1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	(None)
2005	CF1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	(None)
2004	CF1626D Martial Arts Tournament binary search brute force greedy math *2100	0 / 0	(None)
1994	CF1628A Meximum Array binary search constructive algorithms greedy implementation math two pointers *1400	0 / 0	(None)
1988	CF1628E Groceries in Meteor Town binary search data structures dsu trees *3100	0 / 0	(None)
1987	CF1628F Spaceship Crisis Management binary search data structures geometry sortings *3500	0 / 0	(None)
1983	CF1630B Range and Partition binary search constructive algorithms data structures greedy two pointers *1800	0 / 0	(None)
1973	CF1632C Strange Test binary search bitmasks brute force dp math *1600	0 / 0	(None)
1972	CF1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	(None)
1971	CF1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	(None)
1970	CF1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	(None)
1963	CF1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	(None)
1943	CF1637E Best Pair binary search brute force implementation *2100	0 / 0	(None)
1918	CF1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	(None)
1878	CF1650E Rescheduling the Exam binary search data structures greedy implementation math sortings *1900	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