POJ 3070

数位dp不会，所以来刷水题找感觉

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)			memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 111;
const int mod = 10000;

int f[maxn][2][2];
int a[2][2];
int b[2][2];

void init()
{
	f[0][0][0]=0;
	f[0][0][1]=1;
	f[0][1][0]=1;
	f[0][1][1]=1;
	for(int i=1;i<50;i++)
	{
		f[i][0][0]=f[i-1][0][0]*f[i-1][0][0]+f[i-1][0][1]*f[i-1][1][0];
		f[i][0][0]%=mod;
		f[i][0][1]=f[i-1][0][0]*f[i-1][0][1]+f[i-1][0][1]*f[i-1][1][1];		
		f[i][0][1]%=mod;
		f[i][1][0]=f[i-1][1][0]*f[i-1][0][0]+f[i-1][1][1]*f[i-1][1][0];
		f[i][1][0]%=mod;
		f[i][1][1]=f[i-1][1][0]*f[i-1][0][1]+f[i-1][1][1]*f[i-1][1][1];
		f[i][1][1]%=mod;
	}
	return ;
}

int n;

int find()
{
	MM(a,0);
	a[0][0]=a[1][1]=1;
	for(int i=0;n;i++)	
	{
		if(n&1)
		{
			MM(b,0);
			for(int x=0;x<=1;x++)	
			{
				for(int y=0;y<=1;y++)
				{
					for(int z=0;z<=1;z++)
					{
						b[x][y]+=a[x][z]*f[i][z][y];		
						b[x][y]%=mod;
					}
				}	
			}					
			MC(a,b);
		}	
		n>>=1;
	}	
	return a[0][1];
}

int main()
{
	init();
	while(cin>>n)
	{
		if(n==-1) return 0;
		cout<<find()<<endl;	
	}	
	return 0;
}