*2200 - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4641	CF1168C And Reachability bitmasks dp *2200	0 / 0	(None)
4604	CF1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
4586	CF1178F1 Short Colorful Strip combinatorics dfs and similar dp *2200	0 / 0	(None)
4580	CF1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	(None)
4571	CF1181D Irrigation binary search data structures implementation sortings trees two pointers *2200	0 / 0	(None)
4548	CF1184B2 The Doctor Meets Vader (Medium) flows graph matchings graphs shortest paths sortings *2200	0 / 0	(None)
4544	CF1184C2 Heidi and the Turing Test (Medium) data structures *2200	0 / 0	(None)
4483	CF1194E Count The Rectangles bitmasks brute force data structures geometry sortings *2200	0 / 0	(None)
4465	CF1196F K-th Path brute force constructive algorithms shortest paths sortings *2200	0 / 0	(None)
4392	CF1208E Let Them Slide data structures implementation *2200	0 / 0	(None)
4336	CF1215E Marbles bitmasks dp *2200	0 / 0	(None)
4328	CF1216E2 Numerical Sequence (hard version) binary search math *2200	0 / 0	(None)
4303	CF1220E Tourism dfs and similar dp dsu graphs greedy trees *2200	0 / 0	(None)
4277	CF1225E Rock Is Push binary search dp *2200	0 / 0	(None)
4269	CF1227E Arson In Berland Forest binary search graphs graphs shortest paths *2200	0 / 0	(None)
4267	CF1227F1 Wrong Answer on test 233 (Easy Version) dp *2200	0 / 0	(None)
4254	CF1231E Middle-Out constructive algorithms greedy strings *2200	0 / 0	(None)
4247	CF1234F Yet Another Substring Reverse bitmasks dp *2200	0 / 0	(None)
4225	CF1238E Keyboard Purchase bitmasks dp *2200	0 / 0	(None)
4223	CF1238F The Maximum Subtree dfs and similar dp graphs trees *2200	0 / 0	(None)
4176	CF1249F Maximum Weight Subset dp trees *2200	0 / 0	(None)
4148	CF1252E Songwriter greedy two pointers *2200	0 / 0	(None)
4134	CF1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	(None)
4030	CF1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	(None)
4015	CF1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	(None)
3985	CF1283F DIY Garland constructive algorithms greedy trees *2200	0 / 0	(None)
3922	CF1295E Permutation Separation data structures divide and conquer *2200	0 / 0	(None)
3873	CF1303E Erase Subsequences dp strings *2200	0 / 0	(None)
3856	CF1305E Kuroni and the Score Distribution constructive algorithms greedy implementation math *2200	0 / 0	(None)
3833	CF1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	(None)
3763	CF1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	(None)
3753	CF1328F Make k Equal greedy *2200	0 / 0	(None)
3721	CF1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	(None)
3716	CF1334E Divisor Paths combinatorics graphs greedy math number theory *2200	0 / 0	(None)
3706	CF1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	(None)
3703	CF1336C Kaavi and Magic Spell dp strings *2200	0 / 0	(None)
3693	CF1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	(None)
3611	CF1353F Decreasing Heights brute force dp *2200	0 / 0	(None)
3453	CF1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(None)
3398	CF1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(None)
3372	CF1389E Calendar Ambiguity math number theory *2200	0 / 0	(None)
3326	CF1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	(None)
3317	CF1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
3310	CF1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(None)
3282	CF1406D Three Sequences constructive algorithms data structures greedy math *2200	0 / 0	(None)
3276	CF1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	(None)
3239	CF1415E New Game Plus! constructive algorithms greedy math *2200	0 / 0	(None)
3176	CF1424M Ancient Language graphs sortings *2200	0 / 0	(None)
3171	CF1425E Excitation of Atoms greedy implementation *2200	0 / 0	(None)
3147	CF1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	(None)
3103	CF1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	(None)
3096	CF1438D Powerful Ksenia bitmasks constructive algorithms math *2200	0 / 0	(None)
2993	CF1461E Water Level brute force graphs greedy implementation math *2200	0 / 0	(None)
2961	CF1467D Sum of Paths combinatorics dp math *2200	0 / 0	(None)
2959	CF1468A LaIS data structures dp greedy *2200	0 / 0	(None)
2951	CF1468H K and Medians constructive algorithms greedy math *2200	0 / 0	(None)
2933	CF1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	(None)
2909	CF1474D Cleaning data structures dp greedy math *2200	0 / 0	(None)
2888	CF1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	(None)
2852	CF1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	(None)
2843	CF1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	(None)
2829	CF1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	(None)
2766	CF1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	(None)
2765	CF1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(None)
2754	CF1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	(None)
2743	CF1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
2731	CF1505F Math special problem math 2200	0 / 0	(None)
2728	CF1505I Mysterious language again, seriously? special problem 2200	0 / 0	(None)
2665	CF1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	(None)
2631	CF1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	(None)
2630	CF1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	(None)
2604	CF1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	(None)
2544	CF1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	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)
2529	CF1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(None)
2499	CF1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	(None)
2492	CF1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	(None)
2449	CF1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
2442	CF1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(None)
2410	CF1556E Equilibrium data structures dp greedy *2200	0 / 0	(None)
2403	CF1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	(None)
2388	CF1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(None)
2372	CF1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	(None)
2354	CF1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	(None)
2312	CF1575G GCD Festival math number theory *2200	0 / 0	(None)
2311	CF1575H Holiday Wall Ornaments dp strings *2200	0 / 0	(None)
2308	CF1575K Knitting Batik implementation math *2200	0 / 0	(None)
2281	CF1579G Minimal Coverage dp *2200	0 / 0	(None)
2277	CF1580C Train Maintenance brute force data structures implementation *2200	0 / 0	(None)
2258	CF1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
2220	CF1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	(None)
2151	CF1607G Banquet Preparations 1 greedy *2200	0 / 0	(None)
2150	CF1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	(None)
2089	CF1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	(None)
2078	CF1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	(None)
2061	CF1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	(None)
2029	CF1622E Math Test bitmasks brute force greedy *2200	0 / 0	(None)
1996	CF1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	(None)
1982	CF1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	(None)
1950	CF1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	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