#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define int long long
#define endl "\n"
const int N = 1e5;
int num[N + 1];
void solve() {
int n,k;
cin>>n>>k;
for(int i = 1;i <= n;i++) {
cin>>num[i];
}
for(int i = 0;(1<<i) <= k;i++) {
int sum = 0,tmp = 1<<i;
for(int j = 1;j <= n;j++) {
sum += (num[j]/tmp);
}
if(sum%2) {
cout<<1;
return;
}
}
cout<<0;
}
signed main() {
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int t;
cin>>t;
while(t--) solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
468 KB |
Output is correct |
2 |
Correct |
12 ms |
484 KB |
Output is correct |
3 |
Correct |
10 ms |
468 KB |
Output is correct |
4 |
Correct |
11 ms |
484 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
340 KB |
Output is correct |
2 |
Correct |
8 ms |
336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
520 KB |
Output is correct |
2 |
Correct |
19 ms |
340 KB |
Output is correct |
3 |
Correct |
21 ms |
596 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
32 ms |
340 KB |
Output is correct |
2 |
Correct |
33 ms |
400 KB |
Output is correct |
3 |
Correct |
32 ms |
492 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
488 KB |
Output is correct |
2 |
Correct |
12 ms |
488 KB |
Output is correct |
3 |
Correct |
12 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
468 KB |
Output is correct |
2 |
Correct |
15 ms |
484 KB |
Output is correct |
3 |
Correct |
22 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
484 KB |
Output is correct |
2 |
Correct |
20 ms |
488 KB |
Output is correct |