Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
3124	CF1848C Vika and Price Tags math number theory *1800	0 / 0	(None)
3113	CF1848D Vika and Bonuses binary search brute force math ternary search *2200	0 / 0	(None)
3102	CF1848E Vika and Stone Skipping brute force implementation math number theory *2600	0 / 0	(None)
3091	CF1848F Vika and Wiki binary search bitmasks combinatorics divide and conquer dp math *2400	0 / 0	(None)
3080	CF1849A Morning Sandwich implementation math *800	0 / 0	(None)
3068	CF1849B Monsters greedy math sortings *1000	0 / 0	(None)
3057	CF1849C Binary String Copying binary search brute force data structures hashing strings *1600	0 / 0	(None)
3046	CF1849D Array Painting constructive algorithms greedy two pointers *1700	0 / 0	(None)
3035	CF1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers *2300	0 / 0	(None)
3024	CF1849F XOR Partition binary search bitmasks data structures divide and conquer greedy trees *2700	0 / 0	(None)
3013	CF1850A To My Critics implementation sortings *800	0 / 0	(None)
3002	CF1850B Ten Words of Wisdom implementation sortings *800	0 / 0	(None)
2991	CF1850C Word on the Paper implementation strings *800	0 / 0	(None)
2980	CF1850D Balanced Round brute force greedy implementation sortings *900	0 / 0	(None)
2969	CF1850E Cardboard for Pictures binary search geometry implementation math *1100	0 / 0	(None)
2957	CF1850F We Were Both Children brute force implementation math number theory *1300	0 / 0	(None)
2946	CF1850G The Morning Star combinatorics data structures geometry implementation math sortings *1500	0 / 0	(None)
2935	CF1850H The Third Letter dfs and similar dsu graphs greedy implementation *1700	0 / 0	(None)
2924	CF1851A Escalator Conversations brute force constructive algorithms math *800	0 / 0	(None)
2913	CF1851B Parity Sort greedy sortings two pointers *800	0 / 0	(None)
2902	CF1851C Tiles Comeback greedy *1000	0 / 0	(None)
2891	CF1851D Prefix Permutation Sums implementation math *1300	0 / 0	(None)
2880	CF1851E Nastya and Potions dfs and similar dp graphs sortings *1500	0 / 0	(None)
2869	CF1851F Lisa and the Martians bitmasks greedy math strings trees *1800	0 / 0	(None)
2858	CF1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers *2000	0 / 0	(None)
2846	CF1852A Ntarsis' Set binary search math number theory *1800	0 / 0	(None)
2835	CF1852B Imbalanced Arrays constructive algorithms graphs greedy math sortings two pointers *1800	0 / 0	(None)
2824	CF1852C Ina of the Mountain data structures dp greedy math *2400	0 / 0	(None)
2813	CF1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	(None)
2802	CF1852E Rivalries constructive algorithms data structures greedy *3400	0 / 0	(None)
2791	CF1852F Panda Meetups data structures dp flows *3500	0 / 0	(None)
2780	CF1853A Desorting brute force greedy math *800	0 / 0	(None)
2769	CF1853B Fibonaccharsis binary search brute force math *1200	0 / 0	(None)
2758	CF1854A1 Dual (Easy Version) constructive algorithms math *1400	0 / 0	(None)
2747	CF1854A2 Dual (Hard Version) constructive algorithms math *1900	0 / 0	(None)
2735	CF1854B Earn or Unlock bitmasks brute force dp *2200	0 / 0	(None)
2724	CF1854C Expected Destruction combinatorics dp math probabilities *2500	0 / 0	(None)
2713	CF1854D Michael and Hotel binary search interactive trees *3000	0 / 0	(None)
2702	CF1854E Game Bundles brute force constructive algorithms dp greedy math *3000	0 / 0	(None)
2691	CF1854F Mark and Spaceship brute force dp *3500	0 / 0	(None)
2680	CF1855A Dalton the Teacher greedy math *800	0 / 0	(None)
2669	CF1855B Longest Divisors Interval brute force combinatorics greedy math number theory *900	0 / 0	(None)
2658	CF1856A Tales of a Sort implementation *800	0 / 0	(None)
2647	CF1856B Good Arrays implementation math *900	0 / 0	(None)
2636	CF1856C To Become Max binary search brute force data structures dp *1600	0 / 0	(None)
2624	CF1856D More Wrong divide and conquer interactive *2100	0 / 0	(None)
2613	CF1856E1 PermuTree (easy version) dfs and similar dp trees *1800	0 / 0	(None)
2602	CF1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	(None)
2591	CF1857A Array Coloring greedy math *800	0 / 0	(None)
2580	CF1857B Maximum Rounding greedy implementation math *1100	0 / 0	(None)
2569	CF1857C Assembly via Minimums greedy sortings *1200	0 / 0	(None)
2558	CF1857D Strong Vertices math sortings trees *1300	0 / 0	(None)
2547	CF1857E Power of Points math sortings *1500	0 / 0	(None)
2536	CF1857F Sum and Product binary search data structures math *1600	0 / 0	(None)
2525	CF1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	(None)
2512	CF1858A Buttons games greedy math *800	0 / 0	(None)
2501	CF1858B The Walkway brute force dp greedy math number theory *1500	0 / 0	(None)
2490	CF1858C Yet Another Permutation Problem constructive algorithms greedy math number theory *1000	0 / 0	(None)
2479	CF1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	(None)
2468	CF1858E1 Rollbacks (Easy Version) brute force data structures dfs and similar trees *2500	0 / 0	(None)
2457	CF1858E2 Rollbacks (Hard Version) data structures interactive trees *2600	0 / 0	(None)
2446	CF1859A United We Stand constructive algorithms math number theory *800	0 / 0	(None)
2435	CF1859B Olya and Game with Arrays constructive algorithms greedy math sortings *1000	0 / 0	(None)
2424	CF1859C Another Permutation Problem brute force dp greedy math *1200	0 / 0	(None)
2413	CF1859D Andrey and Escape from Capygrad binary search data structures dp dsu greedy sortings *1800	0 / 0	(None)
2401	CF1859E Maximum Monogonosity brute force dp math *2500	0 / 0	(None)
2390	CF1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	(None)
2379	CF1860A Not a Substring constructive algorithms strings *900	0 / 0	(None)
2368	CF1860B Fancy Coins binary search brute force greedy math *1200	0 / 0	(None)
2357	CF1860C Game on Permutation data structures dp games greedy *1400	0 / 0	(None)
2346	CF1860D Balanced String dp *2200	0 / 0	(None)
2335	CF1860E Fast Travel Text Editor data structures dfs and similar graphs shortest paths *2400	0 / 0	(None)
2324	CF1860F Evaluate RBS data structures geometry implementation math sortings *2900	0 / 0	(None)
2313	CF1861A Prime Deletion constructive algorithms math *800	0 / 0	(None)
2302	CF1861B Two Binary Strings constructive algorithms dp greedy *1000	0 / 0	(None)
2290	CF1861C Queries for the Array data structures dfs and similar implementation strings trees *1600	0 / 0	(None)
2279	CF1861D Sorting By Multiplication dp greedy *1800	0 / 0	(None)
2268	CF1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	(None)
2257	CF1861F Four Suits binary search bitmasks flows greedy *3200	0 / 0	(None)
2246	CF1862A Gift Carpet dp greedy implementation strings *800	0 / 0	(None)
2235	CF1862B Sequence Game constructive algorithms *800	0 / 0	(None)
2224	CF1862C Flower City Fence binary search data structures implementation sortings *1100	0 / 0	(None)
2213	CF1862D Ice Cream Balls binary search combinatorics constructive algorithms math *1300	0 / 0	(None)
2202	CF1862E Kolya and Movie Theatre constructive algorithms data structures greedy *1600	0 / 0	(None)
2191	CF1862F Magic Will Save the World binary search bitmasks brute force dp *1800	0 / 0	(None)
2179	CF1862G The Great Equalizer binary search data structures math sortings *2000	0 / 0	(None)
2168	CF1863A Channel greedy implementation *800	0 / 0	(None)
2157	CF1863B Split Sort greedy math sortings *1100	0 / 0	(None)
2146	CF1863C MEX Repetition implementation math *1100	0 / 0	(None)
2135	CF1863D Two-Colored Dominoes constructive algorithms greedy *1400	0 / 0	(None)
2124	CF1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	(None)
2113	CF1863F Divide, XOR, and Conquer bitmasks dp math *2600	0 / 0	(None)
2102	CF1863G Swaps combinatorics dp graphs math *2800	0 / 0	(None)
2091	CF1863H Goldberg Machine 3 dp trees *3500	0 / 0	(None)
2080	CF1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	(None)
2068	CF1864A Increasing and Decreasing constructive algorithms greedy implementation math *800	0 / 0	(None)
2057	CF1864B Swap and Reverse constructive algorithms greedy sortings strings *1100	0 / 0	(None)
2046	CF1864C Divisor Chain bitmasks constructive algorithms math number theory *1300	0 / 0	(None)
2035	CF1864D Matrix Cascade brute force constructive algorithms data structures dp greedy math *1700	0 / 0	(None)
2024	CF1864E Guess Game bitmasks data structures games math probabilities sortings strings 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