斐波那契数列,状态表达式 a[i]=a[i-1]+a[i-3]
#include<iostream> using namespace std; const int maxn = 110; int a[maxn] = { 1,2,3,4 }; void init() { for (int i = 4;i < maxn;i++) { a[i] = a[i - 1] + a[i - 3]; } } int main() { init(); int n; while (cin >> n && n != 0) { cout << a[n-1] << endl; } return 0; }