Colossal Fibonacci Numbers! UVA - 11582

UVA-11582

题目：输入a,b,m。有斐波拉契数列F[i]，求F[a^b]%m的值。0<=a,b<=2^64，1<=m<=1000。

分析：设G[i] = F[i]%m，由于如果G[i-1]，G[i]重复出现，于是之后G[i]会周期性的出现。由于1<=m<=1000，于是周期最多为m^m。只需求出a^b是周期T中的第几项即可。于是有涉及到了快速幂公式。

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<sstream>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int T,f[1001][4001],check[1001][1001]={0},t,save[1001]={0};
//long long -> -(2^32)~2^32
//unsigned long long 0~2^64
unsigned long long a,b;
int m;
int answer(int a,unsigned long long n){
    if(n==0) return 1;
    int x = answer(a, n/2)%save[m];
    x = x*x%save[m];
    if(n%2==1) x = (x*a)%save[m];
    return x;
}
int main(){
    for(int k = 2;k<=1000;k++){ //找出每个m的循环周期
        f[k][1] = 1;f[k][2] = 1;
        memset(check, 0, sizeof(check));
        check[1][1] = 1;
        for(int i = 3;;i++){
            f[k][i] = (f[k][i-2] + f[k][i-1])%k;
            if(check[f[k][i-1]][f[k][i]]){
                t = i-2;
                break;
            }
            else check[f[k][i-1]][f[k][i]] = 1;
        }
        save[k] = t;
    }
    cin>>T;
    while(T--){
        scanf("%llu%llu%d",&a,&b,&m);
        if(a==0||m==1){
            printf("0\n");
            continue;
        }
        a%=save[m];
        int ans = answer(a,b); //快速幂取模
        printf("%d\n",f[m][ans]);
    }
    return 0;
}