[UVA12063] Zeros and Ones && 数位DP

枚举1的个数就行了.....

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
const int MAXN = 70;
const int MAXK = 100;
LL d[MAXN+10][MAXN * 2 + 10][MAXK+10], mod[MAXN+10];
LL n, K;
LL dp(int cur, int O, int MOD)
{
	if(cur == 0) {
		if(O) return 0;
		return d[cur][O][MOD] = ((MOD % K == 0) ? 1 : 0);
	}
	if(d[cur][O][MOD] != -1) return d[cur][O][MOD];
	LL &ans = d[cur][O][MOD];
	
	ans = dp(cur-1, O, MOD);
	if(O > 0) ans += dp(cur-1, O-1, (MOD - mod[cur] + K) % K);
	return ans;
}
void init()
{
	mod[1] = 1;
	for(int i = 2; i <= MAXN; i++) mod[i] = (mod[i-1] << 1) % K;
}
int main()
{
	int T, kase = 1; for(SF("%d", &T); kase <= T; kase++) {
		memset(d, -1, sizeof(d));
		cin >> n >> K;
		PF("Case %d: ", kase);
		if(K == 0 || (n & 1)) { cout << 0 << '\n'; continue; }
		init();
		LL ans = dp(n-1, (n-1) / 2, (K - mod[n]) % K);
		cout << ans << '\n';
	}
}