UVA 10392 Factoring Large Numbers Solution


Solve in C++:

///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE
///Islamic University,Bangladesh


#include<bits/stdc++.h>
using namespace std;
int main(){

long long n,i;
while(cin>>n)
{
    if(n<0)
        break;
    while(n%2==0)
    {
        cout<<"    2"<<endl;
        n=n/2;
    }
    for( i=3; i*i<=n; i=i+2)
    {
        while(n%i==0)
        {
            n=n/i;
            cout<<"    "<<i<<endl;
        }
    }
    if(n>1)
    cout<<"    "<<n<<endl;
    cout<<endl;
}
return 0;
}

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.