F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Jacana Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 153428/153428 K (Java/Others)
Total Submission(s): 164    Accepted Submission(s): 21


Problem Description
This problem is very simple problem.
We define J(n,k) like this:
1. J(n,1)=n
2. J(n,k)=$n^{J(n,k-1)}$ (k=2,3,¡­)
We call this number ¡°Jacana Number¡±.
In this problem you are given two jacana numbers and you must output which Jacana Number is greater than the other.
 

Input
The first line contains an integer T (1 <= T <= 10000), the number of test cases.
Each test case contains four integers n, a, m, b (1 <= n, a, m, b <= $10^9$)
 

Output
For each test case output one of (¡®>¡¯, ¡®=¡¯, ¡®<¡¯) in one line.
If J(n,a)> J(m,b), output ¡®>¡¯.
If J(n,a)= J(m,b), output ¡®=¡¯.
If J(n,a)< J(m,b), output ¡®<¡¯.
 

Sample Input
3 2 2 3 1 2 3 3 2 1 2 1 4
 

Sample Output
> < =
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-05 14:20:52, Gzip enabled