*1800 - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4702	CF1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	(None)
4625	CF1172A Nauuo and Cards greedy implementation *1800	0 / 0	(None)
4597	CF1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	(None)
4593	CF1177B Digits Sequence (Hard Edition) binary search divide and conquer implementation *1800	0 / 0	(None)
4581	CF1179B Tolik and His Uncle constructive algorithms *1800	0 / 0	(None)
4526	CF1186C Vus the Cossack and Strings implementation math *1800	0 / 0	(None)
4518	CF1187C Vasya And Array constructive algorithms greedy implementation *1800	0 / 0	(None)
4502	CF1190B Tokitsukaze, CSL and Stone Game games *1800	0 / 0	(None)
4475	CF1195D2 Submarine in the Rybinsk Sea (hard edition) combinatorics math number theory *1800	0 / 0	(None)
4466	CF1196E Connected Component on a Chessboard constructive algorithms implementation *1800	0 / 0	(None)
4400	CF1207D Number Of Permutations combinatorics *1800	0 / 0	(None)
4394	CF1208C Magic Grid constructive algorithms *1800	0 / 0	(None)
4350	CF1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	(None)
4295	CF1221D Make The Fence Great Again dp *1800	0 / 0	(None)
4278	CF1225D Power Products hashing math number theory *1800	0 / 0	(None)
4270	CF1227D2 Optimal Subsequences (Hard Version) data structures greedy *1800	0 / 0	(None)
4201	CF1244D Paint the Tree brute force constructive algorithms dp graphs implementation trees *1800	0 / 0	(None)
4180	CF1249D1 Too Many Segments (easy version) greedy *1800	0 / 0	(None)
4178	CF1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	(None)
4174	CF1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	(None)
4165	CF1250J The Parade binary search greedy *1800	0 / 0	(None)
4144	CF1252H Twin Buildings greedy implementation *1800	0 / 0	(None)
4131	CF1254B1 Send Boxes to Alice (Easy Version) constructive algorithms greedy math number theory ternary search two pointers *1800	0 / 0	(None)
4063	CF1267J Just Arrange the Icons greedy implementation math *1800	0 / 0	(None)
4061	CF1267L Lexicography constructive algorithms strings *1800	0 / 0	(None)
4005	CF1280B Beingawesomeism implementation math *1800	0 / 0	(None)
3994	CF1282C Petya and Exam greedy sortings two pointers *1800	0 / 0	(None)
3987	CF1283D Christmas Trees graphs greedy shortest paths *1800	0 / 0	(None)
3986	CF1283E New Year Parties dp greedy *1800	0 / 0	(None)
3970	CF1286A Garland dp greedy sortings *1800	0 / 0	(None)
3967	CF1286B Numbers on Tree constructive algorithms data structures dfs and similar graphs greedy trees *1800	0 / 0	(None)
3951	CF1290B Irreducible Anagrams binary search constructive algorithms data structures strings two pointers *1800	0 / 0	(None)
3923	CF1295D Same GCDs math number theory *1800	0 / 0	(None)
3916	CF1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	(None)
3901	CF1299B Aerodynamic geometry *1800	0 / 0	(None)
3866	CF1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	(None)
3811	CF1316C Primitive Primes constructive algorithms math ternary search *1800	0 / 0	(None)
3784	CF1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(None)
3772	CF1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	(None)
3762	CF1327E Count The Blocks combinatorics dp math *1800	0 / 0	(None)
3755	CF1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	(None)
3752	CF1329A Dreamoon Likes Coloring constructive algorithms greedy implementation math *1800	0 / 0	(None)
3717	CF1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	(None)
3707	CF1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
3694	CF1338B Edge Weight Assignment bitmasks constructive algorithms dfs and similar greedy math trees *1800	0 / 0	(None)
3599	CF1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	(None)
3500	CF1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(None)
3415	CF1381B Unmerge dp *1800	0 / 0	(None)
3380	CF1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	(None)
3347	CF1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(None)
3337	CF1396B Stoned Game brute force constructive algorithms games greedy *1800	0 / 0	(None)
3327	CF1398D Colored Rectangles dp greedy sortings *1800	0 / 0	(None)
3304	CF1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(None)
3299	CF1402A Fancy Fence special problem data structures dsu implementation math sortings 1800	0 / 0	(None)
3260	CF1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(None)
3208	CF1420D Rescue Nibel! combinatorics data structures sortings *1800	0 / 0	(None)
3162	CF1426E Rock, Paper, Scissors brute force constructive algorithms flows greedy math *1800	0 / 0	(None)
3105	CF1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	(None)
3084	CF1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	(None)
3083	CF1442B Identify the Operations combinatorics data structures dsu greedy implementation *1800	0 / 0	(None)
3063	CF1446B Catching Cheaters dp strings *1800	0 / 0	(None)
3050	CF1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	(None)
2984	CF1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	(None)
2981	CF1463C Busy Robot implementation *1800	0 / 0	(None)
2971	CF1466E Apollo versus Pan bitmasks brute force math *1800	0 / 0	(None)
2949	CF1468J Road Reform dsu graphs greedy *1800	0 / 0	(None)
2903	CF1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	(None)
2890	CF1477A Nezzar and Board constructive algorithms math number theory *1800	0 / 0	(None)
2832	CF1488B RBS Deletion special problem greedy 1800	0 / 0	(None)
2811	CF1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	(None)
2755	CF1500A Going Home brute force hashing implementation math *1800	0 / 0	(None)
2733	CF1505D Xenolith? Hippodrome? special problem number theory 1800	0 / 0	(None)
2732	CF1505E Cakewalk special problem greedy implementation shortest paths 1800	0 / 0	(None)
2718	CF1508B Almost Sorted binary search combinatorics constructive algorithms implementation *1800	0 / 0	(None)
2710	CF1509C The Sports Festival dp greedy *1800	0 / 0	(None)
2651	CF1517D Explorer Space dp graphs shortest paths *1800	0 / 0	(None)
2611	CF1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	(None)
2555	CF1534D Lost Tree constructive algorithms interactive trees *1800	0 / 0	(None)
2545	CF1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(None)
2471	CF1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
2445	CF1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(None)
2444	CF1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
2426	CF1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	(None)
2425	CF1554D Diane constructive algorithms greedy strings *1800	0 / 0	(None)
2414	CF1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	(None)
2411	CF1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	(None)
2383	CF1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	(None)
2343	CF1571C Rhyme special problem implementation 1800	0 / 0	(None)
2342	CF1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	(None)
2334	CF1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
2316	CF1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(None)
2265	CF1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	(None)
2259	CF1583D Omkar and the Meaning of Life constructive algorithms greedy interactive *1800	0 / 0	(None)
2116	CF1611F ATM and Students binary search data structures two pointers *1800	0 / 0	(None)
2071	CF1617D1 Too Many Impostors (easy version) constructive algorithms implementation interactive *1800	0 / 0	(None)
2056	CF1619D New Year's Problem binary search greedy sortings *1800	0 / 0	(None)
2049	CF1620C BA-String brute force dp greedy implementation math *1800	0 / 0	(None)
1983	CF1630B Range and Partition binary search constructive algorithms data structures greedy two pointers *1800	0 / 0	(None)
1951	CF1635D Infinite Set bitmasks dp math matrices number theory strings *1800	0 / 0	(None)
1944	CF1637D Yet Another Minimization Problem dp greedy math *1800	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