uva10036.cpp

/*
Author: Golam Rahman Tushar
........Aust Cse 27th batch.........
*/

//{ Template

//{ C-headers
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <cctype>
#include <cassert>
#include <ctime>
//}
//{ C++-headers
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <utility>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>

using namespace std;
//}

//}
//{ Floating-points
#define EPS DBL_EPSILON
#define abs(x) (((x) < 0) ? - (x) : (x))
#define zero(x) (abs (x) < EPS)
#define equal(a,b) (zero ((a) - (b)))
#define PI 2 * acos (0.0)
//}

#define INF 1<<29
#define ll long long

template <typename T>
std::string to_string(T const& value) {
    stringstream sstr;
    sstr << value;
    return sstr.str();
}
//}

template <class T> T gcd(T a,T b){if(b==0) return a;else return gcd(b,a%b);}
template <class T> T lcm(T a,T b){return (a*b)/gcd(a,b);}
template <class T> T power( T a, T b){if(b==0) return 1; T x=a;for(T i=2;i<=b;i++) a=a*x;return a;}
template <class T> T BigMod(T a,T b,T c){if(a==0) return 0;if(b==0) return 1;if(b%2==0){T x=BigMod(a,b/2,c)%c;return (x*x)%c;}else return  ((a%c)*BigMod(a,b-1,c)%c)%c;}

bool dp[10000+7][100+7], vis[10000+7][100+7];
int n, k, arr[10000+7];

bool solve(int idx, int val)
{
    if(idx>=n) {
        if(val==0) return true;
        return false;
    }
    if(vis[idx][val]) return dp[idx][val];

    vis[idx][val] = true;
    return dp[idx][val] = solve(idx+1,abs(val+arr[idx])%k)|solve(idx+1,abs(val-arr[idx])%k);
}

int main ()
{
    int t, i;
    scanf("%d",&t);

    while(t--) {
        scanf("%d %d",&n,&k);
        for(i=0;i<n;i++) scanf("%d",&arr[i]);
        memset(vis,0,sizeof(vis));

        if(solve(0,0)) printf("Divisible\n");
        else printf("Not divisible\n");
    }
    return 0;
}