九度[1085]求root(N,K)

 1 # include<iostream>
 2 using namespace std;
 3 int main(){
 4     long long int x=0,y=0,k=0;
 5     while(cin>>x>>y>>k)
 6     {
 7         long long int sum=1;
 8         k--;
 9         while(y)
10         {
11             if(y%2!=0) sum=(sum*x)%k;
12             x=(x*x)%k;
13             y=y/2;
14         }
15         if(sum==0) cout<<k<<endl;
16         else cout<<sum<<endl;
17     }
18     return 0;
19 }