• 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(">
    ");
            else
                printf("<
    ");
        }
    }



  • 相关阅读:
    对象实例化过程分析
    对象实例化过程分析
    QuickHit游戏
    QuickHit游戏
    java继承向上转型和向下转型和动态绑定
    java继承向上转型和向下转型和动态绑定
    洛谷:P1095 守望者的逃离(贪心+dp)
    Manacher算法-最长回文子串
    numpy array()
    CNN 卷积神经网络结构
  • 原文地址:https://www.cnblogs.com/bryce1010/p/9387153.html
Copyright © 2020-2023  润新知