Problem:


Score: 100 points

Problem Statement

There is a train going from Station A to Station B that costs X yen (the currency of Japan).

Also, there is a bus going from Station B to Station C that costs Y yen.

Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.

How much does it cost to travel from Station A to Station C if she uses this ticket?

Constraints

1 \leq X,Y \leq 100

Y is an even number.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

X Y

Output

If it costs x yen to travel from Station A to Station C, print x.

Sample Input 1

81 58

Sample Output 1

110

The train fare is 81 yen.

The train fare is 58 ⁄ 2=29 yen with the 50% discount.

Thus, it costs 110 yen to travel from Station A to Station C.

Sample Input 2

4 54

Sample Output 2

31



Sample input:
81 58


Sample output:
110

Submission status: Accepted

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

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

print(int(x + y/2))

Submission status: Accepted

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


def Discount_Fare():
    X, Y = [int(n) for n in input().split()]
    print(X + (Y // 2))


if __name__ == '__main__':
    Discount_Fare()

Submission status: Accepted

Solution code:
X, Y = [int(s) for s in input().rstrip().split()]
fare = X + int(Y / 2)
print(fare)

Submission status: Accepted

Solution code:
X, Y = [int(a) for a in input().split()]
ret = int(X + Y/2 + 0.1)
print(str(ret))

Submission status: Accepted

Solution code:
from sys import stdin

x, y = list(map(int, stdin.readline().split()))
print(x + y//2)

Submission status: Accepted

Solution code:
[x,y] = list(map(int,input().split()))
print(x + y//2)

Submission status: Accepted

Solution code:
X,Y=list(map(lambda x:float(x),input().split()))
print(int(X+Y/2.))

Submission status: Accepted

Solution code:
n=list(map(int,input().split()))
print(int(n[0]+(n[1]/2)))

Submission status: Accepted

Solution code:
x, y = (int(i) for i in input().split())

print(int(x+y/2))

Submission status: Accepted

Solution code:
def main():
    X,Y = list(map(int, input().split()))
    print(int(X+Y/2))



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X,Y=map(int, raw_input().split())
print X+Y/2

Submission status: Accepted

Solution code:
x,y = [int(i) for i in input().split()]

print(x+y//2)

Submission status: Accepted

Solution code:
# your code goes here
def main():
	buf = input().split()
	print(int(int(buf[0])+int(buf[1])/2))
	
main()

Submission status: Accepted

Solution code:
X, Y = map(int, raw_input().split())

print(X+Y/2)

Submission status: Accepted

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

fare = x + int(y / 2)
print(fare)

Submission status: Accepted

Solution code:
x , y = map(int,input().split())
print(int(x+(y/2)))

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

x, y = list(map(int, input().split()))
print(int(x + y / 2))

Submission status: Accepted

Solution code:
import collections
import scipy.misc
import sys
import numpy as np
from operator import itemgetter

def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   

"""
N, X = map(int, input().split())

x = [0]*N
x[:] = map(int, input().split())
"""


X, Y = map(int, input().split())
print(X + int(Y/2))

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
print(int(X + (Y/2)))

Submission status: Accepted

Solution code:
X, Y = input().rstrip().split()
ans = int(int(X) + int(Y) / 2)
print(ans)

Submission status: Accepted

Solution code:
x,y = map(int, input().split())
print(int(x + (y/2)))

Submission status: Accepted

Solution code:
def main():
    X, Y = list(map(int, input().rstrip().split()))
    print(X + Y // 2)
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(int(x + y /2))

Submission status: Accepted

Solution code:
a,b= map(int,input().split())


print(a + b//2)

Submission status: Accepted

Solution code:
def main():
    X, Y = map(int, input().split())
    print(int(X + Y / 2))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
[a,b]=[int(i) for i in input().split()]

print(int(a+b/2))

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print(x + int(y / 2))

Submission status: Accepted

Solution code:
x, y = map(int,input().split())
print(int(x + y / 2))

Submission status: Accepted

Solution code:
"""
A - Discount Fare
"""

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

print(x + int(y/2))

Submission status: Accepted

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

print(x+int(y/2))

Submission status: Accepted

Solution code:
import math
from functools import reduce
import collections
import itertools
a = list(map(int,input().split()))
x = a[0]
y = a[1]
ans = x + y//2
print(ans)

Submission status: Accepted

Solution code:
X,Y=map(int,input().split(" "))
print(X+Y//2)

Submission status: Accepted

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

if __name__ == '__main__':
    X, Y = map(int, input().split(' '))
    print(int(X + Y / 2))

Submission status: Accepted

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

import sys
import itertools
import math

X,Y=[int(x) for x in input().split()]

print(X+Y//2)

Submission status: Accepted

Solution code:
L = input()
l = L.split()
X = int(l[0])
Y = int(l[1])
x = int(X + Y/2)
print(x)

Submission status: Accepted

Solution code:
X,Y=list(map(int,input().split()))

print(X+(Y//2))

Submission status: Accepted

Solution code:
A = input().split()
print(str(int(int(A[0])+int(A[1])/2)))

Submission status: Accepted

Solution code:
X, Y = list(map(int, input().split()))

ans = X + Y / 2
print(int(ans))

Submission status: Accepted

Solution code:
X, Y = [int(i) for i in input().split()]

ans = X + (int(Y/2))

print(ans)

Submission status: Accepted

Solution code:
#!/bin/env python

def main():
    X, Y = map(int, raw_input().split(" "))
    print X + Y/2

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x, y = [int(_) for _ in input().split()]
print(x+y//2)

Submission status: Accepted

Solution code:
# A
x,y = list(map(int, input().split()))
print(int(x+y/2))

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
print(X + round(Y/2))

Submission status: Accepted

Solution code:
x,y = [int(x) for x in input().strip('\n').split(' ')]
print(int(x+y/2))

Submission status: Accepted

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

y = int(y/2)
print(x+y)

Submission status: Accepted

Solution code:
x,y = [int(_) for _ in input().split()]
print(x+y//2)

Submission status: Accepted

Solution code:
x,y=[int(i) for i in input().split()]
print(int(x+(y/2)))

Submission status: Accepted

Solution code:
inputs = raw_input().replace("\n", "").split(" ")
X, Y = map(int, inputs)

print X+Y/2

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
print(a + b//2)

Submission status: Accepted

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

print(X+Y//2)

Submission status: Accepted

Solution code:

x, y = map(int, input().split())
print(x+y//2)

Submission status: Accepted

Solution code:
x, y = map(int, raw_input().split())
print x + y / 2

Submission status: Accepted

Solution code:
X, Y = input().split()

print(int(X)+int(Y)//2)

Submission status: Accepted

Solution code:
n = input().split(' ')
print(int(int(n[0]) + (int(n[1]) / 2)))

Submission status: Accepted

Solution code:
a,b=map(int, input().split(" "))
print(int(a+b*(1/2)))

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())

Z = X + Y // 2
print(Z)

Submission status: Accepted

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

print(int(A+B/2))

Submission status: Accepted

Solution code:
temp = input().rstrip().split(" ")
X = int(temp[0])
Y = int(temp[1])

print(int(X + Y/2))

Submission status: Accepted

Solution code:
X, Y = list(map(int, input().split()))

re = X + Y // 2
print(re)

Submission status: Accepted

Solution code:
X, Y = map( int, input().split())
print(X+Y//2)

Submission status: Accepted

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

print(n[0]+n[1]//2)

Submission status: Accepted

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

print(x+y//2)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())

ans = X + round(Y/2)

print(ans)

Submission status: Accepted

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

print(int(a[0] + a[1]/2))

Submission status: Accepted

Solution code:
X,Y = map(int, input().split())

ans = int(X + (Y/2))

print(ans)

Submission status: Accepted

Solution code:
def main():
    X, Y = map(int, input().split())

    ans = X + Y // 2
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    x, y = map(int, input().split())
    print(x + y//2)


main()

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print(A+int(B/2))

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline


def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [X, Y] = [long(input_raw[0]), long(input_raw[1])]
    print X + Y/2

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split()))
print(a+(b//2))

Submission status: Accepted

Solution code:
[x,y] = [int(i) for i in input().split()]
print(x+int(y/2))

Submission status: Accepted

Solution code:
x = map(int, raw_input().split(" "))
print x[0] + x[1] / 2

Submission status: Accepted

Solution code:
import sys


def main() -> None:
    x = int(next_str())
    y = int(next_str())

    print(x + y // 2)


def next_str() -> str:
    result = ""
    while True:
        tmp = sys.stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    x, y = list(map(int, input().split(' ')))
    print(x + y // 2)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
print(int(A+B/2))

Submission status: Accepted

Solution code:
X,Y=map(int, raw_input().split())

print X + Y/2

Submission status: Accepted

Solution code:
nums = [int(num) for num in input().split()]
print(nums[0] + nums[1]//2)

Submission status: Accepted

Solution code:
a, b = map(int, raw_input().strip().split())
print a + b // 2

Submission status: Accepted

Solution code:
x, y =map(int, input().split())
print(x + y // 2)

Submission status: Accepted

Solution code:
x, y = list(map(int, input().split()))
print(int(x+y/2))

Submission status: Accepted

Solution code:
[a,b]=[int(x) for x in input().split()]
print(a+b//2)

Submission status: Accepted

Solution code:
N = input().split(' ')
A = int(N[0])
B = int(int(N[1])/2)

print(A+B)

Submission status: Accepted

Solution code:
X, Y = map(int,input().split(' '))

ans = X + Y // 2
print(ans)

Submission status: Accepted

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

ans = x + y // 2
print(ans)

Submission status: Accepted

Solution code:
n, m = [int(i) for i in input().split()]
print(n+m//2)

Submission status: Accepted

Solution code:
n, m = map(int,input().split())
print(n + (m // 2))

Submission status: Accepted

Solution code:
X, Y = (int(i) for i in input().split())

print(X+Y//2)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(int(A + B/2))

Submission status: Accepted

Solution code:
x, y = list(map(int, input().split(" ")))

print(x + (y//2))

Submission status: Accepted

Solution code:


X,Y = map(int,input().split())
print(X + int(Y/2))

Submission status: Accepted

Solution code:
X, Y= map(int, input().split(" "))
print(X + Y//2)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print(x + int(y/2))

Submission status: Accepted

Solution code:
#coding:utf-8
a,b = list(map(int,input().split()))
print (int(a+b/2))

Submission status: Accepted

Solution code:
def abc113_a():
    x, y = map(int, input().split())
    return int(x + y/2)


print(abc113_a())

Submission status: Accepted

Solution code:
n = list(map(int,input().split()))
print(n[0]+n[1]//2)

Submission status: Accepted

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

X,Y = map(int, input().split())

print(X + Y//2)

Submission status: Accepted

Solution code:
# coding: utf-8
X, Y = map(int, input().split())
print(X+Y//2)

Submission status: Accepted

Solution code:
# encoding: utf-8
X, Y = map(int, input().split())
print(X + Y // 2)

Submission status: Accepted

Solution code:
from sys import stdin

x, y = [int(a) for a in stdin.readline().rstrip().split()]
print(x + y // 2)

Submission status: Accepted

Solution code:
def run(a, b):
    return int(a + b/2)


def main():
    a, b, = map(int, input().split())
    print(run(a, b))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
print(X +Y//2)

Submission status: Accepted

Solution code:
X, Y = list(map(int, input().split()))

print(X + Y // 2)

Submission status: Accepted

Solution code:
x,y = map(int,raw_input().split())
print x+y//2

Submission status: Accepted

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

X, Y = map(int, input().split())

print(int(X + Y / 2))

Submission status: Accepted

Solution code:
X, Y = map(int, raw_input().split())
print X + Y / 2

Submission status: Accepted

Solution code:
X,Y = map(int, input().split())

print(int(X + Y/2))

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())

print(int(X + Y / 2))

Submission status: Accepted

Solution code:
x,y =(int(i) for i in input().split(' '))
print(x+y//2)

Submission status: Accepted

Solution code:
X, Y = tuple(int(i) for i in input().split())

print(X + Y//2)

Submission status: Accepted

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

a,b=map(int,input().split())
print(a+b//2)

Submission status: Accepted

Solution code:
X, Y = [int(_) for _ in input().split()]
print(X + Y // 2)

Submission status: Accepted

Solution code:
X, Y = [int(elem) for elem in input().split()]

print(X + Y//2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x,y = map(int, input().split())
print(x+y//2)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())

print(X+(Y//2))

Submission status: Accepted

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


def getNM():
    return map(int, input().split())


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

x, y = getNM()
print(x + y//2)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(A + B // 2)

Submission status: Accepted

Solution code:
b, c = map(int, input().split())

print(b+c//2)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

print(a+(b//2))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
x,y = map(int, input().split())
print(int(x+(y/2)))

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(X, Y):
    return X + Y // 2


def main():
    # N = read_int()
    N, M = read_int_n()
    # A = [read_int_n() for _ in range(N)]
    print(slv(N, M))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(x+y//2)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print((x+y//2))

Submission status: Accepted

Solution code:
X, Y = [int(_) for _ in input().split()]

print(X + Y // 2)

Submission status: Accepted

Solution code:
X, Y = map(int, raw_input().split())
print X + Y/2

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())

print(X + Y //2)

Submission status: Accepted

Solution code:
X,Y = map(int,input().split())

print(X + int(Y/2))

Submission status: Accepted

Solution code:
n,m = map(int, input().split(' '))
print(int(n+m/2))

Submission status: Accepted

Solution code:
x, y = map(int,input().split( ))
print(x + (y//2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def inpl(): return map(int, input().split())
A, B = inpl()
print(A + B//2)

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())

x, y = li()
print(x + y//2)

Submission status: Accepted

Solution code:
import sys
import collections
import itertools
import math
import re
from collections import Counter
from collections import deque

MOD = 10 ** 9 + 7


X, Y = [int(x) for x in input().split()]

print(X + Y // 2)


sys.exit(0)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
print(X + (Y//2))

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
x = X + Y //2

print(x)

Submission status: Accepted

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

print(x+(y//2))

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print(x + (y//2))

Submission status: Accepted

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

from collections import deque
import itertools as it
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

A, B = map(int, raw_input().split())

print A + B / 2

Submission status: Accepted

Solution code:
x , y = map(int,raw_input().split(' '))
print(x+(y/2))

Submission status: Accepted

Solution code:
[x, y] = list(map(int, input().split()))
print(x + y//2)

Submission status: Accepted

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

x, y = map(int, input().split())
print(x + y//2)

Submission status: Accepted

Solution code:
(x, y) = list(map(int, input().split()))
print(x + y // 2)

Submission status: Accepted

Solution code:
a,b = map(int,raw_input().split())
print a + b/2

Submission status: Accepted

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

print(x+int(y//2))

Submission status: Accepted

Solution code:
import sys,collections,math;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a,b = Is()
print(a+b//2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
X,Y = map(int,input().split())
ans = X + Y//2
print(ans)

Submission status: Accepted

Solution code:

def main():
    buf = input()
    buflist = buf.split()
    X = int(buflist[0])
    Y = int(buflist[1])
    print(X + int(Y / 2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x,y = map(int, input().split())
print(x+y//2)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
print(A+B//2)

Submission status: Accepted

Solution code:
X, Y = list(map(int, input().split()))
print(X + int(Y // 2))

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().rstrip()  # ignore trailing spaces

x, y = na()
print(x+y//2)

Submission status: Accepted

Solution code:
#A = int(input())
X, Y = map(int, input().split())
print(X + Y//2)

Submission status: Accepted

Solution code:
from sys import stdin
il = lambda func=int: list(map(func, stdin.readline().rstrip().split()))
ils = lambda n, s="int(input())": [eval(s) for _ in range(n)]

x, y = il()
print(x+y // 2)

Submission status: Accepted

Solution code:
X,Y=map(int, raw_input().split())
print X+Y/2

Submission status: Accepted

Solution code:
a = input().split()
a = [int(i) for i in a]
print (a[0] + a[1] //2)

Submission status: Runtime Error

Solution code:
a,b = map(int(input().split()))
print(a+b//2)

Submission status: Runtime Error

Solution code:
x,y=map(int,input.split())
print(x+y/2)

Submission status: Runtime Error

Solution code:
X,Y=map(int,input().split())
print(X+y/2)

Submission status: Runtime Error

Solution code:
N = int(input())
T, A = map(int, input().split())
H = [int(i) for i in input().split()]
temp = []

for i in H:
    temp.append(abs(A - (T - i * 0.006)))
min_ind = temp.index(min(temp))
print(min_ind)

Submission status: Runtime Error

Solution code:
import math
from math import gcd,pi,sqrt
INF = float("inf")

import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]

def main():
    n,m = i_map()
    l = []
    for i in range(m):
        p,y = i_map()
        l.append([i,p,y,0])

    l.sort(key = lambda x :(x[1], x[2]))
    ken = l[0][1]
    cnt = 1

    for i in l:
        if i[1] == ken:
            i[3] = cnt
            cnt += 1
        else:
            i[3] = 1
            cnt = 2
            ken = i[1]
    l.sort(key = lambda x:x[0])

    ans = []
    for i in l:
        ans.append(str(i[1]).zfill(6) + str(i[3]).zfill(6))
    for i in ans:
        print(i)

if __name__=="__main__":
    main()

Submission status: Runtime Error

Solution code:
x,y=map(int,input())
print(x+y/2)

Submission status: Runtime Error

Solution code:
a,b,c,d=input().split()
a=int(a)
b=int(b)
print(a+b/2)

Submission status: Runtime Error

Solution code:
X=int(input())
Y=int(input())
print(X+Y//2)

Submission status: Runtime Error

Solution code:
N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
mn=abs(A-(T-H[0]*0.006))
c=0
for i in range(N):
    if mn>abs(A-(T-H[i]*0.006)):
        mn=abs(A-(T-H[i]*0.006))
        c=i
print(c+1)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
	int a,b,c;
	cin>>a>>b;
	c=a+b/2;
	cout<<c<<endl;
}

Submission status: Runtime Error

Solution code:
x=int(input())
y=int(input())
print(x+y/2)

Submission status: Runtime Error

Solution code:
x,y=map(int,input().split())
printint((x+y/2))

Submission status: Runtime Error

Solution code:
x,y = map(int,input())
print(x + y //2)

Submission status: Runtime Error

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

print(L[0]+l[1]//2)

Submission status: Runtime Error

Solution code:
N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
m = 1 
mindis = abs(A-(T-H[0]*0.006))
for i in range(1,N):
  cd = abs(A-(T-H[i]*0.006))
  if mindis > cd:
    m = i+1
    mindis = cd
print(m)

Submission status: Runtime Error

Solution code:
n=int(input())
t,a=map(int,input().split())
H=list(map(int,input().split()))
minn=10**10
for i in range(n):
  if minn>abs((t*(1000)-6*H[i])-a*1000):
    ans = H[i]
    minn=t*(1000)-6*H[i]
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
t,a=map(int,input().split())
H=list(map(int,input().split()))
minn=10**10
for i in range(n):
  if minn>abs((t*(1000)-6*H[i])-a):
    ans = H[i]
    minn=t*(1000)-6*H[i]
print(ans)

Submission status: Runtime Error

Solution code:
#n = 候補の数
n = int(input())
#t - h[i] * 0.006
#a = 基準温度
t,a = map(int,input().split())
h = list(map(int,input().split()))
#o = 計算結果格納
o = []

for i in range(n):
    o.append(t - h[i] * 0.006)

#p = 基準温度に最も近い場所の差
p = abs(a - o[0])
#q = 基準地点の番号
q = 0
for i in range(n)[1:]:
    if abs(a - o[i]) < p:
        p = abs(a - o[i])
        q = i

print(q + 1)

Submission status: Runtime Error

Solution code:
x, y = int(input().split())
print(x + (y//2))

Submission status: Runtime Error

Solution code:
x,y=mao(int,input().split())
print(x+y//2)

Submission status: Runtime Error

Solution code:
n = int(input())
t, a = map(int, input().split())
list = [int(i) for i in input().split()]

dif_list = []

for i in range(n):
    t_i = t - list[i] * 0.006
    t_i_dif = abs(a - t_i)
    dif_list.append(t_i_dif)

Min = min(dif_list)
print(dif_list.index(Min) + 1)

Submission status: Runtime Error

Solution code:
N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
a =[]
def cal(n):
  ans = T-n*0.006
  return ans
  
for i in H:
  a.append(int(abs(A-cal(i))))
  
print(a.index(min(a))+1)

Submission status: Runtime Error

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

print(N(N-1)//2+M(M-1)//2)

Submission status: Runtime Error

Solution code:
N = int(input())
T,A= (int(x) for x in input().split(' '))
h_lst= [abs(T-(int(x)*0.006)-A) for x in input().split(' ')]
print(h_lst.index(min(h_lst))+1)

Submission status: Runtime Error

Solution code:
x,y = map(int, sys.stdin.readline().rstrip("\n").split())
print(x+y/2)

Submission status: Runtime Error

Solution code:
def resolve():
    n,m=map(int,input().split())
    py=[[0]*3 for _ in range(m)]
    for i in range(m):
        p,y=map(int,input().split())
        py[i][0],py[i][1],py[i][2]=p,y,i
    py.sort()
    ans=[[''] for _ in range(m)]
    cnt=[0]*(n+1)
    for p,y,i in py:
        cnt[p]+=1
        ans[i]='0'*(6-len(str(p)))+str(p)+'0'*(6-len(str(cnt[p])))+str(cnt[p])
    for i in ans:
        print(i)


if __name__ == '__main__':
    resolve()

Submission status: Runtime Error

Solution code:
# -*- coding: <encoding name> -*-

X, Y = map(int, input())
print(X + Y // 2)

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque 
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする

def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds

def main():
    mod = 10**9+7
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    N, M = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    tot=[[] for _ in range(N+1)]
    ys=[0]*M
    for i in range(N):
        heapify(tot[i])
    for i in range(M):
        P, Y = map(int, input().split())
        heappush(tot[P],[Y,i])
        ys[i]=Y
    tset=[]
    ans=['']*M
    for i in range(N+1):
        t1=tot[i]
        if len(t1)<1:continue
        p=str(i).zfill(6)
        j=0
        while len(t1):
            t, i1=heappop(t1)
            tx=str(j+1).zfill(6)
            ans[i1]=''.join((p,tx))
            j+=1
    print('\n'.join(ans))





if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
n, m =  map(int, input().split())
py = [map(int, input().split()) for _ in range(m)]
p, y = [list(i) for i in zip(*py)]
pre = {}
for i in range(m):
    if p[i] not in pre.keys():
        pre[p[i]] = []
    pre[p[i]].append(y[i])
for i in pre.keys():
    pre[i].sort()
for i in range(m):
    num = str(p[i]*(10**6)+(pre[p[i]].index(y[i])+1))
    while len(num) < 12:
        num = '0' + num
    print(num)

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
py = []
for i in range(m):
    num = i+1
    p,y = map(int,input().split())
    py.append([num,p,y])
py = sorted(py, key = lambda x:x[1]*10**10+x[2])
x = 0
b = '000000'
ans = []
for pyi in py:
    if pyi[1] != x:
        x = pyi[1]
        cnt = 1
    else:
        cnt += 1
    ans.append([pyi[0], (b+str(pyi[1]))[-6:], (b+str(cnt))[-6:]])
ans = sorted(ans, key = lambda x: x[0])
for ansi in ans:
    print(ansi[1]+ansi[2])

Submission status: Runtime Error

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

m = {}
ans = []
for i in range(1, N + 1):
	m[i] = []
for i in range(M):
	p, y = map(int, input().split(" "))
	ans.append((p,y))
	m[p] = m[p] + [y]

l = {}
for k,v in m.items():
	for i, v in enumerate(sorted(v)):
		l[k, v]  = "{:0>6}{:0>6}".format(k, i+1)

for k in ans:
	print(l[k])

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())
  print(x + y * 0.5)

Submission status: Runtime Error

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

print( X + Y/2)

Submission status: Runtime Error

Solution code:
N=int(input())
T,A=map(int, input().split())
list=list(map(int, input().split()))
l_b=[]
d=0
for i in range(N):
  d=A-(T-list[i]*0.006)
  if d<0:
    d=-d
  l_b.append(d)
print(l_b.index(min(l_b))+1)

Submission status: Runtime Error

Solution code:
X, Y = map(int, input().sptit())

print(X + Y//2)