| Submeter | Todas submissőes | Melhores | Voltar |
|
Problem hidden
PHIVAL - Digits of Phi (Golden Ratio) |
Calculate as many digits of the Golden Ratio φ ((1+5^0.5)/2) as possible but at least 1000 after the decimal point. More then 1000000 digits won't enhance the score. In addition try to shorten your code.
Input
None
Output
1.61803398874989484...
Score
Speed and code length should be rated similarly. Though it must be difficult that's an attempt:
Score = min(1000000, (number of correct digits)) + 15000000 / (source length)
| Adicionado por: | HWK |
| Data: | 2011-03-30 |
| Tempo limite: | 2.098s |
| Tamanho do fonte: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Linguagem permitida: | Todas exceto: ASM64 CLOJURE ERL FSHARP PERL6 PY_NBC SCALA TCL |