Solved by 929 users: ...
UserDateAttemptTimeCMSC
V.A.KeRneL`13 nov 2006`Ruby200.0212
xtender`27 may 2010`Perl3500.0618
kronos`29 apr 2007`Ruby300.0219
lacrosse`14 apr 2013`Ruby1500.0220
xtender`27 may 2010`Perl3200.0620
tass`21 apr 2007`Ruby100.0221
big-piglet`25 sep 2007`Ruby100.0221
kronos`29 apr 2007`Ruby200.0221
lacrosse`14 apr 2013`Ruby300.0221
lacrosse`14 apr 2013`Ruby700.0221
sb3ar`01 may 2008`Ruby800.0221
Nakilon`27 may 2010`Ruby1200.0221
lacrosse`14 apr 2013`Ruby1200.0221
lacrosse`14 apr 2013`Ruby1300.0221
xtender`27 may 2010`Perl3600.0621
skim1776`03 jul 2011`Ruby100.0222
sb3ar`30 apr 2008`Ruby700.0222
Vego`12 oct 2006`Python300.0622
 C++ 340 FPC 205 Java 143 C 120 Kylix 61 Ruby 43 Python 30 Scheme 8 Haskell 3 Lua 2 Perl 1
` >  >  >  >  >  >  >  >  >  > `

## Anti-factorial

Time limit = 1 second

For any given natural number n the product 1*2*...*n is called n factorial and it is denoted by n!. Given the value of n! for some integer n>=1, your task is to find n.

Input. The single line of the input data contains the value of n!. The number of decimal digits in n! does not exceed 255. Also, the given number does not contain leading zeroes.

Output. Output the single line containing the requested number n.

 Input#1```1 ``` Output#1```1 ```
 Input#2```120 ``` Output#2```5 ```

Author:
ACM ICPC 2005-2006, NEERC, Moscow Subregional Contest
October 23, 2005

 © acm.mipt DevGroupThe page was generated in 200ms