This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pt;
int n, k, t;
const int maxn = 2e5+5;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> t;
while(t--){
cin >> n >> k;
int pp = 2, sum = 0;
while(!(k&1)){
pp<<=1;
k>>=1;
}
pp--;
for(int i = 0; i < n; i++){
int x;
cin >> x;
sum^=(x&pp);
}
if(sum)cout << 1;
else cout << 0;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |