51Nod 1031 骨牌覆盖

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <stdio.h>
 4 #include <cstring>
 5 using namespace std;
 6 #define ll long long
 7 const int mod = 1e9+7;
 8 ll a[10001];
 9 void lala()
10 {
11     a[1]=1;
12     a[2]=2;
13     for(int i=3;i<10001;i++){
14         a[i]=a[i-1]%mod+a[i-2]%mod;
15         a[i]%=mod;
16     }
17 }
18 int main()
19 {
20     int n;
21     cin>>n;
22     lala();
23     ll m=a[n];
24     cout<<m<<endl;
25     return 0;
26 }