Problem:


Score : 100 points

Problem Statement

You will be given an integer a and a string s consisting of lowercase English letters as input.

Write a program that prints s if a is not less than 3200 and prints red if a is less than 3200.

Constraints

2800 \leq a < 5000

s is a string of length between 1 and 10 (inclusive).

Each character of s is a lowercase English letter.

Input

Input is given from Standard Input in the following format:

a
s

Output

If a is not less than 3200, print s; if a is less than 3200, print red.

Sample Input 1

3200
pink

Sample Output 1

pink

a = 3200 is not less than 3200, so we print s = pink.

Sample Input 2

3199
pink

Sample Output 2

red

a = 3199 is less than 3200, so we print red.

Sample Input 3

4049
red

Sample Output 3

red

a = 4049 is not less than 3200, so we print s = red.



Sample input:
3200
pink


Sample output:
pink

Submission status: Runtime Error

Solution code:
a,s = input().split() 
if int(a) >= 3200:
    print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
a = input()
s = input()
if a>= 3200:
  print(s)
else:
  print('red')

Submission status: Runtime Error

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

if a => 3200:
    print(s)
else:
    print("red")

Submission status: Runtime Error

Solution code:
a=int(inpout())
b=input()
print(b if a>=3200 else "red")

Submission status: Runtime Error

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

N, Q = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(N - 1):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    G[a].append(b)
    G[b].append(a)

val = [0] * (N)
for _ in range(Q):
    p, x = map(int, input().split())
    p -= 1
    val[p] += x

used = [False]*N


def dfs(s):
    stack = []
    stack.append(s)
    while len(stack) > 0:
        now = stack[-1]
        used[now] = True
        stack.pop()
        for nxt in G[now]:
            if used[nxt]:
                continue
            val[nxt] += val[now]
            stack.append(nxt)


dfs(0)

answer = ' '.join(map(str, val[:]))
print(answer)

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(999999)
input = sys.stdin.readline
tree = []
cnt = []

def add_cnt(p,x):
    cnt[p] += x
    for b in tree[p]:
        add_cnt(b,x)

n,q = map(int,input().split())
tree = [[] for _ in range(n+1)]
cnt = [0 for _ in range(n+1)]

for _ in range(n-1):
    a, b = map(int,input().split())
    tree[a].append(b)

for _ in range(q):
    p, x = map(int,input().split())
    add_cnt(p,x)

for i in range(1,n+1):
    print (cnt[i],end=' ')

Submission status: Runtime Error

Solution code:
a,s = map(int, open(0).read().split())
print(s if a>=3200 else 'red')

Submission status: Runtime Error

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

if a < 3200:
  print("red")
else:
  print(s)

Submission status: Runtime Error

Solution code:
print('Yes) if int(input()) >= 3200 else print(input())

Submission status: Runtime Error

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

if a => 3200:
	print(s)
else:
	print('red')

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
 
a.sort()
for i in range(n-1):
    a[i+1] = (a[i] + a[i+1]) / 2
 
print(a[-1])

Submission status: Runtime Error

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

if b <3200:
  print("red")
else:
  print(a)

Submission status: Runtime Error

Solution code:
a = int(input())
s = input()
if s >= 3200:
  print(s)
else:
  print("red")

Submission status: Runtime Error

Solution code:
a,s = map(int,input().split())
if 3200 <= a :
    print(s)
else :
    print('red')

Submission status: Runtime Error

Solution code:
a,s = map(int.input(),split())
if 3200 <= a :
    print(s)
else :
    print('red')

Submission status: Runtime Error

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

if n >= 3200:
  print(s)
else:
  print(''red")

Submission status: Runtime Error

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

if int(a) >= 3200:
    print(s)
else:
    print(red)

Submission status: Runtime Error

Solution code:
lst = imput().split()
if int(lst[0]) >= 3200:
  print(lst[1])
else:
  print('red')

Submission status: Runtime Error

Solution code:
a,s = input().split()
if a >= 3200:
  print(s)
else:
  print('red')

Submission status: Runtime Error

Solution code:
A = int(input())
S = str(input())
if A >= 3200:print(S)
else print("red")

Submission status: Runtime Error

Solution code:
n = int(input())

a = list(map(int,input().split()))

s=0
for x in a:
    s+=1/x
ans=1/s

print(ans)

Submission status: Runtime Error

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

if(a>=3200):
    print(s)
else:
    print("red")

Submission status: Runtime Error

Solution code:
import Foundation

class Node{
    var next:[Node]=[]
    var ten:Int=0
    init() {
    }
    func plus(xs:Int){
        self.ten += xs
        if !self.next.isEmpty{
           // print("!self.next.isEmpty :",!self.next.isEmpty)
            for i in 0...self.next.count-1{
              //  print("i:",i)
                self.next[i].plus(xs:xs)
            }
        }
    }
}

func readInts(by separator: Character = " ") -> [Int] {
    return readLine()!.split(separator:separator).map { Int($0)! }
}

let n:[Int] = readInts()

var node:[Node]=[]

for i in 1...n[0]{
    node.append(Node())
}

for i in 1...n[0]-1{
    let a:[Int]=readInts()
    //print("a:",a)
    node[a[0]-1].next.append(node[a[1]-1])
   // print(node[a[0]-1].next)
}

for i in 1...n[1]{
    let p:[Int]=readInts()
  //  print("p:",p)
    node[p[0]-1].plus(xs:p[1])
}

node.map{print(($0).ten)}

Submission status: Runtime Error

Solution code:
import itertools

N = int(input())
li = list(map(int, input().split()))
t = []

max = 0

for i in itertools.permutations(range(N)):
  t.append(i)

for i in t:
  count = 0
  for n in range(N-1):
    if n == 0:
      count = (li[i[n]] + li[i[n+1]]) / 2
    else:
      count = (count + li[i[n+1]]) / 2

  if max < count:
    max = count

print(max)

Submission status: Runtime Error

Solution code:
a=input()
s=input()
if(a>=3200):
  print(s)
else:
  print('red')

Submission status: Runtime Error

Solution code:
a = input()
if(a<3200):
  print('red')
else:
  print 'pink'

Submission status: Runtime Error

Solution code:
a = int(input())
s = input()
print(s if a >= 3200 else 'red)

Submission status: Runtime Error

Solution code:

s = [input() for i in range(2)]
if s[0] >= 3200:
	print(s[1])
else:
  print("red")

Submission status: Runtime Error

Solution code:
def main():
	# n,m = map(int,input().split())
	# n,k = map(int,input().split())
	# n = int(input())
	# a = list(map(int,input().split()))
	# rsp = list(str(input()))
	# l = [list(map(int, input().split())) for _ in range(n)]
	# s = list(s)
	
	a = int(input())
	s = int(input())

	if a >= 3200:
		print("red")
	else:
		print(s)


 
if __name__ == '__main__':
	main()

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
t=s if a>=3200 else red
print(t)

Submission status: Runtime Error

Solution code:
a=input()
s=input()
t=s if a>=3200 else red
print(t)

Submission status: Runtime Error

Solution code:
from collections import deque

n,q = map(int,input().split())
E = [[] for i in range(n)]
for i in range(n-1):
    a,b = map(int,input().split())
    E[a-1].append(b-1)
    E[b-1].append(a-1)
 

score = [0]*n
for i in range(q):
    a,b = map(int,input().split())
    score[a-1] += b

def bfs(i):
    s = -1
    q = deque([])
    q.append((i-1,s))
    while q:
        
        num,bef = q.pop()
        for j in E[num]:
            if j == bef:
                continue
            else:
                score[j] += score[num]
                q.append((j,num))
            
    return score
print(*bfs(1))

Submission status: Runtime Error

Solution code:
s = input()
t = input()
ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Submission status: Runtime Error

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

if a>=3200:
  print(s)
else:
  print('red')

Submission status: Runtime Error

Solution code:
def main()
  a=int(input())
  s=input()
  if 3200<=a<5000:
    print(s)
  elif 2800<=a<3200:
    print("red")
main()

Submission status: Runtime Error

Solution code:
from collections import defaultdict

N, Q = map(int, input().split())
edge = defaultdict(list)
for i in range(N-1):
    a, b = map(int, input().split())
    edge[a].append(b)
    edge[b].append(a)

cnt = [0]*(N+1)
for i in range(Q):
    p, x = map(int, input().split())
    cnt[p] += x

root_node = (1, -1) # (id, value, parent_id)
open_list = [root_node]
closed_list = []
while True:
    if len(open_list) == 0:
        break
    cur_node = open_list.pop()
    cur_id, parent_id = cur_node
    if not(parent_id == -1):
        cnt[cur_id] += cnt[parent_id]
    for child_id in edge[cur_id]:
        if child_id == parent_id:
            continue
        open_list.append((child_id, cur_id))
print(*cnt[1:])

Submission status: Runtime Error

Solution code:
#再帰を使って各ノードのカウンタの値を決定
def decide_count(v,G,c):#vは1始まり
    for u in G[v]:
        print(u)
        c[u-1]+=c[v-1]
        decide_count(u,G,c) 

N,Q = list(map(int,input().split()))
a=[0]*(N-1)
b=[0]*(N-1)
G={}
for i in range(N-1):
    a[i],b[i] = list(map(int,input().split()))
for i in range(N):
    G[i+1]=[]
p=[0]*Q
x=[0]*Q
for i in range(Q):
    p[i],x[i] = list(map(int,input().split()))

#グラフの作成
for i in range(N-1):
    G[a[i]].append(b[i])

c=[0]*N
for i in range(Q):
    c[p[i]-1] += x[i]

decide_count(1,G,c)

ans = ' '.join([str(x) for x in c])

print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
s = input()
  
if s < 3200:
  print('red')
else:
  print(s)

Submission status: Runtime Error

Solution code:
if int(input) >= 3200:
    print(input())
else:
    print("red")
    exit()

Submission status: Runtime Error

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

if a>=3200:
  print(S)
else:
  print("red")

Submission status: Runtime Error

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

if a >= 3200:
    print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
 
ans = 0
 
for i in range(N):
    ans = ans + 1 / A[i]
 
ans = 1 / ans 
 
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())

A = [int(input()) for _ in range(N)]
Ans = 0

for i in range(N):
    v += 1 / a[i]
print(1 / Ans)

Submission status: Runtime Error

Solution code:
a = int(input())
s = input()
if a >= '3200':
    print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
import py

a = input()
a=int(a)
s=input()
if a >= 3200:
  print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
a=input()
a=int(x)
s=input()
if y>=3200:
  print(s)
else:
  print("red")

Submission status: Runtime Error

Solution code:
a = input()
s=input()
if a >= 3200:
  print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
N, Q = [int(item) for item in input().split()]

tree_list = [input() for _ in range(1,N)]
tree_list_int = [[int(k) for k in i.split()] for i in tree_list]
query_list = [input() for _ in range(Q)]
query_list_int = [[int(k) for k in i.split()]  for i in query_list]

val_list = [0 for _ in range(N)]
node_index = [[] for _ in range(N)]
cumulated_sum_list = [0] * N

# make graph(relation)
for a, b in tree_list_int:
    node_index[a -1].append(b - 1) #親位置に子のindexを追加
    node_index[b -1].append(a - 1) #子位置に親のindexを追加

for index, val in query_list_int:
    val_list[index-1] += val #加算する値を親位置へ記載

def dfs(child_index, pairent_index):
    for child in node_index[child_index]: #とあるノード（再帰していく）の子ノードを線形探索

        if child != pairent_index: #子ノードが親ノードでないとき
            val_list[child] += val_list[child_index] #累積和の計算
            dfs(child, child_index) #再帰する。子にノード子を挿入。今回の子を親に

    return val_list

res = dfs(0, -1) #0はルート、-1は親を持っていない事

for i in res:
    print(i)

Submission status: Runtime Error

Solution code:
=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  input('red')

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
if a>=3200:
  print(a)
else:
  input('red')

Submission status: Runtime Error

Solution code:
a = input()
print(a if a >= 3200 else "red")

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N, Q = map(int, input().split())
 
AB = [[int(x) for x in input().split()] for _ in range(N-1)] 
PX = [[int(x) for x in input().split()] for _ in range(Q)] 
 
graph = [[] for _ in range(N+1)]
for a, b in AB:
    graph[a].append(b)
    graph[b].append(a)
 
value = [0] * (N+1)
for p, x in PX:
    value[p] +=x
 
def dfs(v, parent, add):
    value[v] += add
    for x in graph[v]:
        if x == parent:
            continue
        dfs(x, v, value[v])
 
dfs(1, 0, 0)
ans = ' '.join(map(str,value[1:]))
print(ans)

Submission status: Runtime Error

Solution code:
N, Q = map(int, input().split())
 
AB = [[int(x) for x in input().split()] for _ in range(N-1)] 
PX = [[int(x) for x in input().split()] for _ in range(Q)] 
 
graph = [[] for _ in range(N+1)]
for a, b in AB:
    graph[a].append(b)
    graph[b].append(a)
 
value = [0] * (N+1)
for p, x in PX:
    value[p] +=x
 
def dfs(v, parent, add):
    value[v] += add
    for x in graph[v]:
        if x == parent:
            continue
        dfs(x, v, value[v])
 
dfs(1, 0, 0)
ans = ' '.join(map(str,value[1:]))
print(ans)

Submission status: Runtime Error

Solution code:

import sys

input = sys.stdin.readline

# input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


def main():
    a = int(input())
    s = int(input())

    if a >= 3200:
        print(s)
    else:
        print('red')


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

if a>=3200:
  print(s)
else if a<3200:
  print('red')

Submission status: Runtime Error

Solution code:
n = input()
s = input()

if n < 3200:
  print("red")
else:
  print(s)

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
if s>=3200:
  print(s)
else:
  print('red')

Submission status: Runtime Error

Solution code:
a = int(input())
s = input()
if a < 3200, a >=2800:
  print(s)
else:
  print('red')

Submission status: Runtime Error

Solution code:
a=int(inout())
if a>=3200:
  print("red")
else:
  print(input())

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
if a=>3200:
  print(s)
else:
  print('red')

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
if a=>3200:
  print('s')
else:
  print('red')

Submission status: Runtime Error

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

if a >= 3200:
    print(s)
else:
    print(red)

Submission status: Runtime Error

Solution code:
n = int(input())
guzai_valu = list(map(int, input().split()))
heikin=0
i=1
while i <= n-1:
   guzai_valu_sort = sorted(guzai_valu)
   #print(guzai_valu_sort)
   heikin=(guzai_valu_sort.pop(0)+guzai_valu_sort.pop(0))/2
   #自動で成分がずれるのでリストの成分の内最初のものを2回選ぶことが最小のもの
   #を2つ選ぶことと等価になるんや
   #print(heikin)
   guzai_valu_sort.append(heikin)
   guzai_valu = guzai_valu_sort
   i=i+1


print(heikin)

Submission status: Runtime Error

Solution code:
x = int(input())
y = input()

if x >= 3200 :
     print(y)

else:
print('red')

Submission status: Runtime Error

Solution code:
N, Q = map(int, input().split())
ki = [[[],0] for i in range(N)]
result = [0]*N

def dfs(i, num, parent):
    num_tmp = num+ki[i][1]
    result[i] = num_tmp
    if not ki[i][0]:
        return
    for j in ki[i][0]:
        if j == parent:
            continue
        dfs(j, num_tmp, i)
    return

for i in range(N-1):
    a, b = map(int, input().split())
    ki[a-1][0].append(b-1)
    ki[b-1][0].append(a-1)

for i in range(Q):
    p, x = map(int, input().split())
    ki[p-1][1] += x

dfs(0, 0, -1)
print(*result)

Submission status: Runtime Error

Solution code:
a = int(input())
s = int(input())
if a >= 3200:
    print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
n = input()
an = list(map(int, input().split()))
i=0
k=0
 
 

  
while n>i:
  k+=1/an[i]
  i+=1
  
print(1/k)

Submission status: Runtime Error

Solution code:
n = input()
an = list(map(int, input().split()))
i=0
k=0
 
 

  
while n>i:
  k+=1/an[i]
  i+1
  
print(1/k)

Submission status: Runtime Error

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

atai=[0]*n
oya=[0]*n

for i in range(1,n):
  a,b=map(int,input().split())
  oya[b-1]=a
#↑これにより、各木の親がどの番号なのかをメモっとく

sousa=[list(map(int,input().split())) for i in range(q)]
sousa.sort()

for i in range(q):
  #まず親の値を足す。
  if oya[sousa[i][0]-1]!=0:
    atai[i]+=atai[oya[i]-1] #(親の値は、実際のatai配列には1小さいインデックス番号にある)
    #足した後は「既に足した」証明として-1を代入。
    oya[sousa[i][0]-1]=-1
  #操作で足される文を足す
  atai[sousa[i][0]-1]+=sousa[i][1]

for i in range(n):
  if oya[i]!=-1:
    if oya[i]!=0:
      atai[i]+=atai[oya[i]-1]

for i in atai:
  print(i)

#むずｗ

Submission status: Runtime Error

Solution code:
a = int(input())
s = input()
if a < 3200:
    print(red)
elif a >= 3200:
    print(s)

Submission status: Runtime Error

Solution code:
// CppPractice.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;

int main()
{
	int a;
	string s;
	cin >> a;
	cin >> s;

	if (a > 3200) cout << s;
	else cout << "red";
}

// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー

// 作業を開始するためのヒント: 
//    1. ソリューション エクスプローラー ウィンドウを使用してファイルを追加/管理します 
//   2. チーム エクスプローラー ウィンドウを使用してソース管理に接続します
//   3. 出力ウィンドウを使用して、ビルド出力とその他のメッセージを表示します
//   4. エラー一覧ウィンドウを使用してエラーを表示します
//   5. [プロジェクト] > [新しい項目の追加] と移動して新しいコード ファイルを作成するか、[プロジェクト] > [既存の項目の追加] と移動して既存のコード ファイルをプロジェクトに追加します
//   6. 後ほどこのプロジェクトを再び開く場合、[ファイル] > [開く] > [プロジェクト] と移動して .sln ファイルを選択します

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

from collections import deque

# N: ノードの数
# Q: 数値をノードに付与する回数
N, Q = list(map(int, input().split()))

links =  [[] for _ in range(N)]
values = [0 for _ in range(N)]

for i in range(N - 1):
    edge1, edge2 = [x - 1 for x in list(map(int, input().split()))]
    links[edge1].append(edge2)
    links[edge2].append(edge1)

for i in range(Q):
    node, val = list(map(int, input().split()))
    values[node - 1] += val

# 値の計算
stack = deque()
stack.append((0, -1))
while stack:
    node = stack.pop()

    for linked_node in links[node[0]]:
        if linked_node == node[1]:  # link が親ノード向けでなければ
            continue

        values[linked_node] += values[node[0]]
        stack.append((linked_node, node[0]))

print(*values)

Submission status: Runtime Error

Solution code:
N=int(input())
v=list(map(int,input().split()))
v.sort()
if len(v)==1:
    print(v[0])
elif len(v)==2:
    print((v[0]+v[1])/2)
else:
    s=(v[0]+v[1])/2
    for j in range(2,N):
        s+=(s+v[j])/2
    print(s)

Submission status: Runtime Error

Solution code:
N=int(input())
v=list(map(int,input().split()))
v.sort()
if len(v)==1:
    print(v[0])
elif len(v)==2:
    print((v[0]+v[1])/2)
else:
    s=(v[0]+v[1])/2
    for j in range(2,N):
        s+=v[j]/(2**(N+1-j))    
    print(s)

Submission status: Runtime Error

Solution code:
print('red' if int(input() < 3200 else input())

Submission status: Runtime Error

Solution code:
a=int(input())
s=str((input())
if a<3200:
      print('red')
else:
      print(s)

Submission status: Runtime Error

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

if a<=3200:
  print('red')
  else:
    print(s)

Submission status: Runtime Error

Solution code:
sum = 0
N = input() 
for i in range(int(N)):
	s = float(input())
	sum = sum+(1/s)
print(sum)

Submission status: Runtime Error

Solution code:
N = int(input())
v = [int(x) for x in input().split()]

v.sort()
#print(v)
for i in range(1,N):
  v[:2] = [(v[0]+v[1])/2]

print(v[0])

Submission status: Runtime Error

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

if a >= 3200:
  print(s)
else:
  print('red')

Submission status: Runtime Error

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

if a => 3200:
    print(s)
else:
    print("red")

Submission status: Runtime Error

Solution code:
a=int(input())
s=input
if a => 3200:
    print(s)
else:
    print("red")

Submission status: Runtime Error

Solution code:
a = int(input())

if a => 3200:
    print("s")
else:
    print("red")

Submission status: Runtime Error

Solution code:
a = int(input())

if a =< 3200:
    print(s)
else:
    print(red)

Submission status: Runtime Error

Solution code:
a = input()

if a =< 3200:
    print(s)
else:
    print(red)

Submission status: Runtime Error

Solution code:
a = input()
s = input()
if input(a) >= 3200:
    print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
s = list(input())
t = list(input())
count = 0
for i in range(0,3):
    if s[i] == t[i]:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))

a = 0

for i in range(N):
         a += 1 / A[i]

print(1 / a)

Submission status: Runtime Error

Solution code:
data = [input() for i in range(2)]

if data[0]>=3200:
  print(data[1])

else:
  print("red")

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
if a>=3200:
	print(s)
else:
print("red")

Submission status: Runtime Error

Solution code:
from heapq import heapify, heappush, heappop
n = int(input())
L = [int(i) for i in input().split()]
heapify(L)
for i in range(n-1):
    s = (L[0]+L[1])/2
    L = L[2:] 
    heappush(L,s)
ans = heapq.heappop(L)
print(ans)

Submission status: Runtime Error

Solution code:
a, s = open(0).read().split()
if a >= 3200:
  print('red')
else:
  print(a)

Submission status: Runtime Error

Solution code:
a, s = input().split()
if a >= 3200:
  print('red')
else:
  print(a)

Submission status: Runtime Error

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

if a < 3200:
    print(s)
elif a >= 3200:
    print('red')

Submission status: Runtime Error

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

if a < 3200:
    print(s)
elif a >= 3200:
    print("red")

Submission status: Runtime Error

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

if a < 3200:
    print(s)
elif a >= 3200:
    print(red)

Submission status: Runtime Error

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

if a >=　3200:
  print(s)
else:
  print("red")

Submission status: Runtime Error

Solution code:
n, q = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n-1)]
px = [list(map(int, input().split())) for _ in range(q)]
ab.sort()
cnt = [0]*n

for i in px:
    cnt[i[0] - 1] += i[1]
for j in ab:
    cnt[j[1]-1] += cnt[j[0]-1]

print(*cnt)

Submission status: Runtime Error

Solution code:
s,t=input(),input()
count=0
for i in range(3):
    if s[i]==t[i]:
        count+=1

print(count)

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
if a>=3200: print(s)
else print("red")

Submission status: Runtime Error

Solution code:
import sys

inputs = []
for line in sys.stdin:
    inputs.append(line)
    
if inputs[0] >= 3200:
  print(inputs[1])
else:
  print('red')

Submission status: Runtime Error

Solution code:
import sys
 
def red_or_nod(s:str, a:int):
  if int(a) >= 3200:
    print(s)
  else:
    print('red')
    
red_or_nod(sys.argv[1], sys.argv[2])

Submission status: Runtime Error

Solution code:
import sys

def red_or_nod(a:int, s:str):
  if int(a) >= 3200:
    print(s)
  else:
    print('red')
    
red_or_nod(sys.argv[1], sys.argv[2])

Submission status: Runtime Error

Solution code:
N = int(input())
arr = list(map(int, input().split()))
while len(arr)>1:
    arr=sorted(arr)
    v1 = arr.pop(0)
    v2 = arr.pop(0)
    arr.append((v1+v2)/2)
print(arr[0])

Submission status: Runtime Error

Solution code:
N = int(input())
arr = list(map(int, input().split()))
while len(arr)>1:
    arr=sorted(arr)
    v1 = arr.pop(0)
    v2 = arr.pop(0)
    arr.append((v1+v2)/2)
print(sum(arr))

Submission status: Runtime Error

Solution code:
    def find(i, ss, step):
        for j in range(step, len(ss)):
            #print(i, j, ss[j])
            if i == ss[j]:
                a = j
                return a, step
        return -1
     
     
    s = input().strip()
    #print(s)
    t = input().strip()
    #print(t)
    ss = s * 100
    #print(ss)
    step = 0
    for i in t:
        a = find(i, ss, step)
        if a == -1:
            print(-1)
            break
        else:
            #print(a)
            step = a[0] + 1
            #print(step)
    if a != -1:
        print(step)

Submission status: Runtime Error

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

if N>=3200:
  print(s)
  
else:
    print("red")

Submission status: Runtime Error

Solution code:
N = int(input())

if N>=3200:
  print(s)
  
else:
    print("red")

Submission status: Runtime Error

Solution code:
n=int(input())
Values=list(map(int,input().split()))
Values=sorted(Values)
i=1
while i<=n-1:
    x=Values.pop(0)
    y=Values.pop(0)
    new=(x+y)/2
    Values.append(new)
    Values=sorted(Values)
    i+=1
print(*Values)

Submission status: Runtime Error

Solution code:
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print(‘red’)

Submission status: Runtime Error

Solution code:
L,R = map(int,input().split())
count = 0
for x in range(L,R+1,1):
  for y in range(L,R+1,1):
    surplus = y % x
    xor_xy = bin(x ^ y)
    xor_10 = int(xor_xy,2)
    if (surplus == xor_10):
      count += 1
result = count % (10 ** 9 + 7)
print(result)

Submission status: Runtime Error

Solution code:
import numpy as np
N=int(input())
list=list(map(int,input().split()))
np_list=np.array(list)
inv_np_list=1/np_list
print(1/(sum(inv_np_list)))

Submission status: Runtime Error

Solution code:
a=input()
s=input()
a=int(a)
s=int(s)
if a>=3200:
    print(s)
elif a<3200:
    print("red")

Submission status: Runtime Error

Solution code:
first=input()
(a, s)=first.split()
a=int(a)
s=int(s)
if a>=3200:
    print(s)
elif a<3200:
    print("red")

Submission status: Runtime Error

Solution code:
print("red") if int(input()) < 3200 else print("pink"

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**6)
def walk(n):
    global adj, point
    if len(adj[n])==0:
        return
    else:
        for a in adj[n]:
            point[a] += point[n]
        for a in adj[n]:
            walk(a)
N, Q = map(int, input().split())
adj = [[] for _ in range(N)]
point = [0 for _ in range(N)]
for _ in range(N-1):
    a, b = map(int, input().split())
    adj[a-1].append(b-1)
for _ in range(Q):
    p, x = map(int, input().split())
    point[p-1] += x
walk(0)
print(" ".join(map(str, point)))

Submission status: Runtime Error

Solution code:
    a = int(input())
    s = input()
    if a >= 3200:
        print(s)
    else:
        print("red")

Submission status: Runtime Error

Solution code:
a, s = input().split(' ')
if int(a) >= 3200:
  print(s)
else:
  print("red")

Submission status: Runtime Error

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

if a >= 3200:
    print(s)
else:
    print('red')

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
  ans+=1/a[i]
print(1/ans)

Submission status: Runtime Error

Solution code:

import sys
input = sys.stdin.readline

n, q = [int(x) for x in input().split()]

edge = [[] for _ in range(n)]

counter = [0] * n

for _ in range(n-1):
    a, b = [int(x) for x in input().split()]
    edge[a-1].append(b-1)
    edge[b-1].append(a-1)

for _ in range(q):
    a, b = [int(x) for x in input().split()]
    counter[a-1] += b

parent = [0]

for i in parent:
    for v in edge[i]:
        if v in parent:
            continue
        parent.append(v)
        counter[v] += counter[i]
        
print(" ".join(map(str, counter)))

Submission status: Runtime Error

Solution code:
repeat =int(input())
numbers =input().rstrip().split(" ")
#print(numbers)
sum =0
for i in range(repeat):
  sum =sum +1/int(numbers[i])
#print(sum)
answer =1/sum
print(answer)

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
nums = np.array(list(map(int, input().split())))
n_total = nums.prod()
n_denominator = sum([n_total/num for num in nums])
ans = n_total / n_denominator
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np
 
 
def main():
    n = int(input())
    nums = np.array(list(map(int, input().split())))
    n_total = nums.prod()
    n_denominator = sum([n_total/num for num in nums])
    ans = n_total / n_denominator
    print(ans)
  
  
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import numpy as np
 

n = int(input())
nums = np.array([int(input()) for i in range(n)])
n_total = nums.prod()
n_denominator = sum([n_total/num for num in nums])
ans = n_total / n_denominator
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
if N>0 or N<=100:
    A = []
    for i in range(0,N):
      B = int(input())
      if B>0 or B<=1000:
          A.append(B)
 
    sum1 = 1/A[0]
 
    for i in range(0,N-1):
      sum1 = sum1 + 1/A[i+1]
 
    result = 1/sum1
    print(result)

Submission status: Runtime Error

Solution code:
N = int(input())
A = []
for i in range(0,N):
  B = int(input())
  A.append(B)

sum1 = float(1/A[0])

for i in range(0,N-1):
  sum1 = sum1 + 1/A[i+1]

result = 1/sum1
print(result)

Submission status: Runtime Error

Solution code:
if __name__=="__main__":
    import sys
    a = int(input("Please enter a nubmer: "))
    s = input("Please enter a String: ")
 else:
     a = input()
     s = input()
if a>=3200:
 print(s)
else:
 print('red')

Submission status: Runtime Error

Solution code:
inputs = input().split('\n')
n = inputs[0]
color = inputs[1]

if n >= 3200:
  print(color)
else:
  print('red')

Submission status: Runtime Error

Solution code:
from sys import stdin
n = int(stdin.readline().rsprit())
s = stdin.readline().rstrip()

if n >= 3200:
    print(s)
else:
    print("red")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# https://atcoder.jp/contests/abc138/tasks/abc138_d

# It's a Python porting of ki.cpp
# Mainly to understand the algorithm by myself

N, Q = list(map(int, input().split()))

tree_link = [None] * 200005
answer = [0] * N


def dfs(v, p=-1):
    for link in tree_link[v]:
        if link == p:  # 親ノードであれば continue
            continue
        answer[link] += answer[v]
        dfs(link, v)


# 双方向の辺を作る
for i in range(N - 1):
    a, b = list(map(int, input().split()))
    a -= 1
    b -= 1

    if tree_link[a]:
        tree_link[a].append(b)
    else:
        tree_link[a] = [b]

    if tree_link[b]:
        tree_link[b].append(a)
    else:
        tree_link[b] = [a]

# 頂点に値を足し込む
for i in range(Q):
    p, x = list(map(int, input().split()))
    answer[p - 1] += x

# 計算
dfs(0)

# 出力
print(" ".join([str(answer[i]) for i in range(N)]))

Submission status: Runtime Error

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

if A >= 3200:
  print(red)
else:print(B)

Submission status: Runtime Error

Solution code:
if(int(input())<3200)print("red")
else print(input())

Submission status: Runtime Error

Solution code:
a=int(input())
s=int(input())
if a >= 3200:
    print(s)
else:
    print('red')

Submission status: Runtime Error

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

if a>=3200:
    print(s)
else:
    print(red)

Submission status: Runtime Error

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

if a <= 3200:
  print('red')
elsd:
  print(s)

Submission status: Runtime Error

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

if a >= 3200:
  print('red')
elsd:
  print(s)