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;
int n;
bool calc(vector<int> haha, int k) {
int sb = 0;
for(int i = 0; i < n; i++) {
sb+=haha[i];
}
if(sb%2 == 1) {
return 1;
}
if(k == 1) {
return 0;
}
for(int i = 0; i < n; i++) {
haha[i]/=2;
}
return calc(haha,k/2);
}
void solve() {
int k;
cin >> n >> k;
vector<int> haha(n);
for(int i = 0; i < n; i++) {
cin >> haha[i];
}
if(calc(haha,k)) {
cout << 1;
}
else {
cout << 0;
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) {
solve();
}
return 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... |