#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k, a[N];
int get(int cur = 1){
if (k < cur) return 0;
long long sm = 0;
for (int i = 0; i < n; i ++)
sm += (a[i]);
if (sm % 2) return 1;
for (int i = 0; i < n; i ++)
a[i] /= 2;
return get(cur * 2);
}
void solve(){
cin >> n >> k;
for (int i = 0; i < n; i ++)
cin >> a[i];
cout << get();
}
int main(){
ios::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... |