51Nod 1031 骨牌覆盖

#include<iostream>  
#include<queue>  
#include<vector>  
#include<stack>  
#include<algorithm>
#include<cmath> 
#include<set>
using namespace std;  
const int mod=1e9+7;
int main(){
	int n;
	int a[1010]={0};
	a[0]=a[1]=1;
	cin>>n;
	for(int i=2;i<=n;i++) a[i]=(a[i-1]%mod+a[i-2]%mod)%mod;
	printf("%d",a[n]); 
	return 0;
}