zoj 2042 Divisibility

#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std;int n, k;int a[10001];bool rem[10001][101];int main(){    int t;    scanf("%d",&t);    while(t--)    {        int i, j;        scanf("%d%d",&n,&k);        for(i = 0; i < n; i++)        { scanf("%d",&a[i]); a[i] = (a[i] % k + k) % k;         }        memset(rem,0,sizeof(rem));        rem[0][a[0]] = true;        for(i = 1; i < n; i++) for(j = 0; j < k; j++)     if(rem[i-1][j]) rem[i][(j+a[i]+k)%k] = rem[i][(j-a[i]+k)%k] = true;        if(rem[n-1][0]) printf("Divisiblen");        else printf("Not divisiblen");        if(t) printf("n");    }    return 0;}