大水题,大水题
#include<iostream>
using namespace std;
const int mod=9997;
int ans[10000];
int d[10000],e[10000];
int n;
int main()
{
d[1]=e[1]=1;
d[2]=e[2]=2;
for (int i=3; i<10000; i++)
{
d[i]=(d[i-1]+e[i-2])%mod;
e[i]=(d[i-1]+e[i-1])%mod;
}
for (int i=1; i<10000; i++) ans[i]=(d[i]+e[i])%mod;
while (cin >> n,n!=-1)
{
cout << ans[n] << endl;
}
return 0;
}