Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
1696	CF1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	(None)
1695	CF1677A Tokitsukaze and Strange Inequality brute force data structures dp *1600	0 / 0	(None)
1694	CF1677B Tokitsukaze and Meeting data structures implementation math *1700	0 / 0	(None)
1693	CF1677C Tokitsukaze and Two Colorful Tapes constructive algorithms dfs and similar graphs greedy *1900	0 / 0	(None)
1692	CF1677D Tokitsukaze and Permutations dp math *2500	0 / 0	(None)
1690	CF1677E Tokitsukaze and Beautiful Subsegments data structures *2900	0 / 0	(None)
1689	CF1677F Tokitsukaze and Gems dp math *3500	0 / 0	(None)
1688	CF1678A Tokitsukaze and All Zero Sequence implementation *800	0 / 0	(None)
1687	CF1678B1 Tokitsukaze and Good 01-String (easy version) implementation *800	0 / 0	(None)
1686	CF1678B2 Tokitsukaze and Good 01-String (hard version) dp greedy implementation *1800	0 / 0	(None)
1685	CF1679A AvtoBus brute force greedy math number theory *900	0 / 0	(None)
1684	CF1679B Stone Age Problem data structures implementation *1200	0 / 0	(None)
1683	CF1679C Rooks Defenders data structures implementation *1400	0 / 0	(None)
1682	CF1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	(None)
1681	CF1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	(None)
1679	CF1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	(None)
1678	CF1680A Minimums and Maximums brute force math *800	0 / 0	(None)
1677	CF1680B Robots implementation *800	0 / 0	(None)
1676	CF1680C Binary String binary search greedy strings two pointers *1600	0 / 0	(None)
1675	CF1680D Dog Walking brute force greedy math *2400	0 / 0	(None)
1674	CF1680E Moving Chips bitmasks dp greedy *2000	0 / 0	(None)
1673	CF1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	(None)
1672	CF1681A Game with Cards games greedy *800	0 / 0	(None)
1671	CF1681B Card Trick implementation math *800	0 / 0	(None)
1670	CF1681C Double Sort implementation sortings *1200	0 / 0	(None)
1668	CF1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	(None)
1667	CF1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	(None)
1666	CF1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	(None)
1665	CF1682A Palindromic Indices greedy strings *800	0 / 0	(None)
1664	CF1682B AND Sorting bitmasks constructive algorithms sortings *1100	0 / 0	(None)
1663	CF1682C LIS or Reverse LIS? constructive algorithms greedy implementation math *1400	0 / 0	(None)
1662	CF1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	(None)
1661	CF1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	(None)
1660	CF1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	(None)
1659	CF1684A Digit Minimization constructive algorithms games math strings *800	0 / 0	(None)
1657	CF1684B Z mod X = C constructive algorithms math *800	0 / 0	(None)
1656	CF1684C Column Swapping brute force constructive algorithms greedy implementation sortings *1400	0 / 0	(None)
1655	CF1684D Traps constructive algorithms greedy sortings *1700	0 / 0	(None)
1654	CF1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	(None)
1653	CF1684F Diverse Segments data structures two pointers *2600	0 / 0	(None)
1652	CF1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	(None)
1651	CF1684H Hard Cut constructive algorithms dfs and similar divide and conquer math *3400	0 / 0	(None)
1650	CF1685A Circular Local MiniMax constructive algorithms greedy sortings *1100	0 / 0	(None)
1649	CF1685B Linguistics greedy implementation sortings strings *2000	0 / 0	(None)
1648	CF1685C Bring Balance brute force constructive algorithms greedy *2600	0 / 0	(None)
1646	CF1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	(None)
1645	CF1685D2 Permutation Weight (Hard Version) constructive algorithms greedy *3500	0 / 0	(None)
1644	CF1685E The Ultimate LIS Problem data structures greedy *3500	0 / 0	(None)
1643	CF1686A Everything Everywhere All But One greedy *800	0 / 0	(None)
1642	CF1686B Odd Subarrays dp greedy *800	0 / 0	(None)
1641	CF1687A The Enchanted Forest brute force greedy *1600	0 / 0	(None)
1640	CF1687B Railway System constructive algorithms graphs greedy interactive sortings *1700	0 / 0	(None)
1639	CF1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	(None)
1638	CF1687D Cute number binary search brute force data structures dsu implementation math *2900	0 / 0	(None)
1637	CF1687E Become Big For Me combinatorics constructive algorithms greedy math number theory *3500	0 / 0	(None)
1634	CF1687F Koishi's Unconscious Permutation fft math *3500	0 / 0	(None)
1633	CF1688A Cirno's Perfect Bitmasks Classroom bitmasks brute force *800	0 / 0	(None)
1632	CF1688B Patchouli's Magical Talisman bitmasks constructive algorithms greedy sortings *800	0 / 0	(None)
1631	CF1688C Manipulating History constructive algorithms greedy strings *1700	0 / 0	(None)
1630	CF1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	(None)
1629	CF1689B Mystic Permutation data structures greedy *900	0 / 0	(None)
1628	CF1689C Infected Tree dfs and similar dp trees *1600	0 / 0	(None)
1627	CF1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	(None)
1626	CF1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
1625	CF1690A Print a Pedestal (Codeforces logo?) constructive algorithms greedy *800	0 / 0	(None)
1623	CF1690B Array Decrements greedy implementation *800	0 / 0	(None)
1622	CF1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	(None)
1621	CF1690D Black and White Stripe implementation two pointers *1000	0 / 0	(None)
1620	CF1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	(None)
1619	CF1690F Shifting String graphs math number theory strings *1700	0 / 0	(None)
1618	CF1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	(None)
1617	CF1691A Beat The Odds brute force greedy math *800	0 / 0	(None)
1616	CF1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	(None)
1615	CF1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	(None)
1614	CF1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	(None)
1612	CF1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	(None)
1611	CF1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	(None)
1610	CF1692A Marathon implementation *800	0 / 0	(None)
1609	CF1692B All Distinct greedy sortings *800	0 / 0	(None)
1608	CF1692C Where's the Bishop? implementation *800	0 / 0	(None)
1607	CF1692D The Clock brute force implementation *1100	0 / 0	(None)
1606	CF1692E Binary Deque binary search implementation two pointers *1200	0 / 0	(None)
1605	CF1692F 3SUM brute force math *1300	0 / 0	(None)
1604	CF1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	(None)
1603	CF1692H Gambling data structures dp greedy math *1700	0 / 0	(None)
1601	CF1693A Directional Increase greedy *1300	0 / 0	(None)
1600	CF1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	(None)
1599	CF1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	(None)
1598	CF1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(None)
1597	CF1693E Outermost Maximums data structures greedy *3400	0 / 0	(None)
1596	CF1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	(None)
1595	CF1694A Creep greedy implementation *800	0 / 0	(None)
1594	CF1694B Paranoid String constructive algorithms greedy *1200	0 / 0	(None)
1593	CF1695A Subrectangle Guess games *800	0 / 0	(None)
1592	CF1695B Circle Game games greedy *1000	0 / 0	(None)
1590	CF1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	(None)
1589	CF1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	(None)
1588	CF1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	(None)
1587	CF1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs *2700	0 / 0	(None)
1586	CF1696A NIT orz! bitmasks greedy *800	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