CF1613A.Long Comparison
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Monocarp wrote down two numbers on a whiteboard. Both numbers follow a specific format: a positive integer x with p zeros appended to its end.
Now Monocarp asks you to compare these two numbers. Can you help him?
输入格式
The first line contains a single integer t ( 1≤t≤104 ) — the number of testcases.
The first line of each testcase contains two integers x1 and p1 ( 1≤x1≤106;0≤p1≤106 ) — the description of the first number.
The second line of each testcase contains two integers x2 and p2 ( 1≤x2≤106;0≤p2≤106 ) — the description of the second number.
输出格式
For each testcase print the result of the comparison of the given two numbers. If the first number is smaller than the second one, print '<'. If the first number is greater than the second one, print '>'. If they are equal, print '='.
输入输出样例
输入#1
5 2 1 19 0 10 2 100 1 1999 0 2 3 1 0 1 0 99 0 1 2
输出#1
> = < = <
说明/提示
The comparisons in the example are: 20>19 , 1000=1000 , 1999<2000 , 1=1 , 99<100 .