首页 > 其他 > 详细

(Problem 21)Amicable numbers

时间:2014-02-12 15:53:31      阅读:348      评论:0      收藏:0      [点我收藏+]

Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a bubuko.com,布布扣 b, then a and b are an amicable pair and each of a and b are called amicable numbers.

For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.

Evaluate the sum of all the amicable numbers under 10000.

d(n)定义为n 的所有真因子(小于 n 且能整除 n 的整数)之和。 如果 d(a) = b 并且 d(b) = a, 且 a bubuko.com,布布扣 b, 那么 a 和 b 就是一对相亲数(amicable pair),并且 a 和 b 都叫做亲和数(amicable number)。

例如220的真因子是 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 和 110; 因此 d(220) = 284. 284的真因子是1, 2, 4, 71 和142; 所以d(284) = 220.

计算10000以下所有亲和数之和。

bubuko.com,布布扣
// (Problem 21)Amicable numbers 
// Completed on Wed, 24 Jul 2013, 06:07
// Language: C
//
// 版权所有(C)acutus   (mail: acutus@126.com) 
// 博客地址:http://www.cnblogs.com/acutus/
#include<stdio.h>

int FactorSum(int n)  //计算n的所有小于n的因素和
{
    int i;
    int sum=1;
    for(i=2; i<=n/2; i++)
    {
        if(n%i==0)
            sum+=i;
    }
    return sum;
}

int main()
{
    int t,i=2;
    int sum=0;
    while(i<10000)
    {
        t=FactorSum(i);
        if(t!=i && FactorSum(t)==i) 
            sum+=i;
        i++;
    }
    printf("%d\n",sum);
    return 0;
}
bubuko.com,布布扣
Answer:
31626

(Problem 21)Amicable numbers

原文:http://www.cnblogs.com/acutus/p/3545413.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!