可以预处理popcount(x)<=2的x
查看原帖
可以预处理popcount(x)<=2的x
1188058
141300hxl楼主2024/5/31 14:33

可以在C(64,3)=64×63×626C(64,3)={64\times 63 \times 62 \over 6}的时间复杂度算出来

void solve(int deep, ll x, int sum) {
	if (sum >= 3) return;
	if (deep == 63) {
		ve.push_back(x);
		return;
	}
	rep(i, 0, 1) solve(deep + 1, (x << 1) | i, sum + i);
}
2024/5/31 14:33
加载中...