SPOJ Number theory Problem DIVSUM - Divisor Summation Solution

Solve in C++:
///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE
///Islamic University,Bangladesh
#include<iostream>
using namespace std;
int main()
{
    long long t,n,i,s=0;
    cin>>t;
    while(t--)
    {
        s=0;
        cin>>n;
        for(i=1; i*i<n; i++)
        {
            if(n%i==0)
                s=s+i+n/i;
        }
        if(i*i==n)
            s=s+i;
        s=s-n;
        cout<<s<<endl;
    }

}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.