设计算法求解 a mod m,其中a、n和m均为大于1的整数。(提示:为了避免a超出int型的表示范围,应该每做一次乘法之后对n取模)
package thirdChapter;
public class AnModm {
public int anModn(int a, int n, int m) {
int i = 0;
int num = 1;
while (i < n) {
num *= a;
num = num % m;
i++;
}
return num;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
AnModm aModm = new AnModm();
System.out.println(aModm.anModn(2, 1000000, 5));
}
}