meet-in-the-middle - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	9190	P45D Event Dates greedy meet-in-the-middle sortings *1900	0 / 0	6
	8127	P285D Permutation Sum bitmasks combinatorics dp implementation meet-in-the-middle *1900	0 / 0	6
	7966	P327E Axis Walking bitmasks combinatorics constructive algorithms dp meet-in-the-middle *2300	0 / 0	8
	7446	P457A Golden System math meet-in-the-middle *1700	0 / 0	5
	7397	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	10
	7351	P478E Wavy numbers brute force dfs and similar meet-in-the-middle sortings *2900	0 / 0	10
	7308	P490D Chocolate brute force dfs and similar math meet-in-the-middle number theory *1900	0 / 0	6
	7217	P513G1 Inversions problem brute force dfs and similar dp meet-in-the-middle *1800	0 / 0	6
	7208	P515B Drazil and His Happy Friends brute force dsu meet-in-the-middle number theory *1300	0 / 0	4
	7168	P525E Anya and Cubes binary search bitmasks brute force dp math meet-in-the-middle *2100	0 / 0	7
	7132	P534F Simplified Nonogram bitmasks dp hashing meet-in-the-middle *2400	0 / 0	9
	7061	P552C Vanya and Scales brute force dp greedy math meet-in-the-middle number theory *1900	0 / 0	6
	6938	P585D Lizard Era: Beginning meet-in-the-middle *2300	0 / 0	8
	6675	P643F Bears and Juice dp math meet-in-the-middle *2900	0 / 0	10
	6170	P765G Math, math everywhere brute force dp math meet-in-the-middle number theory *3200	0 / 0	10
	6149	P769D k-Interesting Pairs Of Integers special problem bitmasks brute force meet-in-the-middle 1700	0 / 0	5
	6019	P799D Field expansion brute force dp meet-in-the-middle *2100	0 / 0	7
	5850	P839E Mother of Dragons brute force graphs math meet-in-the-middle *2700	0 / 0	10
	5722	P865F Egg Roulette bitmasks brute force divide and conquer math meet-in-the-middle *3300	0 / 0	10
	5638	P888E Maximum Subsequence bitmasks divide and conquer meet-in-the-middle *1800	0 / 0	6
	5538	P912E Prime Gift binary search dfs and similar math meet-in-the-middle number theory two pointers *2400	0 / 0	9
	5173	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	10
	5101	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	0 / 0	7
	4931	P1043D Mysterious Crime brute force combinatorics math meet-in-the-middle two pointers *1700	0 / 0	5
	4627	P1105E Helping Hiasat bitmasks brute force dp meet-in-the-middle *2200	0 / 0	8
	4191	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
	4011	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	10
	3911	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	5
	3847	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	3836	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	4
	3815	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	10
	3540	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	3011	P1423L Light switches meet-in-the-middle *2600	0 / 0	10
	2430	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
	2305	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	2261	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	2147	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	2113	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	10
	2070	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1546	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	10
	1479	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	1151	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	1068	P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10
	941	P1800F Dasha and Nightmares bitmasks hashing meet-in-the-middle strings *1900	0 / 0	6
	934	P1801F Another n-dimensional chocolate bar dp math meet-in-the-middle number theory *2700	0 / 0	10
	720	P1840G1 In Search of Truth (Easy Version) constructive algorithms interactive math meet-in-the-middle probabilities *2200	0 / 0	8
	719	P1840G2 In Search of Truth (Hard Version) constructive algorithms interactive math meet-in-the-middle probabilities *2500	0 / 0	9
	9446	P1982E Number of k-good subarrays bitmasks combinatorics divide and conquer dp math meet-in-the-middle	0 / 0	(无)

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