ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 388 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
crazyb0y	`11 feb 2008`	C++	2	00.01	43
crazyb0y	`13 feb 2008`	C++	3	00.01	43
crazyb0y	`22 jan 2008`	C++	1	00.01	44
zhuojie	`13 feb 2008`	Python	1	00.06	44
vi002	`17 jul 2007`	Ruby	17	00.02	45
daniel.ugra	`06 jan 2007`	Ruby	3	00.02	46
daniel.ugra	`06 jan 2007`	Ruby	2	00.02	49
Senya	`01 may 2010`	C++	13	00.01	53
MasterYoda	`04 apr 2009`	C++	10	00.01	54
Qsky	`08 nov 2006`	FPC	2	00.01	55
NDAT	`08 nov 2006`	FPC	2	00.01	55
Skyslars	`08 nov 2006`	FPC	10	00.01	55
Skyslars	`08 nov 2006`	FPC	11	00.01	55
nt_d2	`08 nov 2006`	FPC	28	00.01	55

Languages
C++	216
FPC	105
C	31
Kylix	17
Java	16
Ruby	5
Python	3
Lua	1

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Stone Game II -- who is the winner?

Time limit = 5 seconds

You are to determine the status of a position in Another Stone Game, that has the following rules.

There are k stone piles with n₁, n₂, ... , n_k stones. One is permitted to take any positive number of stones from one pile for a move, but no more than half of the pile.

The one who can't make his move loses.

Input contains the number of piles and their sizes. k < 50, n_i < 100 000.

Output either the string "First wins." or the string "Second wins." (without quotes).

Input#1

3
3 2 1

Output#1

First wins.

Input#2

4
1 3 7 63

Output#2

Second wins.

Author:
Well-known problem. Added by Voroztsov Artem.

<PREV | Problem set | Search related messages | NEXT>