*2800 - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3872	CF1303F Number of Components dsu implementation *2800	0 / 0	(None)
3842	CF1310C Au Pont Rouge binary search dp strings *2800	0 / 0	(None)
3808	CF1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	(None)
3795	CF1322D Reality Show bitmasks dp *2800	0 / 0	(None)
3760	CF1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	(None)
3513	CF1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	(None)
3465	CF1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(None)
3436	CF1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
3428	CF1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(None)
3426	CF1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(None)
3404	CF1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
3403	CF1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(None)
3387	CF1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(None)
3370	CF1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(None)
3349	CF1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(None)
3343	CF1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(None)
3309	CF1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(None)
3289	CF1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	(None)
3288	CF1404E Bricks flows graph matchings graphs *2800	0 / 0	(None)
3244	CF1413F Roads and Ramen data structures trees *2800	0 / 0	(None)
3214	CF1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	(None)
3180	CF1423M Milutin's Plums interactive *2800	0 / 0	(None)
3167	CF1425I Impressive Harvesting of The Orchard data structures *2800	0 / 0	(None)
3108	CF1436F Sum Over Subsets combinatorics math number theory *2800	0 / 0	(None)
3081	CF1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	(None)
3009	CF1455F String and Operations dp greedy *2800	0 / 0	(None)
2914	CF1473G Tiles combinatorics dp fft math *2800	0 / 0	(None)
2887	CF1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	(None)
2826	CF1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	(None)
2808	CF1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	(None)
2704	CF1510F Fiber Shape *2800	0 / 0	(None)
2609	CF1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	(None)
2487	CF1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(None)
2402	CF1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	(None)
2331	CF1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	(None)
2304	CF1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	(None)
2303	CF1578B Building Forest Trails data structures dsu *2800	0 / 0	(None)
2292	CF1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	(None)
2229	CF1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	(None)
2159	CF1606F Tree Queries brute force dp trees *2800	0 / 0	(None)
2144	CF1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	(None)
2136	CF1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(None)
2108	CF1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	(None)
2087	CF1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	(None)
2045	CF1620F Bipartite Array dp greedy *2800	0 / 0	(None)
2008	CF1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	(None)
2001	CF1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	(None)
1962	CF1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
1949	CF1635F Closest Pair data structures greedy *2800	0 / 0	(None)
1888	CF1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	(None)
1863	CF1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(None)
1731	CF1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	(None)
1652	CF1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	(None)
1646	CF1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	(None)
1598	CF1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(None)
1572	CF1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	(None)
1565	CF1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	(None)
1416	CF1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	(None)
10448	CF1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	(None)
10399	CF1732E Location data structures dp math number theory *2800	0 / 0	(None)
9757	CF1746F Kazaee data structures hashing probabilities *2800	0 / 0	(None)
9557	CF1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	(None)
8701	CF1765I Infinite Chess implementation shortest paths *2800	0 / 0	(None)
8579	CF1766F MCF flows *2800	0 / 0	(None)
8213	CF1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	(None)
7934	CF1776D Teamwork constructive algorithms greedy math *2800	0 / 0	(None)
7357	CF1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	(None)
5668	CF1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	(None)
5590	CF1809G Prediction combinatorics dp math *2800	0 / 0	(None)
5524	CF1810F M-tree data structures math sortings trees *2800	0 / 0	(None)
5013	CF1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	(None)
4590	CF1826F Fading into Fog geometry interactive math probabilities *2800	0 / 0	(None)
4535	CF1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	(None)
4357	CF1830D Mex Tree brute force dp trees *2800	0 / 0	(None)
3579	CF1842G Tenzing and Random Operations combinatorics dp math probabilities *2800	0 / 0	(None)
3401	CF1844F2 Min Cost Permutation (Hard Version) binary search constructive algorithms data structures greedy math sortings *2800	0 / 0	(None)
3313	CF1845F Swimmers in the Pool dp fft math number theory *2800	0 / 0	(None)
2813	CF1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	(None)
2102	CF1863G Swaps combinatorics dp graphs math *2800	0 / 0	(None)
1869	CF1866J Jackets and Packets dp *2800	0 / 0	(None)
7745	CF1879F Last Man Standing brute force data structures number theory *2800	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