http://poj.o
Fibonacci
Time Limit: 1000MS |
| Memory Limit: 65536K |
Total Submissions: 6873 |
| Accepted: 4866 |
Description
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn ?6?1 1 + Fn ?6?1 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 ?6?11.
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<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
int h[15000]={0,1,1,2,3,5};
int f[40]={0,1,1,2,3};
int main()
{
int i,j,n;
double ans;
for(i=3;i<40;i++)//打表
f[i]=f[i-1]+f[i-2];
for(j=3;j<15000;j++)
h[j]=(h[j-1]+h[j-2])%10000;
while(scanf("%d",&n)!=EOF)
{
if(n==-1)
break;
if(n<40)
printf("%d\n",f[n]);
else
{
printf("%d\n",h[n%15000]);
}
}
return 0;
}
http://poj.org/problem?id=1699