整点高级的 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

已经考了不知道多少次了 打表！

#include <iostream> using namespace std; int main(){ int a,cnt; cin>>a; int b[1000]={1,1,2,3,5,8,13,21,34,55}; cout<<b[a-1]; return 0; }

#include <iostream> using namespace std; int dg(int n) { if(n1) return 1; if(n2) return 1; return dg(n-1)+dg(n-2); } int main(){ int n; cin>>n; cout<<dg(n)<<endl; return 0; }

#include <iostream> using namespace std; long long f(int x) { if(x == 1 || x == 2) return 1; else return f(x-1)+f(x-2); } int main(){ int n; cin >> n; cout << f(n); }

#include<iostream> using namespace std; int main(){ int x; cin >> x; switch(x){ case 1: case 2:cout << 1;break; case 3:cout << 2;break; case 4:cout << 3;break; case 5:cout << 5;break; case 6:cout << 8;break; case 7:cout << 13;break; case 8:cout << 21;break; case 9:cout << 34;break; case 10:cout << 55;break; } }

#include<iostream> using namespace std; int main(){ int a,b=1,l=1,c; cin>>a; if(a1||a2){ cout<<"1"; return 0; } for(int i=1;i<=a-2;i++){ c=b+l; l=b; b=c; } cout<<c; return 0; }