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: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ai = lambda: list(map(int,input().split()))
ai_ = lambda: [int(x)-1 for x in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()

if str == "1":
    print("Hello World")
elif str == "2":
    print(int(input()) + int(input()))

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    n = int(input())
    if n == 1:
        print('Hello World')
    elif n == 2:
        a = int(input())
        b = int(input())
        print(a + b)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, A):
    ans = 0
    return ans


def main():
    N = read_int()
    if N == 1:
        print('Hello World')
    else:
        A = read_int()
        B = read_int()

        print(A + B)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def getN():
    return int(input())

def getMN():
    a = input().split()
    b = [int(i) for i in a]
    return b[0],b[1]

def getlist():
    a = input().split()
    b = [int(i) for i in a]
    return b

N = getN()

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

if N ==2:
    A = getN()
    B = getN()
    print(A+B)

Submission status: Accepted

Solution code:
n = int(input())

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

    print(a+b)

Submission status: Accepted

Solution code:
#coding:utf-8
n = int(input())
if n==1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print (a+b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#N = int(input())
#a = [int(i) for i in input().split()]
#s = [[int(j) for j in input().split()] for i in range(N)]

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin

s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:

if __name__ == "__main__":
    l = input()
    if int(l) == 1:
        print("Hello World")
    else:
        print(int(input()) + int(input()))

Submission status: Accepted

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: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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


def main():
    n = int(input())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect
import numpy as np

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = 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:
k, s = list(map(int, input().split()))

p = s
factors = {}

while p > 1:
    f = False
    for i in range(2, int(p**0.5)+1):
        if p % i == 0:
            if i in factors:
                factors[i] += 1
            else:
                factors[i] = 1

            p //= i
            f = True
            break

    if not f:
        if p in factors:
            factors[p] += 1
        else:
            factors[p] = 1
        break

if len(factors) == 0:
    print(1)
else:
    primes = list(factors.keys())
    exp = [0] * len(primes)
    upper = s/k
    ans = 1

    while exp[0] <= factors[primes[0]]:
        num = 1
        for i in range(len(primes)):
            num *= pow(primes[i], exp[i])

        if num == upper:
            ans = num
            break
        elif num < upper:
            ans = max(ans, num)

        index = len(primes)-1
        done = False
        while not done:
            exp[index] += 1
            if exp[index] > factors[primes[index]]:
                if index == 0:
                    break
                else:
                    exp[index] = 0
                    index -= 1
            else:
                done = True

    print(ans)

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(int(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())
a, b = map(int, input().split())
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:
  print(int(input())+int(print()))

Submission status: Runtime Error

Solution code:
n=int(input())
a,b=int(input()),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")
  exit()

a = int(input())
b = int(input())
print(a+b)

Submission status: Runtime Error

Solution code:
n= int(input())
if n = 1:
  print("Hello World")
  exit()
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")
elif n = 2:
  a = int(input())
  b = int(input())
  print(a+b)

Submission status: Runtime Error

Solution code:
A,B,C,D=map(int,input().split())
if A<=C:
  if D<=B:
    t=B-C
  else:
    t=D-C
else:
  if D<=B:
    t=B-A
  else:
    t=D-A
  t=D-A
if t<=0:
  print(0)
else:
  print(t)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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()) for i in range(3)]

if a[0] == 2:
  print(a[1] + a[2])
  
elif a[0] == 1:
  print('Hello World')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

N = a[0]
A = a[1]
B = a[2]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
XYH = [list(map(int, input().split())) for _ in range(n)]
#print(XYH)

for x1, y1, h1 in XYH:
    if h1 > 0:
        for Cx in range(101):
            for Cy in range(101):
                H = h1 + abs(x1 - Cx) + abs(y1 - Cy)
                # print(Cx, Cy, H)
                if all(h == max(H - abs(x - Cx) - abs(y - Cy), 0) for x, y, h in XYH):
                  print(Cx, Cy, H)
                  exit()

Submission status: Runtime Error

Solution code:
# abc112_a.py
# https://atcoder.jp/contests/abc112/tasks/abc112_a

# A - Programming Education /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点: 100点

# 問題文
# 2020年, AtCoder 社は年商 10 億円を超え, プログラミング教育にも手を出すようになった.
# ある日行われたテストでは, 1 才児は Hello World を出力するプログラムを, 2 才児は整数 A, B を入力して A+B を出力するプログラムを書かなければならない.
# 高橋君はこのテストを受けているが, 突然自分が何才なのかが分からなくなってしまった.
# そこで, 最初に自分の年齢 N (N は 1 または 2) を入力し, N=1 ならば Hello World と出力し, N=2 ならば A, B を入力して A+Bを出力するプログラムを作ることにした.
# 高橋君に代わって, このようなプログラムを作りなさい.

# 制約
#     Nは 1 または 2
#     Aは 1 以上 9以下の整数
#     Bは 1 以上 9以下の整数

# 入力
# 入力は以下の 2 つのうちいずれかの形式で標準入力から与えられる.
# 1

# 2
# A
# B


# 出力
# N=1のとき, Hello World と出力し, N=2 のとき, A+Bを出力しなさい.

# 入力例 1
# 1

# 出力例 1
# Hello World

# N=1なので, 高橋君は 1才である. したがって, Hello World を出力する.

# 入力例 2
# 2
# 3
# 5

# 出力例 2
# 8

# N=2なので, 高橋君は 2 才である. A=3,B=5 なので, A+B である 8 を出力する. 


def calculation(lines):
    n = int(lines[0])
    # values = list(map(int, lines[1].split()))
    # n = lines[0]

    if n == 1:
        return ['Hello World']
    else:
        A = int(lines[1])
        B = int(lines[2])
        return [A+B]


# 引数を取得
def get_input_lines():
    line = input()
    N = int(line)
    lines = list()
    lines.append(line)
    for _ in range(N):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['1']
        lines_export = ['Hello World']
    if pattern == 2:
        lines_input = ['2', '3', '5']
        lines_export = [8]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines()
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
# abc112_a.py
# https://atcoder.jp/contests/abc112/tasks/abc112_a

# A - Programming Education /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点: 100点

# 問題文
# 2020年, AtCoder 社は年商 10 億円を超え, プログラミング教育にも手を出すようになった.
# ある日行われたテストでは, 1 才児は Hello World を出力するプログラムを, 2 才児は整数 A, B を入力して A+B を出力するプログラムを書かなければならない.
# 高橋君はこのテストを受けているが, 突然自分が何才なのかが分からなくなってしまった.
# そこで, 最初に自分の年齢 N (N は 1 または 2) を入力し, N=1 ならば Hello World と出力し, N=2 ならば A, B を入力して A+Bを出力するプログラムを作ることにした.
# 高橋君に代わって, このようなプログラムを作りなさい.

# 制約
#     Nは 1 または 2
#     Aは 1 以上 9以下の整数
#     Bは 1 以上 9以下の整数

# 入力
# 入力は以下の 2 つのうちいずれかの形式で標準入力から与えられる.
# 1

# 2
# A
# B


# 出力
# N=1のとき, Hello World と出力し, N=2 のとき, A+Bを出力しなさい.

# 入力例 1
# 1

# 出力例 1
# Hello World

# N=1なので, 高橋君は 1才である. したがって, Hello World を出力する.

# 入力例 2
# 2
# 3
# 5

# 出力例 2
# 8

# N=2なので, 高橋君は 2 才である. A=3,B=5 なので, A+B である 8 を出力する. 


def calculation(lines):
    n = int(lines[0])
    # values = list(map(int, lines[1].split()))
    # n = lines[0]

    if n == 1:
        return ['Hello World']
    else:
        A = int(lines[1])
        B = int(lines[2])
        return [A+B]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['1']
        lines_export = ['Hello World']
    if pattern == 2:
        lines_input = ['2', '3', '5']
        lines_export = [8]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
# abc112_a.py
# https://atcoder.jp/contests/abc112/tasks/abc112_a

# A - Programming Education /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点: 100点

# 問題文
# 2020年, AtCoder 社は年商 10 億円を超え, プログラミング教育にも手を出すようになった.
# ある日行われたテストでは, 1 才児は Hello World を出力するプログラムを, 2 才児は整数 A, B を入力して A+B を出力するプログラムを書かなければならない.
# 高橋君はこのテストを受けているが, 突然自分が何才なのかが分からなくなってしまった.
# そこで, 最初に自分の年齢 N (N は 1 または 2) を入力し, N=1 ならば Hello World と出力し, N=2 ならば A, B を入力して A+Bを出力するプログラムを作ることにした.
# 高橋君に代わって, このようなプログラムを作りなさい.

# 制約
#     Nは 1 または 2
#     Aは 1 以上 9以下の整数
#     Bは 1 以上 9以下の整数

# 入力
# 入力は以下の 2 つのうちいずれかの形式で標準入力から与えられる.
# 1

# 2
# A
# B


# 出力
# N=1のとき, Hello World と出力し, N=2 のとき, A+Bを出力しなさい.

# 入力例 1
# 1

# 出力例 1
# Hello World

# N=1なので, 高橋君は 1才である. したがって, Hello World を出力する.

# 入力例 2
# 2
# 3
# 5

# 出力例 2
# 8

# N=2なので, 高橋君は 2 才である. A=3,B=5 なので, A+B である 8 を出力する. 


def calculation(lines):
    n = int(lines[0])
    # values = list(map(int, lines[1].split()))
    # n = lines[0]

    if n == 1:
        return ['Hello World']
    else:
        A = int(lines[1])
        B = int(lines[2])
        return [A+B]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['1']
        lines_export = ['Hello World']
    if pattern == 2:
        lines_input = ['2', '3', '5']
        lines_export = [8]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(2)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

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())
xyh=[list(map(int,input().split())) for _ in range(n)]
xyh=sorted(xyh, key=lambda x:x[2], reverse=True)

for xi in range(101):
    for yi in range(101):
        hi=0
        flag=True
        for i in range(n):
            x=xyh[i][0]
            y=xyh[i][1]
            h=xyh[i][2]
            if i==0:
                hi=abs(xi-x)+abs(yi-y)+h
            if max(hi-abs(xi-x)-abs(yi-y),0)!=h:
                flag=False
        if flag:
            print(xi, yi, hi)
            break
    else:
        continue
    break

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())
if n == 1:
  print('Hello World')
  exit()
else:
  a = list(map(int, input().split()))
  print(a[0]+a[1])

Submission status: Runtime Error

Solution code:
if input() == '1':
  print(Hello World)
else:
  print(eval(input()+'+'+input()))

Submission status: Runtime Error

Solution code:
n = int(raw_input())
a = int(raw_input())
b = int(raw_input())
if n == 1:
	print 'Hello World'
elif n == 2:
	print a + b

Submission status: Runtime Error

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

if n == 1:
  print("Hello World")
if n == 2:
  print(a + b)

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,T = map(int,(list(input().split())))
cost = []
for _ in range(N):
    c,t = map(int,(list(input().split())))
    if t<=T:
        cost.append(c)
print(min(cost))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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:
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:
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:
# これはエスパーですがMが素数ならNが何であってもできなさそう？未証明
# で 合成数のみっぽいので定石的に素因数分解すると
# 各項に因数をどれだけ割り振れるかみたいになる？
# -> サンプル1をみるとならなそう
# 最大公約数をgcdとすると、a*gcd*(N-1)+b*gcd = M となるのが都合よさそう こうなると右辺もgcdで割れるのでやはり約数のどれかになりそう
n, m = map(int, input().split())
if m % n == 0:
    print(m // n)
else:
    x = m // n
    for i in range(x, 0, -1):
        if m % i == 0:
            print(i)
            exit()
print(1)

Submission status: Runtime Error

Solution code:
n = int(input())
low = 0
hi = 10**9

li = []
lin = []

for _ in range(n):
    x,y,h = map(int,input().split())
    if h != 0:
        li.append((x,y,h))
    lin.append((x,y,h))

for i in range(101):
    for j in range(101):
        flag = True
        h = li[0][2]+abs(i-li[0][0])+abs(j-li[0][1])
        for a,b,c in lin:
            if max(h-abs(i-a)-abs(j-b),0) != c:
                flag = False
                break
        if flag:
            print(i,j,h)
            exit()

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())
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, B = map(int, input().split())
    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())
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())
A, B = map(int, input().split())
print("Hello World" if N == 1 else 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:
o=int(input())
a=int(input())
b=int(input())
if o==1:
    print('Hello World')
else:
    print(a+b)

Submission status: Runtime Error

Solution code:
if input() ==1:
  '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, 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')
elif n==2:
  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, A, B = map(int,open(0).read().split())
if N == 1:
    print("Hello World")
if N == 2:
    print(A + B)

Submission status: Runtime Error

Solution code:
# 解説AC

n,m=list(map(int,input().split()))

i=m//n

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort(reverse=True)
    return divisors

lis=make_divisors(m)

for mm in lis:
    if mm<=i:
        ans=mm
        break

print(ans)

Submission status: Runtime Error

Solution code:
n = input()

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

Submission status: Runtime Error

Solution code:
n = input()

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

Submission status: Runtime Error

Solution code:
N, T = map(int,input().split())
ans = 10000
for _ in range(N):
  c,t = map(int,input().split())
if t <= T:
  ans = min(ans,c)

print("TLE" if ans == 10000 else ans)

    



if '__name__' == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import math
N, M = map(int, input().split())

ans = 1
if(N < M//N):
  i = N
  while(ans == 1 and i <= math.sqrt(M)):
    if(M % i == 0):
      ans = M//i
    i += 1
else:
  i = M//N
  while(ans == 1 and i >= 1):
    if(M % i == 0):
      ans = i
    i -= 1
  
print(ans)

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,b=map(int,input().split())
    print(a+b)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
n = int(input())
c = []
for i in range(n):
  a = [int(i) for i in input().split()]
  c.append(a)

p,q,r = c[0]
if n == 1:
  print(p,q,r)
  exit()

end = c[-1]
c = c[1:]
for i in range(101):
  for j in range(101):
    chk = abs(p-i)+abs(q-j)+r
    for num,k in enumerate(c):
      x,y,h = k
      if abs(x-i)+abs(y-j)+h != chk and h != 0:
        break
      if k == end:
        ans = (i,j,chk)

print(*ans)

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())
data=[input().split() for i in range(n)]
lc=[]
for row in data:
    if int(row[1]) <=T:
        lc.append(int(row[0]))

if not lc:
    print("TLE")
else:
    a=sorted(lc)
    print(a[0])

Submission status: Runtime Error

Solution code:
n,T=map(int,input().split())
data=[input().split() for i in range(n)]
lc=[]
for row in data:
    if int(row[1]) <=T:
        lc.append(row[0])
if  len(lc)==0:
    print("TLE")
else:
    print(min(lc))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
a=int(input())
b=int(input())
c=a+b
print("Hello World" if n%2==0 else str(c))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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