greedy - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2495	CF1543B Customising the Track combinatorics greedy math *900	0 / 0	(None)
2491	CF1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(None)
2482	CF1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(None)
2478	CF1547B Alphabetical Strings greedy implementation strings *800	0 / 0	(None)
2477	CF1547C Pair Programming greedy two pointers *1100	0 / 0	(None)
2476	CF1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	(None)
2472	CF1548A Web of Lies brute force graphs greedy *1400	0 / 0	(None)
2466	CF1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
2464	CF1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
2463	CF1550A Find The Array greedy math *800	0 / 0	(None)
2462	CF1550B Maximum Cost Deletion greedy math *1000	0 / 0	(None)
2461	CF1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(None)
2456	CF1551A Polycarp and Coins greedy math *800	0 / 0	(None)
2455	CF1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	(None)
2454	CF1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(None)
2453	CF1551C Interesting Story greedy sortings strings *1500	0 / 0	(None)
2447	CF1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	(None)
2445	CF1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(None)
2443	CF1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	(None)
2436	CF1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	(None)
2434	CF1553D Backspace dp greedy strings two pointers *1500	0 / 0	(None)
2428	CF1554A Cherry greedy *800	0 / 0	(None)
2427	CF1554B Cobb bitmasks brute force greedy math *1700	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)
2410	CF1556E Equilibrium data structures dp greedy *2200	0 / 0	(None)
2407	CF1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	(None)
2405	CF1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	(None)
2403	CF1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	(None)
2398	CF1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	(None)
2396	CF1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
2393	CF1559B Mocha and Red and Blue dp greedy *900	0 / 0	(None)
2391	CF1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(None)
2389	CF1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(None)
2384	CF1560D Make a Power of Two greedy math strings *1300	0 / 0	(None)
2382	CF1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
2381	CF1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
2378	CF1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(None)
2376	CF1562A The Miracle and the Sleeper greedy math *800	0 / 0	(None)
2371	CF1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(None)
2369	CF1566A Median Maximization binary search greedy math *800	0 / 0	(None)
2367	CF1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	(None)
2366	CF1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	(None)
2365	CF1566D1 Seating Arrangements (easy version) data structures greedy sortings *1100	0 / 0	(None)
2364	CF1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	(None)
2363	CF1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(None)
2362	CF1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	(None)
2361	CF1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(None)
2358	CF1567B MEXor Mixup bitmasks greedy *1000	0 / 0	(None)
2355	CF1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	(None)
2341	CF1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
2333	CF1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(None)
2332	CF1572C Paint dp greedy *2700	0 / 0	(None)
2331	CF1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	(None)
2328	CF1573A Countdown greedy *800	0 / 0	(None)
2327	CF1573B Swaps greedy math sortings *1400	0 / 0	(None)
2325	CF1574B Combinatorics Homework combinatorics greedy math *1100	0 / 0	(None)
2323	CF1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	(None)
2322	CF1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(None)
2291	CF1578L Labyrinth binary search dsu greedy *2400	0 / 0	(None)
2286	CF1579C Ticks greedy implementation *1500	0 / 0	(None)
2285	CF1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	(None)
2284	CF1579E1 Permutation Minimization by Deque constructive algorithms greedy math *1000	0 / 0	(None)
2283	CF1579E2 Array Optimization by Deque data structures greedy *1700	0 / 0	(None)
2280	CF1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	(None)
2276	CF1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
2272	CF1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	(None)
2269	CF1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	(None)
2266	CF1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	(None)
2265	CF1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	(None)
2264	CF1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	(None)
2259	CF1583D Omkar and the Meaning of Life constructive algorithms greedy interactive *1800	0 / 0	(None)
2258	CF1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	(None)
2252	CF1584B Coloring Rectangles greedy math *1000	0 / 0	(None)
2251	CF1584C Two Arrays greedy math sortings *900	0 / 0	(None)
2249	CF1584E Game with Stones binary search data structures games greedy *2300	0 / 0	(None)
2248	CF1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(None)
2244	CF1585B Array Eversion greedy *900	0 / 0	(None)
2243	CF1585C Minimize Distance greedy *1300	0 / 0	(None)
2236	CF1592A Gamer Hemose binary search greedy math sortings *800	0 / 0	(None)
2231	CF1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	(None)
2230	CF1592F1 Alice and Recoloring 1 constructive algorithms greedy *2600	0 / 0	(None)
2229	CF1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	(None)
2227	CF1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	(None)
2226	CF1593C Save More Mice binary search greedy greedy *1000	0 / 0	(None)
2222	CF1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	(None)
2220	CF1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	(None)
2217	CF1594C Make Them Equal brute force greedy math strings *1200	0 / 0	(None)
2204	CF1599A Weights constructive algorithms greedy two pointers *2600	0 / 0	(None)
2194	CF1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	(None)
2193	CF1600E Array Game games greedy two pointers *1900	0 / 0	(None)
2188	CF1601A Array Elimination bitmasks greedy math number theory *1300	0 / 0	(None)
2186	CF1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
2185	CF1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	(None)
2184	CF1601E Phys Ed Online data structures dp greedy *2900	0 / 0	(None)
2177	CF1603C Extreme Extension dp greedy math number theory *2300	0 / 0	(None)
2173	CF1604A Era greedy *800	0 / 0	(None)
2170	CF1605B Reverse Sort greedy sortings *1000	0 / 0	(None)
2169	CF1605C Dominant Character brute force greedy implementation strings *1400	0 / 0	(None)
2167	CF1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	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