bitmasks - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
2562	CF1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(None)
2494	CF1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(None)
2493	CF1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	(None)
2491	CF1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(None)
2476	CF1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	(None)
2469	CF1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	(None)
2459	CF1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
2444	CF1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
2441	CF1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	(None)
2436	CF1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	(None)
2430	CF1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(None)
2427	CF1554B Cobb bitmasks brute force greedy math *1700	0 / 0	(None)
2426	CF1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	(None)
2411	CF1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	(None)
2409	CF1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(None)
2408	CF1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	(None)
2404	CF1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	(None)
2394	CF1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	(None)
2382	CF1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(None)
2381	CF1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	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)
2358	CF1567B MEXor Mixup bitmasks greedy *1000	0 / 0	(None)
2356	CF1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	(None)
2348	CF1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(None)
2341	CF1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(None)
2265	CF1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	(None)
2256	CF1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	(None)
2248	CF1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(None)
2233	CF1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	(None)
2231	CF1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	(None)
2218	CF1594B Special Numbers bitmasks math *1100	0 / 0	(None)
2206	CF1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	(None)
2194	CF1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	(None)
2189	CF1600J Robot Factory bitmasks dfs and similar *1400	0 / 0	(None)
2188	CF1601A Array Elimination bitmasks greedy math number theory *1300	0 / 0	(None)
2167	CF1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	(None)
2137	CF1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	(None)
2097	CF1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	(None)
2092	CF1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	(None)
2089	CF1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	(None)
2075	CF1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	(None)
2062	CF1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	(None)
2044	CF1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	(None)
2029	CF1622E Math Test bitmasks brute force greedy *2200	0 / 0	(None)
2015	CF1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	(None)
2014	CF1625A Ancient Civilization bitmasks greedy math *800	0 / 0	(None)
2010	CF1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	(None)
1984	CF1630A And Matching bitmasks constructive algorithms *1500	0 / 0	(None)
1974	CF1632B Roof Construction bitmasks constructive algorithms *1000	0 / 0	(None)
1973	CF1632C Strange Test binary search bitmasks brute force dp math *1600	0 / 0	(None)
1960	CF1634B Fortune Telling bitmasks math *1400	0 / 0	(None)
1954	CF1635A Min Or Sum bitmasks greedy *800	0 / 0	(None)
1951	CF1635D Infinite Set bitmasks dp math matrices number theory strings *1800	0 / 0	(None)
1917	CF1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	(None)
1903	CF1646C Factorials and Powers of Two bitmasks brute force constructive algorithms dp math *1500	0 / 0	(None)
1863	CF1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	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)
1833	CF1659B Bit Flipping bitmasks constructive algorithms greedy strings *1300	0 / 0	(None)
1830	CF1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	(None)
1819	CF1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	(None)
1785	CF1665D GCD Guess bitmasks chinese remainder theorem constructive algorithms games interactive math number theory *2000	0 / 0	(None)
1784	CF1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	(None)
1753	CF1669H Maximal AND bitmasks greedy math *1300	0 / 0	(None)
1748	CF1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	(None)
1745	CF1670F Jee, You See? bitmasks combinatorics dp *2400	0 / 0	(None)
1722	CF1673E Power or XOR? bitmasks combinatorics math number theory *2500	0 / 0	(None)
1721	CF1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	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)
1674	CF1680E Moving Chips bitmasks dp greedy *2000	0 / 0	(None)
1664	CF1682B AND Sorting bitmasks constructive algorithms sortings *1100	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)
1626	CF1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
1586	CF1696A NIT orz! bitmasks greedy *800	0 / 0	(None)
1571	CF1698A XOR Mixup bitmasks brute force *800	0 / 0	(None)
1564	CF1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	(None)
1562	CF1699B Almost Ternary Matrix bitmasks constructive algorithms matrices *900	0 / 0	(None)
1529	CF1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	(None)
1512	CF1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	(None)
1511	CF1705F Mark and the Online Exam bitmasks constructive algorithms interactive probabilities *2900	0 / 0	(None)
1498	CF1707F Bugaboo bitmasks constructive algorithms dp number theory *3500	0 / 0	(None)
1490	CF1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	(None)
1489	CF1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	(None)
1486	CF1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	(None)
1467	CF1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	(None)
1455	CF1715D 2+ doors 2-sat bitmasks graphs greedy *1900	0 / 0	(None)
1448	CF1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	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)
1418	CF1721D Maximum AND bitmasks dfs and similar divide and conquer greedy sortings *1800	0 / 0	(None)
10458	CF1722G Even-Odd XOR bitmasks constructive algorithms greedy *1500	0 / 0	(None)
10454	CF1725D Deducing Sortability binary search bitmasks math *2900	0 / 0	(None)
10451	CF1725F Field Photography bitmasks data structures sortings *2100	0 / 0	(None)
10441	CF1726B Mainak and Interesting Sequence bitmasks constructive algorithms math *1100	0 / 0	(None)
10427	CF1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	(None)
10413	CF1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	(None)
10410	CF1731C Even Subarrays bitmasks brute force hashing math number theory *1700	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