Submission #1176991

---

Source Code Expand

import random
import copy
def gcd(a, b):
	while b:
		a, b = b, a % b
	return a

def gcdm(x):
	g=x[0]
	for i in range(1,len(x)):
		g=gcd(g,x[i])
	return(g)
def candi(x):
	d=dict()
	for i in range(len(x)):
		d[x[i]]=i
	y=list(d.values())
	return(y)
def sto(N,AAA,tryno,isFirst=True):
	AA=copy.deepcopy(AAA)
	ply=0
	moves=[]
	moves_win=[]
	
	if max(AA)<=1: 	return(0,0,True)
	cAA=candi(AA)
	for j in cAA:
		if AA[j]>1:
			win=0
			
			for r in range(tryno):
				A=copy.deepcopy(AA)
				ply=1
				A[j]-=1
				g=gcdm(A)
				A=[x//g for x in A]
				while max(A)>1 and min(A)>1:
					ca=candi(A)
					i=ca[random.randint(0,len(ca)-1)]
					if A[i]>1:
						ply+=1
						A[i]-=1
						g=gcdm(A)
						A=[x//g for x in A]
				ply+=sum(A)-N
				if (ply %2==0)!=isFirst:win+=1
				
			moves.extend([j])
			moves_win.extend([win])
		
	if isFirst:
		player='First'
		ans=max(moves_win)
	else:
		player='Second'
		ans=min(moves_win)
	selected=moves[moves_win.index(ans)]
	#print(AAA)
	#print(cAA)
	#print(moves_win,player,selected)
	
	AAA[selected]-=1
	g=gcdm(AAA)
	AAA=[x//g for x in AAA]
	#print(AAA)
	return([selected,ans,False,AAA])



N=int(input())
AAA=[int(x) for x in input().split()]


tryno=100
F=[]
isFirst=True
while max(AAA)>1 and min(AAA)>1:
	y=sto(N,AAA,tryno,isFirst)
	if y[2]: break
	F.extend([y[0]])
	isFirst=(isFirst!=True)
	AAA=y[3]

judge=len(F)+sum(AAA)-N

if judge%2==1:
	print('First')
else:
	print('Second')

	

Submission Info

Judge Result