QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #487945 | #6642. (1, 2) Nim | ucup-team052# | WA | 5ms | 3812kb | C++14 | 536b | 2024-07-23 13:46:23 | 2024-07-23 13:46:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int a[N],n;
void work()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
if(n>=4) printf("Grundy\n");
else if(n==3)
{
sort(a+1,a+n+1);
if(a[1]==1&&a[2]==1&&a[3]>1) printf("Sprague\n");
else printf("Grundy\n");
}
else if(n==2) printf("Grundy\n");
else if(n==1) printf("Sprague\n");
}
int main() {
#ifdef xay5421
freopen("a.in","r",stdin);
#endif
int T;
scanf("%d", &T);
while (T--) {
work();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3812kb
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: 5ms
memory: 3772kb
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 Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy...
result:
wrong answer 22nd lines differ - expected: 'Sprague', found: 'Grundy'