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:
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:
import math

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

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

print(sum_ceil)

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((a+b+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:
#
# abc082 a
#

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """1 3"""
        output = """2"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """7 4"""
        output = """6"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """5 5"""
        output = """5"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

c = (a + b) // 2
d = (a + b) % 2

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a%2==0 and b%2==0:
  print(int((a+b)/2))
elif a%2==1 and b%2==1:
  print(int((a+b)/2))
elif a%2==0 and b%2==1:
  print(int((a+b+1)/2))
else:
  print(int((a+b+1)/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:
def main():
	a, b = map(int, input().split())

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


  
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:
import math
num =input().split(" ")
#print(num)
X = (int(num[0]) + int(num[1]))/2
print(math.ceil(X))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int, input().split())
z =x+y
import math
print(math.ceil(z/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())
ans = - (- (a + b) // 2)
print(ans)

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)

Submission status: Accepted

Solution code:
import math
a,b = (int(x) for x in input().split())
print (abs (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+1)
elif (a+b)/2==(a+b)//2:
  print((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())

mean = (a+b)/2
if mean > int(mean):
  print(int(mean)+1)
else:
  print(int(mean))

Submission status: Accepted

Solution code:

import math


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B = map(int, readline().split())
    print((A+B+1)//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:
a,b = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = (a + b) / 2
n = str(c)
if n[len(n) - 1] == '0':
    print(int(c))
else:
    print(int(c) + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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(int((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 sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if u % 2 > 0:
    x = x + 1

print(str(x))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
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
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
import numpy as np
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

import math
a, b = MAP()
print(math.ceil((a + b) / 2.0))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print((a+1+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())
print((a+b+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:
import numpy as np
ab = input().split(" ")
print(int(np.ceil(np.mean([int(ab[0]), int(ab[1])]))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A,B = (int(T) for T in 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:
import math
a, b = map(int, input().split())

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

Submission status: Accepted

Solution code:
import math
from statistics import mean
import math

# -*- coding: utf-8 -*-
#整数の入力を受け取る
a,b = map(int, input().split())
list1 = [a, b]

#平均値を求め、切り上げて表示する
ave = mean(list1)
print(math.ceil(ave))

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((a+b)//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
input = sys.stdin.readline
#-------------
a,b = map(int,input().split())
#-------------
x = (a+b)/2
y = x//1
mod = x%1
if mod == 0:
  print(int(y))
else:
  print(int(y+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split()) #入力を改行ではなくてスペース1マスあける

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

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

Submission status: Accepted

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


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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil
a, b = map(int, input().split())
print(ceil(0.5 * (a + b)))

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())
x = math.ceil((a+b)/2)
print(x)

Submission status: Accepted

Solution code:
import statistics
import math

a = list(map(int,input().split()))
print( math.ceil(statistics.mean(a)))

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:
def resolve():
    a, b = map(int,input().split())
    x = (a+b) / 2
    if x % 1 == 0:
        print(int(x))
    else:
        print(int(x)+1)
resolve()

Submission status: Accepted

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

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(-(-(a + b)//2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(int(avg))

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
print(math.ceil(sum(map(int,input().split())) / 2))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

c = (a+b)/2

if int(c) == c:
    print(int(c))
else:
    print(int(c+1))

Submission status: Accepted

Solution code:
from math import ceil #小数点以下切り上げ
 
a, b = map(int, input().split())
print(ceil((a+b)/2))

Submission status: Accepted

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

ans = a+b
#print(ans)

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

Submission status: Accepted

Solution code:
from statistics import mean
from math import ceil

# input
ab = list(map(int, input().split()))

print(ceil(mean(ab)))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
from math import ceil

a, b = map(int, input().split())
print(ceil((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.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

from math import ceil
a, b = mapint()
print(ceil((a+b)/2))

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import fractions
import itertools
import functools
import  operator

def solve():
    a, b = map(int, input().split())
    print(math.ceil((a+b)/2))
    return 0

if __name__ == "__main__":
    solve()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

import math

input_ = input().split()

a = float(input_[0])
b = float(input_[1])

ave = (a + b) / 2.0

print(math.ceil(ave))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
a,b = map(int,input().split())
if not (1 <= a <= 100 and 1 <= b <= 100):
    sys.exit()

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=[int(i) for i in input().split()]
mean_ab=(a+b)/2
if (a+b)%2==0:
    print(int(mean_ab))
else:
    print(int(mean_ab)+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:
import math
print(math.ceil(sum(map(int,input().split()))/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())
c = (a+b-1)/2+1
print(int(c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


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

Submission status: Accepted

Solution code:
print(eval(input().replace(*' +'))+1>>1)

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

Submission status: Accepted

Solution code:
import sys
import math
import numpy as np
import itertools
import bisect
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)
INF = 10**9
mod = 10**9+7

a,b = I()
print((a+b+1)//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

Alist=list(map(int,input().split()))

print(int(np.ceil(np.mean(Alist))))

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

ab = a + b

x = ab // 2

xmod = ab % 2

if (xmod == 0):
    print(x)

else:
    print(x + 1)

Submission status: Accepted

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

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

print(x)

Submission status: Accepted

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

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

Submission status: Accepted

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

import math

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

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

Submission status: Accepted

Solution code:
import math
a= list(map(int,input().split()))
print(math.ceil(sum(a) / 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())
print((a + b) // 2 if (a + b) % 2 == 0 else (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:
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+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:
print((eval(input().replace(" ","+"))+1)//2)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    a, b = map(int, input().split())
    print((a + b + 1) // 2)
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print((1+sum(map(int,input().split())))//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())
ans = math.ceil((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:
a,b=map(int,input().split())
ans=(a+b+1)//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
import bisect
from collections import Counter, deque, defaultdict
from copy import deepcopy
from fractions import gcd
from functools import reduce
from heapq import heappush, heappop
import itertools
import math
import sys
### stdin
def input(): return sys.stdin.readline()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]
### stdout

### setting
sys.setrecursionlimit(10 ** 6)
### utils
int1 = lambda x: int(x) - 1
###---------------------------------------------------


a, b = iInM()
ans = math.ceil((a + b) / 2)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil
a, b = [int(x) for x in input().split()]
print(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:
import sys

input = sys.stdin.readline


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

    x = (a + b) / 2
    if x.is_integer():
        ans = int(x)
    else:
        ans = int(x) + 1

    print(ans)


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:
import math


def actual(a, b):
    mean = (a + b) / 2

    return math.ceil(mean)

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

Submission status: Accepted

Solution code:
print((sum(list(map(int, input().split()))) + 1) // 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(int,input().split());print(math.ceil((a+b)/2))

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

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

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())
a, b = M()
print(math.ceil((a+b)/2))

Submission status: Accepted

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

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())
import math
print(math.ceil((a + b)/2))

Submission status: Accepted

Solution code:
import numpy as np
A,B = map(int,input().split())
ans = int(np.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:
from math import ceil

a,b = map(int,input().split())
print(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:
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())
x=(a+b)/2
if x*10%10==5:
    print(int(x*10//10+1))
else:
    print(int(x))

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

Submission status: Accepted

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

print((n+k)//2+(n+k)%2)

Submission status: Accepted

Solution code:
import math

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