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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))

def main():
    x, y = MII()
    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:
n,m=map(int,input().split())
print(int(n+m/2))

Submission status: Accepted

Solution code:
A,B = list(map(int,input().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:
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=[int(i) for i 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 = 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:
print(eval(input().replace(" ", "+") + "//2"))

Submission status: Accepted

Solution code:
#ABC-113-A
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:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

def main():
    x,y = map(int,input().split())
    print(x + y//2)
if __name__ =='__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  x, y = map(int, readline().split())
  print(x+y//2)
  
  
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# ABC 113: A – Discount Fare
x, y = [int(s) for s in input().split()]
print(x + y // 2)

Submission status: Accepted

Solution code:
def main():
  #n = int(input())
  #s = input()
  #s = input().split()
  a,b = list(map(int,input().split()))
  #a = [input() for i in range(n)]
  #a = [int(input()) for i in range(n)]
  #a = [input().split() for i in range(n)]
  #a = [list(map(int,input().split())) for i in range(n)]
  ans = 0
  count = 0
  lis = []
  
  print(a+b//2)

if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  x,y = map(int,input().split())
  print(x + y//2)
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    x,y = map(int, 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:
import sys

x, y = map(int, sys.stdin.readline().split())

def main():
    res = x + y // 2
    print(res)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    b, c = map(int, input().split())

    print(b+ c//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())
c=int(a+b/2)
print(c)

Submission status: Accepted

Solution code:
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(answer)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
X, Y = [int(str) for str in input().strip().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+Y//2)

Submission status: Accepted

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

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

print(int(x + y / 2))

Submission status: Accepted

Solution code:
# | Its_Rashid | #

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

print(a + y // 2)

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


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

Submission status: Accepted

Solution code:
def isneg(x):
    if x[0]=="-": return True
    else: return False


def neg(x):
    if isneg(x): return x[1:]
    else: return "-" + x

    
def zerot(x):
    rx = list(x[::-1])
    while rx[-1] == "0":
        rx.pop()
        if len(rx) == 0: 
            rx = ["0"]
            break
    return "".join(rx[::-1])


def zerocut(x):
    if isneg(x):
        ans = neg(zerot(neg(x)))
        if ans == "-0": return "0"
        return ans 
    else:
        return zerot(x)


def bigsmal(x, y):
    if isneg(x) or isneg(y): raise Exception("negative input")
    if len(x) > len(y):
        return x,y
    elif len(x) < len(y):
        return y,x
    else: return tuple(sorted([x, y])[::-1])
    
    
def bigsmall(x, y):
    if (not isneg(x)) and isneg(y):
        return x,y
    elif isneg(x) and (not isneg(y)):
        return y,x
    elif (not isneg(x)) and (not isneg(y)):
        return bigsmal(x, y)
    elif isneg(x) and isneg(y):
        tmp = bigsmal(neg(x), neg(y))[::-1]
        return tuple(neg(i) for i in tmp)
        
    
def ad(x, y):
    if isneg(x) or isneg(y): raise Exception("negative input")
    ra = [0] * (max(len(x), len(y)) + 1)
    rx = [int(i) for i in x][::-1]
    ry = [int(i) for i in y][::-1]
    for i in range(len(rx)): ra[i] += rx[i]
    for i in range(len(ry)): ra[i] += ry[i]
    for i in range(len(ra) - 1):
        ra[i+1] += ra[i] // 10
        ra[i] = ra[i] % 10
    ans = "".join([str(i) for i in ra][::-1])
    return zerocut(ans)


def s_b(x, y):
    if isneg(x) or isneg(y): raise Exception("negative input")
    if bigsmall(x, y) != (x, y): raise Exception("not x>=y error")
    ra = [0] * (max(len(x), len(y)))
    rx = [int(i) for i in x][::-1]
    ry = [int(i) for i in y][::-1]
    for i in range(len(rx)): ra[i] += rx[i]
    for i in range(len(ry)): ra[i] -= ry[i]
    for i in range(len(ra) - 1):
        if ra[i] < 0:
            ra[i] = 10 + ra[i]
            ra[i+1] -= 1
    ans = "".join([str(i) for i in ra][::-1])    
    return zerocut(ans)


def sb(x, y):
    if isneg(x) or isneg(y): raise Exception("negative input")
    if (x, y) == bigsmall(x, y):
        return s_b(x, y)
    else:
        return neg(s_b(y, x))


def add(x, y):
    if isneg(x) and isneg(y):
        return neg(ad(neg(x), neg(y)))
    elif (not isneg(x)) and (not isneg(y)):
        return ad(x, y)
    elif (not isneg(x)) and isneg(y):
        return sb(x, neg(y))
    elif isneg(x) and (not isneg(y)):
        return sb(y, neg(x))
    

def sub(x, y):
    if isneg(x) and isneg(y):
        return sb(neg(y), neg(x))
    elif (not isneg(x)) and (not isneg(y)):
        return sb(x, y)
    elif (not isneg(x)) and isneg(y):
        return ad(x, neg(y))
    elif isneg(x) and (not isneg(y)):
        return neg(ad(neg(x), y))
        

def ml(x, y):
    if isneg(x) or isneg(y): raise Exception("negative input")
    ra = [0] * (len(x) + len(y))
    rx = [int(i) for i in x][::-1]
    ry = [int(i) for i in y][::-1]
    for i in range(len(rx)):
        for j in range(len(ry)):
            ra[i+j] += rx[i] * ry[j]
    for i in range(len(ra) - 1):
        ra[i+1] += ra[i] // 10
        ra[i] = ra[i] % 10
    ans = "".join([str(i) for i in ra][::-1])
    return zerocut(ans)
    

def mul(x, y):
    if isneg(x) and isneg(y):
        return ml(neg(y), neg(x))
    elif (not isneg(x)) and (not isneg(y)):
        return ml(x, y)
    elif (not isneg(x)) and isneg(y):
        return neg(ml(x, neg(y)))
    elif isneg(x) and (not isneg(y)):
        return neg(ml(neg(x), y))
        

def mod2(x):
    return int(x[-1]) % 2


def div2(x):
    if isneg(x): raise Exception("negative input")
    ans = [0] * len(x)
    xs = [int(i) for i in x]
    for i in range(len(x)-1):
        ans[i] += xs[i]
        ans[i+1] += (ans[i]%2) * 10
        ans[i] //= 2
    ans[len(x)-1] = (ans[len(x)-1] + xs[len(x)-1])//2
    ans = "".join([str(i) for i in ans])
    return zerocut(ans)


a,b = input().split()
print(add(a, div2(b)))

Submission status: Accepted

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

print(round(x+y/2))

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    X, Y = list(map(int, sys.stdin.readline().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:
x,y=list(map(int, input().split()))
print(round(x+y/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Discount Fare
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(x+int(y/2))

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    x, y = list(map(int,ipti().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:
t, b = list(map(int, input().split()))
print(t + round(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(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 = [int(i) for i in input().split()]

print(x + y//2)

Submission status: Accepted

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

X,Y = list(map(int, input().rstrip().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 = map(int, input().split())
print(X + int(Y/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = [int(_) for _ in input().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:
#113_A
X,Y=map(int,input().split())
print(X+Y//2)

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda x: [ni() for _ in range(x)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda x: [ns() for _ in range(x)]
nas = lambda: stdin.readline().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    X, Y = map(int, 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())
y//= 2
print(x+y)

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,raw_input().split())
print x+y/2

Submission status: Accepted

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

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

Submission status: Accepted

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


def main():
    X, Y = map(int, input().split())
    print(int(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 = list(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(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:
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:
a,b = map(int, 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:
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:
def solve(inp):
    (X, Y) = map(int, inp.readline().strip().split(' '))

    return str(int(X + Y / 2))


def test(s):
    from io import StringIO
    print(solve(StringIO(s)))


def main():
    import sys
    result = solve(sys.stdin)
    if result:
        print(result)


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

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools

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

print(x+int(y/2))

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())

sys.setrecursionlimit(10 ** 9)


def main():
    A, B = MAP()
    print(A + B//2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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:
"""
author : halo2halo
date : 22, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A, B = map(int, readline().split())
print(A + B // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin
    r = stdin.readline()[:-1]
    #r = stdin.readlines()

    x, y = map(int, r.split())
    print(x+y//2)
   
if __name__ == '__main__':
    main()

Submission status: Accepted

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

x = input_int_list[0]
y = input_int_list[1]
print(int(x + y/2))

Submission status: Accepted

Solution code:
x,y=input().strip().split(" ")
x,y=[int(x),int(y)]
f=y//2
print(x+f)

Submission status: Accepted

Solution code:
import sys

x, y = map(int, sys.stdin.readline().split())

def main():
    return x + y // 2

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

Submission status: Accepted

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

    print(int(X + Y / 2))

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

Submission status: Accepted

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

print(x + int(y/2))

Submission status: Accepted

Solution code:
X,Y=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
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:
import sys
input = sys.stdin.readline
X,Y = [int(i) for i 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:
def solve():
    X, Y = map(int, input().split())
    print(X+Y//2)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353



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

Submission status: Accepted

Solution code:
# coding: utf-8

(x,y) = [int(i) for i in input().rstrip().split(" ")]

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

Submission status: Accepted

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

print(a+b//2)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    print(a+b//2)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def examA():
    X, Y = LI()
    ans = X + Y//2
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examA()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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())
print(x+int(0.5*y))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum([int(x)//(i+1) for i,x in enumerate(input().split())]))

Submission status: Accepted

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

Submission status: Accepted

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


n,k = map(int,input().split())

print(n+k//2)

Submission status: Accepted

Solution code:
n,t = map(int, input().split())
print(n+(t//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())
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 = [int(i) for i in input().split()]

fare = X + (Y // 2)

print(fare)

Submission status: Accepted

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

print(X + Y // 2)

Submission status: Accepted

Solution code:
# ABC113a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

Solution code:
X,Y=tuple(map(int,input().split()))
print(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:
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:
# -*- coding: utf-8 -*-
import math

#入力
#S = str(input())
#N, i = map(int, input().split())
#K = int(input())
X, Y = map(int, 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:
X, Y = [int(num) for num in input().split()]

print(X + (Y // 2))

Submission status: Accepted

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

x,y = MAP()
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 = list(map(int, input().split()))
print(X + Y // 2)

Submission status: Accepted

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


if __name__ == '__main__':
    main()