50道JAVA基础编程练习题(1)

// 求最大公约数和最小公倍数
// 程序分析：利用辗除法。
private static void max_min(int m, int n) {
int temp = 1;
int yshu = 1;
int bshu = m * n;
if (n < m) {
temp = n;
n = m;
m = temp;
}
while (m != 0) {
temp = n % m;
n = m;
m = temp;
}
yshu = n;
bshu /= n;
System.out.println("最大公约数为" + yshu);
System.out.println("最小公倍数为" + bshu);
}

// 求完数
private static void compNumber(int n) {
System.out.println(n + "以内的完数：");
int count = 0;
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= i / 2; j++) {
if ((i % j) == 0) {
sum += j;
}
}
if (sum == i) {
System.out.print(i + " \n");
count++;
}
}
System.out.println(n + "以内共有完数 : " + count + "个");
}