BMS1988 - Fibonacci factorization
The Mysterious Affair at Byte Court
Hercule was quietly on hollydays (Noël) at Byte Court when Fibonacci and Lucas (well-dressed) knocked at his door. They came in, and the first one said : "Monsieur, can you factorise my first 1001 terms, please?". Hercule said : "It was useless to come in to ask that, but since you are here, I'll do that very quickly." Then Lucas said : "It's not a speed challenge, we like Styles too, the shorter your code is, the best your score is."
Output
You have to output 1001 lines, the factorization of the 1001 first terms of the Fibonacci sequence. See sample for output details.
Example
F(0)= 0 F(1)= 1 F(2)= 1 F(3)= 2 F(4)= 3 F(5)= 5 F(6)= 2^3 F(7)= 13 F(8)= 3 * 7 F(9)= 2 * 17 F(10)= 5 * 11 F(11)= 89 F(12)= 2^4 * 3^2 [...] F(1000)= 3 * 5^3 * 7 * 11 [...]
hide comments
Francky:
2013-01-21 16:56:24
Congratulations to Robert as the first solver in the way it was designed for. I hope everybody will find this very mysterious : The mysterious Affair at Byte Court. |
|
Francky:
2013-01-20 21:23:50
Congratulations to Mitch as the first solver with a very good score (around 13000), but Hercule did a much better score ; the problem is not over ... Have fun.
|
|
Narendra yadav:
2013-01-20 18:37:19
...computationally very "hard" problem. |
|
Francky:
2013-01-20 13:29:56
@raf : Thanks for the typos. |
|
(Tjandra Satria Gunawan)(曾毅昆):
2013-01-20 13:28:43
wow, another SuperHard problem (-__-)"
|
|
Aditya Pande:
2013-01-20 13:28:43
Python won't help me unless i am able to help myself
|
|
Francky:
2013-01-20 13:28:43
Toc toc toc.
|
Added by: | Francky |
Date: | 2013-01-20 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own problem |