| Submit | All submissions | Best solutions | Back to list |
EVAL - Digits of e |
In this problem you have to find as many digits of E as possible.
Input
There is no input for this problem
Output
Output must contain as many digits of E as possible (max = 1000000)
Score
The score awarded to your program will be the first position of digit where first difference occured.
Example
Output:2.7182
will be awarded with 6 points.
| Added by: | Roman Sol |
| Date: | 2005-03-10 |
| Time limit: | 2.5s |
| Source limit: | 4096B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ERL JS-RHINO |
| Resource: | ZCon |
hide comments
|
||||||
|
2023-07-03 14:53:51 Charlie Yu
Was the machine changed? I resubmitted the same code that got accepted in 2020, now get time limit exceeded |
||||||
|
2022-07-21 00:55:48
100k with java, bang! :) Last edit: 2022-07-21 00:57:12 |
||||||
|
2022-07-20 01:49:47
I got 84697 (2.49 sec) using C++ and boost cpp_int |
||||||
|
2019-10-03 12:44:34
over 21k in java |
||||||
|
2019-05-30 09:19:08
can someone explain the scoring method. What does it mean by first position of digit where the first diff occurred? and how the score in the sample case is 6? |
||||||
|
2018-12-27 20:53:35 Robert Gawron
I got 3677 by just hardcoding the value in source code, my whole program was printf("the digits till I roughly fit to source code requirements"); Would be more challenging if source code limit was lower :) |
||||||
|
2018-12-18 17:45:33
POINTS DEPEND HOW MANY TIMES U CAN USE PRINTF,,,,, |
||||||
|
2018-09-13 08:23:23
What is the best calculation method for this? I used the sum of factorial reciprocals and only got 16325. |
||||||
|
2017-07-07 14:41:03
2002 in c++ |
||||||
|
2017-01-12 15:24:00
2159 in c!! |
||||||
RSS