bitmasks - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6607	P212B Polycarpus is Looking for Good Substrings bitmasks hashing implementation *2300	0 / 0	(None)
	6583	P217D Bitonix' Patrol bitmasks brute force combinatorics dfs and similar math *2900	0 / 0	(None)
	6556	P224B Array bitmasks implementation two pointers *1500	0 / 0	(None)
	6552	P225D Snake bitmasks dfs and similar graphs implementation *2200	0 / 0	(None)
	6525	P232B Table bitmasks combinatorics dp math *1900	0 / 0	(None)
	6522	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	(None)
	6489	P241B Friends binary search bitmasks data structures math *2700	0 / 0	(None)
	6479	P242E XOR on Segment bitmasks data structures *2000	0 / 0	(None)
	6478	P243A The Brand New Function bitmasks *1600	0 / 0	(None)
	6472	P244B Undoubtedly Lucky Numbers bitmasks brute force dfs and similar *1600	0 / 0	(None)
	6443	P251D Two Sets bitmasks math *2700	0 / 0	(None)
	6344	P276D Little Girl and Maximum XOR bitmasks dp greedy implementation math *1700	0 / 0	(None)
	6332	P279D The Minimum Number of Variables bitmasks dp *2200	0 / 0	(None)
	6319	P282E Sausage Maximization bitmasks data structures trees *2200	0 / 0	(None)
	6308	P285D Permutation Sum bitmasks combinatorics dp implementation meet-in-the-middle *1900	0 / 0	(None)
	6284	P291C Network Mask special problem bitmasks brute force implementation 1600	0 / 0	(None)
	6220	P309C Memory for Arrays binary search bitmasks greedy *1900	0 / 0	(None)
	6147	P327E Axis Walking bitmasks combinatorics constructive algorithms dp meet-in-the-middle *2300	0 / 0	(None)
	6117	P333D Characteristics of Rectangles binary search bitmasks brute force implementation sortings *2100	0 / 0	(None)
	6116	P333E Summer Earnings binary search bitmasks brute force geometry sortings *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.