Codeforces 13613A - Long Comparison 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 t;

        cin>>t;

        while(t--)

        {

            long double  x1,x2,p1,p2,fn,fs;

            cin>>x1>>p1>>x2>>p2;

            if(p1==p2)

                p1=0,p2=0;

            else if(p1>p2)

                p1=p1-p2,p2=0;

            else

                p2=p2-p1,p1=0;


            fn=x1*pow(10,p1);

            fs=x2*pow(10,p2);

            if(fn<fs)

                cout << "<"<<endl;

            else if(fn>fs)

                cout << ">"<<endl;

            else

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