sortings - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4307	CF1220A Cards implementation sortings strings *800	0 / 0	(None)
4293	CF1221F Choose a Square binary search data structures sortings *2400	0 / 0	(None)
4286	CF1223E Paint the Tree dp sortings trees *2100	0 / 0	(None)
4238	CF1237B Balanced Tunnel data structures sortings two pointers *1300	0 / 0	(None)
4236	CF1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	(None)
4228	CF1238B Kill 'Em All greedy sortings *1300	0 / 0	(None)
4222	CF1238G Adilbek and the Watering System data structures greedy sortings *2700	0 / 0	(None)
4212	CF1242B 0-1 MST dfs and similar dsu graphs sortings *1900	0 / 0	(None)
4200	CF1244E Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers *2000	0 / 0	(None)
4187	CF1248B Grow The Tree greedy math sortings *900	0 / 0	(None)
4178	CF1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	(None)
4156	CF1251D Salary Changing binary search greedy sortings *1900	0 / 0	(None)
4137	CF1253C Sweets Eating dp greedy math sortings *1500	0 / 0	(None)
4136	CF1253D Harmonious Graph constructive algorithms dfs and similar dsu graphs greedy sortings *1700	0 / 0	(None)
4134	CF1253E Antenna Coverage data structures dp greedy sortings *2200	0 / 0	(None)
4118	CF1256E Yet Another Division Into Teams dp greedy sortings *2000	0 / 0	(None)
4117	CF1256F Equalizing Two Strings constructive algorithms sortings strings *2000	0 / 0	(None)
4114	CF1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	(None)
4112	CF1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	(None)
4105	CF1260D A Game with Traps binary search dp greedy sortings *1900	0 / 0	(None)
4064	CF1267I Intriguing Selection brute force constructive algorithms implementation interactive sortings *2600	0 / 0	(None)
4053	CF1269B Modulo Equality brute force sortings *1500	0 / 0	(None)
4049	CF1270D Strange Device constructive algorithms interactive math sortings *1900	0 / 0	(None)
4039	CF1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	(None)
4036	CF1272A Three Friends brute force greedy math sortings *900	0 / 0	(None)
3996	CF1282B1 K for the Price of One (Easy Version) dp greedy sortings *1400	0 / 0	(None)
3995	CF1282B2 K for the Price of One (Hard Version) dp greedy sortings *1600	0 / 0	(None)
3994	CF1282C Petya and Exam greedy sortings two pointers *1800	0 / 0	(None)
3983	CF1284B New Year and Ascent Sequence binary search combinatorics data structures dp implementation sortings *1400	0 / 0	(None)
3981	CF1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	(None)
3979	CF1284E New Year and Castle Construction combinatorics geometry math sortings *2500	0 / 0	(None)
3972	CF1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
3970	CF1286A Garland dp greedy sortings *1800	0 / 0	(None)
3932	CF1294B Collecting Packages implementation sortings *1200	0 / 0	(None)
3917	CF1296D Fight with Monsters greedy sortings *1500	0 / 0	(None)
3916	CF1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	(None)
3914	CF1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	(None)
3911	CF1297B Cartoons *special problem implementation sortings	0 / 0	(None)
3909	CF1297D Bonus Distribution *special problem binary search greedy sortings	0 / 0	(None)
3907	CF1297F Movie Fan *special problem data structures greedy implementation sortings	0 / 0	(None)
3896	CF1300B Assigning to Classes greedy implementation sortings *1000	0 / 0	(None)
3867	CF1304C Air Conditioner dp greedy implementation sortings two pointers *1500	0 / 0	(None)
3862	CF1305A Kuroni and the Gifts brute force constructive algorithms greedy sortings *800	0 / 0	(None)
3849	CF1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	(None)
3844	CF1310A Recommendations data structures greedy sortings *1700	0 / 0	(None)
3837	CF1311B WeirdSort dfs and similar sortings *1200	0 / 0	(None)
3832	CF1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	(None)
3830	CF1312B Bogosort constructive algorithms sortings *1000	0 / 0	(None)
3812	CF1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 0	(None)
3809	CF1316E Team Building bitmasks dp greedy sortings *2300	0 / 0	(None)
3807	CF1320A Journey Planning data structures dp greedy math sortings *1400	0 / 0	(None)
3805	CF1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	(None)
3797	CF1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	(None)
3786	CF1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	(None)
3723	CF1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	(None)
3721	CF1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	(None)
3719	CF1334B Middle Class greedy sortings *1100	0 / 0	(None)
3710	CF1335C Two Teams Composing binary search greedy implementation sortings *1100	0 / 0	(None)
3705	CF1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	(None)
3704	CF1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	(None)
3688	CF1339B Sorted Adjacent Differences constructive algorithms sortings *1200	0 / 0	(None)
3675	CF1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	(None)
3667	CF1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	(None)
3665	CF1344A Hilbert's Hotel math number theory sortings *1600	0 / 0	(None)
3654	CF1346C Spring Cleaning special problem greedy sortings 1600	0 / 0	(None)
3645	CF1348B Phoenix and Beauty constructive algorithms data structures greedy sortings *1400	0 / 0	(None)
3644	CF1348C Phoenix and Distribution constructive algorithms greedy sortings strings *1600	0 / 0	(None)
3616	CF1353B Two Arrays And Swaps greedy sortings *800	0 / 0	(None)
3614	CF1353D Constructing the Array constructive algorithms data structures sortings *1600	0 / 0	(None)
3604	CF1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
3600	CF1355B Young Explorers dp greedy sortings *1200	0 / 0	(None)
3597	CF1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	(None)
3563	CF1358B Maria Breaks the Self-isolation greedy sortings *1000	0 / 0	(None)
3550	CF1360B Honest Coach greedy sortings *800	0 / 0	(None)
3549	CF1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	(None)
3542	CF1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(None)
3541	CF1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	(None)
3514	CF1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	(None)
3500	CF1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(None)
3497	CF1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
3484	CF1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(None)
3482	CF1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(None)
3467	CF1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(None)
3466	CF1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
3447	CF1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(None)
3445	CF1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	(None)
3444	CF1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(None)
3443	CF1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(None)
3439	CF1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(None)
3438	CF1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(None)
3430	CF1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
3429	CF1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(None)
3422	CF1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(None)
3414	CF1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(None)
3410	CF1381E Origami geometry math sortings *3300	0 / 0	(None)
3407	CF1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
3404	CF1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
3388	CF1386B Mixture special problem data structures geometry math sortings 2900	0 / 0	(None)
3377	CF1388E Uncle Bogdan and Projections data structures geometry sortings *2700	0 / 0	(None)
3371	CF1389F Bicolored Segments data structures dp graph matchings sortings *2600	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