dp - Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
1454	CF1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	(None)
1450	CF1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	(None)
1449	CF1716D Chip Move brute force dp math *2000	0 / 0	(None)
1448	CF1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	(None)
1446	CF1716F Bags with Balls combinatorics dp math number theory *2500	0 / 0	(None)
1439	CF1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	(None)
1438	CF1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	(None)
1424	CF1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	(None)
1423	CF1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	(None)
1417	CF1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	(None)
10460	CF1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	(None)
10452	CF1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	(None)
10447	CF1725J Journey dp trees *2500	0 / 0	(None)
10444	CF1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	(None)
10430	CF1728D Letter Picking constructive algorithms dp games two pointers *1800	0 / 0	(None)
10427	CF1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	(None)
10419	CF1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	(None)
10413	CF1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	(None)
10408	CF1731D Valiant's New Map binary search brute force data structures dp two pointers *1700	0 / 0	(None)
10407	CF1731E Graph Cost dp greedy math number theory *2000	0 / 0	(None)
10406	CF1731F Function Sum brute force combinatorics dp fft math *2500	0 / 0	(None)
10404	CF1732B Ugu brute force dp greedy implementation *900	0 / 0	(None)
10399	CF1732E Location data structures dp math number theory *2800	0 / 0	(None)
10393	CF1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	(None)
10392	CF1733E Conveyor constructive algorithms dp math *2700	0 / 0	(None)
10388	CF1734D Slime Escape data structures dp greedy two pointers *1800	0 / 0	(None)
10385	CF1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	(None)
10374	CF1736C2 Good Subarrays (Hard Version) binary search data structures dp two pointers *2400	0 / 0	(None)
10372	CF1736E Swap and Take dp greedy *2600	0 / 0	(None)
10368	CF1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	(None)
10367	CF1737E Ela Goes Hiking combinatorics dp math probabilities *2500	0 / 0	(None)
10361	CF1738C Even Number Addicts dp games greedy math *1500	0 / 0	(None)
10346	CF1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	(None)
10324	CF1738G Anti-Increasing Addicts constructive algorithms dp greedy math *2900	0 / 0	(None)
10278	CF1739C Card Game combinatorics constructive algorithms dp games *1500	0 / 0	(None)
10256	CF1739E Cleaning Robot bitmasks dp *2400	0 / 0	(None)
10245	CF1739F Keyboard Design bitmasks data structures dp string suffix structures strings *2600	0 / 0	(None)
10190	CF1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	(None)
10178	CF1740F Conditional Mix combinatorics dp math *2600	0 / 0	(None)
10145	CF1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	(None)
10090	CF1741E Sending a Sequence Over the Network dp *1600	0 / 0	(None)
10067	CF1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	(None)
9956	CF1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	(None)
9945	CF1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	(None)
9934	CF1743E FTL binary search dp *2400	0 / 0	(None)
9923	CF1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	(None)
9912	CF1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	(None)
9790	CF1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	(None)
9768	CF1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	(None)
9746	CF1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	(None)
9690	CF1747E List Generation combinatorics dp math *2900	0 / 0	(None)
9657	CF1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	(None)
9635	CF1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	(None)
9579	CF1749D Counting Arrays combinatorics dp math number theory *1900	0 / 0	(None)
9501	CF1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	(None)
9490	CF1750F Majority combinatorics dp math strings *2700	0 / 0	(None)
9479	CF1750G Doping combinatorics dp math *3300	0 / 0	(None)
9468	CF1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	(None)
9457	CF1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	(None)
9446	CF1753A2 Make Nonzero Sum (hard version) constructive algorithms dp greedy *1500	0 / 0	(None)
9424	CF1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	(None)
9246	CF1759E The Humanoid brute force dp sortings *1500	0 / 0	(None)
9079	CF1761F1 Anti-median (Easy Version) dp math *3100	0 / 0	(None)
9067	CF1761F2 Anti-median (Hard Version) combinatorics dp math *3500	0 / 0	(None)
8990	CF1762F Good Pairs binary search data structures dp *2600	0 / 0	(None)
8934	CF1763D Valid Bitonic Permutations combinatorics dp implementation math number theory *2200	0 / 0	(None)
8923	CF1763E Node Pairs dp graphs math number theory *2200	0 / 0	(None)
8912	CF1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	(None)
8868	CF1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	(None)
8857	CF1764E Doremy's Number Line dp greedy sortings *2400	0 / 0	(None)
8768	CF1765C Card Guessing combinatorics dp probabilities *2600	0 / 0	(None)
8734	CF1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	(None)
8612	CF1766C Hamiltonian Wall dp implementation *1300	0 / 0	(None)
8590	CF1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	(None)
8546	CF1767C Count Binary Strings data structures dp *2100	0 / 0	(None)
8535	CF1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	(None)
8524	CF1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	(None)
8446	CF1768F Wonderful Jump dp greedy *2900	0 / 0	(None)
8390	CF1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	(None)
8379	CF1770F Koxia and Sequence bitmasks combinatorics dp math number theory *3100	0 / 0	(None)
8335	CF1771B Hossam and Friends binary search constructive algorithms dp two pointers *1400	0 / 0	(None)
8313	CF1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	(None)
8302	CF1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	(None)
8213	CF1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	(None)
8157	CF1773L Lisa's Sequences dp *3500	0 / 0	(None)
8124	CF1774C Ice and Fire constructive algorithms dp greedy *1300	0 / 0	(None)
8102	CF1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	(None)
8067	CF1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	(None)
7979	CF1775F Laboratory on Pluto constructive algorithms dp greedy math *2500	0 / 0	(None)
7956	CF1776B Vittorio Plays with LEGO Bricks dp geometry *2200	0 / 0	(None)
7923	CF1776E Crossing the Railways data structures dp *3500	0 / 0	(None)
7857	CF1776K Uniform Chemistry dp math *3200	0 / 0	(None)
7834	CF1776M Parmigiana With Seafood binary search dp greedy trees *3000	0 / 0	(None)
7779	CF1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees *1900	0 / 0	(None)
7712	CF1778D Flexible String Revisit combinatorics dp math probabilities *2100	0 / 0	(None)
7690	CF1778F Maximizing Root dfs and similar dp graphs math number theory trees *2600	0 / 0	(None)
7646	CF1779D Boris and His Amazing Haircut constructive algorithms data structures dp dsu greedy sortings *1700	0 / 0	(None)
7623	CF1779F Xorcerer's Stones bitmasks constructive algorithms dp trees *2500	0 / 0	(None)
7546	CF1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	(None)
7468	CF1781F Bracket Insertion combinatorics dp math trees *2700	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