zoukankan      html  css  js  c++  java
  • 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("<
    ");
        }
    }



  • 相关阅读:
    scala :: , +:, :+ , ::: , ++ 的区别
    Scala 函数式编程思想
    Scala 关键字
    HDFS 的内存存储是什么?
    LRU
    高并发情况限流
    Java中List集合去除重复数据的方法
    MySQL支持的跨库事务
    死磕ConcurrentHashMap 1.8源码解析
    一致性Hash算法
  • 原文地址:https://www.cnblogs.com/bryce1010/p/9387153.html
Copyright © 2011-2022 走看看