bitmasks - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2088	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	(None)
	2015	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(None)
	2007	P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	(None)
	1961	P1270C Make Good bitmasks constructive algorithms math *1400	0 / 0	(None)
	1883	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(None)
	1868	P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	(None)
	1851	P1292F Nora's Toy Boxes bitmasks combinatorics dp *3500	0 / 0	(None)
	1817	P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	(None)
	1802	P1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(None)
	1794	P1303D Fill The Bag bitmasks greedy *1900	0 / 0	(None)
	1777	P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	(None)
	1754	P1312C Adding Powers bitmasks greedy implementation math number theory ternary search *1400	0 / 0	(None)
	1745	P1313D Happy New Year bitmasks dp implementation *2500	0 / 0	(None)
	1736	P1316E Team Building bitmasks dp greedy sortings *2300	0 / 0	(None)
	1725	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	(None)
	1723	P1322D Reality Show bitmasks dp *2800	0 / 0	(None)
	1709	P1325D Ehab the Xorcist bitmasks constructive algorithms greedy number theory *1700	0 / 0	(None)
	1700	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	(None)
	1699	P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	(None)
	1692	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.