Count of ways in which N can be represented as sum of Fibonacci numbers without repetition

Правка en1, от Funfunfunfun, 2021-01-03 07:04:43

Recently, I had problem: counting ways in which X could be represented as summing Fibonacci numbers without repeating them. With X <= 1e9;and the input has N text with N <= 1e5. Can you give me an idea to solve this problem? thanks for help.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Funfunfunfun 2021-01-03 07:04:43 334 Initial revision (published)