UVa12063 Zeros and Ones

神坑 1竟然还要取模

在后面填数多好的

 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<iostream>

 using namespace std;

 void setIO(const string& s) {
     freopen((s + ".in").c_str(), "r", stdin);
     freopen((s + ".out").c_str(), "w", stdout);
 }
 template<typename Q> Q read(Q& x) {
     static char c, f;
     for(f = ; c = getchar(), !isdigit(c); ) if(c == '-') f = ;
     for(x = ; isdigit(c); c = getchar()) x = x *  + c - '';
     if(f) x = -x;
     return x;
 }
 template<typename Q> Q read() {
     static Q x; return read(x);
 }

 typedef long long LL;
 LL f[][][];

 LL dp(int n, int p) {
     if(!p || (n & )) return ;
     memset(f, , sizeof f);
     f[][][ % p] = ;
     for(int i = ; i < n; i++) {
         for(int j = ; j <= i; j++) {
             for(int k = ; k < p; k++) {
                 f[i + ][j][(k << ) % p] += f[i][j][k];
                 f[i + ][j + ][(k <<  | ) % p] += f[i][j][k];
             }
         }
     }
     return f[n][n / ][];
 }

 int main() {
 #ifdef DEBUG
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w", stdout);
 #endif

     int T = read<int>(), n, k;
     for(int cas = ; cas <= T; cas++) {
         read(n), read(k);
         printf("Case %d: %lld\n", cas, dp(n, k));
     }

     return ;
 }