Problem Set - bitmasks - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5346	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	5342	P1903B StORage room bitmasks brute force constructive algorithms greedy *1200	0 / 0	4
	5340	P1903D1 Maximum And Queries (easy version) binary search bitmasks brute force greedy *1700	0 / 0	5
	5339	P1903D2 Maximum And Queries (hard version) binary search bitmasks divide and conquer dp greedy *2500	0 / 0	9
	6618	P1906B Button Pressing bitmasks constructive algorithms hashing *2600	0 / 0	10
	6696	P1909B Make Almost Equal With Mod bitmasks constructive algorithms math number theory *1200	0 / 0	4
	6693	P1909E Multiple Lamps bitmasks brute force constructive algorithms math number theory *2400	0 / 0	9
	6667	P1912K Kim's Quest bitmasks combinatorics dp *1800	0 / 0	6
	6663	P1913C Game with Multiset binary search bitmasks brute force greedy *1300	0 / 0	4
	6650	P1915A Odd One Out bitmasks implementation *800	0 / 0	3
	6649	P1915B Not Quite Latin Square bitmasks brute force implementation *800	0 / 0	3
	6629	P1917F Construct Tree bitmasks constructive algorithms dp trees *2500	0 / 0	9
	8205	P1918C XOR-distance bitmasks dp greedy implementation math *1400	0 / 0	4
	8182	P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math *1800	0 / 0	6
	8921	P1926D Vlad and Division bitmasks greedy	0 / 0	(None)
	8920	P1926E Vlad and an Odd Ordering binary search bitmasks data structures dp implementation math number theory	0 / 0	(None)
	8919	P1926F Vlad and Avoiding X bitmasks brute force dfs and similar dp implementation	0 / 0	(None)
	8900	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	8894	P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	0 / 0	(None)
	8892	P1930F Maximize the Difference bitmasks brute force dfs and similar	0 / 0	(None)
	8868	P1933G Turtle Magic: Royal Turtle Shell Pattern bitmasks brute force combinatorics constructive algorithms dfs and similar math	0 / 0	(None)
	8864	P1934D1 XOR Break — Solo Version bitmasks constructive algorithms greedy	0 / 0	(None)
	8863	P1934D2 XOR Break — Game Version bitmasks games greedy interactive	0 / 0	(None)
	8857	P1935E Distance Learning Courses in MAC bitmasks brute force data structures greedy math	0 / 0	(None)
	8855	P1936A Bitwise Operation Wizard bitmasks constructive algorithms greedy interactive math	0 / 0	(None)
	8852	P1936D Bitwise Paradox binary search bitmasks data structures greedy two pointers	0 / 0	(None)
	9376	P1965B Missing Subsequence Sum bitmasks constructive algorithms greedy number theory *1800	0 / 0	6
	9366	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9327	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees *2400	0 / 0	9
	9315	P1973B Cat, Fox and the Lonely Array binary search bitmasks data structures greedy math two pointers *1300	0 / 0	4
	9311	P1973F Maximum GCD Sum Queries bitmasks brute force dp implementation number theory *3100	0 / 0	10
	9298	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math	0 / 0	(None)
	9293	P1977B Binary Colouring bitmasks constructive algorithms greedy math	0 / 0	(None)
	9291	P1977D XORificator bitmasks brute force hashing	0 / 0	(None)

Pick a problem randomly based on the current filter.