HDU 2020 Multi-University Training Contest 8 杭电2019多校联合训练赛 第八场 1006 The Oculus (6768)
Problem Description
Let’s define the Fibonacci sequence F1,F2,… as F1=1,F2=2,Fi=Fi−1+Fi−2 (i≥3).
It’s well known that every positive integer x has its unique Fibonacci representation (b1,b2,…,bn) such that:
· b1×F1+b2×F2+⋯+bn×Fn=x.
· bn=1, and for each i (
原创
2020-07-23 23:27:20 ·
261 阅读 ·
0 评论