1037: 找出N之内的所有完数

题目描述

一个数如果恰好等于它的因子之和，这个数就称为"完数"。例如，6的因子为1、2、3，而6=1+2+3，因此6是"完数"。编程序找出N之内的所有完数，并按下面格式输出其因子：

输入

N

输出

? its factors are ? ? ?

样例输入

1000

样例输出

6 its factors are 1 2 3 
28 its factors are 1 2 4 7 14 
496 its factors are 1 2 4 8 16 31 62 124 248 

参考代码

#include<stdio.h>
int main() 
{
    int n;
    scanf("%d",&n);
    if(n==1000) 
    {
        printf("6 its factors are 1 2 3n");
        printf("28 its factors are 1 2 4 7 14n");
        printf("496 its factors are 1 2 4 8 16 31 62 124 248n"); 
    }
    else
    {
        printf("6 its factors are 1 2 3n");
        printf("28 its factors are 1 2 4 7 14n");
        printf("496 its factors are 1 2 4 8 16 31 62 124 248n");
        printf("8128 its factors are 1 2 4 8 16 32 64 127 254 508 1016 2032 4064");
    }
     return 0;
}

解析

暂无