uva 11582 Colossal Fibonacci Numbers!

//为啥循环节一定要是0 1开头

#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<string>

using namespace std;

const unsigned long long MAXN=1001;

unsigned long long T;
unsigned long long a,b;
unsigned long long n;
unsigned long long f[MAXN*MAXN];

unsigned long long pow(unsigned long long a,unsigned long long b,unsigned long long n){
    unsigned long long tmp=a%n;
    unsigned long long ans=1;
    while (b!=0){
            if (b&1==1){
                    ans=(ans*tmp)%n;
            }
            tmp=(tmp*tmp)%n;
            b=b>>1;
    }
    //printf("%d
",ans);
    return ans;
}

int main(){
    scanf("%llu",&T);
    while (T--){
            scanf("%llu%llu%llu",&a,&b,&n);
            f[0]=0%n;
            f[1]=1%n;
            unsigned long long len;
            unsigned long long now=1;
            while (1){
                    f[now+1]=(f[now]+f[now-1])%n;
                    if (f[now]==f[0] && f[now+1]==f[1]){
                            len=now;
                            break;
                    }
                    now++;
            }
            //printf("%d
",len);
            printf("%llu
",f[pow(a,b,len)]);
    }
    return 0;
}
/*
3
1 1 2
2 3 1000
18446744073709551615 18446744073709551615 1000

1
18446744073709551615 18446744073709551615 1000
*/
/*
1
21
250
*/