51nod 1031 骨牌覆盖

#include <bits/stdc++.h>using namespace std;long long mod=1e9+7;long long f[1010];int main(){long long i,n;f[1]=1;f[2]=2;for(i=3;i<=1000;i++){f[i]=(f[i-1]+f[i-2])%mod;}while(cin>>n){printf("%lld\n",f[n]);}}