Problem:


Score : 200 points

Problem Statement

You are given two positive integers A and B. Compare the magnitudes of these numbers.

Constraints

1 ≤ A, B ≤ 10^{100}

Neither A nor B begins with a 0.

Input

Input is given from Standard Input in the following format:

A
B

Output

Print GREATER if A>B, LESS if A<B and EQUAL if A=B.

Sample Input 1

36
24

Sample Output 1

GREATER

Since 36>24, print GREATER.

Sample Input 2

850
3777

Sample Output 2

LESS

Sample Input 3

9720246
22516266

Sample Output 3

LESS

Sample Input 4

123456789012345678901234567890
234567890123456789012345678901

Sample Output 4

LESS



Sample input:
36
24


Sample output:
GREATER

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
    print("GREATER")
elif a == b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = int(input())
    b = int(input())

    if a > b:
        print("GREATER")
    elif a < b:
        print("LESS")
    else:
        print("EQUAL")

Submission status: Accepted

Solution code:
# abc059_b.py
A = int(input())
B = int(input())
if A>B:
    print('GREATER')
elif A==B:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A>B:
    print("GREATER")
elif A<B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
def solve(i, j):
    if i > j:
        print("GREATER")
        exit()
    if i < j:
        print("LESS")
        exit()
a = input()
b = input()
solve(len(a), len(b))
if int(a) == int(b):
    print("EQUAL")
    exit()
for ai, bi in zip(a, b):
    solve(int(ai), int(bi))

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A == B:print('EQUAL')
elif A > B:print('GREATER')
else:print('LESS')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a>b:
    print("GREATER")
elif a==b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A>B:
  print('GREATER')
elif A<B:
  print('LESS')
else:
  print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
print('GREATER' if A>B else 'LESS' if A<B else 'EQUAL')

Submission status: Accepted

Solution code:
A, B = int(input()), int(input())
if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a > b:
  print("GREATER")
if b > a:
  print("LESS")
if b == a:
  print("EQUAL")

Submission status: Accepted

Solution code:
# a,b = map(int,input().rstrip().split(' '))
a = int(input().rstrip())
b = int(input().rstrip())
if(a>b):print("GREATER")
elif(a<b):print("LESS")
else:print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a>b:
    print("GREATER")
elif a==b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a>b:
    result="GREATER"
if a<b:
    result="LESS"
if a==b:
    result="EQUAL"
print(result)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a>b:
    print('GREATER')
elif a<b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    a=int(input())    
    b=int(input())    
    if a>b:
        print("GREATER")
    elif a<b:
        print("LESS")
    else:
        print("EQUAL")

Submission status: Accepted

Solution code:
a=input()
b=input()
if len(a)==len(b):
  if a>b:
    print("GREATER")
  elif a<b:
    print("LESS")
  else :
    print("EQUAL")
else :
  if len(a)>len(b):
    print("GREATER")
  else:
    print("LESS")

Submission status: Accepted

Solution code:
n,m=map(int,open(0))
print('GREATER' if n>m else 'ELQEUSASL'[n<m::2])

Submission status: Accepted

Solution code:
# =map(int,input().split())
n=int(input())
m=int(input())
if n>m:
    print('GREATER')
elif n==m:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:

def myAnswer(A:int,B:int)-> str:
   if(A >B): return "GREATER"
   if(A<B): return "LESS"
   if(A==B): return "EQUAL"

def modelAnswer():
   tmp=1
def main():
   A = int(input())
   B = int(input())
   print(myAnswer(A,B))

if __name__ == '__main__':
   main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a>b:
  print("GREATER")
elif a<b:
  print("LESS")
else:
  print("EQUAL")

Submission status: Accepted

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

a = int(input())
b = int(input())
if a>b:
    print("GREATER")
elif a == b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A>B: print("GREATER")
elif A == B : print("EQUAL")
else: print("LESS")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b :
  print("GREATER")
elif a==b:
  print("EQUAL")
else:
  print("LESS")

Submission status: Accepted

Solution code:

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

if a > b:
    print("GREATER")
elif a < b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
def main():
    A = int(input())
    B = int(input())
    if A > B:
        print("GREATER")
    elif A < B:
        print("LESS")
    else:
        print("EQUAL")
main()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    A = int(input())
    B = int(input())

    if A > B:
        ans = "GREATER"
    elif A < B:
        ans = "LESS"
    else:
        ans = "EQUAL"
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A = input()
B = input()

LA = len(A)
LB = len(B)

if LA > LB:
    ans = 'GREATER'
elif LA < LB:
    ans = 'LESS'
else:
    for a, b in zip(A, B):
        if a > b:
            ans = 'GREATER'
            break
        elif a < b:
            ans = 'LESS'
            break
    else:
        ans = 'EQUAL'

print(ans)

Submission status: Accepted

Solution code:
A=int(input())
B = int(input())
if A>B:
    print('GREATER')
elif A<B:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if (A > B):
    print("GREATER")
elif (A == B):
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a >b:print('GREATER')
elif a < b:print('LESS')
else:print('EQUAL')

Submission status: Accepted

Solution code:
# ABC 059: B – Comparison
a, b = [input() for _ in range(2)]

if len(a) > len(b):
    print('GREATER')
elif len(a) < len(b):
    print('LESS')
else:
    if a > b:
        print('GREATER')
    elif a < b:
        print('LESS')
    else:
        print('EQUAL')

Submission status: Accepted

Solution code:
# ABC 059: B – Comparison
a, b = [int(input()) for _ in range(2)]
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
"""
A
>
B
 のときGREATER、
A
<
B
 のときLESS、
A
=
B
 のときEQUALと出力せよ。

"""
A,B=map(int,open(0).read().split())
if A>B:ans="GREATER"
if A<B:ans="LESS"
if A==B:ans="EQUAL"
print(ans)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A = INT()
B = INT()

if A > B :
    print("GREATER")
elif A < B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
import sys

def solve():
    A = int(input())
    B = int(input())
    if A > B: print("GREATER")
    elif A < B: print("LESS")
    else: print("EQUAL")
            
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:
    print("GREATER")
elif a<b:
    print("LESS")
elif a==b:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a>b:print("GREATER")
elif(b>a): print("LESS")
else:print("EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B:
    print('GREATER')
elif B > A:
    print('LESS')
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A = input()
B = input()
if len(A) > len(B):
    print("GREATER")
elif len(A) < len(B):
    print("LESS")
else:
    for k in range(len(A)):
        if int(A[k]) > int(B[k]):
            print("GREATER")
            exit(0)
        elif int(A[k]) < int(B[k]):
            print("LESS")
            exit(0)
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if(a>=b): 
    if(a==b): print('EQUAL')
    else: print('GREATER')
else: print('LESS')

Submission status: Accepted

Solution code:
A, B = int(input()), int(input())

if A > B:
    print("GREATER")
elif A == B:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a<b:
    print('LESS')
elif a==b:
    print('EQUAL')
else:
    print('GREATER')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A = int(input())
B = int(input())
if A < B: print("LESS")
elif A == B: print("EQUAL")
else: print("GREATER")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A < B:
    print('LESS')
elif A == B:
    print('EQUAL')
else:
    print('GREATER')

Submission status: Accepted

Solution code:
a =int(input())
b = int(input())
if a==b:
    print('EQUAL')
elif a>b:
    print('GREATER')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a= int(input())
b = int(input())
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
print('GREATER' if A>B else 'LESS' if A<B else "EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B: ans = "GREATER"
elif A < B: ans = "LESS"
else: ans = "EQUAL"
print(ans)

Submission status: Accepted

Solution code:
def main():
    a = int(input())
    b = int(input())
    if a > b:
        print("GREATER")
    elif a == b:
        print("EQUAL")
    else:
        print("LESS")


if __name__ == '__main__':
    main()

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

A = INT()
B = INT()

if A > B:
	print("GREATER")
elif B > A:
	print("LESS")
else:
	print("EQUAL")

Submission status: Accepted

Solution code:
#coding:utf-8
a = int(input())
b = int(input())

if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print('GREATER' if a > b else 'LESS' if a < b else 'EQUAL')

Submission status: Accepted

Solution code:
A=input().rstrip()
B=input().strip()
if len(A)>len(B): print("GREATER")
elif len(A)<len(B): print("LESS")
else:
  if A==B: print("EQUAL")
  elif A>B: print("GREATER")
  else: print("LESS")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B:
    print("GREATER")
elif A == B:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a,s=int(input()),int(input())
print("GREATER" if a>s else "LESS" if a<s else "EQUAL")

Submission status: Accepted

Solution code:
a = input()
b = input()
if len(a) > len(b):
    ans = 'GREATER'
elif len(b) > len(a):
    ans = 'LESS'
elif a > b:
    ans = 'GREATER'
elif b > a:
    ans = 'LESS'
else:
    ans = 'EQUAL'
print(ans)

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
print('GREATER' if a>b else 'LESS' if a<b else 'EQUAL')

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
a = ii()
b = ii()

if a > b:
    print('GREATER')
elif a == b:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a < b:
    ans = 'LESS'
elif b < a:
    ans = 'GREATER'
else:
    ans = 'EQUAL'

print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
ans = 'EQUAL' if a == b else 'GREATER' if a > b else 'LESS'
print(ans)

Submission status: Accepted

Solution code:
a,b=[int(input()) for i in range(2)]
print("GREATER" if a>b else "LESS" if a<b else "EQUAL")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

if a>b:
    print('GREATER')
elif a<b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = input()
b = input()

if len(a)==len(b):
    for i in range(len(a)):
        if a[i]>b[i]:
            print("GREATER")
            quit()
        elif a[i]<b[i]:
            print("LESS")
            quit()
            
elif len(a)>len(b):
    print("GREATER")
    quit()
else:
    print("LESS")
    quit()

print("EQUAL")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

if a>b:
    print("GREATER")
elif b>a:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
print('GREATER' if A > B else 'LESS' if A < B else 'EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

AsubB = A - B

if AsubB < 0:
    print("LESS")
elif AsubB > 0:
    print("GREATER")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a, b = map(int, open(0))
print([["LESS","GREATER"][a>b], "EQUAL"][a==b])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
     print("GREATER")
elif a < b:
     print("LESS")
else:
     print("EQUAL")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a<b:
  print('LESS')
elif a==b:
  print('EQUAL')
else:
  print('GREATER')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

if a==b:
    print("EQUAL")
elif a>b:
    print("GREATER")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a = input()
b = input()

lena=len(a)
lenb=len(b)

s = [a,b]
s.sort()

ans = 0
if lena>lenb:
  ans = a
elif lena<lenb:
  ans = b
elif s[0] == s[1]:
  ans = 0
else:
  ans = s[1]
  
if ans==0:
  print("EQUAL")
elif ans==a:
  print("GREATER")
else:
  print("LESS")

Submission status: Accepted

Solution code:
a, b = (int(input()) for _ in range(2))
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

# 10^100って扱えるっけ
result = ''
if (A > B):
  result = 'GREATER'
elif (A < B):
  result = 'LESS'
else:
  result = 'EQUAL'

print(result)

Submission status: Accepted

Solution code:
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""

# Written by NoKnowledgeGG @YlePhan

#import math
#mod = 10**9+7



def main():
  a = int(input())
  b = int(input())
  if a > b:
    print('GREATER')
  elif a < b:
    print('LESS')
  else:
    print('EQUAL')
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A == B:
    print('EQUAL')
else:
    print('GREATER' if A>B else 'LESS')

Submission status: Accepted

Solution code:

import math
import itertools
import statistics
#import numpy as np
import collections

#n = int(input())
#n, m = list(map(int, input().split()))
a = int(input())
b = int(input())
if a>b:
    print("GREATER")
elif a<b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
ans = ["GREATER", "LESS", "EQUAL"]
A = int(input())
B = int(input())
if A > B:
    print(ans[0])
elif A == B:
    print(ans[2])
else:
    print(ans[1])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a>b:ans='GREATER'
elif a<b:ans='LESS'
else:ans='EQUAL'
print(ans)

Submission status: Accepted

Solution code:
n=int(input())

s=int(input())

if s<n:
    print('GREATER')
elif s==n:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:

A = int(input())
B = int(input())

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

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else :
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print("LESS" if a<b else "EQUAL" if a == b else "GREATER")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:print('GREATER')
elif a<b:print('LESS')
else:print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a > b:
	print("GREATER")
if a == b:
	print("EQUAL")
if a < b:
	print("LESS")

Submission status: Accepted

Solution code:
a = input()
b = input()
if len(a) < len(b):
    print("LESS")
elif len(a) > len(b):
    print("GREATER")
else:
    if a < b:
        print("LESS")
    elif a > b:
        print("GREATER")
    else:
        print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
r = ''
if a == b:
	r = 'EQUAL'
else:
	r = 'GREATER' if a > b else 'LESS'
print(r)

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Sat Mar 28 10:36:41 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a = ns()
b = ns()

if len(a) > len(b):
    c = ''.join(['0' for _ in range(len(a) - len(b))])
    b = c + b
elif len(a) < len(b):
    c = ''.join(['0' for _ in range(len(b) - len(a))])
    a = c + a

if a > b:
    print("GREATER")
elif a < b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

A_s =str(A)
B_s = str(B)

if len(A_s) > len(B_s):
    print("GREATER")
elif len(A_s) < len(B_s):
    print("LESS")
else:
    for i in range(len(A_s)):
        if A_s[i] > B_s[i]:
            print("GREATER")
            break
        elif A_s[i] < B_s[i]:
            print("LESS")
            break
        elif (A_s[i] == B_s[i]) & (i == len(A_s)-1):
            print("EQUAL")
            break

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if (a-b) == 0:
    print('EQUAL')
    
if (a-b) > 0:
    print('GREATER')
    
if (a-b) < 0:
    print('LESS')

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))


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

    A = ii()
    B = ii()
    print('GREATER' if A > B else 'LESS' if A < B else 'EQUAL')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:
    print('GREATER')
elif a==b:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a = input()
b = input()
if len(a)>len(b):
    print('GREATER')
elif len(b)>len(a):
    print('LESS')
else:
    if int(a)>int(b):
        print('GREATER')
    elif int(b)>int(a):
        print('LESS')
    else:
        print('EQUAL')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

if a>b:
  print('GREATER')
elif a<b:
  print('LESS')
else:
  print('EQUAL')

Submission status: Accepted

Solution code:
#ABC059.B
A = int(input())
B = int(input())

if A > B:
    print('GREATER')
elif A == B:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a=input()
b=input()

if len(a)<len(b):
    print('LESS')
elif len(a)>len(b):
    print('GREATER')
else:
    f=0
    for i in range(len(a)):
        if a[i]>b[i]:
            print('GREATER')
            break
        elif a[i]<b[i]:
            print('LESS')
            break
        else:
            f+=1
            continue
    if f==len(a):
        print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A == B:
  print('EQUAL')
elif A > B:
  print('GREATER')
else:
  print('LESS')

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
print('GREATER' if (A-B)>0 else 'EQUAL' if A==B else 'LESS')

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())

if A>B: print("GREATER")
elif A<B: print("LESS")
else: print("EQUAL")

Submission status: Accepted

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

    A = int(sys.stdin.buffer.readline().rstrip())
    B = int(sys.stdin.buffer.readline().rstrip())
    print('GREATER' if A > B else 'LESS' if A < B else 'EQUAL')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=int(input())
b =int(input())

print('GREATER') if a>b else print ('LESS') if b>a else print('EQUAL')

Submission status: Accepted

Solution code:
# import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq # priolity-queue
# import time
# import itertools
# import collections # queue
# from operator import itemgetter
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def main():
    a = int(input())
    b = int(input())
    if a>b:
        print("GREATER")
    elif a<b:
        print("LESS")
    else:
        print("EQUAL")
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a == b:
    print('EQUAL')
elif a < b:
    print('LESS')
else:
    print('GREATER')

Submission status: Accepted

Solution code:
A, B = int(input()), int(input())
if A > B:
    print("GREATER")
elif A < B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a>b:
    print("GREATER")
elif a<b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
from __future__ import print_function

import sys

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd
# fractions.gcd() を用いること
# math.log2()はatcoderでは対応していない．留意せよ．

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


def lcm(n, m):
    return int(n * m / gcd(n, m))


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def main():
    a = int(input().strip())
    b = int(input().strip())
    if a > b:
        print("GREATER")
    elif a == b:
        print("EQUAL")
    else:
        print("LESS")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    A = int(input())
    B = int(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
c=a-b
print('GREATER' if c>0 else 'LESS' if c<0 else 'EQUAL')

Submission status: Accepted

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

def main():
    a = int(input())
    b = int(input())
    if a > b:
        print("GREATER")
    elif a == b:
        print("EQUAL")
    else:
        print("LESS")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B: print("GREATER")
elif A == B: print("EQUAL")
else: print("LESS")

Submission status: Accepted

Solution code:
l = [int(input()) for i in range(2)]
a = 0
for n in l:
  if a == 0:
    a = n
  elif a > n:
    print('GREATER')
  elif a < n:
    print('LESS')
  else:
    print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

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

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
if A>B:
  print("GREATER")
elif A<B:
  print('LESS')
else:
  print('EQUAL')

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    A=int(input())
    B=int(input())
    print('GREATER' if A>B else 'LESS' if A<B else 'EQUAL')

resolve()

Submission status: Accepted

Solution code:
# B
a = int(input())
b = int(input())

if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
elif a == b:
    print('EQUAL')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
print("GREATER" if (a>b) else "LESS" if (a<b) else "EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
    print("GREATER")
elif a == b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:
            print('GREATER')
elif a<b:
            print('LESS')
else:
            print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print("GREATER" if a > b else "EQUAL" if a == b else "LESS")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a < b:
    print("LESS")
elif a == b:
    print("EQUAL")
else:
    print("GREATER")

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc059/tasks/abc059_b

A = int(input())
B = int(input())

if A == B:
    print('EQUAL')

elif A > B:
    print('GREATER')

else:
    print('LESS')

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    a=I()
    b=I()
    
    if a==b:
        print("EQUAL")
    elif a>b:
        print("GREATER")
    else:
        print("LESS")

main()

Submission status: Accepted

Solution code:
import sys
a=input().strip()
b=input().strip()

if a==b:
  print("EQUAL")
elif len(a)>len(b):
  print("GREATER")
elif len(b)>len(a):
  print("LESS")
else: #same len
  for i in range(len(a)):
    if int(a[i])>int(b[i]):
      print("GREATER")
      sys.exit()
    elif int(a[i])<int(b[i]):
      print("LESS")
      sys.exit()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a - b > 0:
    print("GREATER")
elif a - b < 0:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

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


def solve(A: int, B: int):
    print(["EQUAL", "GREATER", "LESS"][(A > B) - (A < B)])


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = input()
B = input()
if len(A) > len(B):
    print("GREATER")
elif len(A) < len(B):
    print("LESS")
else:
    for i in range(len(A)):
        if A[i] > B[i]:
            print("GREATER")
            exit()
        elif A[i] < B[i] :
            print("LESS")
            exit()
    print("EQUAL")

Submission status: Accepted

Solution code:
A=input()
B=input()
if len(A)==len(B):
    if A==B:
        print("EQUAL")
    elif A>B:
        print("GREATER")
    else:
        print("LESS")
elif len(A)>len(B):
    print("GREATER")
else:
    print("LESS")

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
if A>B:
    print('GREATER')
elif A<B:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
c = 0
if len(a) > len(b):
    c = 1
elif len(a) < len(b):
    c = 2
else:
    for i in range(len(a)):
        if int(a[i]) > int(b[i]):
            c = 1
            break
        elif int(a[i]) < int(b[i]):
            c = 2
            break
if c == 0:
    print("EQUAL")
elif c == 1:
    print("GREATER")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:
    ans="GREATER"
elif a<b:
    ans="LESS"
else:
    ans="EQUAL"
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
b = int(input())

if a > b:
    print("GREATER")
if a < b:
    print("LESS")
if a == b:
    print("EQUAL")

Submission status: Accepted

Solution code:
#abc59 b
a=int(input())
b=int(input())
if a>b:
    print("GREATER")
elif a<b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a == b:
    print("EQUAL")
elif a > b:
    print("GREATER")
elif a < b:
    print("LESS")