meet-in-the-middle - 题库 - oj

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8741	P45D Event Dates greedy meet-in-the-middle sortings *1900	0 / 0	6
	7678	P285D Permutation Sum bitmasks combinatorics dp implementation meet-in-the-middle *1900	0 / 0	6
	7517	P327E Axis Walking bitmasks combinatorics constructive algorithms dp meet-in-the-middle *2300	0 / 0	8
	6984	P457A Golden System math meet-in-the-middle *1700	0 / 0	5
	6935	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	10
	6889	P478E Wavy numbers brute force dfs and similar meet-in-the-middle sortings *2900	0 / 0	10
	6846	P490D Chocolate brute force dfs and similar math meet-in-the-middle number theory *1900	0 / 0	6
	6755	P513G1 Inversions problem brute force dfs and similar dp meet-in-the-middle *1800	0 / 0	6
	6746	P515B Drazil and His Happy Friends brute force dsu meet-in-the-middle number theory *1300	0 / 0	4
	6701	P525E Anya and Cubes binary search bitmasks brute force dp math meet-in-the-middle *2100	0 / 0	7
	6665	P534F Simplified Nonogram bitmasks dp hashing meet-in-the-middle *2400	0 / 0	9
	6594	P552C Vanya and Scales brute force dp greedy math meet-in-the-middle number theory *1900	0 / 0	6
	6471	P585D Lizard Era: Beginning meet-in-the-middle *2300	0 / 0	8
	6208	P643F Bears and Juice dp math meet-in-the-middle *2900	0 / 0	10
	5703	P765G Math, math everywhere brute force dp math meet-in-the-middle number theory *3200	0 / 0	10
	5682	P769D k-Interesting Pairs Of Integers special problem bitmasks brute force meet-in-the-middle 1700	0 / 0	5
	5552	P799D Field expansion brute force dp meet-in-the-middle *2100	0 / 0	7
	5383	P839E Mother of Dragons brute force graphs math meet-in-the-middle *2700	0 / 0	10
	5255	P865F Egg Roulette bitmasks brute force divide and conquer math meet-in-the-middle *3300	0 / 0	10
	5171	P888E Maximum Subsequence bitmasks divide and conquer meet-in-the-middle *1800	0 / 0	6
	5071	P912E Prime Gift binary search dfs and similar math meet-in-the-middle number theory two pointers *2400	0 / 0	9
	4706	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	10
	4634	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	0 / 0	7
	4464	P1043D Mysterious Crime brute force combinatorics math meet-in-the-middle two pointers *1700	0 / 0	5
	4160	P1105E Helping Hiasat bitmasks brute force dp meet-in-the-middle *2200	0 / 0	8
	3724	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
	3544	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	10
	3444	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	5
	3380	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	9
	3369	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	4
	3348	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	10
	3073	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	2544	P1423L Light switches meet-in-the-middle *2600	0 / 0	10
	1963	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
	1838	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	1794	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	10
	1680	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	1646	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	10
	1603	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1088	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	10
	1021	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	693	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	610	P1779H Olympic Team Building brute force meet-in-the-middle *3500	0 / 0	10
	483	P1800F Dasha and Nightmares bitmasks hashing meet-in-the-middle strings *1900	0 / 0	6
	476	P1801F Another n-dimensional chocolate bar dp math meet-in-the-middle number theory *2700	0 / 0	10
	262	P1840G1 In Search of Truth (Easy Version) constructive algorithms interactive math meet-in-the-middle probabilities *2200	0 / 0	8
	261	P1840G2 In Search of Truth (Hard Version) constructive algorithms interactive math meet-in-the-middle probabilities *2500	0 / 0	9
	9364	P1952H Palindrome meet-in-the-middle	0 / 0	(无)
	9362	P1952J Help, what does it mean to be "Based" 2-sat binary search bitmasks brute force chinese remainder theorem combinatorics constructive algorithms data structures dfs and similar divide and conquer dp dsu expression parsing fft flows games geometry graph matchings graphs greedy hashing implementation interactive math matrices meet-in-the-middle number theory probabilities schedules shortest paths sortings string suffix structures strings ternary search trees two pointers	0 / 0	(无)
	9471	P1958I Equal Trees *special problem graphs meet-in-the-middle	0 / 0	(无)
	9566	P1982E Number of k-good subarrays bitmasks bitmasks combinatorics divide and conquer divide and conquer dp math meet-in-the-middle	0 / 0	(无)

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