Codechef Chef and Prime Divisors Problem Code: CHAPD Contest Code: MAY15 Solution

 

Problem Link: https://www.codechef.com/problems/CHAPD?tab=statement

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;

#define ll long long

void solve()

{

    ll a,b,g;

    cin>>a>>b;

    g=__gcd(a,b);

    while(g>1&&b>1)

    {

        b/=g;

        g=__gcd(a,b);

    }

    if(b>1)

    cout<<"No"<<endl;

    else

    cout<<"Yes"<<endl;

}

int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    ll t;

    cin>>t;

    while(t--)

    {

       solve();

    }

}