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 647 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
V.A.KeRneL	`21 nov 2006`	Ruby	1	00.02	12
814_Vadik	`22 may 2009`	Ruby	4	00.02	15
kil	`10 jul 2007`	Ruby	13	00.02	19
kil	`10 jul 2007`	Ruby	14	00.02	19
kil	`08 jul 2007`	Ruby	11	00.02	20
814_Vadik	`22 may 2009`	Ruby	3	00.02	21
kil	`10 jul 2007`	Ruby	16	00.02	21
kil	`07 jul 2007`	Ruby	10	00.02	22
fetetriste	`10 apr 2007`	Ruby	3	00.01	30
patronus	`27 apr 2007`	Python	2	00.06	33
Vego	`29 oct 2006`	Python	5	00.06	34
david_it21	`15 apr 2008`	Ruby	1	00.02	37
karthiekc	`28 oct 2007`	Ruby	20	00.02	37
karthiekc	`28 oct 2007`	Ruby	21	00.02	37
abortmozga.ru	`03 jul 2010`	C++	5	00.01	38
Vego	`27 oct 2006`	Python	4	00.06	38
JohnJones_001	`22 jun 2006`	Python	3	00.06	39

Languages
C++	262
FPC	224
C	87
Kylix	39
Java	30
Ruby	12
Python	8
Lua	1
Perl	1

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Circle Game

Time limit = 1

Let's consider circle game. From N children, numbered 1, 2, ..., N, standing in circle every M-th is going to be removed from circle and only the last child will be the winner. For example when N = 6 and M = 5 then the children will be removed in the order 5, 4, 6, 2, 3 and 1 will be winner.

There are two teams playing the game. Each team consists of K children. In the circle the first K children are from the first team and the last K children from the second one. You have to determine such minimal M that all the players of the second team will be removed before the children of the first team.

Input The input consists of one line, containing K. 0 < K < 14.

Output The output should contain M.

Input#1

Output#1

Author:
Student olympiad in Khmelnitski, March 2003
24 april 2003

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