QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#846722#9481. Min NimSanya#RE 0ms0kbPython3238b2025-01-07 12:46:102025-01-07 12:46:11

Judging History

This is the latest submission verdict.

  • [2025-01-07 12:46:11]
  • Judged
  • Verdict: RE
  • Time: 0ms
  • Memory: 0kb
  • [2025-01-07 12:46:10]
  • Submitted

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

result: