UVa 11582 Colossal Fibonacci Numbers!

 1 #include<iostream>  
 2 #include<cstdio>  
 3 #include<cstring> 
 4 #include <cmath> 
 5 #include<stack>
 6 #include<vector>
 7 #include<map> 
 8 #include<set>
 9 #include<queue> 
10 #include<algorithm>  
11 using namespace std;
12 
13 typedef long long LL;
14 typedef unsigned long long ULL;
15 const int INF = (1<<30)-1;
16 const int mod=1000000007;
17 const int maxn=1005;
18 
19 int f[maxn][6*maxn],p[maxn];
20 
21 int pow_mod(ULL a,ULL b,int n){
22     if(b==0) return 1;
23     int k=pow_mod(a,b/2,n);
24     k=k*k%n;
25     if(b%2==1) k= k * a % n;
26     return  k;
27 }
28 
29 int solve(ULL a,ULL b,int n){
30     if(a==0||n==1) return 0;//0的 任意次方为0，一个数模上1的余数为0
31     int idx=pow_mod(a%p[n],b,p[n]) ;
32     return f[n][idx];
33 }
34 
35 int main(){
36     int ncase;
37     int n;    
38     for(int n=2;n<=1000;n++){
39         f[n][0]=0;f[n][1]=1;
40         for(int i=2;;i++){
41             f[n][i]=(f[n][i-2]+f[n][i-1])%n;
42             if(f[n][i-1]==0&&f[n][i]==1){
43                 p[n]=i-1;
44                 break;
45             }            
46         }
47     }
48 //    freopen("in.txt","r",stdin);
49 //    freopen("out.txt","w",stdout);
50     scanf("%d",&ncase);
51     while(ncase--){
52         ULL a,b;
53             
54         cin>>a>>b>>n;
55         cout<<solve(a,b,n)<<"\n";
56     }
57     return 0;
58 }