NYOJ-127 快速求幂，最小生成树

 #include"iostream"
 using namespace std;
 int kuaisuqiumo(int a,int b,int c){
     int ans = ;
     a = a % c;
     while(b>){
         if(b %  == )
             ans = (ans * a) % c;
         b = b/;
         a = (a * a) % c;
     }
     return ans;
 }
 int main(){
     int n;
     cin>>n;
     while(n--){
         int x;
         cin>>x;
         cout<<kuaisuqiumo(x,x-,)<<endl;
     }
     return ;
 }