hdu 1005 矩阵快速幂

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define mod 1000000007
#define inf 999999999
//#pragma comment(linker, "/STACK:102400000,102400000")
int scan()
{
    int res =  , ch ;
    while( !( ( ch = getchar() ) >= '' && ch <= '' ) )
    {
        if( ch == EOF ) return  <<  ;
    }
    res = ch - '' ;
    while( ( ch = getchar() ) >= '' && ch <= '' )
        res = res *  + ( ch - '' ) ;
    return res ;
}
struct is
{
    ll a[][];
};
is juzhenmul(is a,is b,ll hang ,ll lie)
{
    int i,t,j;
    is ans;
    memset(ans.a,,sizeof(ans.a));
    for(i=;i<=hang;i++)
    for(t=;t<=lie;t++)
    for(j=;j<=lie;j++)
    {
        ans.a[i][t]+=(a.a[i][j]*b.a[j][t])%;
    }
    return ans;
}
is quickpow(is ans,is a,ll x)
{
    while(x)
    {
        if(x&)  ans=juzhenmul(ans,a,,);
        a=juzhenmul(a,a,,);
        x>>=;
    }
    return ans;
}
int main()
{
    is ans,base;
    ll x,y,z,i,t;
    while(scanf("%lld%lld%lld",&x,&y,&z)!=EOF)
    {
        if(x==&&y==&&z==)break;
        if(z<)
        {printf("1\n");
        continue;}
        memset(ans.a,,sizeof(ans.a));
        ans.a[][]=;
        ans.a[][]=;
        //printf("%lld %lld\n%lld %lld\n",ans.a[1][1],ans.a[1][2],ans.a[2][1],ans.a[2][2]);
        base.a[][]=x;
        base.a[][]=;
        base.a[][]=y;
        base.a[][]=;
        ans=quickpow(ans,base,z-);
        printf("%lld\n",(ans.a[][]+ans.a[][])%);
    }
    return ;
}