2017 JUST Programming Contest 3.0 H. Eyad and Math

H. Eyad and Math
time limit per test
2.0 s
memory limit per test
256 MB
input
standard input
output
standard output

Eyad was given a simple math problem, but since he is very bad at math he asked you to help him.

Given 4 numbers, abc, and d. Your task is to find whether ab is less than cd or not.

It is guaranteed that the two numbers above are never equal for the given input.

Input

The first line contains an integer T (1 ≤ T ≤ 105), where T is the number of test cases.

Then T lines follow, each line contains four integers abc, and d (1 ≤ a, b, c, d ≤ 109).

Output

For each test case, print a single line containing "<" (without quotes), if ab is less than cd. Otherwise, print ">" (without quotes).

Example
input
2
9 2 5 3
3 4 4 3
output
<
>


#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
#define ll long long
const int maxn=100005;

int main()
{
//    freopen("in.txt","r",stdin);
    int T;
    double a,b,c,d;
    scanf("%d",&T);
    double temp1,temp2;
    while(T--)
    {
        scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
        temp1=b*log10(a),temp2=d*log10(c);
        if(temp1>=temp2)
            printf(">\n");
        else
            printf("<\n");
    }
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值