SPOJ Problem Set (challenge)

1423. Digits of SQRT(2)

In this task you are to find as many digits of the square root of 2 as possible. You have to make it within the limit of time and source code length.

There is no input for this problem

The output must contain as many digits of the square root of 2 as possible (max = 2000000)

The score awarded to your program will be the first position of the digit where the first difference occurs.

Output:

1.41421356237309504

will be awarded with 19 points.

Added by:	Roman Sol
Date:	2007-01-07
Time limit:	20s
Source limit:	4096B
Languages:	All except: LISP sbcl LISP clisp ERL CLPS TECS JS
Resource:	ZCon 2007


2009-09-09 15:08:07 :D You're score in challenge is based on the relevance to the max score (see point rules under rankings). In case of this problem You would be getting 4096/2000000 of a point!
2009-09-08 23:31:33 David Pěgřímek (Davpe) i think that language "TEXT" shouldn't be allowed, because some people just copy it.