blob: e236cf32e12b453f9066f3292060d15e28fea904 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
#include <math.h>
int sum_divisors(int number)
{
int i;
int sum = 1;
int limit = (int) ceil(sqrt(number));
for(i=2; i<limit; i++)
{
if(number % i == 0)
{
sum += i;
if(number / i != i)
sum += number / i;
}
}
return sum;
}
int main()
{
int sum = 0;
int a;
for(a=1; a<10000; a++)
{
int b = sum_divisors(a);
if(a == sum_divisors(b) && a != b)
sum += a;
}
printf("%d\n", sum);
return 0;
}
|