ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

<PREV Problem:

Solved by 859 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
xtender	`12 apr 2010`	Perl	10	00.10	1
sb3ar	`28 jan 2008`	Ruby	8	00.02	44
bush	`03 mar 2006`	Ruby	1	00.03	45
sb3ar	`11 jan 2008`	Ruby	7	00.02	46
sb3ar	`12 dec 2007`	Ruby	6	00.02	47
tarc	`05 oct 2009`	Python	4	00.19	47
xtender	`12 apr 2010`	Perl	8	00.06	50
xtender	`12 apr 2010`	Perl	9	00.06	50
fetetriste	`23 nov 2007`	C++	3	00.02	51
Nakilon	`08 jan 2010`	Ruby	7	00.14	51
yuyang7	`22 apr 2009`	Scheme	1	00.33	51
Serik	`14 mar 2005`	FPC	1	?.??	51
fetetriste	`23 nov 2007`	C++	2	00.01	52
Nakilon	`08 jan 2010`	Ruby	11	00.09	52
tarc	`05 oct 2009`	Python	3	00.16	52
david_it21	`15 apr 2008`	Ruby	2	00.23	52
lite	`19 dec 2007`	Scheme	1	00.32	52
Nakilon	`08 jan 2010`	Ruby	9	00.09	53

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Operations

Time limit = 5 second(s)

Memory limit = 8 Mb

You can perform the following operations.

The number i is integer. Find the minimal number of operations to get 0.

Input Integer 0 ≤ N ≤ 2000000

Input#1

Output#1

Input#2

Output#2

Input#3

Output#3

Author:
Voroztsov Artem, IV MIPT Contest