Thursday, 6 April 2017

Geeksforgeeks Solution For " Greater power "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Greater power

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        long double a,b,m,n,sum,res;
        cin>>a>>b>>m>>n;
        sum=b*log(a);
        res=n*log(m);
        //cout<<sum<<" "<<res<<endl;
        if(sum>res)
        cout<<"1\n";
        if(sum<res)
        cout<<"0\n";
        if(sum==res)
        cout<<"-1\n";
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Greater power "

No comments:
Write comments

Recommended Posts × +