ICPC Asia West Regional 2019 Problem J Greatest GCD Ever Solution

   ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    #include <bits/stdc++.h>

    using namespace std;

    int gcd(int a, int b)

    {

        if (b == 0)

            return a;

        return gcd(b, a % b);


    }

    int main()

    {

        int a,b,i,gc,mxg=0;

        cin>>a>>b;

        gc=gcd(a,b);

        for(i=0; i<=b; i++)

        {

            mxg=max(mxg,gcd(a,i));

        }

            cout<<mxg<<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.