Problem:


Score : 100 points

Problem Statement

In programming, hexadecimal notation is often used.

In hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.

In this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.

When X and Y are seen as hexadecimal numbers, which is larger?

Constraints

Each X and Y is A, B, C, D, E or F.

Input

Input is given from Standard Input in the following format:

X Y

Output

If X is smaller, print <; if Y is smaller, print >; if they are equal, print =.

Sample Input 1

A B

Sample Output 1

<

10 < 11.

Sample Input 2

E C

Sample Output 2

>

14 > 12.

Sample Input 3

F F

Sample Output 3

=

15 = 15.



Sample input:
A B


Sample output:
<

Submission status: Accepted

Solution code:
x, y = input().split()
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
x, y = input().split()

if ord(x)<ord(y):
    print('<')
elif ord(x)>ord(y):
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
X, Y = input().split()
if X > Y:
    print(">")
elif X < Y:
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
a,b=map(str,input().split())
List = ["A","B","C","D","E","F"]
if a == b:
  print("=")
c = 0
d = 0
for i in range(6):
  if a == List[i]:
    c = i
  if b == List[i]:
    d = i
if c < d:
  print("<")
elif d < c:
  print(">")

Submission status: Accepted

Solution code:
l = ["A", "B", "C", "D", "E", "F"]
x, y = map(str, input().split())
if l.index(x) > l.index(y):
  print(">")
elif l.index(x) < l.index(y):
  print("<")
else:
  print("=")

Submission status: Accepted

Solution code:
x, y = input().split()
if x < y:
    print("<")
elif x == y:
    print("=")
else:
    print(">")

Submission status: Accepted

Solution code:
x, y = input().split()
if x == y:
    ans = "="
elif x < y:
    ans = "<"
else:
    ans = ">"
print(ans)

Submission status: Accepted

Solution code:
X, Y = list(map(str, input().split()))

if X < Y:
    print("<")
elif X == Y:
    print("=")
else:
    print(">")

Submission status: Accepted

Solution code:
import collections
def main():
    x,y=map(str, input().split())
    if(x>y):
        print(">")
    elif(y>x):
        print("<")
    else:
        print("=")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,y = map(str,input().split())
if(x<y):
    print("<")
elif(x>y):
    print(">")
else:
    print("=")

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    x,y=sl()
    print('<' if x < y else '=' if x == y else '>')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = input().split()

if ord(a) < ord(b):
    print('<')
elif ord(a) > ord(b):
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
X,Y=input().split()
number={"A":10,"B":11,"C":12,"D":13,"E":14,"F":15}
if number[X]==number[Y]:
    print("=")
elif number[X]<number[Y]:
    print("<")
else:
    print(">")

Submission status: Accepted

Solution code:
x,y = input().split()
print('<'if x< y else '='if x==y else '>')

Submission status: Accepted

Solution code:
X,Y = input().split()

if X < Y:
  print("<")
elif X > Y:
  print(">")
else:
  print("=")

Submission status: Accepted

Solution code:
def resolve():
    x, y = input().split()
    nx = ord(x)
    ny = ord(y)
    if nx < ny:
        print("<")
    elif nx > ny:
        print(">")
    else:
        print("=")
resolve()

Submission status: Accepted

Solution code:
a, b = input().split()
if a==b:
  print("=")
else:
  print("<" if a < b else ">")

Submission status: Accepted

Solution code:
X,Y = input().split()
if X < Y:
    print('<')
elif X == Y:
    print('=')
else:
    print('>')

Submission status: Accepted

Solution code:
X,Y=input().split()
d={'A':10,'B':11,'C':12,'D':13,'E':14,'F':15}
if d[X]<d[Y]:
    print('<')
elif d[Y]<d[X]:
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
x, y=input().split()
alp='ABCDEF'
if x==y:
  print('=')
elif alp.index(x)<alp.index(y):
  print('<')
else:
  print('>')

Submission status: Accepted

Solution code:
input1 = list(input().split())
check = sorted(input1)
if check[0] == check[1]:
    print("=")
elif check[0] == input1[0]:
    print("<")
else:
    print(">")

Submission status: Accepted

Solution code:
X, Y = input().split()

if (X < Y):
    print('<')
elif (X > Y):
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
a, b = list(input().split())

if a == "A":
    a = "10"
if a == "B":
    a = "11"
if a == "C":
    a = "12"
if a == "D":
    a = "13"
if a == "E":
    a = "14"
if a == "F":
    a = "15"

if b == "A":
    b = "10"
if b == "B":
    b = "11"
if b == "C":
    b = "12"
if b == "D":
    b = "13"
if b == "E":
    b = "14"
if b == "F":
    b = "15"

a=int(a)
b=int(b)

if a>b:
    print(">")
elif a<b:
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

X,Y=list(input().rstrip().split())
if X>Y:
    print('>')
elif X<Y:
    print('<')
else:
    print('=')

Submission status: Accepted

Solution code:
X,Y=map(str,input().split())
#print(X,Y)

if X>Y:
  print(">")
elif X<Y:
  print("<")
else:
  print("=")

Submission status: Accepted

Solution code:
x,y = input().split()

if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rs()
if a<b:
  print('<')
elif a==b:
  print('=')
else:
  print('>')

Submission status: Accepted

Solution code:
x, y = map(ord ,input().split())
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, y = M()
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
x, y = input().split()
alpha = ['A', 'B', 'C', 'D', 'E', 'F']

if x == y:
    print('=')
else:
    if alpha.index(x) < alpha.index(y):
        print('<')
    else:
        print('>')

Submission status: Accepted

Solution code:
a,b=map(ord,input().split())
if a>b:
    print(">")
elif a<b:
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
A, B = map(lambda S: int(S,16), input().split())
if A < B:
  print("<")
elif A == B:
  print("=")
else:
  print(">")

Submission status: Accepted

Solution code:
x, y = map(str, input().split())
if x < y:
  print("<")
elif x > y:
  print(">")
else:
  print("=")

Submission status: Accepted

Solution code:
x,y = map(str,input().split())

if x == y:
  print("=")
elif x > y:
  print(">")
else:
  print("<")

Submission status: Accepted

Solution code:
###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout
def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))
### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
### constants
INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)
###---------------------------------------------------

S = sInLH()

if S[0] < S[1]:
  ans = '<'
elif S[0] > S[1]:
  ans = '>'
else:
  ans = '='
  
print(ans)

Submission status: Accepted

Solution code:
A, B = input().split()

if A < B:
    print("<")
elif A > B:
    print(">")
elif A == B:
    print("=")

Submission status: Accepted

Solution code:
a, b = input().split()
if a == b:
  print("=")
else:
  print(">" if a > b else "<")

Submission status: Accepted

Solution code:
a,b = map(str, input().split())
if a < b:
    print("<") 
elif a > b:
    print(">")
else:
    print("=")

Submission status: Accepted

Solution code:
x,y = map(str,input().split())
if x>y:
  print(">")
elif x<y:
  print("<")
else:
  print("=")

Submission status: Accepted

Solution code:
A,B = map(str,input().split())

def comp(A,B):
    if A > B:
        return '>'
    elif A<B:
        return '<'
    else:
        return '='

ans = comp(A,B)
print(ans)

Submission status: Accepted

Solution code:
A,B=list(input().split())
if A < B:
  print("<")
elif A == B:
  print("=")
else:
  print(">")

Submission status: Accepted

Solution code:
x,y=input().split()
if x<y:
  print("<")
elif x>y:
  print(">")
else:
  print("=")

Submission status: Accepted

Solution code:
import sys
X,Y = map(str,input().split())

list = ['A','B','C','D','E','F']
if X not in list or Y not in list:
    sys.exit()

if ord(X) < ord(Y):
    print("<")
if ord(X) == ord(Y):
    print("=")
if ord(X) > ord(Y):
    print(">")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

A,B = S()
if ord(A) > ord(B):
    print('>')
if ord(A) == ord(B):
    print('=')
if ord(A) < ord(B):
    print('<')

Submission status: Accepted

Solution code:
X,Y=map(str,input().split())
if X<Y:
  print('<')
elif X>Y:
  print('>')
else:
  print('=')

Submission status: Accepted

Solution code:
x, y = input().split()
print(["=", ">", "<"][x>y or -(x<y)])

Submission status: Accepted

Solution code:
x,_,y=input()
print('=><'[(x>y)-(x<y)])

Submission status: Accepted

Solution code:
x,y=input().split();print("<" if x<y else "=" if x==y else ">" )

Submission status: Accepted

Solution code:
X,Y=input().split()

if X<Y:
	print("<")
else:
	if X>Y:
		print(">")
	else:
		print("=")

Submission status: Accepted

Solution code:
X, Y = input().split()

if (Y == "F"):
    if (X == "F"):
        print("=")
    else:
        print("<")

elif(Y == "E"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print("=")
    else:
        print("<")

elif(Y == "D"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print(">")
    elif (X == "D"):
        print("=")
    else:
        print("<")

elif (Y == "C"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print(">")
    elif (X == "D"):
        print(">")
    elif (X == "C"):
        print("=")
    else:
        print("<")

elif (Y == "B"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print(">")
    elif (X == "D"):
        print(">")
    elif (X == "C"):
        print(">")
    elif (X == "B"):
        print("=")
    else:
        print("<")
    
elif (Y == "A"):
    if (X == "A"):
        print("=")
    else:
        print(">")

Submission status: Accepted

Solution code:
x, y = input().split()
if x < y:
  print('<')
elif x == y:
  print('=')
else:
  print('>')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

x, y = map(str, input().split())

if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
x, y = input().split()
st = ['A','B','C','D','E','F']
xin = st.index(x)
yin = st.index(y)
if xin > yin:
    print('>')
elif xin < yin:
    print('<')
else:
    print('=')

Submission status: Accepted

Solution code:
x,y = input().split()
if ord(x) == ord(y):
    print("=")
elif ord(x) > ord(y):
    print(">")
else:
    print("<")

Submission status: Accepted

Solution code:
a,b = map(ord,input().split())
print(">" if a>b else "=" if a == b else "<")

Submission status: Accepted

Solution code:
X, Y = input().split()
print("<" if X < Y else "=" if X == Y else ">")

Submission status: Accepted

Solution code:
x,y=input().split()
if x<y:
  print('<')
elif x>y:
  print('>')
else:
  print('=')

Submission status: Accepted

Solution code:
def main():
    a, b = input().split()
    alphabet = {'A': 10, 'B': 11, 'C': 12, 'D': 13, 'E': 14, 'F': 15}
    if alphabet.get(a) < alphabet.get(b):
        print('<')
    elif alphabet.get(a) > alphabet.get(b):
        print('>')
    else:
        print('=') 
main()

Submission status: Accepted

Solution code:
x,y=map(str,input().split())
if x>y:
    print(">")
if x<y:
    print("<")
if x==y:
    print("=")

Submission status: Accepted

Solution code:
X, Y = map(str, input().split())

if X < Y:
    print("<")
elif X == Y:
    print("=")
else:
    print(">")

Submission status: Accepted

Solution code:
A,B,C,D,E,F = 10,11,12,13,14,15
x,y = map(str,input().split())
if x < y:
  print("<")
elif x > y:
  print(">")
else:
  print("=")

Submission status: Accepted

Solution code:
a, b = input().split()
if a > b: print('>')
elif a == b: print('=')
else: print('<')

Submission status: Accepted

Solution code:
x, y = input().split()
if x > y:
  print('>')
elif x == y:
  print('=')
else:
  print('<')

Submission status: Accepted

Solution code:
x, y = input().split()
if x > y:
  print('>')
elif x < y:
  print('<')
else:
  print('=')

Submission status: Accepted

Solution code:
x,y=input().split()
if x>y:
  ans=">"
elif x==y:
  ans="="
else:
  ans="<"
  
print(ans)

Submission status: Accepted

Solution code:
X,Y = input().split()

arb = ['A','B','C','D','E','F']

print('=' if arb.index(X) == arb.index(Y) else '<'  
if arb.index(X) < arb.index(Y) else '>')

Submission status: Accepted

Solution code:
X,Y = input().split()

if X<Y:
  print("<")
elif X==Y:
  print("=")
else:
  print(">")

Submission status: Accepted

Solution code:
c,d=map(str,input().split())
n=sorted([c,d])
a=n.index(c)
b=n.index(d)
if a>b:
  print('>')
elif a==b:
  print('=')
else:
  print('<')

Submission status: Accepted

Solution code:
def actual(x, y):
    ord_x = ord(x)
    ord_y = ord(y)
    
    if ord_x < ord_y:
        return '<'

    if ord_x > ord_y:
        return '>'

    return '='

x, y = input().split()
print(actual(x, y))

Submission status: Accepted

Solution code:
x, y = map(str, input().split())
if x < y:
  print("<")
elif x == y:
  print("=")
else:
  print(">")

Submission status: Accepted

Solution code:
x, y = input().split()
ans = "="
if x < y:
    ans = "<"
elif x > y:
    ans = ">"
print(ans)

Submission status: Accepted

Solution code:
X, Y = map(str, input().split())
if X > Y: print(">")
elif X == Y: print("=")
else: print("<")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    X, Y = input().split()

    if X < Y:
        ans = "<"
    elif X > Y:
        ans = ">"
    else:
        ans = "="

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

L = ["A","B","C","D","E","F"]
P,Q = input().split()
p = L.index(P)
q = L.index(Q)
if p>q:
  print(">")
elif p<q:
  print("<")
else:
  print("=")

Submission status: Accepted

Solution code:
a,b=input().split();print('=' if a==b else '<' if a<b else '>')

Submission status: Accepted

Solution code:
lst=['A','B','C','D','E','F']
x,t=input().split()
if lst.index(x) > lst.index(t):
  print('>')
elif lst.index(x) < lst.index(t):
  print('<')
else:
  print('=')

Submission status: Accepted

Solution code:
x,y=input().split()
if ord(x)<ord(y):
  print('<')
elif ord(x)>ord(y):
  print('>')
else:
  print('=')

Submission status: Accepted

Solution code:
a,b = map(str,input().split())
if ord(a) == ord(b):
  print("=")
elif ord(a) > ord(b):
  print(">")
else:
  print("<")

Submission status: Accepted

Solution code:
x, y = input().split()
if x < y: print("<")
elif x > y: print(">")
else: print("=")

Submission status: Accepted

Solution code:
x, y = input().split()

dict = { 'A':10 , 'B':11 , 'C':12 , 'D':13, 'E':14, 'F':15 }

if dict[x] > dict[y]:
  print('>')
elif dict[x] == dict[y]:
  print('=')
else:
  print('<')

Submission status: Accepted

Solution code:
X,Y=input().split()
if X<Y:
  print("<")
elif X>Y:
  print(">")
else:
  print("=")

Submission status: Accepted

Solution code:
a, b = input().split()
print(">" if a > b else "<" if a < b else "=")

Submission status: Accepted

Solution code:

import math

x,y=input().split()
if(ord(x)>ord(y)):
    print(">")
elif(ord(x)==ord(y)):
    print("=")
else:
    print("<")

Submission status: Accepted

Solution code:
x,y = map(str,input().split())
if x > y:
  print('>')
elif x < y:
  print('<')
else:
  print('=')

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- Coding: utf-8 -*-

x, y = input().split()

a = int(x, 16)
b = int(y, 16)

if a > b:
    print(">")
elif a < b:
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
X,Y=input().split()

if X<Y:
  print("<")
elif X==Y:
  print("=")
else:
  print(">")

Submission status: Accepted

Solution code:
x, y = input().split()

if ord(x) > ord(y):
    print(">")
elif ord(x) < ord(y):
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
x, y = map(str, input().split())
A = 10
B = 11
C = 12
D = 13
E = 14
F = 15
if x < y:
    print("<")
elif x > y:
    print(">")
else:
    print("=")

Submission status: Accepted

Solution code:
x,y = input().split()

a = ord(x)
b = ord(y)
if a<b:
  print("<")
elif a>b:
  print(">")
else:
  print("=")

Submission status: Accepted

Solution code:
X, Y = input().split()
print("<" if X<Y else ">" if X>Y else "=")

Submission status: Accepted

Solution code:
a_list = ['A', 'B', 'C', 'D', 'E', 'F']
x, y = input().split()
if int(a_list.index(x)) > int(a_list.index(y)):
    print('>')
elif int(a_list.index(x)) < int(a_list.index(y)):
    print('<')
else:
    print('=')

Submission status: Accepted

Solution code:
x,y=map(str,input().split())
arr=['A','B','C','D','E','F']
if arr.index(x)<arr.index(y):
    print('<')
elif arr.index(x)>arr.index(y):
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
x, y = list(map(str, input().split()))

if x < y:
    print("<")
elif x == y:
    print("=")
else:
    print(">")

Submission status: Accepted

Solution code:
x, y = input().split()
if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Submission status: Accepted

Solution code:
a,b = input().split()
if a < b: print('<')
elif a > b: print('>')
else: print('=')

Submission status: Accepted

Solution code:
x,y=input().split()
print("<" if x<y else "=" if x==y else ">")

Submission status: Accepted

Solution code:
x, y = map(str, input().split())
if ord(x) > ord(y): print('>')
elif ord(x) < ord(y): print('<')
else: print('=')

Submission status: Accepted

Solution code:
X, Y = input().split()
if X < Y:
  print('<')
elif X > Y:
  print('>')
else:
  print('=')

Submission status: Accepted

Solution code:
X,Y=map(str,input().split())
a=['A','B','C','D','E','F']
b=['10','11','12','13','14','15']

for i in range(6):
  if X==a[i]:
    X=b[i]
  if Y==a[i]:
    Y=b[i]
    
if X<Y:
  print('<')
elif X==Y:
  print('=')
else:
  print('>')

Submission status: Accepted

Solution code:
X,Y = map(str, input().split())
l = ['A','B','C','D','E','F']
if l.index(X)>l.index(Y):
  print('>')
elif l.index(X)<l.index(Y):
  print('<')
else:
  print('=')

Submission status: Accepted

Solution code:
X,Y = input().split()

x = "ABCDEF".index(X)
y = "ABCDEF".index(Y)

if x==y:
  print("=")
elif x>y:
  print(">")
else:
  print("<")

Submission status: Accepted

Solution code:
x,y=input().split()
if x>y:
    print('>')
elif x==y:
    print('=')
else:
    print('<')

Submission status: Accepted

Solution code:
a,b=input().split()
print(">") if a>b else print("<") if a<b else print("=")

Submission status: Accepted

Solution code:
X, Y = input().split()
if ord(X) > ord(Y):
    print('>')
elif ord(X) == ord(Y):
    print('=')
else:
    print('<')

Submission status: Accepted

Solution code:
A,B = input().split()
if A>B:
  print(">")
elif A==B:
  print("=")
else:
  print("<")

Submission status: Accepted

Solution code:
X, Y = input().split()
if X == Y:
    print("=")
elif X > Y:
    print(">")
else:
    print("<")

Submission status: Accepted

Solution code:
x,y = input().split()
li = ['A','B','C','D','E','F']
x = li.index(x)
y = li.index(y)
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
a,b = input().split()

def xy(a):
    if a =="A":
        return 10
    elif a =="B":
        return 11
    elif a =="C":
        return 12
    elif a =="D":
        return 13
    elif a =="E":
        return 14
    elif a =="F":
        return 15
    
if xy(a) > xy(b):
    print(">")
elif xy(a) < xy(b):
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
a, b= map(str, input().split())
if a == b:
  print('=')
else:
  a = int(a, 16)
  b = int(b, 16)
  if a > b:
    print('>')
  else:
    print('<')

Submission status: Accepted

Solution code:
x,y=input().split()
sixt={'A':10,'B':11,'C':12,'D':13,'E':14,'F':15}
if sixt[x]>sixt[y]:
    print('>')
elif sixt[x]<sixt[y]:
    print('<')
else:
    print('=')

Submission status: Accepted

Solution code:
x, y = map(str, input().split())
li=[x, y]
li1 = [x, y]
li.sort()
if x==y:
  print('=')
elif li==li1:
  print('<')
else:
  print('>')

Submission status: Accepted

Solution code:
x,y=input().split()
if ord(x) < ord(y):
  print("<")
elif x==y:
  print("=")
else:
  print(">")

Submission status: Accepted

Solution code:
x, y = input().split()
print("<" if x < y else (">" if x > y else "="))

Submission status: Accepted

Solution code:
x,y=input().split()
if x>y:
    print(">")
elif x<y:
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
lst=["A","B","C","D","E","F"]
a=input()
if lst.index(a[0])>lst.index(a[2]):
    print(">")
elif lst.index(a[0])==lst.index(a[2]):
    print("=")
else:
    print("<")

Submission status: Accepted

Solution code:
X,Y = input().split()

if X > Y:
  print('>')
elif X < Y:
  print('<')
else:
  print('=')

Submission status: Accepted

Solution code:
x,y = map(str,input().split())
print(">") if ord(x)>ord(y) else print("<") if ord(x)<ord(y) else print("=")

Submission status: Accepted

Solution code:
x,y=input().split();print("="if x==y else">"if x>y else"<")

Submission status: Accepted

Solution code:

x,y=map(str,input().split())

l=list('ABCDEF')

xi=l.index(x)
yi=l.index(y)

if (xi<yi):print('<')
elif (xi>yi):print('>')
else:print('=')

Submission status: Accepted

Solution code:
X, Y = list(map(str, input().split()))

if ord(X) > ord(Y):
  print(">")
elif ord(X) < ord(Y):
  print("<")
else:
  print("=")

Submission status: Accepted

Solution code:
x, y = input().split()
print('>' if x > y else '=' if x == y else '<')

Submission status: Accepted

Solution code:
xy = input()
x, y = xy[0], xy[2]

if x < y:
    print("<")
elif x == y:
    print("=")
else:
    print(">")

Submission status: Accepted

Solution code:
X,Y=input().split()
if X<Y:
    print('<')
elif X==Y:
    print('=')
else:
    print('>')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

def main():
    x,y = input().split()

    if x == y:
        print('=')
    elif x < y:
        print('<')
    else:
        print('>')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X, Y = input().split()
x = ord(X); y = ord(Y)

if x < y:
  print('<')
elif x == y:
  print('=')
else:
  print('>')

Submission status: Accepted

Solution code:
x,y=map(str,input().split())
a=['A','B','C','D','E','F']
x=a.index(x)
y=a.index(y)
if x>y:
    print('>')
elif x<y:
    print('<')
else:
    print('=')

Submission status: Accepted

Solution code:
x,y=input().split()
print('<' if x<y else '>' if x>y else '=')

Submission status: Accepted

Solution code:
x,y=input().split()
if ord(x)>ord(y):
  print('>')
elif ord(x)==ord(y):
  print('=')
else:
  print('<')

Submission status: Accepted

Solution code:
z = input().split()
l = {
  'A': 1
  , 'B': 2
  , 'C': 3
  , 'D': 4
  , 'E': 5
  , 'F': 6
}
x = l[z[0]]
y = l[z[1]]
if x > y:
  print('>')
elif x < y:
  print('<')
else:
  print('=')

Submission status: Accepted

Solution code:
X,Y = input().split()
print("<" if X < Y else ">" if X>Y else "=")

Submission status: Accepted

Solution code:
x, y = map(str, input().split())
s = ['A', 'B', 'C', 'D', 'E', 'F']
for i in range(6):
    if x == s[i]:
        xi = i
    if y == s[i]:
        yi = i
if xi > yi:
    print('>')
elif xi < yi:
    print('<')
else:
    print('=')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x, y = readline().decode().split()
# x = int(x.lower(), 16)
# y = int(y.lower(), 16)
if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x, y = readline().decode().split()
x = int(x.lower(), 16)
y = int(y.lower(), 16)
if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Submission status: Accepted

Solution code:
x, y = map(str, input().split())
print("<" if x < y else "=" if x == y else ">")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = input().split()
    if a < b:
        print('<')
    elif a == b:
        print('=')
    else:
        print('>')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

X, Y = input().split()

if X == Y:
    print('=')
elif X < Y:
    print("<")
else:
    print(">")