Find each other

/***************************************************************
*Name            :CalSumOfDivisor
*Fun             :求所有约数的和（不包含本身）
*InputParaments  :a，待求对象
*OutputParaments :所有约数的和
****************************************************************/
int CalSumOfDivisor(int a) {
	int s = 0;
	for (int i = 1; i < a; i++) {
		if (!(a%i)) {
			s += i;
		}
	}
	return s;
}

/***************************************************************
*Name            :FindMutualEnrichmentNumber
*Fun             :找互满数
*InputParaments  :None
*OutputParaments :None
****************************************************************/
void FindMutualEnrichmentNumber(void) {
	for (int i = 1; i <= 20000; i++) {
		int s1 = CalSumOfDivisor(i);
		int s2 = CalSumOfDivisor(s1);
		if ((i == s2)&&(i<s1)) {
			printf("%d 和%d 是互满数\n",i,s1);
		}
	}	
}