Problem Set - bitmasks - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2241	P1494A ABC String bitmasks brute force implementation *900	0 / 0	3
	2240	P1494B Berland Crossword bitmasks brute force greedy implementation *1400	0 / 0	4
	2223	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	9
	2219	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	2215	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	9
	2205	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	10
	2173	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2149	P1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 0	10
	2140	P1513B AND Sequences bitmasks combinatorics constructive algorithms math *1400	0 / 0	4
	2134	P1514B AND 0, Sum Big bitmasks combinatorics math *1200	0 / 0	4
	2123	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	2120	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	5
	2119	P1516C Baby Ehab Partitions Again bitmasks constructive algorithms dp math *1700	0 / 0	5
	2103	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	10
	2086	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	9
	2084	P1523F Favorite Game bitmasks dp *3300	0 / 0	10
	2068	P1527A And Then There Were K bitmasks *800	0 / 0	3
	2049	P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	10
	2033	P1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(None)
	1973	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	6
	1972	P1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	5
	1970	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	1957	P1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	4
	1950	P1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	8
	1941	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	9
	1928	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	1925	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	10
	1920	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	4
	1915	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	10
	1912	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	5
	1911	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	1899	P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	6
	1897	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	9
	1896	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	10
	1892	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	5
	1883	P1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	3
	1872	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1871	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	7
	1859	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	3
	1858	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	3
	1850	P1567B MEXor Mixup bitmasks greedy *1000	0 / 0	3
	1849	P1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	5
	1841	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	1835	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	5
	1767	P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	6
	1759	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	9
	1751	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	10
	1738	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	5
	1736	P1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	9
	1724	P1594B Special Numbers bitmasks math *1100	0 / 0	3
	1713	P1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	9
	1702	P1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	10
	1699	P1600J Robot Factory bitmasks dfs and similar *1400	0 / 0	4
	1698	P1601A Array Elimination bitmasks greedy math number theory *1300	0 / 0	4
	1679	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	1651	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	9
	1615	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	5
	1610	P1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	4
	1608	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	1596	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	1584	P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	1568	P1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	9
	1554	P1622E Math Test bitmasks brute force greedy *2200	0 / 0	8
	1541	P1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	6
	1540	P1625A Ancient Civilization bitmasks greedy math *800	0 / 0	3
	1537	P1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	8
	1513	P1630A And Matching bitmasks constructive algorithms *1500	0 / 0	5
	1504	P1632B Roof Construction bitmasks constructive algorithms *1000	0 / 0	3
	1503	P1632C Strange Test binary search bitmasks brute force dp math *1600	0 / 0	5
	1492	P1634B Fortune Telling bitmasks math *1400	0 / 0	4
	1487	P1635A Min Or Sum bitmasks greedy *800	0 / 0	3
	1484	P1635D Infinite Set bitmasks dp math matrices number theory strings *1800	0 / 0	6
	1453	P1641D Two Arrays bitmasks brute force combinatorics greedy hashing math two pointers *2700	0 / 0	10
	1440	P1646C Factorials and Powers of Two bitmasks brute force constructive algorithms dp math *1500	0 / 0	5
	1404	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1383	P1658D1 388535 (Easy Version) bitmasks math *1600	0 / 0	5
	1382	P1658D2 388535 (Hard Version) bitmasks brute force data structures math *2300	0 / 0	8
	1378	P1659B Bit Flipping bitmasks constructive algorithms greedy strings *1300	0 / 0	4
	1375	P1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	8
	1365	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
	1334	P1665D GCD Guess bitmasks chinese remainder theorem constructive algorithms games interactive math number theory *2000	0 / 0	7
	1333	P1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	9
	1305	P1669H Maximal AND bitmasks greedy math *1300	0 / 0	4
	1300	P1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	8
	1299	P1670F Jee, You See? bitmasks combinatorics dp *2400	0 / 0	9
	1278	P1673E Power or XOR? bitmasks combinatorics math number theory *2500	0 / 0	9
	1277	P1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	9
	1240	P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	9
	1239	P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	10
	1234	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1225	P1682B AND Sorting bitmasks constructive algorithms sortings *1100	0 / 0	3
	1198	P1688A Cirno's Perfect Bitmasks Classroom bitmasks brute force *800	0 / 0	3
	1197	P1688B Patchouli's Magical Talisman bitmasks constructive algorithms greedy sortings *800	0 / 0	3
	1191	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	1155	P1696A NIT orz! bitmasks greedy *800	0 / 0	3
	1141	P1698A XOR Mixup bitmasks brute force *800	0 / 0	3
	1135	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	10
	1133	P1699B Almost Ternary Matrix bitmasks constructive algorithms matrices *900	0 / 0	3
	1103	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	1089	P1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	8

Pick a problem randomly based on the current filter.