UVA 10036 - Divisibility

///...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include<bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%lld",&a)
#define sf2(a,b) scanf("%lld %lld",&a,&b)
#define sf3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%lld",a)
#define pf2(a,b) printf("%lld %lld",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld",a,b,c)
#define nl printf("\n")
#define   timesave              ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define pb push_back
#define MPI map<int,int>mp;
#define fr(i,n) for(i=0;i<n;i++)
#define fr1(i,n) for(i=1;i<=n;i++)
#define frl(i,a,b) for(i=a;i<=b;i++)
/*primes in range 1 - n
1 - 100(1e2) -> 25 pimes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293 48112959837082048697
*/
//freopen("Input.txt","r",stdin);
//freopen("Output.txt","w",stdout);
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
long n,k,arr[10000+5];
int dp[100+5][10000+5];
vector<long>v1;
vector<long>v2;
bool func(int sum, int position)
{
    bool check=false;
    sum=((sum%k)+k)%k;
    if(position==n)
    {
        if(sum==0)
            return true;
        else
            return false;
    }
    if(dp[sum][position]!=-1)
        return dp[sum][position];
    check=check | func(sum+arr[position],position+1);
    check=check | func(sum-arr[position],position+1);
    v1.push_back(sum);
    v2.push_back(position);
    return dp[sum][position]=check;
}
int main()
{
    long tc,i;
    cin>>tc;
    memset(dp,-1,sizeof(dp));
    while(tc--)
    {
        v1.clear();
        v2.clear();
        cin>>n>>k;
        for(i=0; i<n; i++)
            cin>>arr[i];
        bool ans=func(arr[0],1);
        if(ans)
            cout<<"Divisible"<<endl;
        else
            cout<<"Not divisible"<<endl;
        long l=v1.size();
        for(i=0; i<l; i++)
            dp[v1[i]][v2[i]]=-1;

    }
    return 0;
}