Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
7568	CF1780D Bit Guessing Game binary search bitmasks constructive algorithms interactive *1800	0 / 0	(None)
7557	CF1780E Josuke and Complete Graph binary search brute force data structures math number theory *2400	0 / 0	(None)
7546	CF1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	(None)
7535	CF1780G Delicious Dessert binary search dsu hashing math number theory string suffix structures *2400	0 / 0	(None)
7524	CF1781A Parallel Projection geometry math *800	0 / 0	(None)
7512	CF1781B Going to the Cinema brute force greedy sortings *1000	0 / 0	(None)
7501	CF1781C Equal Frequencies brute force constructive algorithms greedy implementation sortings strings *1600	0 / 0	(None)
7490	CF1781D Many Perfect Squares brute force math number theory *1800	0 / 0	(None)
7479	CF1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	(None)
7468	CF1781F Bracket Insertion combinatorics dp math trees *2700	0 / 0	(None)
7457	CF1781G Diverse Coloring constructive algorithms trees *3200	0 / 0	(None)
7446	CF1781H1 Window Signals (easy version) *3200	0 / 0	(None)
7435	CF1781H2 Window Signals (hard version) *3500	0 / 0	(None)
7424	CF1783A Make it Beautiful constructive algorithms math sortings *800	0 / 0	(None)
7413	CF1783B Matrix of Differences constructive algorithms math *1100	0 / 0	(None)
7401	CF1783C Yet Another Tournament binary search greedy sortings *1700	0 / 0	(None)
7390	CF1783D Different Arrays brute force dp implementation *2000	0 / 0	(None)
7379	CF1783E Game of the Year brute force data structures math number theory *2300	0 / 0	(None)
7368	CF1783F Double Sort II dfs and similar flows graph matchings graphs *2500	0 / 0	(None)
7357	CF1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	(None)
7346	CF1784A Monsters (easy version) brute force greedy *1000	0 / 0	(None)
7335	CF1784B Letter Exchange constructive algorithms *1900	0 / 0	(None)
7324	CF1784C Monsters (hard version) data structures greedy *2200	0 / 0	(None)
7313	CF1784D Wooden Spoon combinatorics dp *2400	0 / 0	(None)
7302	CF1784E Infinite Game brute force combinatorics dp games probabilities *3100	0 / 0	(None)
7290	CF1784F Minimums or Medians *3400	0 / 0	(None)
7279	CF1786A1 Non-alternating Deck (easy version) implementation *800	0 / 0	(None)
7268	CF1786A2 Alternating Deck (hard version) implementation *800	0 / 0	(None)
7257	CF1786B Cake Assembly Line brute force sortings *1300	0 / 0	(None)
7246	CF1787A Exponential Equation constructive algorithms math *800	0 / 0	(None)
7235	CF1787B Number Factorization greedy math number theory *1100	0 / 0	(None)
7224	CF1787C Remove the Bracket dp greedy math *1600	0 / 0	(None)
7213	CF1787D Game on Axis combinatorics dfs and similar dsu graphs implementation *1900	0 / 0	(None)
7202	CF1787E The Harmonization of XOR bitmasks constructive algorithms greedy math *2100	0 / 0	(None)
7191	CF1787F Inverse Transformation constructive algorithms implementation math *2500	0 / 0	(None)
7179	CF1787G Colorful Tree Again brute force data structures trees *3000	0 / 0	(None)
7168	CF1787H Codeforces Scoreboard binary search data structures dp geometry *3300	0 / 0	(None)
7157	CF1787I Treasure Hunt data structures divide and conquer two pointers *3400	0 / 0	(None)
7146	CF1788A One and Two brute force implementation math *800	0 / 0	(None)
7135	CF1788B Sum of Two Numbers constructive algorithms greedy implementation math probabilities *1100	0 / 0	(None)
7124	CF1788C Matching Numbers constructive algorithms greedy math *1300	0 / 0	(None)
7113	CF1788D Moving Dots binary search brute force combinatorics math two pointers *2000	0 / 0	(None)
7102	CF1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	(None)
7091	CF1788F XOR, Tree, and Queries bitmasks constructive algorithms dfs and similar dsu graphs greedy implementation trees *2500	0 / 0	(None)
7080	CF1789A Serval and Mocha's Array brute force math number theory *800	0 / 0	(None)
7068	CF1789B Serval and Inversion Magic brute force implementation strings two pointers *800	0 / 0	(None)
7057	CF1789C Serval and Toxel's Arrays combinatorics dp implementation math *1500	0 / 0	(None)
7046	CF1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	(None)
7035	CF1789E Serval and Music Game brute force dp implementation math number theory *2500	0 / 0	(None)
7024	CF1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings *2700	0 / 0	(None)
7013	CF1790A Polycarp and the Day of Pi implementation math strings *800	0 / 0	(None)
7002	CF1790B Taisia and Dice greedy greedy math *800	0 / 0	(None)
6991	CF1790C Premutation brute force implementation math *1000	0 / 0	(None)
6980	CF1790D Matryoshkas data structures greedy sortings *1200	0 / 0	(None)
6969	CF1790E Vlad and a Pair of Numbers bitmasks constructive algorithms *1400	0 / 0	(None)
6956	CF1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	(None)
6945	CF1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	(None)
6934	CF1791A Codeforces Checking implementation strings *800	0 / 0	(None)
6923	CF1791B Following Directions geometry implementation *800	0 / 0	(None)
6912	CF1791C Prepend and Append implementation two pointers *800	0 / 0	(None)
6901	CF1791D Distinct Split brute force greedy strings *1000	0 / 0	(None)
6890	CF1791E Negatives and Positives dp greedy sortings *1100	0 / 0	(None)
6879	CF1791F Range Update Point Query binary search brute force data structures *1500	0 / 0	(None)
6868	CF1791G1 Teleporters (Easy Version) greedy sortings *1100	0 / 0	(None)
6857	CF1791G2 Teleporters (Hard Version) binary search greedy sortings *1900	0 / 0	(None)
6845	CF1792A GamingForces greedy sortings *800	0 / 0	(None)
6834	CF1792B Stand-up Comedian greedy math *1200	0 / 0	(None)
6823	CF1792C Min Max Sort binary search brute force greedy math two pointers *1500	0 / 0	(None)
6812	CF1792D Fixed Prefix Permutations binary search bitmasks data structures hashing math sortings *1700	0 / 0	(None)
6801	CF1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	(None)
6790	CF1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	(None)
6779	CF1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	(None)
6768	CF1793A Yet Another Promotion greedy math *800	0 / 0	(None)
6757	CF1793B Fedya and Array constructive algorithms math *1100	0 / 0	(None)
6746	CF1793C Dora and Search constructive algorithms data structures two pointers *1200	0 / 0	(None)
6734	CF1793D Moscow Gorillas binary search dp greedy implementation math two pointers *1800	0 / 0	(None)
6723	CF1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	(None)
6712	CF1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	(None)
6701	CF1794A Prefix and Suffix Array strings *800	0 / 0	(None)
6690	CF1794B Not Dividing constructive algorithms greedy math *900	0 / 0	(None)
6679	CF1794C Scoring Subsequences binary search greedy math two pointers *1300	0 / 0	(None)
6668	CF1794D Counting Factorizations combinatorics divide and conquer dp math number theory *1900	0 / 0	(None)
6657	CF1794E Labeling the Tree with Distances data structures dp greedy hashing implementation trees *2400	0 / 0	(None)
6646	CF1795A Two Towers brute force implementation strings *800	0 / 0	(None)
6635	CF1795B Ideal Point brute force geometry greedy *900	0 / 0	(None)
6623	CF1795C Tea Tasting binary search data structures implementation *1500	0 / 0	(None)
6612	CF1795D Triangle Coloring combinatorics math *1600	0 / 0	(None)
6601	CF1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	(None)
6590	CF1795F Blocking Chips binary search constructive algorithms dfs and similar greedy trees *2400	0 / 0	(None)
6579	CF1795G Removal Sequences bitmasks dfs and similar graphs *2700	0 / 0	(None)
6568	CF1796A Typical Interview Problem brute force implementation strings *800	0 / 0	(None)
6557	CF1796B Asterisk-Minor Template implementation strings *1000	0 / 0	(None)
6546	CF1796C Maximum Set binary search math *1600	0 / 0	(None)
6535	CF1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	(None)
6524	CF1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	(None)
6512	CF1796F Strange Triples brute force math number theory *2900	0 / 0	(None)
6501	CF1797A Li Hua and Maze constructive algorithms flows graphs greedy implementation *800	0 / 0	(None)
6490	CF1797B Li Hua and Pattern constructive algorithms greedy *1100	0 / 0	(None)
6479	CF1797C Li Hua and Chess constructive algorithms greedy interactive *1600	0 / 0	(None)
6468	CF1797D Li Hua and Tree brute force data structures dfs and similar dp implementation trees *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