Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11859 | Accepted: 8422 |
Description
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 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 Fn.
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 Fn. If the last four digits of Fn are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print Fn 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
代码:
#include<cstdio>
using namespace std;
const int mod=1e4;
int a[2][2],b[2][2],c[2][2];
void multi(int (*x)[2],int (*y)[2])
{
int i,j,k;
for(i=0;i<2;i++)
for(j=0;j<2;j++)
for(c[i][j]=k=0;k<2;k++)
c[i][j]+=x[i][k]*y[k][j];
for(i=0;i<2;i++)
for(j=0;j<2;j++)
x[i][j]=c[i][j]%mod;
}
int main()
{
// freopen("1.in","r",stdin);
int n;
while(scanf("%d",&n),n>=0)
{
a[0][0]=1,a[0][1]=1;
a[1][0]=1,a[1][1]=0;
b[0][0]=1,b[0][1]=0;
b[1][0]=0,b[1][1]=1;
while(n)
{
if(n&1)multi(b,a);
multi(a,a),n>>=1;
}
printf("%d\n",b[0][1]);
}
return 0;
}