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;
typedef long long int ll;
int win[109][109];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t,n,k,a;
cin >> t;
while(t--){
cin >> n >> k;
if (n==1){
cin >> a;
for (int x=0;x<=a;x++){
for (int y=0;y<=k;y++) win[x][y] = 0;
}
for (int x=0;x<=k;x++) win[1][x]=1;
for (int x=2;x<=a;x++){
for (int y=1;y<=k;y++){
for (int z=1;z<=y;z++){
if (win[x-z][z]) win[x][y]=1;
}
}
}
cout << win[a][k];
}
ll suma=0;
for (int x=0;x<n;x++){
cin >> a;
suma+=a;
}
cout << suma%2LL;
}
cout << '\n';
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... |