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 a[100001];
int n, k;
bool ok ()
{
int sum = 0;
for (int i=1; i<=n; i++)
sum += a[i] % 2, sum &= 1;
return sum;
}
void solve()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
cin >> a[i];
if (ok())
{
cout << 1;
return;
}
while (k > 1)
{
for (int i=1; i<=n; i++)
a[i] /= 2;
k /= 2;
if (ok())
{
cout << 1;
return;
}
}
cout << 0;
}
int main()
{
ios_base::sync_with_stdio(false);
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... |