<PREV Problem:
NEXT>
Solved by 1225 users: ...
UserDateAttemptTimeCMSC
xtender12 apr 2010Perl1000.101 
sb3ar28 jan 2008Ruby800.0244 
bush03 mar 2006Ruby100.0345 
sb3ar11 jan 2008Ruby700.0246 
sb3ar12 dec 2007Ruby600.0247 
tarc05 oct 2009Python400.1947 
skim177603 jul 2011Ruby100.0349 
s01A0614 mar 2011C2600.0150 
s01A0614 mar 2011C2900.0150 
xtender12 apr 2010Perl800.0650 
xtender12 apr 2010Perl900.0650 
s01A0614 mar 2011C2200.0151 
s01A0614 mar 2011C2400.0151 
fetetriste23 nov 2007C++300.0251 
Nakilon08 jan 2010Ruby700.1451 
yuyang722 apr 2009Scheme100.3351 
Serik14 mar 2005FPC1?.??51 
fetetriste23 nov 2007C++200.0152 
Nakilon08 jan 2010Ruby1100.0952 
tarc05 oct 2009Python300.1652 
Languages
C++
580
FPC
273
C
229
Java
70
Kylix
54
Ruby
16
Python
14
Scheme
4
Lua
3
Perl
3
Haskell
2
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 

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
4
Output#1
3
Input#2
15
Output#2
6
Input#3
59
Output#3
9

Author:
Voroztsov Artem, IV MIPT Contest

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


© acm.mipt DevGroup
The page was generated in 190ms

SW soft NIX
ID = 35.172.195.82