题库 - meet-in-the-middle - 南阳理工学院OJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7203	P45D Event Dates greedy meet-in-the-middle sortings *1900	0 / 0	(无)
	6140	P285D Permutation Sum bitmasks combinatorics dp implementation meet-in-the-middle *1900	0 / 0	(无)
	5979	P327E Axis Walking bitmasks combinatorics constructive algorithms dp meet-in-the-middle *2300	0 / 0	(无)
	5459	P457A Golden System math meet-in-the-middle *1700	0 / 0	(无)
	5410	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	(无)
	5364	P478E Wavy numbers brute force dfs and similar meet-in-the-middle sortings *2900	0 / 0	(无)
	5321	P490D Chocolate brute force dfs and similar math meet-in-the-middle number theory *1900	0 / 0	(无)
	5230	P513G1 Inversions problem brute force dfs and similar dp meet-in-the-middle *1800	0 / 0	(无)
	5221	P515B Drazil and His Happy Friends brute force dsu meet-in-the-middle number theory *1300	0 / 0	(无)
	5179	P525E Anya and Cubes binary search bitmasks brute force dp math meet-in-the-middle *2100	0 / 0	(无)
	5143	P534F Simplified Nonogram bitmasks dp hashing meet-in-the-middle *2400	0 / 0	(无)
	5072	P552C Vanya and Scales brute force dp greedy math meet-in-the-middle number theory *1900	0 / 0	(无)
	4949	P585D Lizard Era: Beginning meet-in-the-middle *2300	0 / 0	(无)
	4686	P643F Bears and Juice dp math meet-in-the-middle *2900	0 / 0	(无)
	4175	P765G Math, math everywhere brute force dp math meet-in-the-middle number theory *3200	0 / 0	(无)
	4154	P769D k-Interesting Pairs Of Integers special problem bitmasks brute force meet-in-the-middle 1700	0 / 0	(无)
	4024	P799D Field expansion brute force dp meet-in-the-middle *2100	0 / 0	(无)
	3855	P839E Mother of Dragons brute force graphs math meet-in-the-middle *2700	0 / 0	(无)
	3727	P865F Egg Roulette bitmasks brute force divide and conquer math meet-in-the-middle *3300	0 / 0	(无)
	3643	P888E Maximum Subsequence bitmasks divide and conquer meet-in-the-middle *1800	0 / 0	(无)
	3543	P912E Prime Gift binary search dfs and similar math meet-in-the-middle number theory two pointers *2400	0 / 0	(无)
	3174	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	(无)
	3102	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	0 / 0	(无)
	2932	P1043D Mysterious Crime brute force combinatorics math meet-in-the-middle two pointers *1700	0 / 0	(无)
	2628	P1105E Helping Hiasat bitmasks brute force dp meet-in-the-middle *2200	0 / 0	(无)
	2192	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
	2012	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	(无)
	1912	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	(无)
	1848	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(无)
	1837	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	(无)
	1816	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	(无)
	1533	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	(无)
	1004	P1423L Light switches meet-in-the-middle *2600	0 / 0	(无)
	415	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	(无)
	290	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(无)
	246	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(无)
	123	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	(无)
	89	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	(无)
	46	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(无)
	7712	P1698G Long Binary String bitmasks math matrices meet-in-the-middle number theory *2900	0 / 0	(无)
	8146	P1840G1 In Search of Truth (Easy Version) constructive algorithms interactive math meet-in-the-middle probabilities *2200	0 / 0	8
	8145	P1840G2 In Search of Truth (Hard Version) constructive algorithms interactive math meet-in-the-middle probabilities *2500	0 / 0	9
	8824	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8

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