bitmasks - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3713	P912B New Year's Eve bitmasks constructive algorithms number theory *1300	0 / 0	(None)
	3707	P913C Party Lemonade bitmasks dp greedy *1600	0 / 0	(None)
	3705	P913E Logical Expression bitmasks dp shortest paths *2400	0 / 0	(None)
	3697	P914E Palindromes in a Tree bitmasks data structures divide and conquer trees *2400	0 / 0	(None)
	3696	P914F Substrings in a String bitmasks brute force data structures string suffix structures strings *3000	0 / 0	(None)
	3695	P914G Sum the Fibonacci bitmasks divide and conquer dp fft math *2600	0 / 0	(None)
	3685	P916B Jamie and Binary Sequence (changed after round) bitmasks greedy math *2000	0 / 0	(None)
	3662	P920G List Of Integers binary search bitmasks brute force combinatorics math number theory *2200	0 / 0	(None)
	3565	P938F Erasing Substrings bitmasks dp greedy *2700	0 / 0	(None)
	3564	P938G Shortest Path Queries bitmasks data structures dsu graphs *2900	0 / 0	(None)
	3492	P959E Mahmoud and Ehab and the xor-MST bitmasks dp graphs implementation math *1900	0 / 0	(None)
	3491	P959F Mahmoud and Ehab and yet another xor task bitmasks dp math matrices *2400	0 / 0	(None)
	3488	P960C Subsequence Counting bitmasks constructive algorithms greedy implementation *1700	0 / 0	(None)
	3480	P961C Chessboard bitmasks brute force implementation *1400	0 / 0	(None)
	3427	P979D Kuro and GCD and XOR and SUM binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees *2200	0 / 0	(None)
	3416	P981D Bookshelves bitmasks dp greedy *1900	0 / 0	(None)
	3415	P981E Addition on Segments bitmasks data structures divide and conquer dp *2200	0 / 0	(None)
	3389	P986C AND Graph bitmasks dfs and similar dsu graphs *2500	0 / 0	(None)
	3352	P993B Open Communication bitmasks brute force *1900	0 / 0	(None)
	3351	P993C Careful Maneuvering bitmasks brute force geometry *2100	0 / 0	(None)

Pick a problem randomly based on the current filter.