sortings - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3351	CF1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	(None)
3347	CF1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(None)
3343	CF1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(None)
3334	CF1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	(None)
3331	CF1397B Power Sequence brute force math number theory sortings *1500	0 / 0	(None)
3329	CF1398B Substring Removal Game games greedy sortings *800	0 / 0	(None)
3327	CF1398D Colored Rectangles dp greedy sortings *1800	0 / 0	(None)
3326	CF1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	(None)
3322	CF1399A Remove Smallest greedy sortings *800	0 / 0	(None)
3317	CF1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(None)
3316	CF1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(None)
3305	CF1401C Mere Array constructive algorithms math number theory sortings *1300	0 / 0	(None)
3304	CF1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(None)
3303	CF1401E Divide Square data structures geometry implementation sortings *2400	0 / 0	(None)
3299	CF1402A Fancy Fence special problem data structures dsu implementation math sortings 1800	0 / 0	(None)
3298	CF1402B Roads special problem geometry sortings 2900	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)
3284	CF1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	(None)
3271	CF1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(None)
3270	CF1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	(None)
3260	CF1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(None)
3248	CF1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(None)
3234	CF1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(None)
3229	CF1417B Two Arrays greedy math sortings *1100	0 / 0	(None)
3227	CF1418B Negative Prefixes greedy sortings *1300	0 / 0	(None)
3217	CF1419D1 Sage's Birthday (easy version) binary search constructive algorithms greedy sortings *1000	0 / 0	(None)
3216	CF1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	(None)
3212	CF1420A Cubes Sorting math sortings *900	0 / 0	(None)
3208	CF1420D Rescue Nibel! combinatorics data structures sortings *1800	0 / 0	(None)
3197	CF1422D Returning Home graphs shortest paths sortings *2300	0 / 0	(None)
3177	CF1424G Years data structures sortings *1300	0 / 0	(None)
3176	CF1424M Ancient Language graphs sortings *2200	0 / 0	(None)
3163	CF1426D Non-zero Segments constructive algorithms data structures greedy sortings *1500	0 / 0	(None)
3160	CF1427A Avoiding Zero math sortings *900	0 / 0	(None)
3159	CF1427B Chess Cheater greedy implementation sortings *1400	0 / 0	(None)
3147	CF1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	(None)
3140	CF1430B Barrels greedy implementation sortings *800	0 / 0	(None)
3105	CF1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	(None)
3098	CF1438B Valerii Against Everyone constructive algorithms data structures greedy sortings *1000	0 / 0	(None)
3075	CF1443B Saving the City dp greedy math sortings *1300	0 / 0	(None)
3074	CF1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	(None)
3071	CF1444B Divide and Sum combinatorics math sortings *1900	0 / 0	(None)
3066	CF1445A Array Rearrangment greedy sortings *800	0 / 0	(None)
3064	CF1446A Knapsack constructive algorithms greedy sortings *1300	0 / 0	(None)
3054	CF1450A Avoid Trygub constructive algorithms sortings *800	0 / 0	(None)
3034	CF1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	(None)
3031	CF1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	(None)
3011	CF1455D Sequence and Swaps dp greedy sortings *1600	0 / 0	(None)
2994	CF1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	(None)
2986	CF1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	(None)
2985	CF1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	(None)
2978	CF1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	(None)
2972	CF1466D 13th Labour of Heracles data structures greedy sortings trees *1500	0 / 0	(None)
2970	CF1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	(None)
2955	CF1468D Firecrackers binary search sortings *1700	0 / 0	(None)
2937	CF1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	(None)
2925	CF1472D Even-Odd Game dp games greedy sortings *1200	0 / 0	(None)
2923	CF1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	(None)
2922	CF1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	(None)
2920	CF1473A Replacing Elements greedy implementation math sortings *800	0 / 0	(None)
2910	CF1474C Array Destruction brute force constructive algorithms data structures greedy implementation sortings *1700	0 / 0	(None)
2903	CF1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	(None)
2901	CF1475E Advertising Agency combinatorics math sortings *1600	0 / 0	(None)
2899	CF1475G Strange Beauty dp math number theory sortings *1900	0 / 0	(None)
2894	CF1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	(None)
2892	CF1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	(None)
2888	CF1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	(None)
2882	CF1478C Nezzar and Symmetric Array implementation math sortings *1700	0 / 0	(None)
2873	CF1480B The Great Hero greedy implementation sortings *900	0 / 0	(None)
2850	CF1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	(None)
2848	CF1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	(None)
2841	CF1487A Arena implementation sortings *800	0 / 0	(None)
2837	CF1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(None)
2817	CF1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	(None)
2796	CF1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	(None)
2789	CF1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(None)
2786	CF1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	(None)
2777	CF1497A Meximization brute force data structures greedy sortings *800	0 / 0	(None)
2765	CF1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	(None)
2752	CF1500D Tiles for Bathroom data structures sortings two pointers *2900	0 / 0	(None)
2748	CF1501B Napoleon Cake dp implementation sortings *900	0 / 0	(None)
2743	CF1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	(None)
2742	CF1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	(None)
2721	CF1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	(None)
2716	CF1508D Swap Pass constructive algorithms geometry sortings *3000	0 / 0	(None)
2715	CF1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	(None)
2678	CF1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	(None)
2677	CF1513E Cost Equilibrium combinatorics constructive algorithms math sortings *2300	0 / 0	(None)
2676	CF1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	(None)
2672	CF1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	(None)
2671	CF1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	(None)
2666	CF1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	(None)
2662	CF1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	(None)
2661	CF1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	(None)
2653	CF1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	(None)
2643	CF1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	(None)
2641	CF1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	(None)
2612	CF1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	(None)
2608	CF1526A Mean Inequality constructive algorithms sortings *800	0 / 0	(None)
2586	CF1529B Sifid and Strange Subsequences greedy math sortings *1100	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