求完数, 最大公约数
package net;public class T {public static void main(String[] args) {int i, j;for (i = 1; i <= 1000; i++) {int sum = 0;for (j = 1; j < i; j++) {if (i % j == 0)sum = sum + j;}if (sum == i)System.out.print(i + " ");// 6 28 496}}}// 最大公约数, 最小公倍数 = 2数乘积除最大公约数public int test(int a, int b) {int temp = 0;if (a < b) {temp = a;a = b;b = temp;}while (b != 0) {temp = a % b;a = b;b = temp;}return a;}