*2400 - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4760	CF1147D Palindrome XOR dfs and similar graphs *2400	0 / 0	(None)
4727	CF1152E Neko and Flashback constructive algorithms dfs and similar graphs *2400	0 / 0	(None)
4667	CF1163E Magical Permutation bitmasks brute force constructive algorithms data structures graphs math *2400	0 / 0	(None)
4652	CF1166F Vicky's Delivery Service data structures dsu graphs hashing *2400	0 / 0	(None)
4609	CF1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	(None)
4564	CF1182D Complete Mirror constructive algorithms dfs and similar dp hashing implementation trees *2400	0 / 0	(None)
4538	CF1184E3 Daleks' Invasion (hard) data structures dsu graphs trees *2400	0 / 0	(None)
4521	CF1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	(None)
4517	CF1187D Subarray Sorting data structures sortings *2400	0 / 0	(None)
4482	CF1194F Crossword Expert combinatorics dp number theory probabilities two pointers *2400	0 / 0	(None)
4431	CF1202E You Are Given Some Strings... brute force string suffix structures strings *2400	0 / 0	(None)
4410	CF1205C Palindromic Paths implementation interactive *2400	0 / 0	(None)
4373	CF1210D Konrad and Company Evaluation graphs *2400	0 / 0	(None)
4316	CF1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	(None)
4293	CF1221F Choose a Square binary search data structures sortings *2400	0 / 0	(None)
4266	CF1227F2 Wrong Answer on test 233 (Hard Version) combinatorics math *2400	0 / 0	(None)
4233	CF1237E Balanced Binary Search Trees dp math *2400	0 / 0	(None)
4218	CF1239D Catowice City 2-sat dfs and similar graph matchings graphs *2400	0 / 0	(None)
4211	CF1242C Sum Balance bitmasks dfs and similar dp graphs *2400	0 / 0	(None)
4198	CF1244G Running in Pairs constructive algorithms greedy math *2400	0 / 0	(None)
4154	CF1251E2 Voting (Hard Version) binary search data structures greedy *2400	0 / 0	(None)
4147	CF1252F Regular Forestation hashing trees *2400	0 / 0	(None)
4110	CF1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(None)
4104	CF1260E Tournament brute force dp greedy *2400	0 / 0	(None)
4095	CF1263F Economic Difficulties data structures dfs and similar dp flows graphs trees *2400	0 / 0	(None)
4092	CF1264C Beautiful Mirrors with queries data structures probabilities *2400	0 / 0	(None)
3992	CF1282E The Cake Is a Lie constructive algorithms data structures dfs and similar graphs *2400	0 / 0	(None)
3966	CF1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	(None)
3950	CF1290C Prefix Enlightenment dfs and similar dsu graphs *2400	0 / 0	(None)
3863	CF1304F2 Animal Observation (hard version) data structures dp greedy *2400	0 / 0	(None)
3771	CF1326E Bombs data structures two pointers *2400	0 / 0	(None)
3750	CF1329C Drazil Likes Heap constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
3722	CF1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	(None)
3685	CF1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	(None)
3666	CF1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
3642	CF1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	(None)
3560	CF1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
3497	CF1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
3482	CF1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(None)
3474	CF1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
3452	CF1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(None)
3443	CF1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
3358	CF1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	(None)
3303	CF1401E Divide Square data structures geometry implementation sortings *2400	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)
3270	CF1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	(None)
3223	CF1418E Expected Damage binary search combinatorics probabilities *2400	0 / 0	(None)
3183	CF1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	(None)
3145	CF1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(None)
3109	CF1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	(None)
3082	CF1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	(None)
3073	CF1443E Long Permutation brute force math two pointers *2400	0 / 0	(None)
3048	CF1450F The Struggling Contestant constructive algorithms greedy *2400	0 / 0	(None)
3010	CF1455E Four Points brute force constructive algorithms flows geometry greedy implementation math ternary search *2400	0 / 0	(None)
2978	CF1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	(None)
2939	CF1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	(None)
2916	CF1473E Minimum Path graphs shortest paths *2400	0 / 0	(None)
2860	CF1482F Useful Edges graphs shortest paths *2400	0 / 0	(None)
2850	CF1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	(None)
2810	CF1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	(None)
2788	CF1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	(None)
2759	CF1499E Chaotic Merge combinatorics dp math strings *2400	0 / 0	(None)
2757	CF1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	(None)
2620	CF1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	(None)
2603	CF1526E Oolimry and Suffix Array combinatorics constructive algorithms math *2400	0 / 0	(None)
2596	CF1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	(None)
2498	CF1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	(None)
2306	CF1575M Managing Telephone Poles data structures geometry *2400	0 / 0	(None)
2291	CF1578L Labyrinth binary search dsu greedy *2400	0 / 0	(None)
2264	CF1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	(None)
2241	CF1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	(None)
2240	CF1585F Non-equal Neighbours combinatorics dp math *2400	0 / 0	(None)
2231	CF1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	(None)
2212	CF1594F Ideal Farm constructive algorithms math *2400	0 / 0	(None)
2206	CF1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	(None)
2166	CF1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	(None)
2161	CF1606D Red-Blue Matrix brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
2145	CF1608D Dominoes combinatorics fft graphs math number theory *2400	0 / 0	(None)
2137	CF1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	(None)
2088	CF1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(None)
2070	CF1617D2 Too Many Impostors (hard version) constructive algorithms implementation interactive math *2400	0 / 0	(None)
2052	CF1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(None)
2044	CF1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	(None)
2003	CF1626E Black and White Tree dfs and similar greedy trees *2400	0 / 0	(None)
1989	CF1628D2 Game on Sum (Hard Version) combinatorics dp games math *2400	0 / 0	(None)
1981	CF1630D Flipping Range constructive algorithms dp greedy number theory *2400	0 / 0	(None)
1971	CF1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	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)
1956	CF1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	(None)
1934	CF1638E Colorful Operations brute force data structures implementation *2400	0 / 0	(None)
1767	CF1667C Half Queen Cover constructive algorithms math *2400	0 / 0	(None)
1745	CF1670F Jee, You See? bitmasks combinatorics dp *2400	0 / 0	(None)
1721	CF1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	(None)
1681	CF1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	(None)
1675	CF1680D Dog Walking brute force greedy math *2400	0 / 0	(None)
1573	CF1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	(None)
1506	CF1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	(None)
1501	CF1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	(None)
1490	CF1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	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