#include<iostream> using namespace std; int main() { long long a,f[61]; cin>>a; f[1]=1,f[2]=2; for(int i=3;i<=a;i++) { f[i]=f[i-1]+f[i-2]; } cout<<f[a]; return 0; }

就是骨牌铺法

#include<bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; long long a[70] = {}; a[1] = 1, a[2] = 2; for(int i = 3; i <= n; i++) { a[i] = a[i - 1] + a[i - 2]; } cout << a[n]; return 0; }

#include<iostream> using namespace std; int main(){ long long a,f[61]; cin>>a; f[1]=1,f[2]=2; for(int i=3;i<=a;i++){ f[i]=f[i-1]+f[i-2]; } cout<<f[a]; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ long long qb[61]; int n; cin>>n; qb[1]=1; qb[2]=2; for(int i=3;i<=n;i++) qb[i]=qb[i-1]+qb[i-2]; cout<<qb[n]<<endl; return 0; }