Non-abundant sums

Non-abundant sums

Problem 23

Published on Friday, 2nd August 2002, 06:00 pm; Solved by 52881

A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.
A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.
As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.
Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.




SOLUTION
:::






long long int i,k,flag=0;
long long int counter=0;
long long int sum=0;
abcheck(int n)//function to check abundancy of a number
{
int res=0;
for(i=1;i<=(n/2);i++)
{
if(n%i==0){res+=i;if(res>n){return 1;}}
}
return 0;
}
main()
{
    int i=1;
while(i<=28123)//As mentioned in the question that number above 28123 can be expressed as sum of two abundant number.
{
flag=0;
counter=0;
for(k=1;k<=i&&flag==0;k++)
{
counter++;
int n=i-k;
if(abcheck(k)&&abcheck(n))
{
flag++;break;
}
}
if(flag==0&&counter!=0){sum=sum+i;}
i++;
}
printf("%lld",sum);
}