本题要求实现一个计算整数因子和的简单函数,并利用其实现另一个函数,输出两正整数m和n(0<m≤n≤10000)之间的所有完数。所谓完数就是该数恰好等于除自身外的因子之和。例如:6=1+2+3,其中1、2、3为6的因子。
#include <stdio.h>
int factorsum( int number );
void PrintPN( int m, int n );
int main()
{
int i, m, n;
scanf("%d %d", &m, &n);
if ( factorsum(m) == m ) printf("%d is a perfect number\n", m);
if ( factorsum(n) == n ) printf("%d is a perf
PrintPN(m, n);
return 0;
}
输入样例1
1 30
输出样例2
1 is a perfect number
1 = 1
6 = 1 + 2 + 3
28 = 1 + 2 + 4 + 7 + 14
int factorsum(int number) { //判断number是否为完数
int i, sum = 0;
if (number == 1) return 1;
for (i = 1; i < number; i++) {
if (number % i == 0) {
sum = sum + i;
}
}
return sum;
}
void PrintPN(int m, int n) {
int i, j, count = 0;
for (i = m; i <= n; i++) {
if (factorsum(i) == i) {
count++; // count用来计数,表示完数的个数
printf("%d = ", i);
if (i == 1) printf("1");
for (j = 1; j < i; j++) {
if (i % j == 0) {
printf("%d", j);
if (j == i / 2) //判断加到最后一位数时,无加号
break;
printf(" + ");
}
}
printf("\n");
}
}
if (!count) printf("No perfect number");
}