【poj3070】Fibonacci

include

include

using namespace std;

const int M=10000;

struct Matrix{ 
int a[2][2]; 
Matrix operator *(const Matrix& tmp){ 
Matrix ans; 
memset(ans.a,0,sizeof(ans.a)); 
for( int i=0; i<2; i++) 
for( int j=0; j<2; j++ ) 
for( int k=0; k<2; k++) 
ans.a[i][j]=(ans.a[i][j]+a[i][k]*tmp.a[k][j])%M; 
return ans; 
} 
};

int quick_pow( Matrix b, int n ) { 
Matrix ans; 
ans.a[0][0]=ans.a[1][1]=1; 
ans.a[0][1]=ans.a[1][0]=0;

while( n )
{
    if( n%2 )
      ans=ans*b;
    b=b*b;
    n=n/2;  
}
return ans.a[0][1];
}

int main(){ 
int n; 
Matrix base; 
base.a[0][0]=base.a[0][1]=base.a[1][0]=1; 
base.a[1][1]=0; 
while(~scanf(“%d”,&n)) 
{ 
if( n==-1 ) 
break; 
printf(“%d\n”,quick_pow(base,n));

}

return 0;
}