Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2473	CF1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
2472	CF1548A Web of Lies brute force graphs greedy *1400	0 / 0	(None)
2471	CF1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
2470	CF1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(None)
2469	CF1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	(None)
2467	CF1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	(None)
2466	CF1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
2465	CF1549A Gregor and Cryptography math number theory *800	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)
2460	CF1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	(None)
2459	CF1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
2458	CF1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	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)
2452	CF1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	(None)
2451	CF1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	(None)
2450	CF1551E Fixed Points binary search brute force dp *2000	0 / 0	(None)
2449	CF1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
2448	CF1552A Subsequence Permutation sortings strings *800	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)
2444	CF1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
2443	CF1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	(None)
2442	CF1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(None)
2441	CF1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	(None)
2440	CF1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	(None)
2439	CF1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	(None)
2438	CF1553A Digits Sum math number theory *800	0 / 0	(None)
2437	CF1553B Reverse String brute force dp hashing implementation strings *1300	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)
2433	CF1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	(None)
2432	CF1553F Pairwise Modulo data structures math *2300	0 / 0	(None)
2431	CF1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	(None)
2430	CF1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(None)
2429	CF1553I Stairs combinatorics divide and conquer dp fft math *3400	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)
2423	CF1554E You dfs and similar dp math number theory *2600	0 / 0	(None)
2422	CF1555A PizzaForces brute force math *900	0 / 0	(None)
2421	CF1555B Two Tables brute force *1300	0 / 0	(None)
2420	CF1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	(None)
2419	CF1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	(None)
2418	CF1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	(None)
2417	CF1555F Good Graph data structures dsu graphs trees *2700	0 / 0	(None)
2416	CF1556A A Variety of Operations math *800	0 / 0	(None)
2415	CF1556B Take Your Places! implementation *1300	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)
2410	CF1556E Equilibrium data structures dp greedy *2200	0 / 0	(None)
2409	CF1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(None)
2408	CF1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	(None)
2407	CF1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	(None)
2406	CF1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	(None)
2405	CF1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	(None)
2404	CF1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	(None)
2403	CF1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	(None)
2402	CF1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	(None)
2400	CF1558A Charmed by the Game brute force math *1300	0 / 0	(None)
2399	CF1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(None)
2398	CF1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	(None)
2397	CF1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	(None)
2396	CF1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(None)
2395	CF1558F Strange Sort data structures sortings *3300	0 / 0	(None)
2394	CF1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	(None)
2393	CF1559B Mocha and Red and Blue dp greedy *900	0 / 0	(None)
2392	CF1559C Mocha and Hiking constructive algorithms graphs *1200	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)
2388	CF1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(None)
2387	CF1560A Dislike of Threes implementation *800	0 / 0	(None)
2386	CF1560B Who's Opposite? math *800	0 / 0	(None)
2385	CF1560C Infinity Table implementation math *800	0 / 0	(None)
2384	CF1560D Make a Power of Two greedy math strings *1300	0 / 0	(None)
2383	CF1560E Polycarp and String Transformation binary search implementation sortings strings *1800	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)
2380	CF1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	(None)
2378	CF1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(None)
2377	CF1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(None)
2376	CF1562A The Miracle and the Sleeper greedy math *800	0 / 0	(None)
2375	CF1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	(None)
2374	CF1562C Rings constructive algorithms math *1500	0 / 0	(None)
2373	CF1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	(None)
2372	CF1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	(None)
2371	CF1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(None)
2370	CF1562F Tubular Bells interactive math number theory probabilities *2900	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)

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