POJ 3070-Fibonacci

最新推荐文章于 2020-04-10 14:24:38 发布

Yuric

最新推荐文章于 2020-04-10 14:24:38 发布

阅读量286

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/Yuric/article/details/44630581

版权

ACM 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

Fibonacci

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10087		Accepted: 7201

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

Sample Output

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:

小结：

一天有过去了，四月是你的谎言，未闻花名还真是催人泪下啊...

好了，该说正事了，这道题目，做法题目已经清清楚楚说明了，很简单，基本只要不粗心都能完成！

以下是AC代码：

#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
const int mod=10000;
typedef vector<int>vec;
typedef vector<vec>mat;
typedef long long ll;
mat mul(mat &a,mat &b)
{
    mat c(a.size(),vec(b[0].size()));
    for(int i=0;i<a.size();i++)
    for(int k=0;k<b.size();k++)
    for(int j=0;j<b[0].size();j++)
    {
        c[i][j]=(c[i][j]+a[i][k]*b[k][j])%mod;
    }
    return c;
}
mat pow_mul(mat a,ll num)
{
    mat b(a.size(),vec(a[0].size()));
    for(int i=0;i<a.size();i++)
    b[i][i]=1;
    while(num)
    {
        if(num&1)
        b=mul(b,a);
        a=mul(a,a);
        num>>=1;
    }
    return b;
}
int main()
{
    ll n;
    while(~scanf("%lld",&n)&&n!=-1)
    {
        if(n==0)
        {
            printf("0\n");
            continue;
        }
        mat a(2,vec(2));
        a[0][0]=1;
        a[0][1]=1;
        a[1][0]=1;
        a[1][1]=0;
        a=pow_mul(a,n);
        printf("%d\n",a[1][0]);
    }
    return 0;
}