省略前导0
AC代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_N = 3;
const int MOD = 10000;
void multipy( int a[MAX_N][MAX_N], int b[MAX_N][MAX_N], int c[MAX_N][MAX_N] ){
for( int i = 1; i <= 2; i++ ){
for( int j = 1; j <= 2; j++ ){
c[i][j] = 0;
for( int k = 1; k <= 2; k++ ){
c[i][j] = ( c[i][j] + a[i][k] * b[k][j] ) % MOD;
}
}
}
}
void get_matrix_pow( int a[MAX_N][MAX_N], int n ){
int ans[MAX_N][MAX_N] = {0};
int temp[MAX_N][MAX_N];
for( int i = 1; i <= 2; i++ ) ans[i][i] = 1;
while( n ){
if( n % 2 == 1 ){
multipy( ans, a, temp );
memcpy( ans, temp, sizeof( int ) * MAX_N * MAX_N );
}
multipy( a, a, temp );
memcpy( a, temp, sizeof( int ) * MAX_N * MAX_N );
n /= 2;
}
memcpy( a, ans, sizeof( int ) * MAX_N * MAX_N );
}
int main(){
int M;
while( scanf( "%d", &M ) && M != -1 ){
if( M == 0 ){
printf( "0\n" );
}else{
int a[MAX_N][MAX_N];
a[1][1] = 1; a[1][2] = 1;
a[2][1] = 1; a[2][2] = 0;
get_matrix_pow( a, M );
printf( "%d\n", a[2][1] );
}
}
return 0;
}