QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #846722 | #9481. Min Nim | Sanya# | RE | 0ms | 0kb | Python3 | 238b | 2025-01-07 12:46:10 | 2025-01-07 12:46:11 |
Judging History
answer
def solve(n, a):
if n % 2 == 1:
return True
return a.count(max(a)) % 2 == 1
T = int(input())
for _ in range(T):
n = int(input())
a = map(int, input().split())
if solve(n, a):
print('First')
else:
print('Second')
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Dangerous Syscalls
input:
2 3 3 1 4 8 3 1 4 1 5 9 2 6
output:
First