*2300 - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3796	CF1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	(None)
3674	CF1342E Placing Rooks combinatorics fft math *2300	0 / 0	(None)
3650	CF1346G Two IP Cameras special problem math number theory 2300	0 / 0	(None)
3466	CF1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
3429	CF1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
3420	CF1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	(None)
3392	CF1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(None)
3391	CF1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(None)
3345	CF1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(None)
3336	CF1396C Monster Invaders dp greedy implementation *2300	0 / 0	(None)
3316	CF1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(None)
3295	CF1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(None)
3291	CF1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	(None)
3269	CF1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	(None)
3253	CF1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	(None)
3197	CF1422D Returning Home graphs shortest paths sortings *2300	0 / 0	(None)
3172	CF1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	(None)
3051	CF1450C2 Errich-Tac-Toe (Hard Version) constructive algorithms math *2300	0 / 0	(None)
3038	CF1451E2 Bitwise Queries (Hard Version) bitmasks constructive algorithms interactive math *2300	0 / 0	(None)
3023	CF1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	(None)
2945	CF1468M Similar Sets data structures graphs implementation *2300	0 / 0	(None)
2894	CF1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	(None)
2828	CF1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	(None)
2789	CF1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(None)
2784	CF1495C Garden of the Sun constructive algorithms graphs *2300	0 / 0	(None)
2677	CF1513E Cost Equilibrium combinatorics constructive algorithms math sortings *2300	0 / 0	(None)
2592	CF1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	(None)
2554	CF1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	(None)
2538	CF1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	(None)
2510	CF1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(None)
2469	CF1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	(None)
2460	CF1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	(None)
2443	CF1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	(None)
2432	CF1553F Pairwise Modulo data structures math *2300	0 / 0	(None)
2318	CF1575B Building an Amusement Park binary search geometry *2300	0 / 0	(None)
2310	CF1575I Illusions of the Desert data structures trees *2300	0 / 0	(None)
2249	CF1584E Game with Stones binary search data structures games greedy *2300	0 / 0	(None)
2232	CF1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	(None)
2214	CF1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	(None)
2192	CF1600F Party Organization brute force math probabilities *2300	0 / 0	(None)
2186	CF1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
2177	CF1603C Extreme Extension dp greedy math number theory *2300	0 / 0	(None)
2152	CF1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	(None)
2128	CF1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	(None)
2095	CF1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	(None)
2039	CF1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	(None)
2023	CF1623D Robot Cleaner Revisit implementation math probabilities *2300	0 / 0	(None)
2010	CF1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	(None)
1992	CF1628C Grid Xor constructive algorithms greedy implementation interactive math *2300	0 / 0	(None)
1864	CF1654E Arithmetic Operations brute force data structures graphs math *2300	0 / 0	(None)
1838	CF1658D2 388535 (Hard Version) bitmasks brute force data structures math *2300	0 / 0	(None)
1706	CF1675G Sorting Pancakes dp *2300	0 / 0	(None)
1666	CF1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	(None)
1612	CF1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	(None)
1599	CF1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	(None)
1588	CF1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	(None)
1566	CF1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	(None)
1560	CF1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	(None)
1512	CF1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	(None)
1505	CF1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	(None)
1476	CF1712E1 LCM Sum (easy version) binary search brute force combinatorics math number theory two pointers *2300	0 / 0	(None)
10429	CF1728E Red-Black Pepper brute force data structures greedy math number theory *2300	0 / 0	(None)
10346	CF1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	(None)
9923	CF1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	(None)
9635	CF1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	(None)
8590	CF1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	(None)
8457	CF1768E Partial Sorting combinatorics math number theory *2300	0 / 0	(None)
7546	CF1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	(None)
7479	CF1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	(None)
7379	CF1783E Game of the Year brute force data structures math number theory *2300	0 / 0	(None)
6945	CF1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	(None)
6457	CF1797E Li Hua and Array brute force data structures dsu math number theory two pointers *2300	0 / 0	(None)
6390	CF1798E Multitest Generator brute force dp *2300	0 / 0	(None)
6313	CF1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math *2300	0 / 0	(None)
5935	CF1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	(None)
5246	CF1814E Chain Chips data structures dp matrices *2300	0 / 0	(None)
4712	CF1824B2 LuoTianyi and the Floating Islands (Hard Version) combinatorics dfs and similar math probabilities trees *2300	0 / 0	(None)
4102	CF1834E MEX of LCM binary search data structures implementation math number theory *2300	0 / 0	(None)
3601	CF1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	(None)
3479	CF1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	(None)
3035	CF1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers *2300	0 / 0	(None)
2268	CF1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	(None)
2013	CF1864F Exotic Queries data structures implementation sortings *2300	0 / 0	(None)
1935	CF1866D Digital Wallet dp greedy *2300	0 / 0	(None)
1880	CF1866I Imagination Castle dp games two pointers *2300	0 / 0	(None)
1602	CF1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	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