求解亲密数代码剖析

#include <stdio.h>
int Sum(int a)
{
	int sum = 0;
	for (int i = 1; i < a; i++)
	{
		if (a % i == 0)
			sum += i;
	}
	return sum;
}
int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n - 1; i++)
	{
		for (int j = 2; j <= n; j++)
		{
			if (Sum(i) == j && Sum(j) == i && i < Sum(i))
				printf("%d %d\n", i, j);
		}
	}
	return 0;
}

#include <stdio.h>
int main()
{
	int n, i, j, k, sum1, sum2;
	scanf("%d", &n);
	for (i = 1; i <= n; i++)
	{
		sum1 = 0;
		sum2 = 0;
		for (j = 1; j < i; j++)
		{
			if (i % j == 0)
				sum1 += j;
		}
		for (k = 1; k < sum1; k++)
		{
			if (sum1 % k == 0)
				sum2 += k;
		}
			if (sum2 == i && i < sum1)
				printf("%d %d\n", i, sum1);
	}
	return 0;
}