UVa10036 Divisibility

#include<stdio.h>
#include<string.h>
bool ans[10000][100];
int t[10000];
int main()
{
    //freopen("t.txt","r",stdin);
    int T,n,k,i,j,u,v;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&k);
        memset(ans,0,sizeof(ans));
        for(i=0;i<n;i++){
            scanf("%d",&u);
            t[i]=(k+u%k)%k;
        }
        ans[0][t[0]]=1;
        for(i=1;i<n;i++){
            for(j=0;j<k;j++){
                if(ans[i-1][j]){
                    ans[i][(j+t[i])%k]=1;
                    ans[i][(j-t[i]+k)%k]=1;
                }

            }
        }
        if(ans[n-1][0])printf("Divisible\n");
        else printf("Not divisible\n");

    }
    return 0;
}