Codeforces Gym - 310911K Solution

                                                


 Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long long  temp,n,i,ans=1;
    cin>>n;
    temp=sqrtl(n);
    for(i=2; i*i<=temp; i++)
    {
        while(temp%i==0)
        temp/=i,ans=max(ans,i);
    }
    if(temp>=2)
        ans=max(ans,temp);
    cout<<ans<<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.