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:
X,Y=[int(i) for i in input().split()]
print(int(X+(Y/2)))

Submission status: Accepted

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

Submission status: Accepted

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


def solve(X: int, Y: int):
    print(X + Y // 2)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    Y = int(next(tokens))  # type: int
    solve(X, Y)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
X,Y = map(int,input().split())
print(int(X+0.5*Y)) #intは小数点以下をださない

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

X = int(X)
Y = int(Y)

print(X + Y // 2)

Submission status: Accepted

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


abc()

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(int(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:
import sys

from collections import deque
# q = deque(); q.append(x); q.appendleft(x); q.pop() -> x; q.popleft() -> x
from collections import defaultdict
# d = defaultdict(lambda: []); d[key] -> []
import heapq
# hq = []; heapq.heappush(hq, x); heapq.heappop(hq) -> x; heapq.heappushpop(hq, x) -> x
import bisect
# i = bisect.bisect_left([1,2,3,4], 1.5); i = bisect.bisect_right([4,3,2,1], 1.5)

#import numpy as np
#from scipy.misc import comb

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    X, Y = i2nn()
    n = int(X + Y / 2)
    print(n)

main()

Submission status: Accepted

Solution code:
import numpy as np

# 初期値を入力

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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(int(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 + ( y //2))

Submission status: Accepted

Solution code:
X, Y = [int(x) for x in 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:
a, b = [int(i) for i in input().split()]
sum = a + (b // 2)
print(sum)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

lst_1 = input().split()

X = int(lst_1[0])
Y = int(lst_1[1])

ans = int(X + Y/2)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
X, Y = [int(x) for x in stdin.readline().rstrip().split()]
print(X + int(Y / 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = x+y/2

print(int(ans))

Submission status: Accepted

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

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:
ab, bc = map(int, input().split())

fare = int(ab + bc/2)

print(fare)

Submission status: Accepted

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

Submission status: Accepted

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

print(x+y//2)

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


def solve(X: int, Y: int):
    print(X+Y//2)


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    Y = int(next(tokens))  # type: int
    solve(X, Y)

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(int(X + 1 / 2 * Y))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 空白区切り
x, y = map(int, input().split())
# 改行区切り
# s = int(input())

# 鉄道 A -> B : X円
# バス B -> C : Y円

# X:10円 Y:100円
ans = x + (y / 2)
print(int(ans))

Submission status: Accepted

Solution code:
print(int(eval("+".join(map(str,input().split()))+"/2")))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from __future__ import print_function
import numpy as np
import sys
import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy,functools
# from itertools import accumulate
# from collections import deque
import random

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

a,b = map(int, 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:
# -*- coding: utf-8 -*-
"""
A - Discount Fare
https://atcoder.jp/contests/abc113/tasks/abc113_a

"""
import sys


def solve(X, Y):
    return X + Y//2


def main(args):
    X, Y = map(int, input().split())
    ans = solve(X, Y)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

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

    print(int(X+Y/2))

Submission status: Accepted

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

print(x+y//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

input_array = []
input_array.append(input().split())

for i in input_array:
    print(int(int(i[0]) + int(i[1])/2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

X, Y = MAP()

print(X+Y//2)

Submission status: Accepted

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits



def input(): return sys.stdin.readline().strip()


def INT(): return int(input())


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


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


sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

x, y = MAP()

print(int(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())
price = X + Y/2
print(round(price))

Submission status: Accepted

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

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 = 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:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())

X,Y = inpl()
print(X+Y//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = (int(j) for j in 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=[int(a) for a in 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 = list(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, input().split())

print(int(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  = 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:
# -*- coding:utf-8 -*-

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

if __name__ == "__main__":
    solve()

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(N + int(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:
X,Y = list(map(int,input().split()))

print(X+(Y//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:
print(eval(input().replace(" ","+") + "//2"))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(eval(input().replace(' ', '+') + '//2'))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
xy = input().split()
x = int(xy[0])
y = int(xy[1])


print(x + y // 2)

Submission status: Accepted

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

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(int(X+Y/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(X: int, Y: int):
    return X + Y // 2


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    Y = int(next(tokens))  # type: int
    result = solve(X, Y)
    print(result)

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:
l=list(map(int,input().split()))
x=l[0]
y=l[1]
print(int(x+y/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
xy = list(map(int,input().split()))
# xのみを取り出す
x=xy[0]
# yのみを取り出す
y=xy[1]
print(int(x+y/2))

Submission status: Accepted

Solution code:
X,Y = map(int,input().split())
K =int((X+(0.5*Y)))
print(K)

Submission status: Accepted

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

print(X+Y//2)

Submission status: Accepted

Solution code:
xy = list(map(int,input().split()))
x=xy[0]
y=xy[1]
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:
[X,Y] = list(map(int,input().split()))
print(X+Y//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().split()
b=int(a[0])
c=int(a[1])
d=round(b+c/2)
print(d)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
XY=input().split()
X=int(XY[0])
Y=int(XY[1])
ans=int(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:
X, Y = map(int, input().rstrip().split())
print(X+Y//2)

Submission status: Accepted

Solution code:
import functools
import math

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


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


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC113A - Discount Fare
x, y = list(map(int, input().rstrip().split()))

print(int(x + y / 2))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#113 A
X,Y= map(int,input().split())
print(int(X+0.5*Y))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(X + Y // 2)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print('{0:.0f}'.format(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 = map(int, (input().split()))
print(x + (y // 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y = [int(n) for n in 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 = map(int,input().split())
ans = x + (y // 2)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(X: int, Y: int):
    print(X+Y//2)
    return


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(int( a + (b/2)))

Submission status: Accepted

Solution code:
x = list(map(int,input().split()))
print(x[0]+(x[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, raw_input().split())
print X + Y/2

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

def main():
    X, Y = [int(x) for x in input().split()]
    print(X + (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:
x, y = map(int, input().split())
ans = x + (y // 2)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(input().split())
X=int(a[0])
Y=int(a[1])
z=int(X+Y/2)
print(z)

Submission status: Accepted

Solution code:
from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]  # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()]  # LIST FLOAT
def LS(): return sys.stdin.readline().split()  # LIST STRING
def MI(): return map(int, sys.stdin.readline().split())  # MAP INT
def II(): return int(sys.stdin.readline())  # INPUT INT
def IS(): return input()  # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers):  # greatest common divisor
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):  # least common multiple
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(A + 1/2*B))

Submission status: Accepted

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

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

print(a + b // 2)

Submission status: Accepted

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


def solve(X: int, Y: int):
    ret = X + Y // 2
    print(ret)
    return


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

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(int(X + Y/2))

Submission status: Accepted

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

print(X+Y//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
def A():
    x,y = LI()
    print(x+y//2)
    return

#B
def B():
    return

#C
def C():
    n = list(map(int,S()))
    l = len(n)
    dp = [[[0 for k in range(16)] for j in range(2)] for i in range(l+1)]
    dp[0][0][0] = 1
    for i in range(l):
        for j in range(2):
            for k in range(9):
                x = 9 if j else n[i]
                for d in range(x+1):
                    if d == 3:
                        f = 1
                    elif d == 5:
                        f = 2
                    elif d == 7:
                        f = 4
                    else:
                        if k == 0 and d == 0:
                            f = 0
                        else:
                            f = 8
                    dp[i+1][j or d < n[i]][k|f] += dp[i][j][k]
    ans = 0
    for i in range(2):
        ans += dp[l][i][7]
    print(ans)
#D
def D():
    def factorial(n):
        if n <= 3:
            return [n]
        l = []
        i = 2
        m = n
        while i**2 <= n:
            while m%i == 0:
                l.append(i)
                m //= i
            i += 1
        if m != 1:
            l.append(m)
        return l

    n = I()
    d = defaultdict(int)
    for i in range(2,n+1):
        l = factorial(i)
        for j in l:
            d[j] += 1
    a3 = 0
    a5 = 0
    a15 = 0
    a25 = 0
    a75 = 0
    for i in d.keys():
        if d[i] >= 74:
            a75 += 1
        if d[i] >= 24:
            a25 += 1
        if d[i] >= 14:
            a15 += 1
        if d[i] >= 4:
            a5 += 1
        if d[i] >= 2:
            a3 += 1
    ans = a75+(a3-1)*a25+(a5-1)*a15+(a3-2)*a5*(a5-1)//2
    print(ans)
#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    A()

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())
 
ans = X + (Y / 2)
 
print(int(ans))

Submission status: Accepted

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

print(int(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, input().split())

def main():
    return X + int(Y/2)

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

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
print(N+int(M/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,input().split(' '))
print(int(X + Y/2))

Submission status: Accepted

Solution code:
X, Y = [int(x) for x in input().split()]
print(int(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:
#coding: utf-8
x, y = map(int, input().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:
a,b=list(map(int, input().split()))
 
print(a + int(b/2))

Submission status: Accepted

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

print(a + int(b/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AB, BC = [int(s) for s in input().split(" ")]
print(AB + BC//2)

Submission status: Accepted

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

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())
n = int(y/2)
print(x+n)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())  # 複数数値入力
print(int(a+b/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit
A,B = [int(n) for n in input().split()]
# N = int(input())
# a = [int(input()) for _ in range(N)]
# S = str(input())
# L = len(S)
# T = str(input())
print(A + B//2)
exit()

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