File size: 3,700 Bytes
c4b0eef |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 |
/*
Author : Shipu Ahamed (Psycho Timekiller)
Facebook : http://facebook.com/DeesheharaShipu
*/
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cctype>
#include<cstdio>
#include<string>
#include<sstream>
#include<cstring>
#include<cstdlib>
#include<fstream>
#include<iterator>
#include<iostream>
#include<algorithm>
using namespace std;
#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()
//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)
//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)
#define CP(a) cout<<a<<endl
#define CPN(a) cout<<a<<" "
#define ff first
#define se second
#define pb push_back
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define abs(x) (((x)<0)?-(x):(x))
#define cover(a,d) memset(a,d,sizeof(a))
#define popcount(i) __builtin_popcount(i) //count one. in long long use __builtin_popcountll(i)
#define parity(i) __builtin_parity(i) //evenparity 0 and odd parity 1
#define btz(a) __builtin_ctz(a) //count binary trailling zero
#define ST(v) sort(all(v))
#define un(v) ST(v), (v).erase(unique(all(v)),v.end())
#define common(a,b) ST(a), ST(b), a.erase(set_intersection(all(a),all(b),a.begin()),a.end())
#define uncommon(a,b) ST(a), ST(b), a.erase(set_symmetric_difference(all(a),all(b),a.begin()),a.end())
typedef long long ll;
typedef unsigned long long ull;
template <typename T>string toString( T Number ){stringstream st;st << Number;return st.str();}
int SOD(int n) {int sum=0;for(int i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}
//File input/output
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
//upper bound and lower bound
#define LB(a,value) (lower_bound(all(a),value)-a.begin())
#define UB(a,value) (upper_bound(all(a),value)-a.begin())
//Test Case & New line
#define Case(no) printf("Case %d: ",++no)
#define nl puts("")
int stringconvert(string s){int p; istringstream st(s); st>>p ; return p;}
ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}
////============ CONSTANT ===============////
#define inf 1<<30 //infinity value
#define eps 1e-9
#define mx 10010
#define mod 1000000007
////=====================================////
int a[mx],dp[mx][203],n,k;
bool solve(int i,int sum)
{
if(i==n)
{
if(sum%k==0)
{
return 1;
}
else
return 0;
}
if(dp[i][sum]!=-1)
return dp[i][sum];
return dp[i][sum]=(solve(i+1,(sum+a[i])%k)|solve(i+1,(sum-a[i])%k));
}
int main()
{
int t;
si(t);
while(t--)
{
sii(n,k);
cover(dp,-1);
for(int i=0;i<n;i++)
{
si(a[i]);
}
// P(solve(1,a[0]));
if(solve(1,a[0]%k))
{
puts("Divisible");
}
else
{
puts("Not divisible");
}
}
return 0;
}
|