Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2585	CF1530A Binary Decimal greedy math *800	0 / 0	(None)
2584	CF1530B Putting Plates constructive algorithms implementation *800	0 / 0	(None)
2583	CF1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	(None)
2582	CF1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	(None)
2581	CF1530E Minimax constructive algorithms greedy strings *2100	0 / 0	(None)
2579	CF1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	(None)
2578	CF1530G What a Reversal constructive algorithms *3300	0 / 0	(None)
2577	CF1530H Turing's Award data structures dp *3400	0 / 0	(None)
2576	CF1532A A+B (Trial Problem) *special problem	0 / 0	(None)
2575	CF1532B Frog Jumping *special problem math	0 / 0	(None)
2574	CF1532C Uniform String *special problem implementation	0 / 0	(None)
2573	CF1532D Teams Forming *special problem sortings	0 / 0	(None)
2572	CF1532E Good Array *special problem	0 / 0	(None)
2571	CF1532F Prefixes and Suffixes *special problem strings	0 / 0	(None)
2570	CF1533A Travel to Bertown *special problem implementation math	0 / 0	(None)
2568	CF1533B Nearest Point Function *special problem implementation	0 / 0	(None)
2567	CF1533C Sweets *special problem data structures implementation	0 / 0	(None)
2566	CF1533D String Searching *special problem hashing	0 / 0	(None)
2565	CF1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)
2564	CF1533F Binary String Partition *special problem binary search greedy	0 / 0	(None)
2563	CF1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
2562	CF1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(None)
2561	CF1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
2560	CF1533J Pawns *special problem	0 / 0	(None)
2559	CF1534A Colour the Flag brute force implementation *800	0 / 0	(None)
2557	CF1534B Histogram Ugliness greedy implementation math *1100	0 / 0	(None)
2556	CF1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	(None)
2555	CF1534D Lost Tree constructive algorithms interactive trees *1800	0 / 0	(None)
2554	CF1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	(None)
2553	CF1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	(None)
2552	CF1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	(None)
2551	CF1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	(None)
2550	CF1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	(None)
2549	CF1535A Fair Playoff brute force implementation *800	0 / 0	(None)
2548	CF1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	(None)
2546	CF1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	(None)
2545	CF1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	(None)
2544	CF1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	(None)
2543	CF1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	(None)
2542	CF1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	(None)
2541	CF1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	(None)
2540	CF1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	(None)
2539	CF1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	(None)
2538	CF1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	(None)
2537	CF1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	(None)
2535	CF1537A Arithmetic Array greedy math *800	0 / 0	(None)
2534	CF1537B Bad Boy constructive algorithms greedy math *900	0 / 0	(None)
2533	CF1537C Challenging Cliffs constructive algorithms greedy implementation math *1200	0 / 0	(None)
2532	CF1537D Deleting Divisors games math number theory *1700	0 / 0	(None)
2531	CF1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	(None)
2530	CF1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	(None)
2529	CF1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(None)
2528	CF1538A Stone Game brute force dp greedy *800	0 / 0	(None)
2527	CF1538B Friends and Candies greedy math *800	0 / 0	(None)
2526	CF1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	(None)
2522	CF1538D Another Problem About Dividing Numbers constructive algorithms math number theory *1700	0 / 0	(None)
2521	CF1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	(None)
2520	CF1538F Interesting Function binary search dp math number theory *1500	0 / 0	(None)
2519	CF1538G Gift Set binary search greedy math ternary search *2100	0 / 0	(None)
2518	CF1539A Contest Start combinatorics geometry greedy math *1000	0 / 0	(None)
2517	CF1539B Love Song dp implementation strings *800	0 / 0	(None)
2516	CF1539C Stable Groups greedy sortings *1200	0 / 0	(None)
2515	CF1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	(None)
2514	CF1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(None)
2513	CF1539F Strange Array data structures greedy sortings *2600	0 / 0	(None)
2511	CF1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	(None)
2510	CF1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(None)
2509	CF1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	(None)
2508	CF1540C2 Converging Array (Hard Version) dp math *2900	0 / 0	(None)
2507	CF1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	(None)
2506	CF1540E Tasty Dishes math matrices *3500	0 / 0	(None)
2505	CF1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	(None)
2504	CF1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	(None)
2503	CF1542A Odd Set math *800	0 / 0	(None)
2502	CF1542B Plus and Multiply constructive algorithms math number theory *1500	0 / 0	(None)
2500	CF1542C Strange Function math number theory *1600	0 / 0	(None)
2499	CF1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	(None)
2498	CF1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	(None)
2497	CF1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	(None)
2496	CF1543A Exciting Bets greedy math number theory *900	0 / 0	(None)
2495	CF1543B Customising the Track combinatorics greedy math *900	0 / 0	(None)
2494	CF1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(None)
2493	CF1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	(None)
2492	CF1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	(None)
2491	CF1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(None)
2489	CF1545A AquaMoon and Strange Sort sortings *1500	0 / 0	(None)
2488	CF1545B AquaMoon and Chess combinatorics math *1900	0 / 0	(None)
2487	CF1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(None)
2486	CF1545D AquaMoon and Wrong Coordinate constructive algorithms interactive math *3000	0 / 0	(None)
2485	CF1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	(None)
2484	CF1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	(None)
2483	CF1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	(None)
2482	CF1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(None)
2481	CF1546B AquaMoon and Stolen String interactive math *1200	0 / 0	(None)
2480	CF1547A Shortest Path with Obstacle implementation math *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)
2475	CF1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(None)
2474	CF1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	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