meet-in-the-middle - 题库 - 思+学堂

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7863	P45D Event Dates greedy meet-in-the-middle sortings *1900	0 / 0	6
	6800	P285D Permutation Sum bitmasks combinatorics dp implementation meet-in-the-middle *1900	0 / 0	6
	6640	P327E Axis Walking bitmasks combinatorics constructive algorithms dp meet-in-the-middle *2300	0 / 0	8
	6119	P457A Golden System math meet-in-the-middle *1700	0 / 0	5
	6070	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	10
	6024	P478E Wavy numbers brute force dfs and similar meet-in-the-middle sortings *2900	0 / 0	10
	5981	P490D Chocolate brute force dfs and similar math meet-in-the-middle number theory *1900	0 / 0	6
	5890	P513G1 Inversions problem brute force dfs and similar dp meet-in-the-middle *1800	0 / 0	6
	5881	P515B Drazil and His Happy Friends brute force dsu meet-in-the-middle number theory *1300	0 / 0	4
	5841	P525E Anya and Cubes binary search bitmasks brute force dp math meet-in-the-middle *2100	0 / 0	7
	5805	P534F Simplified Nonogram bitmasks dp hashing meet-in-the-middle *2400	0 / 0	9
	5734	P552C Vanya and Scales brute force dp greedy math meet-in-the-middle number theory *1900	0 / 0	6
	5611	P585D Lizard Era: Beginning meet-in-the-middle *2300	0 / 0	8
	5348	P643F Bears and Juice dp math meet-in-the-middle *2900	0 / 0	10
	4837	P765G Math, math everywhere brute force dp math meet-in-the-middle number theory *3200	0 / 0	10
	4816	P769D k-Interesting Pairs Of Integers special problem bitmasks brute force meet-in-the-middle 1700	0 / 0	5
	4686	P799D Field expansion brute force dp meet-in-the-middle *2100	0 / 0	7
	4517	P839E Mother of Dragons brute force graphs math meet-in-the-middle *2700	0 / 0	10
	4390	P865F Egg Roulette bitmasks brute force divide and conquer math meet-in-the-middle *3300	0 / 0	10
	4305	P888E Maximum Subsequence bitmasks divide and conquer meet-in-the-middle *1800	0 / 0	6
	4205	P912E Prime Gift binary search dfs and similar math meet-in-the-middle number theory two pointers *2400	0 / 0	9
	3839	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	10
	3767	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	0 / 0	7
	3597	P1043D Mysterious Crime brute force combinatorics math meet-in-the-middle two pointers *1700	0 / 0	5
	3293	P1105E Helping Hiasat bitmasks brute force dp meet-in-the-middle *2200	0 / 0	8
	2857	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
	2677	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	10
	2577	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	5
	2513	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	2502	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	4
	2481	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	10
	2207	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	1678	P1423L Light switches meet-in-the-middle *2600	0 / 0	10
	1097	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	10
	972	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	928	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	814	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	780	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	10
	737	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	222	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	10
	155	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	8238	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	8182	P1779H Olympic Team Building brute force meet-in-the-middle	0 / 0	(无)
	8302	P1800F Dasha and Nightmares bitmasks hashing meet-in-the-middle	0 / 0	(无)
	8417	P1801F Another n-dimensional chocolate bar dp math meet-in-the-middle number theory *2700	0 / 0	10
	8581	P1839D Ball Sorting brute force data structures dfs and similar dp meet-in-the-middle shortest paths sortings string suffix structures	0 / 0	(无)
	9463	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8

根据当前过滤条件随机选择一道题