ID	题目隐藏标签显示标签	AC / 尝试	难度
6989	P45D Event Dates greedy meet-in-the-middle sortings *1900	0 / 0	(无)
5926	P285D Permutation Sum bitmasks combinatorics dp implementation meet-in-the-middle *1900	0 / 0	(无)
5765	P327E Axis Walking bitmasks combinatorics constructive algorithms dp meet-in-the-middle *2300	0 / 0	(无)
5245	P457A Golden System math meet-in-the-middle *1700	0 / 0	(无)
5196	P468E Permanent dp graph matchings math meet-in-the-middle *3100	0 / 0	(无)
5150	P478E Wavy numbers brute force dfs and similar meet-in-the-middle sortings *2900	0 / 0	(无)
5107	P490D Chocolate brute force dfs and similar math meet-in-the-middle number theory *1900	0 / 0	(无)
5016	P513G1 Inversions problem brute force dfs and similar dp meet-in-the-middle *1800	0 / 0	(无)
5007	P515B Drazil and His Happy Friends brute force dsu meet-in-the-middle number theory *1300	0 / 0	(无)
4965	P525E Anya and Cubes binary search bitmasks brute force dp math meet-in-the-middle *2100	0 / 0	(无)
4929	P534F Simplified Nonogram bitmasks dp hashing meet-in-the-middle *2400	0 / 0	(无)
4858	P552C Vanya and Scales brute force dp greedy math meet-in-the-middle number theory *1900	0 / 0	(无)
4735	P585D Lizard Era: Beginning meet-in-the-middle *2300	0 / 0	(无)
4472	P643F Bears and Juice dp math meet-in-the-middle *2900	0 / 0	(无)
3967	P765G Math, math everywhere brute force dp math meet-in-the-middle number theory *3200	0 / 0	(无)
3946	P769D k-Interesting Pairs Of Integers special problem bitmasks brute force meet-in-the-middle 1700	0 / 0	(无)
3816	P799D Field expansion brute force dp meet-in-the-middle *2100	0 / 0	(无)
3647	P839E Mother of Dragons brute force graphs math meet-in-the-middle *2700	0 / 0	(无)
3519	P865F Egg Roulette bitmasks brute force divide and conquer math meet-in-the-middle *3300	0 / 0	(无)
3435	P888E Maximum Subsequence bitmasks divide and conquer meet-in-the-middle *1800	0 / 0	(无)
3335	P912E Prime Gift binary search dfs and similar math meet-in-the-middle number theory two pointers *2400	0 / 0	(无)
2966	P995E Number Clicker divide and conquer graphs meet-in-the-middle number theory *2700	0 / 0	(无)
2894	P1006F Xor-Paths bitmasks brute force dp meet-in-the-middle *2100	0 / 0	(无)
2724	P1043D Mysterious Crime brute force combinatorics math meet-in-the-middle two pointers *1700	0 / 0	(无)
2420	P1105E Helping Hiasat bitmasks brute force dp meet-in-the-middle *2200	0 / 0	(无)
1984	P1192C Cubeword *special problem brute force dp meet-in-the-middle	0 / 0	(无)
1760	P1221G Graph And Numbers bitmasks brute force combinatorics dp meet-in-the-middle *2900	0 / 0	(无)
1660	P1249C2 Good Numbers (hard version) binary search greedy math meet-in-the-middle *1500	0 / 0	(无)
1596	P1257F Make Them Similar bitmasks brute force hashing meet-in-the-middle *2400	0 / 0	(无)
1585	P1263C Everyone is a Winner! binary search math meet-in-the-middle number theory *1400	0 / 0	(无)
1564	P1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	(无)
1281	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	(无)
752	P1423L Light switches meet-in-the-middle *2600	0 / 0	(无)
163	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	(无)
32	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(无)
1873	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle	0 / 0	(无)
7356	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	(无)

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

状态

支持

特别鸣谢

开发与维护：杨旭龙、王树淳、王国斌、宋文宇
老师：肖飞、关玉蓉、魏银珍、周芬

Worker 0, 68ms
Powered by Hydro v4.9.27
Modified by HGNU ACM TEAM (Repo Link)

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

状态

支持

特别鸣谢

分类

状态

支持

特别鸣谢

还没有账户？

登录