Problem Set - 算道OJ

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
1918	CF1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	(None)
1917	CF1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	(None)
1916	CF1641E Special Positions combinatorics divide and conquer fft math *3300	0 / 0	(None)
1915	CF1641F Covering Circle geometry *3500	0 / 0	(None)
1914	CF1642A Hard Way geometry *800	0 / 0	(None)
1912	CF1642B Power Walking greedy *900	0 / 0	(None)
1911	CF1644A Doors and Keys implementation *800	0 / 0	(None)
1910	CF1644B Anti-Fibonacci Permutation brute force constructive algorithms implementation *800	0 / 0	(None)
1909	CF1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	(None)
1908	CF1644D Cross Coloring data structures implementation math *1700	0 / 0	(None)
1907	CF1644E Expand the Path brute force combinatorics data structures implementation math *1900	0 / 0	(None)
1906	CF1644F Basis combinatorics fft math number theory *2900	0 / 0	(None)
1905	CF1646A Square Counting math *800	0 / 0	(None)
1904	CF1646B Quality vs Quantity brute force constructive algorithms greedy sortings two pointers *800	0 / 0	(None)
1903	CF1646C Factorials and Powers of Two bitmasks brute force constructive algorithms dp math *1500	0 / 0	(None)
1901	CF1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	(None)
1900	CF1646E Power Board brute force dp math number theory *2200	0 / 0	(None)
1899	CF1646F Playing Around the Table constructive algorithms greedy implementation *2900	0 / 0	(None)
1898	CF1647A Madoka and Math Dad implementation math *800	0 / 0	(None)
1897	CF1647B Madoka and the Elegant Gift brute force constructive algorithms graphs implementation *1200	0 / 0	(None)
1896	CF1647C Madoka and Childish Pranks constructive algorithms greedy *1300	0 / 0	(None)
1895	CF1647D Madoka and the Best School in Russia constructive algorithms dp math number theory *1900	0 / 0	(None)
1894	CF1647E Madoka and the Sixth-graders data structures dfs and similar greedy *2500	0 / 0	(None)
1893	CF1647F Madoka and Laziness dp greedy *3100	0 / 0	(None)
1892	CF1648A Weird Sum combinatorics data structures geometry math matrices sortings *1400	0 / 0	(None)
1890	CF1648B Integral Array brute force constructive algorithms data structures math *1800	0 / 0	(None)
1889	CF1648C Tyler and Strings combinatorics data structures implementation *1900	0 / 0	(None)
1888	CF1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	(None)
1887	CF1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	(None)
1886	CF1648F Two Avenues data structures dfs and similar graphs *3500	0 / 0	(None)
1885	CF1649A Game implementation *800	0 / 0	(None)
1884	CF1649B Game of Ball Passing greedy implementation *1300	0 / 0	(None)
1883	CF1650A Deletions of Two Adjacent Letters implementation strings *800	0 / 0	(None)
1882	CF1650B DIV + MOD math *900	0 / 0	(None)
1881	CF1650C Weight of the System of Nested Segments greedy hashing implementation sortings *1200	0 / 0	(None)
1879	CF1650D Twist the Permutation brute force constructive algorithms implementation math *1300	0 / 0	(None)
1878	CF1650E Rescheduling the Exam binary search data structures greedy implementation math sortings *1900	0 / 0	(None)
1877	CF1650F Vitaly and Advanced Useless Algorithms dp greedy implementation *2200	0 / 0	(None)
1876	CF1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	(None)
1875	CF1651A Playoff implementation *800	0 / 0	(None)
1874	CF1651B Prove Him Wrong constructive algorithms greedy *800	0 / 0	(None)
1873	CF1651C Fault-tolerant Network brute force data structures implementation *1500	0 / 0	(None)
1872	CF1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths *1900	0 / 0	(None)
1871	CF1651E Sum of Matchings brute force combinatorics constructive algorithms dfs and similar graph matchings greedy math *2600	0 / 0	(None)
1870	CF1651F Tower Defense binary search brute force data structures *3000	0 / 0	(None)
1868	CF1654A Maximum Cake Tastiness brute force greedy implementation sortings *800	0 / 0	(None)
1867	CF1654B Prefix Removals strings *800	0 / 0	(None)
1866	CF1654C Alice and the Cake data structures greedy implementation sortings *1400	0 / 0	(None)
1865	CF1654D Potion Brewing Class dfs and similar math number theory trees *2100	0 / 0	(None)
1864	CF1654E Arithmetic Operations brute force data structures graphs math *2300	0 / 0	(None)
1863	CF1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(None)
1862	CF1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	(None)
1861	CF1654H Three Minimums combinatorics constructive algorithms divide and conquer dp fft math *3500	0 / 0	(None)
1860	CF1656A Good Pairs math sortings *800	0 / 0	(None)
1859	CF1656B Subtract Operation data structures greedy math two pointers *1100	0 / 0	(None)
1856	CF1656C Make Equal With Mod constructive algorithms math number theory sortings *1200	0 / 0	(None)
1855	CF1656D K-good constructive algorithms math number theory *1900	0 / 0	(None)
1854	CF1656E Equal Tree Sums constructive algorithms dfs and similar math trees *2200	0 / 0	(None)
1853	CF1656F Parametric MST binary search constructive algorithms graphs greedy math sortings *2600	0 / 0	(None)
1852	CF1656G Cycle Palindrome constructive algorithms graphs math *3200	0 / 0	(None)
1851	CF1656H Equal LCM Subsets data structures math number theory *3200	0 / 0	(None)
1850	CF1656I Neighbour Ordering constructive algorithms graphs *3500	0 / 0	(None)
1849	CF1657A Integer Moves brute force math *800	0 / 0	(None)
1848	CF1657B XY Sequence greedy *800	0 / 0	(None)
1847	CF1657C Bracket Sequence Deletion greedy implementation *1200	0 / 0	(None)
1845	CF1657D For Gamers binary search brute force greedy math sortings *2000	0 / 0	(None)
1844	CF1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	(None)
1843	CF1657F Words on Tree 2-sat dfs and similar dsu graphs trees *2600	0 / 0	(None)
1842	CF1658A Marin and Photoshoot constructive algorithms implementation math *800	0 / 0	(None)
1841	CF1658B Marin and Anti-coprime Permutation combinatorics math number theory *800	0 / 0	(None)
1840	CF1658C Shinju and the Lost Permutation constructive algorithms math *1700	0 / 0	(None)
1839	CF1658D1 388535 (Easy Version) bitmasks math *1600	0 / 0	(None)
1838	CF1658D2 388535 (Hard Version) bitmasks brute force data structures math *2300	0 / 0	(None)
1837	CF1658E Gojou and Matrix Game data structures dp games hashing implementation math number theory sortings *2500	0 / 0	(None)
1836	CF1658F Juju and Binary String brute force constructive algorithms greedy math *2700	0 / 0	(None)
1834	CF1659A Red Versus Blue constructive algorithms greedy implementation math *1000	0 / 0	(None)
1833	CF1659B Bit Flipping bitmasks constructive algorithms greedy strings *1300	0 / 0	(None)
1832	CF1659C Line Empire binary search brute force dp greedy implementation math *1500	0 / 0	(None)
1831	CF1659D Reverse Sort Sum constructive algorithms data structures greedy implementation math two pointers *1900	0 / 0	(None)
1830	CF1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	(None)
1829	CF1659F Tree and Permutation Game dfs and similar games graphs trees *3000	0 / 0	(None)
1828	CF1660A Vasya and Coins greedy math *800	0 / 0	(None)
1827	CF1660B Vlad and Candies math *800	0 / 0	(None)
1826	CF1660C Get an Even String dp greedy strings *1300	0 / 0	(None)
1825	CF1660D Maximum Product Strikes Back brute force implementation math two pointers *1600	0 / 0	(None)
1823	CF1660E Matrix and Shifts brute force constructive algorithms greedy implementation *1600	0 / 0	(None)
1822	CF1660F1 Promising String (easy version) brute force implementation math strings *1700	0 / 0	(None)
1821	CF1660F2 Promising String (hard version) data structures implementation math strings *2100	0 / 0	(None)
1820	CF1661A Array Balancing greedy math *800	0 / 0	(None)
1819	CF1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	(None)
1818	CF1661C Water the Trees binary search greedy math *1700	0 / 0	(None)
1817	CF1661D Progressions Covering data structures greedy *1900	0 / 0	(None)
1816	CF1661E Narrow Components brute force data structures dp dsu math trees *2500	0 / 0	(None)
1815	CF1661F Teleporters binary search greedy *2600	0 / 0	(None)
1814	CF1662A Organizing SWERC brute force implementation	0 / 0	(None)
1812	CF1662B Toys greedy strings	0 / 0	(None)
1811	CF1662C European Trip dp graphs math matrices	0 / 0	(None)
1810	CF1662D Evolution of Weasels greedy implementation strings	0 / 0	(None)
1809	CF1662E Round Table math	0 / 0	(None)
1808	CF1662F Antennas data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths	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