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:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

A, B = mi()

print(A + B // 2)

Submission status: Accepted

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

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

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  #文字列では使わない
X,Y = (int(i) for i in input().split())
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:
a,b=map(int,input().split())
print(a+int(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())
res = a + b/2
print(int(res))

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

Submission status: Accepted

Solution code:
X, Y = map(int,input().rstrip().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 sys
import math
X,Y = map(int,input().split())

if not (1 <= X <= 100 and 1 <= Y <= 100): sys.exit()
if not (Y % 2 == 0): sys.exit()

print(X+math.floor(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:
a,b = map(int, input().split())
print(a + (b // 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:
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:
L = list(map(int,input().split()))

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

Submission status: Accepted

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

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:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rm()
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(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:
x,y = map(int,input().split())
import math
print(math.floor(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(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:
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 + Y//2)

Submission status: Accepted

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

y = Y // 2

a = X + y

print(a)

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

ans = a + b // 2

print(ans)

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

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:
def INT():
    return int(input())

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

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

X, Y = MI()

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

if __name__ == '__main__':
    solve()

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

x = X + Y // 2

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    X, Y = map(int, input().split())
    print(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:
#!/usr/bin/env python3

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:
#!/usr/bin/env python3
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:
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()]
print(A+B//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

X,Y = I()
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:
import sys
input = sys.stdin.readline

def main():
    x, y = map(int, input().split())

    print(x+y//2)

main()

Submission status: Accepted

Solution code:
print(eval(input().replace(' ','+')+'//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(y/2)+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:
def inp():return map(int,input().split())

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, y = M()
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())

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

ans = x + y//2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# abc113_a.py
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:
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(int(X + Y/2))

Submission status: Accepted

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

fee = x + y//2

print(fee)

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

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

Submission status: Accepted

Solution code:
import sys
X, Y = map(int, sys.stdin.readline().rstrip().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())

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

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial#, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
# input = sys.stdin.readline 
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_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    x, y = i_map()

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

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
X,Y = map(int,input().split())

print(X+Y//2)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

# code here
X, Y = na()

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

Submission status: Accepted

Solution code:
#n=int(input())
x,y=map(int,input().split())
#al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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 = 0
Y = 0

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

x = X+Y/2

print(round(x))

Submission status: Accepted

Solution code:
# input
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:
# ABC 113

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
x,y = map(int, sys.stdin.readline().rstrip("\n").split())
print(x+y//2)

Submission status: Accepted

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


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

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:
def main():
    x, y = map(int, input().split())

    print(int(x + 0.5 * y))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# A - Discount Fare

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:
import itertools
import math
import fractions
import functools
import copy

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:
import sys
input=sys.stdin.readline

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

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
x, y = map(int, input().split())
print(x+int(y/2))

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = a +b//2

print(ans)

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(N+M//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())
    print(x+y//2)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed May 13 15:48:53 2020

@author: shinba
"""

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

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

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

X,Y = inputIL()

print(int(X+Y/2))

Submission status: Accepted

Solution code:
def main():
    x, y = map(int, input().split())
    ans = solve(x, y)
    print(ans)


def solve(x, y):
    ans = x + y // 2
    return ans


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_113_A()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(X: int, Y: int):
    print(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
    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(X+(Y//2))

Submission status: Accepted

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

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

print(int(X+Y/2))

Submission status: Accepted

Solution code:
# ABC113A

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 = [int(x) for x in input().split()]
print(x + int(y // 2))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b = map(int, input().split())
print(int(a + b / 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())
unchin = x + y//2
print(unchin)

Submission status: Accepted

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

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
s = input().split()
x = int(s[0])
y = int(s[1])
print(x+math.floor(y/2))

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

X, Y = lr()
answer = X + Y // 2
print(answer)

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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, Y = MAP()
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 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(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:
x,y = map(int,input().split())

print(x+int(y/2))

Submission status: Accepted

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

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

print(int(x + y/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# int(input()) # 入力が1つ
x, y = map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字
ans = x + y // 2
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
print('{:.0f}'.format(a+b/2))

Submission status: Accepted

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

Submission status: Accepted

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

print(math.floor(x + (y/2)))

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

print(X + Y//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def DiscountFare(x , y):

    return int(x + (y / 2))

def main():
    x , y = map(int , input().split())
    print(DiscountFare(x , y))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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