Problem:


﻿Score: 100 points

Problem Statement

In 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.

One day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.

Takahashi, who is taking this exam, suddenly forgets his age.

He decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.

Write this program for him.  

Constraints

N is 1 or 2.

A is an integer between 1 and 9 (inclusive).

B is an integer between 1 and 9 (inclusive).

Input

Input is given from Standard Input in one of the following formats:  

1

2
A
B

Output

If N=1, print Hello World; if N=2, print A+B.  

Sample Input 1

1

Sample Output 1

Hello World

As N=1, Takahashi is one year old. Thus, we should print Hello World.

Sample Input 2

2
3
5

Sample Output 2

8

As N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5. 



Sample input:
1


Sample output:
Hello World

Submission status: Runtime Error

Solution code:
import random

def is_prime(q,k=50):
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    d = (q-1)>>1
    while d&1 == 0:
        d >>= 1
    for i in range(k):
        a = random.randint(1,q-1)
        t = d
        y = pow(a,t,q)
        while t != q-1 and y != 1 and y != q-1: 
            y = pow(y,2,q)
            t <<= 1
        if y != q-1 and t&1 == 0:
            return False
    return True

n,m=(int(i) for i in input().split(' '))
for i in range(1,n):
  if m%i==0 and (is_prime(i) or i==1) and is_prime(m//i) and (i==1 or m//i<n):
    print('1')
    exit()
for i in range(n,m+1):
  if i==m:
    print(1)
    break
  if m%i==0:
    print(m//i)
    break
  if m-i-n>0 and m%(m-i-n)==0 and m//(m-i-n)>n:
    print(m-i-n)
    break

Submission status: Runtime Error

Solution code:
import random

def is_prime(q,k=50):
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    d = (q-1)>>1
    while d&1 == 0:
        d >>= 1
    for i in range(k):
        a = random.randint(1,q-1)
        t = d
        y = pow(a,t,q)
        while t != q-1 and y != 1 and y != q-1: 
            y = pow(y,2,q)
            t <<= 1
        if y != q-1 and t&1 == 0:
            return False
    return True

n,m=(int(i) for i in input().split(' '))
if m%n>100000:
  for i in range(1,n):
    if m%i==0 and is_prime(i) and is_prime(m//i) and (i==1 or m//i<n):
      print('1')
      exit()
for i in range(n,m+1):
  if i==m:
    print(1)
    break
  if m%i==0:
    print(m//i)
    break
  if m-i-n>0 and m%(m-i-n)==0 and m//(m-i-n)>n:
    print(m-i-n)
    break

Submission status: Runtime Error

Solution code:
import random

def is_prime(q,k=50):
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    d = (q-1)>>1
    while d&1 == 0:
        d >>= 1
    for i in range(k):
        a = random.randint(1,q-1)
        t = d
        y = pow(a,t,q)
        while t != q-1 and y != 1 and y != q-1: 
            y = pow(y,2,q)
            t <<= 1
        if y != q-1 and t&1 == 0:
            return False
    return True

n,m=(int(i) for i in input().split(' '))
if m%n>10000:
  for i in range(1,n):
    if m%i==0 and is_prime(i) and is_prime(m//i) and (i==1 or m//i<n):
      print('1')
      exit()
for i in range(n,m+1):
  if i==m:
    print(1)
    break
  if m%i==0:
    print(m//i)
    break
  if m%(m-i+1)==0
    print(m-i+1)
    break

Submission status: Runtime Error

Solution code:
import random

def is_prime(q,k=50):
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    d = (q-1)>>1
    while d&1 == 0:
        d >>= 1
    for i in range(k):
        a = random.randint(1,q-1)
        t = d
        y = pow(a,t,q)
        while t != q-1 and y != 1 and y != q-1: 
            y = pow(y,2,q)
            t <<= 1
        if y != q-1 and t&1 == 0:
            return False
    return True

n,m=(int(i) for i in input().split(' '))
for i in range(1,n):
  if m%i==0 and is_prime(m//i) and (i==1 or m//i<n):
    print('1')
    exit()
for i in range(n,m):
  if i==m:
    print(1)
    break
  if m%i==0:
    print(m//i)
    break

Submission status: Runtime Error

Solution code:
n,m=(int(i) for i in input().split(' '))
for i in range(1,1000)[::-1]:
  if i==1:
    print(i)
    break
  if m%i==0 and m//i>=n:
    print(m//i)
    break

Submission status: Runtime Error

Solution code:
import random

def is_prime(q,k=50):
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    d = (q-1)>>1
    while d&1 == 0:
        d >>= 1
    for i in range(k):
        a = random.randint(1,q-1)
        t = d
        y = pow(a,t,q)
        while t != q-1 and y != 1 and y != q-1: 
            y = pow(y,2,q)
            t <<= 1
        if y != q-1 and t&1 == 0:
            return False
    return True

n,m=(int(i) for i in input().split(' '))

if n==1:
  print(m)
  exit()
if True:
  for i in range(1,n):
    if m%i==0 and is_prime(m//i) and m//i>n:
      print('1')
      exit()
for i in range(1,m//n+1)[::-1]:
  if i==1:
    print(i)
    break
  if m%i==0 and m//i>=n:
    print(i)
    break

Submission status: Runtime Error

Solution code:
import random

def is_prime(q,k=50):
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    d = (q-1)>>1
    while d&1 == 0:
        d >>= 1
    for i in range(k):
        a = random.randint(1,q-1)
        t = d
        y = pow(a,t,q)
        while t != q-1 and y != 1 and y != q-1: 
            y = pow(y,2,q)
            t <<= 1
        if y != q-1 and t&1 == 0:
            return False
    return True

n,m=(int(i) for i in input().split(' '))

if n==1:
  print(m)
  exit()
if m//n>10000:
  for i in range(1,n):
    if m%i==0 and is_prime(m//i) and m//i>n:
      print('1')
      exit()
for i in range(1,m//n+1)[::-1]:
  if i==1:
    print(i)
    break
  if m%i==0 and m//i>=n:
    print(i)
    break

Submission status: Runtime Error

Solution code:
n,m=(int(i) for i in input().split(' '))
i=m%n
if m==2147483647:
  print(1)
  exit()
while True:
  if i==1:
    print(i)
    break
  if m%i==0 and m//i>=n:
    print(i)
    break
  else:
    i-=1

Submission status: Runtime Error

Solution code:
n,m=(int(i) for i in input().split(' '))
i=n
while True:
  if m%i==0:
    if m//i>=n:
      print(i)
    break
  else:
    i-=1

Submission status: Runtime Error

Solution code:
def factor(x):
  factor=[]
  if x==1:
    return
  else:
    i=2
    while x>1:
      if x%i==0:
        factor.append([i,1])
        x/=i
        while x%i==0:
          factor[-1][1]+=1
          x/=i
      i+=1
    return factor

m,n=(int(i) for i in input().split(' '))
factor=factor(m)
ans=1
for data in factor:
  data[1]=data[1]//n
  ans=ans*(data[0]**data[1])
print(ans)

Submission status: Runtime Error

Solution code:
a = [int(input()) for i in range(3)]
if a[0] == 1:
	print("Hello World")
else:
	print(a[1] + a[2])

Submission status: Runtime Error

Solution code:
a = [int(input()) for i in range(3)]
if a[0] == 1:
	print("Hello World")
else:
	print(a[1]+a[2])

Submission status: Runtime Error

Solution code:
a = [int(input()) for i in range(3)]
if a[0] == 2:
	print("Hello World")
	else:
		print(a[1]+a[2])

Submission status: Runtime Error

Solution code:
a = [int(input()) for i in range(3)]
if a[0] == 2:
	print("Hello World")
else:
	print(a[1]+a[2])

Submission status: Runtime Error

Solution code:
a = [int(input()) for i in range(3)]
if a[0] == 2:
  print("Hello World")
else:
  print(a[1]+a[2])

Submission status: Runtime Error

Solution code:
a = [int(input()) for i in range(3)]
if a[0] == 2:
  print("Hello World")
elif:
  print(a[1]+a[2])

Submission status: Runtime Error

Solution code:
a = [int(input()) for i in range(3)]
if a[0] == 2:
  print("Hello World")
elif print(a[1]+a[2])

Submission status: Runtime Error

Solution code:
a = int(input())
if a == 1:
  print("Hello Wor\ld")
elif:
  b = int(input())
  c = int(input())
  print(b + c)

Submission status: Runtime Error

Solution code:
N = 0;
A = 0;
B = 0;

input(N);

if N == 1:
    print("Hello World")
    
else:
    input(A);
    input(B);
    print(A+B);

Submission status: Runtime Error

Solution code:
N=int(input().strip())

xyh=[]
for i in range(N):
    xi,yi,hi = map(int, input().split(' '))
    if hi>0:
        xyh.append([xi,yi,hi])

fl=False
for ny in range(101):
    for nx in range(101):
        nh=abs(xyh[0][0]-nx)+abs(xyh[0][1]-ny)+xyh[0][2]
        nh=max(nh,0)
        fl=True
        for i in range(len(xyh)):
                if nh!=max(0,abs(xyh[i][0]-nx)+abs(xyh[i][1]-ny)+xyh[i][2]):
                    fl=False
        if fl:
            ax=nx
            ay=ny
            ah=nh

print("{} {} {}".format(ax,ay,ah))

Submission status: Runtime Error

Solution code:
import sys

n = int(input())

xyh = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]

isOk = False
i = 0
j = 0
constant = -1

for i in range(101):
    for j in range(101):

        constant = -1
        for xyhTemp in xyh:
            if xyhTemp[2] != 0:
                temp = xyhTemp[2] + abs(i - xyhTemp[0]) + abs(j - xyhTemp[1])

                if constant == -1:
                    constant = temp

                if constant != temp:
                    break
        else:

            for p in xyh:
                if p[2] == 0 and constant - abs(i - p[0]) - abs(j - p[1]) > 0:
                    break
            else:
                isOk = True
                break
        
    if isOk:
        break

print(i, j, constant)

Submission status: Runtime Error

Solution code:
n = int(input())

xyh = [list(map(int, input().split())) for _ in range(n)]

isOk = False
i = 0
j = 0
constant = -1

for i in range(101):
    for j in range(101):

        constant = -1
        for xyhTemp in xyh:
            if xyhTemp[2] != 0:
                temp = xyhTemp[2] + abs(i - xyhTemp[0]) + abs(j - xyhTemp[1])

                if constant == -1:
                    constant = temp

                if constant != temp:
                    break
        else:

            for p in xyh:
                if p[2] == 0 and constant - abs(i - p[0]) - abs(j - p[1]) > 0:
                    break
            else:
                isOk = True
                break
        
    if isOk:
        break

print(i, j, constant)

Submission status: Runtime Error

Solution code:
N = int(input())
if N == 1:
    print("Hello World")
else :
    A , B = int(input())
    print(A+B)

Submission status: Runtime Error

Solution code:
N = int(input)
if N == 1:
    print("Hello World")
else :
    A , B = int(input)
    print(A+B)

Submission status: Runtime Error

Solution code:
ct=[]
for i in range(N):
    ct.append(list(map(int, input().strip().split(' '))))
    
tle=True
c=10000

for i in range(N):
    if ct[i][1]<=T:
        tle=False
        c=min(c,ct[i][0])
        
if tle:
    print('TLE')
else:
    print(c)

Submission status: Runtime Error

Solution code:
a=int(input())
if a = 1:
  print("Hello World")
elif a = 2:
  A = int(input())
  B = int(input())
  print(A+B)

Submission status: Runtime Error

Solution code:
from collections import defaultdict


def main():
    N = int(input())
    pairs = []
    for _ in range(N):
        pair = [int(e) for e in input().split()]
        pairs.append(pair)

    d = defaultdict(int)
    for pair in pairs:
        x, y, h = pair

        for X in range(101):
            for Y in range(101):
                H = h + (abs(X - x) + abs(Y - y))
                d[(X, Y, H)] += 1

    for k, v in d.items():
        if v == N:
            X, Y, H = k
            print(X, Y, H)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
if int(input()) == 1:
    print("Hello World")

else:	
    A=int(input())
	B=int(input())
	print(A+B)

Submission status: Runtime Error

Solution code:
N,A,B=[ int(x) for x in input().split()]
if N == 1:
    print("Hello,world")
	
else:
    print(A+B)

Submission status: Runtime Error

Solution code:
n = input();

if n==1:
	print('Hello World')
else:
	a = input()
	b = input()
	print(a + b)

Submission status: Runtime Error

Solution code:
n = int(input())
if n == 1:
  print("Hello World")
a = int(input())
b = int(input())
print a+b

Submission status: Runtime Error

Solution code:
n = int(input())
a = int(input())
b = int(input())
if n == 1:
  print("Hello World")
else:
  print a+b

Submission status: Runtime Error

Solution code:
N = int(input())
if N == 1 :
	print("Hello World")
else :
	A = int(input())
    B = int(input())
    print(A + B)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1 :
	print("Hello World")
else :
  	A = int(input())
    B = int(input())
    print(A + B)

Submission status: Runtime Error

Solution code:
import sys

a = int(sys.stdin.readline().strip())
b = int(sys.stdin.readline().strip())
c = int(sys.stdin.readline().strip())

if a == 1:
    print("Hello World")
else:
    print(b + c)

Submission status: Runtime Error

Solution code:
import sys
a = int(sys.stdin.readline().strip())
b = int(sys.stdin.readline().strip())
c = int(sys.stdin.readline().strip())

if a == 1:
  print("Hello World")
else:
  print(b + c)

Submission status: Runtime Error

Solution code:
n, m = map(int, raw_input().split())

yueshu = []
state = 0
for i in range(1, int(m**0.5)+1):
    if m % i == 0:
        yueshu.insert(0, m/i)
        if i >= n:
            print m / i
            state = 1
            break
if state == 0:
    for i in range(int(m**0.5)+1, m):
        if m % i == 0:
            if i >= n:
                print m / i
                break
if state == 0:
    print 1

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if a==1:
     print("Hello World")
else:
     print(b+c)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
  print("Hello World")
else N == 2:
  A = int(input())
  B = int(input())
  print(A + B)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
  print("Hello World")
else if N == 2:
  A = int(input())
  B = int(input())
  print(A + B)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
  print("Hello World")
else if N == 2:
  A, B = input() for i in 2
  print(A + B)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
  print("Hello World")
else if N == 2:
  A, B = map(int, input().split())
  print(A + B)

Submission status: Runtime Error

Solution code:
import io
import sys

    line1 = sys.stdin.readline().rstrip()
    line2 = sys.stdin.readline().rstrip()
    line3 = sys.stdin.readline().rstrip()
    if int(line1) == 1:
        return "Hello World"
    else:
        return int(line2)+int(line3)
solve()

Submission status: Runtime Error

Solution code:
n = int(input())

if n == 1:
  	print("Hello World")
  
else:
  	a = int(input())
  	b = int(input())
  print(a + b)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
  	print("Heloo World")
  
else:
  	A = int(input())
  	B = int(input())
  print(A + B)

Submission status: Runtime Error

Solution code:
N , T  = map(int,input().split())
tmp_a = 1001
result = 1001
count = 1
while count < N+1:
 a,b = map(int,input().split())
 if b < T and a < tmp_a:
  result = count
  tmp_a = a
 count = count + 1
if result == 1001:
 print('TLE')
else:
 print(result)

Submission status: Runtime Error

Solution code:
N , T  = map(int,input().split())
tmp_a = 1000
result = 1001
while N > 0:
 a,b = map(int,input().split())
 if b < T & a < tmp_a:
  result = N
  tmp_a = a
 N = N -1
if result == 1001:
 print('TLE')
else:
 print(result)

Submission status: Runtime Error

Solution code:
if int(input())==1:print("Hello World")else:print(int(input())+int(input()))

Submission status: Runtime Error

Solution code:
if int(input())==1
	print("Hello World")
else
	print(int(input())+int(input()))

Submission status: Runtime Error

Solution code:
import sys

N = int(input())

list = []
for i in range(0, N):
    x, y, h = [int(x) for x in input().split()]
    list.append((x, y, h))

for X in range(0, 101):
    for Y in range(0, 101):
        b = True
        H = 0
        for Cx, Cy, Ch in list:
            if Ch != 0:
                H = Ch + abs(X - Cx) + abs(Y - Cy)
        for Cx, Cy, Ch in list:
            h = max(H - abs(X - Cx) - abs(Y - Cy), 0)
            if Ch != h:
                b = False
        if b == True:
            print(X, Y, H)
            sys.exit(0)

Submission status: Runtime Error

Solution code:
N, T = map(int, input().split())
i = 0
min_cost = 1000
fg = False
while i < N:
    i += 1
    c, t = map(int, input().split())
    if t <= T:
        if c <= min_cost:
            fg = True
            min_cost = c

if fg:
    print(min_cost)
else:
    print('TLE')

Submission status: Runtime Error

Solution code:
N = input()
if N == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A + B)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
l = map(int, raw_input().split())
n = l[0]
t = l[1]

"""
x = []
for i in range(n):
  x.append(map(int, raw_input().split()))
print(x)
"""

lst = [map(int, raw_input().split()) for i in range(n)]
#print(lst)

"""
minc = x[0]
mint = t

for j in range(n):
  if x[j][1] <= mint:
    mint = x[j][1]
    minc = x[j][0]
    #print("mint updated")
  else:
    continue

if mint < t:
  print(minc)
else:
  print("TLE")
"""

#sort_using lambda
lst = sorted(lst, key = lambda x:x[1])
#print(lst)

maxt = t
minc = 9999

for j in range(n + 10):
  if lst[j][1] <= maxt and lst[j][0] <= minc:
    minc = lst[j][0]
  else:
    break

"""
if maxt <= t:
  print(minc)
else:
  print("TLE")
"""

if minc == 9999:
  print("TLE")
else:
  print(minc)

Submission status: Runtime Error

Solution code:
N = int(input())
x_y_h = [tuple(map(int, input().split())) for _ in range(N)]

for cx in range(101):
    for cy in range(101):
        try_H = 0
        for x, y, h in x_y_h:
            if h > 0:
                try_H = h + abs(x - cx) + abs(y - cy)
                break

        not_found = False
        for x, y, h in x_y_h:
            if h <= 0:
                continue
            tmp_H = h + abs(x - cx) + abs(y - cy)
            if tmp_H != try_H:
                not_found = True
                break
        if not_found:
            continue
        print(cx, cy, try_H)
        exit()

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
int main(void){
  int n;
  cin>>n;
  int a,b;
  if (n==1) cout<<"Hello World";
  else{
    cin>>a;
    cin>>b;
    cout<<a+b;
  }
}

Submission status: Runtime Error

Solution code:
# coding: utf-8
import math

N, M = [int(s) for s in input().strip().split()]

if N == 1:
    print(M)
    exit()

ROOT_M = int(math.sqrt(M))
divisors = []
for d in range(1, ROOT_M+1):
    if M % d == 0:
        divisors.append(d)
        divisors.append(M//d)

divisors.sort()
MAX_VAL = int(M/N)
for d in divisors:
    if d > MAX_VAL:
        break
    max_gcd = d

print(max_gcd)

Submission status: Runtime Error

Solution code:
# coding: utf-8

N = int(input().strip())

input_tuples = []
selected_tuple = None

for _ in range(N):
    x, y, h = [int(s) for s in input().strip().split()]
    if selected_tuple is None and h > 0:
        selected_tuple = ((x, y, h))
    else:
        input_tuples.append((x, y, h))

for cx in range(0, 101):
    for cy in range(0, 101):
        H = selected_tuple[2] + \
            abs(selected_tuple[0] - cx) + abs(selected_tuple[1] - cy)

        for x, y, h in input_tuples:
            if h != max(H - abs(x - cx) - abs(y - cy), 0):
                break
        else:
            break
        continue
    else:
        continue
    break

print("{} {} {}".format(cx, cy, H))

Submission status: Runtime Error

Solution code:
n,t = map(int,input().split())

a = []

for i in range(n):
    a.append(list(map(int,input().split())))

min = 9999

for i in a:
    if i[1] <= t and i[0] < min:
        min = i[0]

if min > 1000:
    print("TLE")
else:
    print(min)

Submission status: Runtime Error

Solution code:
n=list(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Submission status: Runtime Error

Solution code:
n = int(input())
if n ==1:
    print(Hello World)
else:
    a = int(input())
    b = int(input())
    print(a+b)

Submission status: Runtime Error

Solution code:
L = []
N = L.append(int(input))
if len(N) == 1:
  print("Hello world")
  
else:
  print(N[2]+N[3])

Submission status: Runtime Error

Solution code:
N=int(input())
x=[]
y=[]
h=[]
for i in range(N):
    x_n,y_n,h_n=map(int,input().split())
    if h_n >= 1:
        x.append(x_n)
        y.append(y_n)
        h.append(h_n)

def all_same(a):
    if all(a[i]==a[i+1] for i in range(0,len(a)-1)):
        return True
    else:
        return False

for C_x in range(101):
    for C_y in range(101):
        H=[]
        for i in range(len(x)):
            H.append(h[i]+abs(x[i]-C_x)+abs(y[i]-C_y))
        H.sort()
        if all_same(H):
            print(C_x,C_y,H[0])

Submission status: Runtime Error

Solution code:
N=int(input())
x=[]
y=[]
h=[]
for i in range(N):
    x_n,y_n,h_n=map(int,input().split())
    if h_n !=0:
        x.append(x_n)
        y.append(y_n)
        h.append(h_n)

def all_same(a):
    if all(a[i]==a[i+1] for i in range(0,len(a)-1)):
        return True
    else:
        return False

for C_x in range(101):
    for C_y in range(101):
        H=[]
        for i in range(len(x)):
            H.append(h[i]+abs(x[i]-C_x)+abs(y[i]-C_y))
        H.sort()
        H.remove(0)
        if all_same(H):
            print(C_x,C_y,H[0])

Submission status: Runtime Error

Solution code:
N,T=map(int,input().split())
min=1001
for i in range(N):
    c,t=map(int,input().split())
    if t<(T+1):
        if c<min:
            min=c           
if min==1001:
    print("TLE")
else:
    print(min)

Submission status: Runtime Error

Solution code:
N,T=map(int,input().split())
min=1001
for i in range(N):
    c,t=map(int,input().split())
    if t<(T+1):
        if c<min:
            min=c           
if min=1001:
    print("TLE")
else:
    print(min)

Submission status: Runtime Error

Solution code:
N = int(input())
if N == 1:
     print("Hello World")
else:
     A =  int(input())
     B =  int(input())
     print(A+B

Submission status: Runtime Error

Solution code:
n,t=map(int,input().split())
l=[]
for i in range(n):
    l.append([j for j in map(int,input().split())])
    
a=float('inf')
for i in l:
    if i[1] <= t:a=i[0]
if a == float('inf'):
    a = 'TLE'
print(a)

Submission status: Runtime Error

Solution code:
N=int(input())
if N==1:
  print ('Hello World')
else:
  A=int(input())
  B=int(input())
  pirnt (A+B)

Submission status: Runtime Error

Solution code:
n=int(input())
if n==1:print('Hello World')
else:
    a=int(input())
    b=int(inputt())
    print(a+b)

Submission status: Runtime Error

Solution code:
n = [int(input()) for i in range(3)]

if n[0] ==1:
    print('Hello World')

else:
    print(n[1]+n[2])

Submission status: Runtime Error

Solution code:

N, T = [int(s) for s in input().split()]

c = []
t = []
for n in N:
    inputs = input().split()
    c.append(int(inputs[0]))
    t.append(int(inputs[1]))

min_cost = None
for i in range(N):
    if t[i] <= T and (min_cost is None or c[i] <= min_cost):
        min_cost = c[i]
        result = i

return i

Submission status: Runtime Error

Solution code:
x = input()
if x is "1":
    print("Hello World")
elif x is "2":
    a, b = [int(s) for s in input().split()]
    print(a+b)

Submission status: Runtime Error

Solution code:
n = input()
if n == '1':
  print 'Hello World'
else:
  a = input()
  b = input()
  print int(a) + int(b)

Submission status: Runtime Error

Solution code:
if int(input()) == 1:
 print 'Hello World'
else:
 A = int(input())
 B = int(input())
 C = A + B
 print C

Submission status: Runtime Error

Solution code:
#coding: utf-8

if int(input()) == 1:
 print 'Hello World'
else:
 A = int(input)
 B = int(input)
 C = A + B
 print C

Submission status: Runtime Error

Solution code:
i=input;print'Hello World'*(i()-1)or i()+i()

Submission status: Runtime Error

Solution code:
i=input;i(eval(i()+'+'+i())if'1'<i()else'Hello World')

Submission status: Runtime Error

Solution code:
a=map(int,open(0).read().split())
print('Hello World'if a[0]<2else a[1]+a[2])

Submission status: Runtime Error

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

if(N==1):
    print("Hello World")
elif(N==2):
    print(A+B)

Submission status: Runtime Error

Solution code:
N=int(input())
x=[]
y=[]
h=[]
for i in range(N):
    x_n,y_n,h_n=map(int,input().split())
    x.append(x_n)
    y.append(y_n)
    h.append(h_n)
for C_x in range(101):
    for C_y in range(101):
        H=h[0]+abs(x[0]-C_x)+abs(y[0]-C_y)
        if all(H==h[i]+abs(x[i]-C_x)+abs(y[i]-C_y) for i in range(N)):
            print(C_x,C_y,H)

Submission status: Runtime Error

Solution code:
N=int(input())
x=[]
y=[]
h=[]
for i in range(N):
    x_n,y_n,h_n=map(int,input().split())
    x.append(x_n)
    y.append(y_n)
    h.append(h_n)
for C_x in range(101):
    for C_y in range(101):
        if all(h[i]+abs(x[i]-C_x)+abs(y[i]-C_y)==h[i+1]+abs(x[i+1]-C_x)+abs(y[i+1]-C_y) for i in range(N-1)):
            if h[1]+abs(x[1]-C_x)+abs(y[1]-C_y) >1 or h[1]+abs(x[1]-C_x)+abs(y[1]-C_y)==1:
                H=h[1]+abs(x[1]-C_x)+abs(y[1]-C_y)
                print(C_x,C_y,H)

Submission status: Runtime Error

Solution code:

N= list(map(int,input().split())) #１行目の入力

root_list = []
cost = 1001
for i in range(N[0]):
    root_list.append(list(map(int,input().split())))

    if root_list[i][1] > N[1]:
        if root_list[i][0] < cost:
            cost = root_list[i][0]


if cost == 1001:
    print("TLE")
else:
    print(cost)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
  print("Hello World")
else:
  A, B = map(int, input().split())
  print(A+B)

Submission status: Runtime Error

Solution code:
N = input()
if N == 1:
  print("Hello World")
else:
  A, B = map(int, input().split())
  print(A+B)

Submission status: Runtime Error

Solution code:
N = int(input())
if N == 1:
    print('Hello World')
else if N == 2:
    a = int(input())
    b = int(input())
    print(a + b)

Submission status: Runtime Error

Solution code:
N = int(input())
if N == 1:
    print('Hello World')
else if N == 2:
    a = input(input())
    b = input(input())
    print(a + b)

Submission status: Runtime Error

Solution code:
N = int(input())
if N == 1:
    print('Hello World')
else:
    a = input(input())
    b = input(input())
    print(a + b)

Submission status: Runtime Error

Solution code:
N = input()

if N==1:
	print ("Hello World")
elif N==2:
 	N1 = input()
	N2 = input()
	print (N1+N2)

Submission status: Runtime Error

Solution code:
N = input()
N1 = input()
N2 = input()

if N==1:
  print ("Hello World")
elif N==1:
  print (N1+N2)

Submission status: Runtime Error

Solution code:
N = int(input())
if N == 1:
    print('Hello World')
else:
    a, b = map(int, input().split())
    print(a + b)

Submission status: Runtime Error

Solution code:
N = input()
if N == 1:
  print("Hello World")
else:
  A, B = list(map(int, input().split()))
  print(A+B)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon Oct 15 17:46:36 2018

@author: oyata
"""

N = int(input())

a = []
T = []
T_min=int(input())
for i in range(N):
    a.append(input())
    T.append(input())

for i in range(N):
    if T[N] > T_min:
        T.pop[N]
        a.pop[N]

print(min(a))

Submission status: Runtime Error

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

ina = input()
if ina == "1":
  print("Hello World")
else:
  inb = int(input())
  inc = int(input())
  print(inb + inc)

Submission status: Runtime Error

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

ina = input()
if ina == "1":
  print("Hello World")
else:
  inb = int(input())
  inc = int(input())
  print(inb + inc)

Submission status: Runtime Error

Solution code:
n = int(input())
if n == 1 :
    print("Hello World")
if n == 2 :
    a, b = map(int, input().split())
    print(a + b)

Submission status: Runtime Error

Solution code:
a=[]
for i in range(3):
	a.append(int(input()))

if a[0]!=1:
	print(a[1]+a[2])
else:
	print("Hello World")

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if a==1:
	print("Hello World")	
else:
    print(b+c)

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if a!=1:
	print(b+c)
else:
	print("Hello World")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
if a == 1:
    print('Hello World')
else:
    print(b + c)

Submission status: Runtime Error

Solution code:
N, T = map(int, input().split())
if N < 1 or N > 100:
    exit()
if T < 1 or T > 1000:
    exit()

jugde = False
jugde_N = 100
maplist = {}
for i in range(N):
    ci,ti = map(int, input().split())
    if ci < 1 or ci > 1000:
        exit()
    if ti < 1 or ti > 1000:
        exit()
    if maplist.get(ci) == None:
        maplist[ci] = ti
for jN,jT in maplist.items():
    if jT <= T:
        if jN <= jugde_N:
            jugde = True
            jugde_N = jN
if jugde == False:
    print('TLE')
else:
    print(jugde_N)

Submission status: Runtime Error

Solution code:
N = int(input())

if N == 1:
    print("Hello World")

elif N == 2:
    A = int(input())
    b = int(input())
    print(A+B)

Submission status: Runtime Error

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

if N == 1:
    print("Hello World")

elif N == 2:
    print(A+B)

Submission status: Runtime Error

Solution code:
total = [int(i) for i in input().split()]
n = total[0]
time_limit = total[1]

ci = []
ti = []
for i in range(n):
    list = [int(j) for j in input().split()]
    ci.append(list[0])
    ti.append(list[1])

min = 1000
for i in range(len(ci)):
    if ci[i] < min and ti[i] < time_limit:
        min = ci[i]

if min != 1000:
    print(min)
else:
    print("TLE")

Submission status: Runtime Error

Solution code:
total = [int(i) for i in input().split()]
n = total[0]
time_limit = total[1]

ci = []
ti = []
for i in range(n):
    list = [int(j) for j in input().split()]
    ci.append(list[0])
    ti.append(list[1])

min = 100
update = 0
for i in range(len(ci)):
    if ci[i] <= min and ti[i] <= time_limit:
        min = ci[i]
        update = 1

if update == 1:
    print(min)
else:
    print("TLE")

Submission status: Runtime Error

Solution code:
if(int(input())==1):
    print("Hello World")
else:
    a,b=map(int,input().split())
    print(a+b)

Submission status: Runtime Error

Solution code:
n=int(input())
if n==1:
    print("Hello World")
elif n==2:
    a,b=map(int,input().split())
    print(a+b)

Submission status: Runtime Error

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

if N == 1:
  print("Hello World")
else:
  print(A+B)

Submission status: Runtime Error

Solution code:
n, t = map(int,input().split())
mydict = {}
for i in range(n):
	a, b = map(int,input().split())
	mydict.setdefault(a, b)
sortedDict = sorted(mydict.items())
k = 0
for j in sortedDict:
	k += 1
	if j[1] <= t:
		print(j[0])
		break
	if k == len(sortedDict):
		print("TLE")
		break

Submission status: Runtime Error

Solution code:
n, t = map(int,input().split())
mydict = {}
for i in range(n):
	a, b = map(int,input().split())
	mydict.setdefault(a, b)
sortedDict = sorted(mydict.items())
k = 0
for j in sortedDict:
	k += 1
	if j[1] <= t:
		print(j[0])
		break
	if k == len(sortedDict):
		print("TLE")