A difficult problem

[Quang]

Please help me solve this problem please (sorry for not being of Volume 1):
As we know about Fibonacci number:
F[n]=F[n-1]+f[n-2];
Now: Enter a number S (S can have 200 digits, this is the dificulty!).
Problem: Let present S equivalant sum of leaset numbers of Fibanacci.
Hope you respond as soon as possible!

[Miguel Angel]

Get the first 500 fibonacci numbers(think f(500) will be more than 200 digits) and then use binary search to find your number

[kcph007]

This is not the problem of the algorithm but computation, all you have to do is to do calculating with big numbers ( up to 200 digits).
Find the lastgest Fibo number f smaller than n and do the same problem with n-f.
Good luck