This hole is experimental, no solutions will be saved. Please leave feedback on the GitHub issue.

Zeckendorf Representation


Every natural number can be written uniquely as the sum of Fibonacci numbers in a way that avoids using consecutive Fibonacci numbers. For example, 10 = 8 + 2, and 64 = 55 + 8 + 1. This sum is called the Zeckendorf representation.

Print the Zeckendorf representation for each input argument. Terms should be listed in decreasing order separated by ' + '. For example, input 10 should produce 8 + 2.

0 bytes, 0 chars
Restore solution
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Zeckendorf Representation?

If you have seperate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.