POJ 2686 打印完数

时间限制: 

1000ms

内存限制: 

65536kB

描述

一个数如果恰好等于它的因子之和，这个数就成为“完数”。例如，6的因子为1、2、3，而6＝1＋2＋3，因此6是“完数”。编程序打印出1000之内（包括1000）所有的完数，并按如下格式输出其所有因子：

6 its factors are 1,2,3

输入

无输入

输出

输出1000以内所有的完数及其因子，每行一个完数。

样例输入

样例输出

（1）、源代码：

#include <iostream>

 

using namespace std;

 

int main()

{

                int yin[100];

                int sum, k, i, j, m;

                for(i = 6; i <= 1000; i++)

                {

                                sum = k = 0;

                                for(j = 1; j < i; j++){

                                                if(i % j == 0){

                                                                sum += j;

                                                                yin[k++] = j;

                                                }

                                }

                                if(i == sum){

                                                cout << i << " its factors are ";

                                                for(m = 0; m < k; m++){

                                                                cout << yin[m];

                                                                if(m != k - 1)

                                                                                cout << ",";

                                                }

                                                cout << endl;

                                }              

                }

                return 0;

}

 

（2）、解题思路：略

（3）、可能出错：略

 

 

 

 

转载于:https://www.cnblogs.com/lydf-2012/archive/2012/05/02/2479740.html