求大数高次幂的模

题目：

/*球大数高次幂的模X^Y mod Z思路：x^y mod z = (x % z)*(x % z)*、、、*(x % z)*/#include <stdio.h>bool Getmi(int X, int Y, int Z, int &res){int numl(1);int numy(Y);int multi(X);int tmp(0);int tres(1);multi = multi % Z;if(multi > 1) //当余数等于0、1时直接可求得结果while(numy > 0){if(multi == 1)break;//当余数等于1时结束循环        numl = 1;        int tt = numy;        X = multi;while(X < Z && tt > 0 ){X *= multi;tt--;numl++;}tmp = numy % numl;while(tmp){            if(multi == 1)break;tres *= multi;tmp--;}multi = X % Z;numy = numy / numl;tres %= Z;}res = (multi * tres) % Z;return true;}int main(){int x, y, z;int res(0);while(1){res = 0;printf("请输入x, y, z:");scanf("%d %d %d", &x, &y, &z);if(Getmi(x, y, z, res)){printf("result = %d\n\n\n", res);}else{printf("Wrong!!!\n");}}}

测试结果：