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 ord(x) == ord(y):
    print("=")
elif ord(x) > ord(y):
    print(">")
else:
    print("<")

Submission status: Accepted

Solution code:
X, Y = map(str, input().split())
lst = ["A","B","C","D","E","F"]
x = lst.index(X)
y = lst.index(Y)

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

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()
print("<"if x<y else ">" if x>y else"=")

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]

if a.index(X) > a.index(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 int(x,16)>int(y,16):
  print(">")
elif int(x,16)<int(y,16):
  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:
import sys
s = list(input().split())
if s[0] == s[1]:
    print("=")
    sys.exit()
r = sorted(s)
if s == r:
    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:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X, Y = map(str, input().split())

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

Submission status: Accepted

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

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 = map(str, 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:
a, b = input().split()
if a < b:
    print('<')
elif a > b:
    print('>')
else:
    print('=')

Submission status: Accepted

Solution code:
X,Y=input().split()
XY=[X,Y]
XY.sort()
if X==Y:
    print("=")
elif X==XY[0]:
    print("<")
else:
    print(">")

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

X,Y = inputSL()

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:
X,Y=input().split()
if (X<Y):
    print("<")
elif (X==Y):
    print("=")
elif (X>Y):
    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()
print("<" if X<Y else "=" if X==Y else ">")

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    x, y = input().split()
    if ord(x) < ord(y):
        print('<')
    elif ord(x) > ord(y):
        print('>')
    else:
        print('=')
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

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()
shinsu = {
    'A':1,
    'B':2,
    'C':3,
    'D':4,
    'E':5,
    'F':6
}

if shinsu[x] < shinsu[y]:
    print('<')
elif shinsu[x] > shinsu[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:
S = list(map(str, input().split()))
if S[0] == S[1]:
    print("=")
    exit()
if S == sorted(S):
    print("<")
else:
    print(">")

Submission status: Accepted

Solution code:
A = list(input().split())
if A[0] == A[1]:
    print("=")
elif min(A[0],A[1]) == A[1]:
    print(">")
else:
    print("<")

Submission status: Accepted

Solution code:
X, Y = input().split()
print('<' if Y>X else '>' if X>Y 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:
a,b = (str(x) for x in input().split())
if a < b:
    print("<")
elif a > b:
    print(">")
else:
    print("=")

Submission status: Accepted

Solution code:
h=list('ABCDEF')
X,Y=input().split()
if X==Y: print('=')
else: print('<' if h.index(X)<h.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:
def ABC_78_A():
    X,Y = map(str, input().split())
    list1 = ['A','B','C','D','E','F']
    list2 = [10,11,12,13,14,15]
    
    if list2[list1.index(X)] > list2[list1.index(Y)]:
        print('>')
    elif list2[list1.index(X)] < list2[list1.index(Y)]:
        print('<')
    else:
        print('=')



if __name__ == '__main__':

    ABC_78_A()

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:
N16 = {'A':1,'B':2,'C':3,'D':4,'E':5,'F':6,}
X,Y = input().split()
if N16[X] == N16[Y]:
    print('=')
elif N16[X] > N16[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:
def resolve():
	x, y = input().split()
	if ord(x) > ord(y):
		print('>')
	elif ord(x) == ord(y):
		print('=')
	else:
		print('<')
resolve()

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
X, Y = rs_()
print('=' if X == Y else '<' if X < Y else '>')

Submission status: Accepted

Solution code:
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 = 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=map(str,input().split())

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=input().split()
    a=ord(a)
    b=ord(b)
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')
resolve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    L=[0,1,2,3,4,5,6,7,8,9,'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('<')

    
resolve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=input().split()
    l=['A','B','C','D','E','F']
    if l.index(a)<l.index(b):
        print('<')
    elif l.index(a)>l.index(b):
        print('>')
    else:
        print('=')
resolve()

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:
A,B = input().split()

print('<' if A < B else '=' 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()
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:
X, Y = input().split()
if X == Y:
    print("=")
elif X > Y:
    print(">")
elif X < Y:
    print("<")

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]
## math ##
def to_bin(x: int) -> str: return format(x, 'b') # rev => int(res, 2)
def to_oct(x: int) -> str: return format(x, 'o') # rev => int(res, 8)
def to_hex(x: int) -> str: return format(x, 'x') # rev => int(res, 16)
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
## libs ##
from itertools import accumulate as acc, combinations as combi, product, combinations_with_replacement as combi_dup
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left
#======================================================#

def main():
    x, y = IS().split()
    if x < y:
        print('<')
    elif x > y:
        print('>')
    else:
        print('=')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
dic = {'A':10,'B':11,'C':12,'D':13,'E':14,'F':15}
x,y = input().split()
if dic[x] > dic[y]:
  print('>')
elif dic[x] < dic[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:
#!/usr/bin/env python3

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:
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()
a=ord(x)
b=ord(y)
if a>b:
    print(">")
elif a==b:
    print("=")
else:
    print("<")

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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 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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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:
s='ABCDEF'
a,b=input().split()
x=s.find(a)
y=s.find(b)
if x==y:
  print('=')
elif x>y:
  print('>')
else:
  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:
dict = {'A':10,'B':11,'C':12,'D':13,'E':14,'F':15}
x,y = map(str,input().split())

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

Submission status: Accepted

Solution code:
a=[i for i in input().split()]
if a[0]==a[1]:
    print("=")
elif a==sorted(a):
    print("<")
else:
    print(">")

Submission status: Accepted

Solution code:
X,Y = map(str,input().split())
dic = {"A":10,"B":11,"C":12,"D":13,"E":14,"F":15}
if dic[X]<dic[Y]:
    print("<")
elif dic[X]>dic[Y]:
    print(">")
elif dic[X] ==dic[Y]:
    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']
x =List.index(a)
y = List.index(b)
if x > y:
  print('>')
elif x ==y:
  print('=')
else:
  print('<')

Submission status: Accepted

Solution code:
x,y=map(str,input().split())
xx=ord(x)
yy=ord(y)
if xx<yy:
  print("<")
elif xx==yy:
  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:
a,b=map(str,input().split())
print("<" if a<b else ">" 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:
a,b = input().split()
dic = {'A':0, 'B':1, 'C':2, 'D':3, 'E':4, 'F':5}
if dic[a] > dic[b]:
    print(">")
elif dic[a] == dic[b]:
    print("=")
else:
    print("<")

Submission status: Accepted

Solution code:
x,y=input().split()
L=[x,y]
L.sort()
if x==y:
  print('=')
elif L[0]==x:
  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=sorted([x,y])
if x==y:
    print("=")
elif x==a[1]:
    print(">")
else:
    print("<")

Submission status: Accepted

Solution code:
S=input()
A=ord(S[0])
B=ord(S[2])

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

Submission status: Accepted

Solution code:
s1,s2=input().split(" ")
s1=s1.lower()
s2=s2.lower()
flag=0
if(len(s1)>len(s2)):
   a=len(s2)
else:
    a=len(s1)

for i in range(0,a):
    if(s1[i]==s2[i]):
        flag=flag+1
    elif(s1[i]>s2[i]):
            print('>')
            break;
    elif(s1[i]<s2[i]):
            print('<')
            break;
if(flag==a):
    if(len(s1)>len(s2)):
        print(">")

    elif(len(s1)<len(s2)):
        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:
array = ['A', 'B', 'C', 'D', 'E', 'F']
X, Y = map(str, input().split())
if X == Y:
    print("=")
elif array.index(X) > array.index(Y):
    print(">")
else:
    print("<")

Submission status: Accepted

Solution code:
array = ['A', 'B', 'C', 'D', 'E', 'F']
X, Y = map(str, input().split())
if X == Y:
    print("=")
elif array.index(X) > array.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 ord(x) < ord(y):
    print('<')
elif ord(x) > ord(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 x==y:
    print("=")
elif d[x]<d[y]:
    print("<")
else:
    print(">")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi
#from operator import itemgetter
from copy import deepcopy
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [LI()for i in range(n)]
inf = 10**17
mod = 10**9 + 7

def trans(s):
    if s=="A":
        return 10
    elif s=="B":
        return 11
    elif s=="C":
        return 12
    elif s=="D":
        return 13
    elif s=="E":
        return 14
    elif s=="F":
        return 15
xy=input().rstrip().split(" ")
x,y=xy[0],xy[1]
if trans(x)>trans(y):
    print(">")
if trans(x)==trans(y):
    print("=")
if trans(x)<trans(y):
    print("<")

Submission status: Accepted

Solution code:
list_XY = input().split()
list_XY_sorted = sorted(list_XY)

if list_XY[0] == list_XY[1]:
    print('=')
elif list_XY == list_XY_sorted:
    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 = list(map(str,input().split()))
if a[0] == a[1]:
    print("=")
    exit()
b = sorted(a)
if a == b:
    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:
list=["A","B","C","D","E","F"]
a,b=[str(i) for i in input().split()]
if list.index(a)==list.index(b):
  print("=")
elif list.index(a)>list.index(b):
  print(">")
else:
  print('<')

Submission status: Accepted

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

Submission status: Accepted

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

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 A < B:
    print("<")
elif A == B:
    print("=")
else:
    print(">")

Submission status: Accepted

Solution code:
x,y=map(str,input().split())
x=int(x,16)
y=int(y,16)
if x>y:
    print(">")
elif x<y:
    print("<")
elif x==y:
    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()
strings="A","B","C","D","E","F"
if X==Y:
    print("=")
elif Y<X:
    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:

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


if '__main__' == __name__:
    resolve()

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:
x,y =input().split()
print(">" if x>y else "<" if x<y else "=")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y=map(str, input().split())
str_list = 'ABCDEF'
x=str_list.index(X)
y=str_list.index(Y)
if x<y : print('<')
if x==y: print('=')
if x>y : print('>')

Submission status: Accepted

Solution code:
s = list(input())

if s[0] == s[2]:
  print("=")
elif s[0] < s[2]:
  print("<")
else:
  print(">")

Submission status: Accepted

Solution code:
x = list(map(str, input().split()))
a = int(x[0],16)
b = int(x[1],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:
a,b =list(input().split())
if ord(a) < ord(b):
  print("<")
elif ord(b) < ord(a):
  print(">")
else:
  print("=")

Submission status: Accepted

Solution code:
A=int(10)
B=int(11)
C=int(12)
D=int(13)
E=int(14)
F=int(15)

N,M=input().split()
if N>M:
  print(">") 
elif N==M:
  print("=")
else:
  print("<")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

li2 = sorted(li)

if li[0] == li[1]:
  print("=")

elif li == li2:
  print("<")
  
else:
  print(">")

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


x,y = input().split()

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

Submission status: Accepted

Solution code:
def slove(n, m):
    if n < m:
        tmp = "<"
    elif n > m:
        tmp = ">"
    else:
        tmp = "="
    return tmp

if __name__ == "__main__":
    n, m = [i for i in input().split()]
    print(slove(n, m))

Submission status: Accepted

Solution code:
from sys import stdin
import math

a=input()
if (a[0]<a[2]):
    print("<")
elif(a[0]==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:
if __name__ == "__main__":
    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=[int(x,16) for x in input().split()]
if(x>y):
    print(">")
elif(x<y):
    print("<")
else:
    print("=")

Submission status: Accepted

Solution code:
a1, a2 = map(str, input().split())
x = 'ABCDEF'
c = x.index(a1)
d = x.index(a2)
if c == d:
  print('=')
elif c > d:
  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 = input().split()

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

Submission status: Accepted

Solution code:
# n = int(input())

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

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

Submission status: Accepted

Solution code:
icase=0    
if icase==0:
    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())
if x < y:
  print('<')
elif x == y:
  print('=')
else:
  print('>')

Submission status: Accepted

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

x, y = input().split()

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

Submission status: Accepted

Solution code:
def main():
    x, y = input().split()
    x = int(x, 16)
    y = int(y, 16)

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

Submission status: Accepted

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

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

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