File size: 931 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 | #include <iostream>
#include <unordered_set>
using namespace std;
int num[10002];
int N, K;
unordered_set<int> proc(int ini, int fin) {
if (ini < fin) {
unordered_set<int> s1 = proc(ini, (ini + fin)/2), s2 = proc((ini + fin)/2 + 1, fin), r;
for (auto it1 = s1.begin(); it1 != s1.end(); ++it1) {
for (auto it2 = s2.begin(); it2 != s2.end(); ++it2) {
r.insert((*it1 + *it2)%K);
r.insert((*it1 - *it2 + K)%K);
}
}
return r;
} else {
unordered_set<int> r;
r.insert(((num[ini]%K)+K)%K);
return r;
}
}
int main() {
int M;
cin >> M;
while (M--) {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> num[i];
}
unordered_set<int> r = proc(0, N-1);
if (r.count(0)) printf("Divisible\n");
else printf("Not divisible\n");
}
return 0;
}
|