dp - Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
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)
2475	CF1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(None)
2473	CF1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
2470	CF1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(None)
2464	CF1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	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)
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)
2444	CF1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
2442	CF1552F Telepanting binary search data structures dp sortings *2200	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)
2429	CF1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(None)
2423	CF1554E You dfs and similar dp math number theory *2600	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)
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)
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)
2399	CF1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(None)
2393	CF1559B Mocha and Red and Blue dp greedy *900	0 / 0	(None)
2388	CF1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(None)
2381	CF1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
2377	CF1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(None)
2373	CF1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	(None)
2371	CF1562E Rescue Niwen! dp greedy string suffix structures strings *2500	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)
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)
2360	CF1566H Xor-quiz constructive algorithms dp interactive math number theory *3200	0 / 0	(None)
2356	CF1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	(None)
2347	CF1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(None)
2341	CF1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
2340	CF1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	(None)
2339	CF1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(None)
2334	CF1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(None)
2332	CF1572C Paint dp greedy *2700	0 / 0	(None)
2330	CF1572E Polygon binary search dp geometry *3000	0 / 0	(None)
2320	CF1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(None)
2316	CF1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(None)
2311	CF1575H Holiday Wall Ornaments dp strings *2200	0 / 0	(None)
2307	CF1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	(None)
2281	CF1579G Minimal Coverage dp *2200	0 / 0	(None)
2280	CF1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	(None)
2278	CF1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	(None)
2276	CF1580D Subsequence brute force divide and conquer dp greedy trees *2900	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)
2260	CF1583C Omkar and Determination data structures dp *1700	0 / 0	(None)
2248	CF1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(None)
2240	CF1585F Non-equal Neighbours combinatorics dp math *2400	0 / 0	(None)
2239	CF1585G Poachers dp games graphs trees *2500	0 / 0	(None)
2233	CF1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	(None)
2227	CF1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	(None)
2221	CF1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	(None)
2220	CF1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	(None)
2216	CF1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	(None)
2214	CF1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	(None)
2211	CF1598A Computer Game brute force dfs and similar dp implementation *800	0 / 0	(None)
2209	CF1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	(None)
2207	CF1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	(None)
2206	CF1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	(None)
2187	CF1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	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)
2176	CF1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(None)
2175	CF1603E A Perfect Problem combinatorics dp math *3200	0 / 0	(None)
2174	CF1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	(None)
2165	CF1605F PalindORme combinatorics dp *2900	0 / 0	(None)
2160	CF1606E Arena combinatorics dp math *2100	0 / 0	(None)
2159	CF1606F Tree Queries brute force dp trees *2800	0 / 0	(None)
2147	CF1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	(None)
2143	CF1608F MEX counting combinatorics dp implementation *3200	0 / 0	(None)
2139	CF1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	(None)
2137	CF1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	(None)
2129	CF1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	(None)
2117	CF1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	(None)
2109	CF1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	(None)
2108	CF1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	(None)
2103	CF1613D MEX Sequences dp math *1900	0 / 0	(None)
2097	CF1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	(None)
2096	CF1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	(None)
2095	CF1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	(None)
2087	CF1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	(None)
2081	CF1616D Keep the Average High dp greedy math *2000	0 / 0	(None)
2076	CF1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	(None)
2075	CF1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	(None)
2069	CF1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	(None)
2064	CF1618D Array and Operations dp greedy math *1300	0 / 0	(None)
2055	CF1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	(None)
2049	CF1620C BA-String brute force dp greedy implementation math *1800	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