题解 | 斐波那契数列
斐波那契数列
https://www.nowcoder.com/practice/c245af6cfdce49ceb5435f649ee14f89
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10,MOD=1e9+7;
int f[N],k;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>k;
f[1]=1;f[2]=1;
for(int i=3;i<=k;i++){
f[i]=(f[i-1]%MOD+f[i-2]%MOD)%MOD;
}
cout<<f[k]<<endl;
return 0;
}