SQRT2 - 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.
Input
There is no input for this problem
Output
The output must contain as many digits of the square root of 2 as possible (max = 2000000)
Score
The score awarded to your program will be the first position of the digit where the first difference occurs.
Example
Output:1.41421356237309504
will be awarded with 19 points.
hide comments
|
_R0b_:
2015-04-28 22:33:00
i got max score 40002 after that time limit exceed |
|
Min_25:
2015-04-26 20:19:32
@numerix
|
|
numerix:
2015-04-26 20:16:50
@Min_25: Great! |
|
Mitch Schwartz:
2014-12-06 00:41:03
See also SQR2_VAL on the CONSTANT contest. |
|
Vikesh_Tiwari:
2014-03-29 14:45:40
got 9995 points...what does it mean? |
|
sridhar:
2013-11-09 10:54:17
what will happen if i write cout"1.41421356237309504"? |
|
shally:
2013-03-02 14:10:30
ac in first attempt |
|
:):
2012-06-13 07:28:21
hey i am getting only 17.....using %lf
|
|
Aditya Pande:
2012-05-09 05:07:50
Last edit: 2012-07-23 12:49:49 |
|
:D:
2009-09-09 13:08:07
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! |
| Added by: | Roman Sol |
| Date: | 2007-01-07 |
| Time limit: | 2.75s |
| Source limit: | 4096B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: CLPS LISP sbcl LISP clisp ERL JS-RHINO NODEJS PERL6 VB.NET |
| Resource: | ZCon 2007 |
RSS