您的答案為: 0
正確答案為: 1

#include <iostream>
using namespace std;
#define ull unsigned long long
ull a,b,sum;
int f[1000];
//==============================================
int main() {
int m, n;
 
 cin>>m;
 while(m--){
   cin>>a>>b>>n;
   f[0]=0; f[1]=1; f[2]=1;
 
   for(int i=3; i<1000; i++){ 
     f[i]=(f[i-1]+f[i-2])%n;
     //printf("@@@ f[%d]=%lld\n",i,f[i]);
   }
 
   sum=1;
   while(b>0){ //快速冪
     if(b%2) sum*=(a%n);
     a = (a%n)*(a%n);
     a %= n;
     sum %= n;
     b/=2;
     //printf("%lld %lld %lld\n",a,b,sum); 
   }
   //cout<<sum<<endl;
   cout<<f[sum]<<endl;
 }
}

請指教