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

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