Problem:


Score : 100 points

Problem Statement

You are given two positive integers a and b.
Let x be the average of a and b.
Print x rounded up to the nearest integer.

Constraints

a and b are integers.

1 \leq a, b \leq 100

Input

Input is given from Standard Input in the following format:

a b

Output

Print x rounded up to the nearest integer.

Sample Input 1

1 3

Sample Output 1

2

The average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.

Sample Input 2

7 4

Sample Output 2

6

The average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.

Sample Input 3

5 5

Sample Output 3

5



Sample input:
1 3


Sample output:
2

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

c=(a+b)/2

print(math.ceil(c))

Submission status: Accepted

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

print(math.ceil((a+b)/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = -(-(a + b) // 2)

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

print(m)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(x))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
x=(a+b)//2
if (a+b)%2==0:
    print(x)
else:
    print(x+1)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
ans = a+b
if ans%2==0:
  print(ans//2)
else:
  print(ans//2+1)

Submission status: Accepted

Solution code:
import math
print(math.ceil(sum(list(map(int, input().split())))/2))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)%2==0:
    print(int((a+b)/2))
else:
    print(int((a+b)//2+1))

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    if (a + b) % 2 == 0:
        print((a + b) // 2)
    else:
        print((a + b) // 2 + 1)


if __name__ == "__main__":
    main()

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())
c = (a+b)//2
print(c if (a+b)%2==0 else c+1)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if int(A+B)/2 == (A+B)//2:
  print(int((A+B)/2))
else:
  print(1+(A+B)//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 + (a + b) % 2)

Submission status: Accepted

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

n = (a+b) / 2

print(math.ceil(n))

Submission status: Accepted

Solution code:
import math
x = input().split()
a = int(x[0])
b = int(x[1])
print(math.ceil((a+b)/2))

Submission status: Accepted

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

Submission status: Accepted

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

x = ((a + b) + 1 ) // 2

print(x)

Submission status: Accepted

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

s=a+b
ss=s//2
s2=s%2

if s2==1:
    print(ss+1)
    exit()
print(ss)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = (a + b)/2
y = int(x)
if x-y == 0:
    print(int(x))
else:
    z = int(x) + 1
    print(z)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
 
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
 
def main():
  a, b = map(int,input().split())
  
  print(math.ceil((a + b) / 2))
 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if (a+b)%2==0:
    print((a+b)//2)
else:
    print((a+b)//2+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

import math
a, b = map(int, input().split())
x = math.ceil((a + b) / 2)
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(-(-sum(map(int, input().split())) // 2))

Submission status: Accepted

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

mu = math.ceil((a + b)/2)

print(mu)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)%2==0:
  print(int((a+b)/2))
else:
  print(int((1+a+b)/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

def main():
    nums = [int(x) for x in input().split()]
    ave = sum(nums)/len(nums)
    print(math.ceil(ave))

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
from math import ceil
print(ceil(sum(list(map(int,input().split())))/2))

Submission status: Accepted

Solution code:
import math

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

print(math.ceil((a + b) / 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
a, b = map(int, input().split())
x = math.ceil((a + b) / 2)

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

print(c)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    a,b=map(int,input().split())
    x=(a+b)/2
    print(int(-(-x // 1)))
    
    
resolve()

Submission status: Accepted

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

def resolve():
    a,b=map(int, input().split())
    print(-(-(a+b) // 2))
resolve()

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 #
#############
a,b = inputIL()

print(math.ceil((a+b)/2))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    a,b=map(int,input().split())
    print(-(-(a+b)//2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    a, b = map(int, input().split())
    ans = (a + b + 1) // 2
    print(ans)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# ABC082 A

import math

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

    print(math.ceil((a + b)/2))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if (a+b)%2 == 0:
    print((a+b)//2)
else:
    print((a+b)//2 + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().split()
a = int(s[0])
b = int(s[1])
result = int((a + b + 1) / 2)

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

def resolve():
	n = list(map(int, input().split()))
	print(math.ceil(sum(n)/2))
resolve()

Submission status: Accepted

Solution code:
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# a, b = list(map(int, input().split()))
# s = input()

a, b = list(map(int, input().split()))
ans = math.ceil((a + b) / 2)
print(ans)

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_82_A()

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

def main():
    a,b = (int(x) for x in input().split())
    print(ceil((a+b)/2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = list(map(int,input().split()))
if (a+b)%2 == 0:
    print((a+b)//2)
else:
    print((a+b)//2+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
a, b = ri_()
print(ceil((a + b) / 2))

Submission status: Accepted

Solution code:
def actual(a, b):
    return (a + b + 1) // 2


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

print(actual(a,b))

Submission status: Accepted

Solution code:
s = sum(map(int, input().split()))

d, m = divmod(s, 2)
if m != 0:
    d += 1
print(d)

Submission status: Accepted

Solution code:
import math;print(math.ceil(eval(input().replace(" ","+"))/2))

Submission status: Accepted

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

Submission status: Accepted

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

if (a+b)%2==0:
    print((a+b)//2)    
else:
    print((a+b)//2+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b%2==0:
    print((a+b)//2)
else:
    print((a+b+1)//2)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print((a+b)//2) if (a+b)%2 == 0 else print((a+b)//2+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 1問目類題3
a,b = map(int, input().split())
print((a+b+1)//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a + b) % 2 == 0:
    x = (a + b) / 2
else:
    x = (a + b + 1)/2
print(int(x))

Submission status: Accepted

Solution code:
# 1問目類題3
a,b = map(int, input().split())
x = (a+b)/2
if (a+b) % 2 ==0:
    print(int(x))
else:
    print(int(x//1+1))

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

if c == 0:
  print(d)
else:
  print(d+1)

Submission status: Accepted

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

import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    a,b = list(map(int,_in[0].split(' ')))  # type:list(int)
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    cnt = math.ceil((a+b)/2)
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(cnt)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
from math import ceil

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

x = (a+b)/2
ans = ceil(x)
print(ans)

Submission status: Accepted

Solution code:
def resolve(x,y):
    if (x+y)%2 == 1:
        print((x+y+1)//2)
    else:
        print((x+y)//2)
a,b=map(int,input().split())
resolve(a,b)

Submission status: Accepted

Solution code:
def resolve(x,y):
    if (x+y)%2 == 1:
        return (x+y+1)//2
    else:
        return (x+y)//2
a,b=map(int,input().split())
print(resolve(a,b))

Submission status: Accepted

Solution code:
def resolve(x,y):
    if (x+y)%2==0:
        print((x+y)//2)
    else:
        print(((x+y)//2)+1)
a,b=map(int,input().split())
resolve(a,b)

Submission status: Accepted

Solution code:
def resolve(x,y):
    if (x+y)%2==0:
        return (x+y)//2
    else:
        return ((x+y)//2)+1
a,b=map(int,input().split())
print(resolve(a,b))

Submission status: Accepted

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

if (a + b) % 2 == 0:
  print(int(x))
else:
  print(int(x + 1))

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())
x = a + b
if x%2 == 0:
  print(x//2)
else:
  print(x//2 + 1)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)%2==0:
    print((a+b)//2)
else:
    print((a+b)//2+1)

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

Submission status: Accepted

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

x = (a + b) / 2
print(math.ceil(x))

Submission status: Accepted

Solution code:
import math
a,b=map(int,input().split())
x=(a+b)/2
ans=math.ceil(x)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
B = (A[0]+A[1])/2
if B > int(B):
  print(int(B)+1)
else:
  print(int(B))

Submission status: Accepted

Solution code:
import math
a=[int(i) for i in input().split()]
print(math.ceil(sum(a)/2))

Submission status: Accepted

Solution code:
data = list(map(int,input().split()))
#data = [int(input()),int(input())]

print((data[0]+data[1]+2-1)//2)

Submission status: Accepted

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

Submission status: Accepted

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

if (a + b) % 2 == 0:
    print(int((a + b) / 2))
else:
    print(int((a + b) / 2 + 1))

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

a, b = MAP()
print(-(-(a+b)//2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
## dp ##
INIT_VAL = 0
def DD2(d1,d2): return [[INIT_VAL]*d2 for _ in range(d1)]
def DD3(d1,d2,d3): return [DD2(d2,d3) for _ in range(d1)]
## math ##
MOD=10**9+7
def divc(x,y): return -(-x//y)
def divf(x,y): return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers"""
    is_prime = [True] * MAX_NUM
    is_prime[0] = False
    is_prime[1] = False
    primes = []
    for i in range(MAX_NUM):
        if is_prime[i]:
            primes.append(i)
            for j in range(2*i, MAX_NUM, i):
                is_prime[j] = False
    return primes
## libs ##
from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left

#======================================================#

def main():
    a, b = MII()
    print(divc(a+b, 2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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

x = math.ceil((a+b)/2)

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    a, b = list(map(int, input().split()))
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

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


resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0 - -(a + b)//2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Round Up the Mean
a, b = map(int, input().split())
print((a + b + 2 - 1) // 2)
#print(int((a + b - 1)// b))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)%2==0:
    print((a+b)//2)
else:
    print((a+b)//2 +1)

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil((a+b)/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi
#from operator import itemgetter
from copy import deepcopy
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)]
inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print((a + b) // 2 if (a + b) % 2 == 0 else (a + b) // 2 + 1)

Submission status: Accepted

Solution code:
import math

a, b = map(float, input().split())

ave = (a + b)/ 2

print(math.ceil(ave))

Submission status: Accepted

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

ave = (a + b) / 2  # float
if ave - int(ave) > 0:
  print(int(ave)+1)
else:
  print(int(ave))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = (a + b + 1) / 2
print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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