QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #213234 | #6642. (1, 2) Nim | solemntee | WA | 6ms | 3632kb | C++17 | 633b | 2023-10-14 13:16:52 | 2023-10-14 13:16:52 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int T;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
vector<int>a(n+1);
int maxx=0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
maxx=max(maxx,a[i]);
}
if(maxx==1&&n%3==1)printf("Sprague\n");
else if(n==1){
printf("Sprague\n");
}else if(n!=3){
printf("Grundy\n");
}else{
if(a[1]==1&&a[2]==1&&a[3]!=1)printf("Sprague\n");
else if(a[1]==1&&a[3]==1&&a[2]!=1)printf("Sprague\n");
else if(a[2]==1&&a[3]==1&&a[1]!=1)printf("Sprague\n");
else printf("Grundy2\n");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3588kb
input:
3 2 1 2 1 5 4 1 7 2 9
output:
Grundy Sprague Grundy
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 6ms
memory: 3632kb
input:
11337 9 4 1 2 3 2 4 3 2 3 10 1 7 1 5 1 2 2 2 1 3 9 1 3 7 3 3 1 1 3 2 12 1 1 2 4 1 2 2 4 2 2 1 4 15 1 3 4 3 1 2 1 4 1 1 1 1 1 1 1 8 3 3 2 2 3 9 1 2 10 2 2 2 2 1 5 1 2 7 2 10 2 2 2 3 2 2 3 5 2 2 7 2 2 6 2 2 3 5 10 1 1 1 3 1 1 1 5 1 1 8 2 2 2 2 5 2 10 1 5 3 10 1 3 1 8 3 4 2 2 1 1 11 1 6 6 4 8 2 4 2 10 ...
output:
Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy2 Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy2 Grundy Grundy Grundy Grundy Grundy Grundy Grun...
result:
wrong answer 22nd lines differ - expected: 'Sprague', found: 'Grundy'