Light OJ 1125 Divisible Group Sums

http://www.lightoj.com/volume_showproblem.php?problem=1125

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 205
#define LL long long
LL dp[N][11][21][21];
LL num[N];
void init(int n)
{
    memset(dp,0,sizeof(dp));
    for(int k=1;k<=20;k++){
        LL c=2100000000;
        LL tmp=(num[1]+k*c)%k;
        dp[1][1][k][tmp]++;
    }
    
    for(LL i=2;i<=n;i++)
    for(LL j=1;j<=min(i,(LL)10);j++)
    for(LL k=1;k<21;k++)
    for(LL l=0;l<k;l++){
        LL c=2100000000;
        LL tmp=(num[i]+k*c)%k;
        if(j==1){
            dp[i][j][k][l]=dp[i-1][j][k][l];
            if(tmp==l)
                dp[i][j][k][l]++;
        }
        else
            dp[i][j][k][l]=dp[i-1][j][k][l]+dp[i-1][j-1][k][(k+l-tmp)%k];
    }
}
int main()
{
    int t,cas=1;
    scanf("%d",&t);
    while(t--){
        int n,q;
        scanf("%d%d",&n,&q);
        for(int i=1;i<=n;i++)
        scanf("%lld",num+i);
        init(n);
        //print(n);
        printf("Case %d:
",cas++);
        while(q--){
            int a,b;
            scanf("%d%d",&a,&b);
            printf("%lld
",dp[n][b][a][0]);
        }
    }
    return 0;
}