Codeforces A. Game 23 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 main()

    {

        int m,n,d,c2=0,c3=0;

        cin>>m>>n;

        if(n%m!=0)

            cout<<"-1"<<endl;

        else

        {

            d=n/m;

                while(d%2==0)

                {

                    c2++;

                    d=d/2;

                }

                while(d%3==0)

                {

                    c3++;

                    d=d/3;

                }

            if(d==1)

                cout<<c2+c3<<endl;

            else

                cout<<"-1"<<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.