蓝桥杯_递归_4.9斐波那契数列#include<iostream>#include<vector>using namespace std;int main(){ int n; cin >> n; vector<int>v; v.push_back(0); v.push_back(1); for(int i=2;i<=n;i++){ v.push_back(v[i-1]+v[i-2]); } cout << v[n]%10007 << endl; return 0;}