이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 |
---|
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... |