QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #134892 | #6642. (1, 2) Nim | salvator_noster# | WA | 7ms | 1700kb | C++14 | 516b | 2023-08-05 09:46:58 | 2023-08-05 09:47:00 |
Judging History
answer
#include <stdio.h>
using namespace std;
int main() {
int T;
scanf("%d", &T);
while (T --) {
int N, cnt1 = 0, cnt2 = 0;
scanf("%d", &N);
for (int i = 1, a; i <= N; i ++) {
scanf("%d", &a);
if (a > 1) cnt2 ++;
else cnt1 ++;
}
if ((cnt1 % 3 == 0 && cnt2 == 1) || (cnt2 == 0 && cnt1 % 3 == 1)) {
printf("Sprague\n");
}else {
printf("Grundy\n");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1588kb
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: 7ms
memory: 1700kb
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 Sprague Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grundy Grund...
result:
wrong answer 65th lines differ - expected: 'Sprague', found: 'Grundy'