Funfunfunfun's blog

Count of ways in which N can be represented as sum of Fibonacci numbers without repetition
By Funfunfunfun, history, 4 years ago, In English

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.

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
4 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Can you add a problem link? People often ask for problems from a running contest, so it's good to add a link to the problem.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

It is same as CEOI 18-fib I think. There is explanation here.

→ Reply