baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-27 16:56:26 +00:00
Code Releases Activity

P1755 斐波那契的拆分

Browse Source 
R41206075
This commit is contained in:
Baoshuo Ren 2020-11-04 10:40:55 +08:00 committed by Baoshuo Ren
parent 173cae28de
commit 1abfdaa2f0
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 32 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
problem/P1755/P1755.cpp Normal file
View File

@ -0,0 +1,32 @@
#include<bits/stdc++.h>
using namespace std;
const int fib[] = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170};
int main() {
int t, n;
cin >> t;
while(t--) {
stack<int> st;
cin >> n;
cout << n << "=";
for(int i = 45 ; i > 0 ; i--) {
while(n >= fib[i]) {
n -= fib[i];
st.push(fib[i]);
}
if(n == 0) {
break;
}
}
cout << st.top();
st.pop();
while(!st.empty()) {
cout << "+" << st.top();
st.pop();
}
cout << endl;
}
return 0;
}