POJ 3070 Fibonacci

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11210		Accepted: 7970

Description

In the Fibonacci integer sequence, F₀ = 0, F₁ = 1, and F_n = F_{n − 1} + F_{n − 2} for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …

An alternative formula for the Fibonacci sequence is

.

Given an integer n, your goal is to compute the last 4 digits of F_n.

Input

The input test file will contain multiple test cases. Each test case consists of a single line containing n (where 0 ≤ n ≤ 1,000,000,000). The end-of-file is denoted by a single line containing the number −1.

Output

For each test case, print the last four digits of F_n. If the last four digits of F_n are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print F_n mod 10000).

Sample Input

0
9
999999999
1000000000
-1

Sample Output

0
34
626
6875

Hint

As a reminder, matrix multiplication is associative, and the product of two 2 × 2 matrices is given by

.

Also, note that raising any 2 × 2 matrix to the 0th power gives the identity matrix:

.

Source

Stanford Local 2006

#include <cstdio>
#include <cstring>

const int N = 100;
const int MOD = 10000;

struct matrix{
	int ary[2][2];
	void init() {
		memset(ary, 0, sizeof(ary));
	}
	matrix() {
		init();
	}
	
};

const matrix operator*(const matrix & A, const matrix & B) {
	matrix t;

	for (int i = 0; i < 2; ++i)
		for (int j = 0; j < 2; ++j) {
			for (int k = 0; k < 2; ++k)
				t.ary[i][j] += A.ary[i][k] * B.ary[k][j];
			t.ary[i][j] %= MOD;
		}

	return t;
}

int quick_pow(int k) {
	matrix ans, tmp;

	for (int i = 0; i < 2; ++i)
		for (int j = 0; j < 2; ++j) {
			if (i == j) ans.ary[i][j] = 1;
			else ans.ary[i][j] = 0;

			if (i + j < 2) tmp.ary[i][j] = 1;
			else tmp.ary[i][j] = 0;
		}

	while (k) {
		if (k & 1)
			ans = ans * tmp;
		k >>= 1;
		tmp = tmp * tmp;
	}

	return ans.ary[0][0];
}

int main() {
	int T;

	while (~scanf("%d", &T), T != -1) {
		if (T == 0)
			puts("0");
		else
			printf("%d\n", quick_pow(T - 1));
	}

	return 0;
}