#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<=k;x++) win[0][x]=1;
for (int x=1;x<=a;x++){
for (int y=1;y<=k;y++){
if (x==k) win[x][y]=1;
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 |
1 |
Correct |
8 ms |
348 KB |
Output is correct |
2 |
Correct |
8 ms |
460 KB |
Output is correct |
3 |
Correct |
11 ms |
460 KB |
Output is correct |
4 |
Correct |
8 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
89 ms |
1008 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |