UVa10229 - Modular Fibonacci

Problem A: Modular Fibonacci

The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:

F₀ = 0
F₁ = 1
F_i = F_i-1 + F_i-2 for i>1

Write a program which calculates M_n = F_n mod 2^m for given pair of n and m. 0� n� 2147483647 and 0� m< 20. Note that a mod b gives the remainder when a is divided by b.

Input and Output

Input consists of several lines specifying a pair of n and m. Output should be corresponding M_n, one per line.

Sample Input

11 7
11 6

Sample Output

89
25

结果是一个循环数列。也可以用矩阵快速幂做。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
vector<int> fib[21];
void init(){
    for(int i = 1; i <= 20; i++){
        int mod = 1<<i;
        int a = 0,b = 1,c = (a+b)%mod;
        fib[i].push_back(a);
        fib[i].push_back(b);
        fib[i].push_back(1%mod);
        while(!(b==0&&c==1)){
            a = b;
            b = c;
            c = (a+b)%mod;
            fib[i].push_back(c);
        }
        fib[i].pop_back();fib[i].pop_back();
    }
}
int main(){

    init();
    int n,m;
    while(cin >> n >> m){
        if(m==0) cout<<0<<endl;
        else   cout<<fib[m][n%fib[m].size()]<<endl;
    }

    return 0;
}