Spoj CEQU - Crucial Equation solution

 Solution in C++:

 ///La ilaha illellahu muhammadur rasulullah

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

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    1. #include <bits/stdc++.h>
    2. using namespace std;
    3. int main()
    4. {
    5. int t,a,b,c,i=0;
    6. cin>>t;
    7. while(t--)
    8. {
    9. cin>>a>>b>>c;
    10. i++;
    11. if(c%__gcd(a,b)==0)
    12. cout<<"Case "<<i<<": Yes"<<endl;
    13. else
    14. cout<<"Case "<<i<<": No"<<endl;
    15. }
    16. }

    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.