话说斐波那契数列需要用动态规划吗？

#include <iostream>
#include <vector>
using namespace std;
#define ull unsigned long long
int F(int n) {
 vector<int> dp;
 dp.push_back(0);
 dp.push_back(1);
 for(int i=2;i<n;i++) {
     dp.push_back(dp[0]+dp[1]);
 }
 return dp[n-1];
}
int main() {
 ull n;
 cin>>n;
 ull *a = new ull[n];
 for(ull i=0;i<n;i++)cin>>a[i];
 ull *sum = new ull[n];
 for(ull i=0;i<n;i++) {
     sum[i]=F(a[i]);
 }
 for(ull i=0;i<n;i++)cout<<sum[i]<<endl;
 return 0;
}