Sum of amicable numbers under 10000

February 22, 2019
Sum of amicable numbers under 10000
#include<stdio.h>
#include<math.h>
int SumOfDivisors(int number);
int main()
{
    int M,N=1,SumOf_amic_num=0;

    for(M=2;M<=10000;M++){
        N=SumOfDivisors(M);
        if(M==SumOfDivisors(N) && M!=N)
            SumOf_amic_num=SumOf_amic_num+M;
    }
    printf("%d",SumOf_amic_num);
    return 0;
}

int SumOfDivisors(int number)
{
    int sum_div=1,div1;
    for(int div=2;div<=sqrt(number);div++)
    {
        if(number%div==0)
        {
            sum_div=sum_div+div;
            div1=number/div;
                if(div1!=div)
                sum_div=sum_div+div1;
        }
    }
    return sum_div;
}

No comments:

'; (function() { var dsq = document.createElement('script'); dsq.type = 'text/javascript'; dsq.async = true; dsq.src = '//' + disqus_shortname + '.disqus.com/embed.js'; (document.getElementsByTagName('head')[0] || document.getElementsByTagName('body')[0]).appendChild(dsq); })();
Powered by Blogger.