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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(total)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
li =input().split()
a= int(li[0])
b= int(li[1])

#if a==0 or b==0:
	#c=inta+b
	#print('a')

if a==0 or b==0 or (a+b)%2 != 0:
	c =int(((a+b)/2) + 1)
	#print('b')

else:
	c=int((a+b)/2)
	#print('c')
    
print(c)

Submission status: Accepted

Solution code:
import math

a,b = input().rstrip().split()

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

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil((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())

Ans = -(-(A+B)//2)

print(Ans)

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 math
from statistics import mean

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(x_rounded_up)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#82

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

Submission status: Accepted

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

if ((a+b)/2)-((a+b)//2)>=0.5:
    print(((a+b)//2) +1)
else:
    print((a+b)//2)

Submission status: Accepted

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

print(math.ceil( (x[0] + x[1]) / 2 ))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil((a+b)*0.5))

Submission status: Accepted

Solution code:
import math

a = str(input())
b = a.split()

mean = math.ceil((int(b[0])+int(b[1]))/2)

print(mean)

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

Submission status: Accepted

Solution code:
a ,b = list(map(int,input().split()))
ave = int(abs((a + b) / 2))
mod = (a + b) % 2
if mod >= 0.5:
  print(ave +1)
else:
  print(ave)

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

Submission status: Accepted

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


def solve(a: int, b: int):
    print(-(-(a+b)//2))
    return


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

l = list(map(int, input().split()))
ave = sum(l) / len(l)
print(math.ceil(ave))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
a,b = map(int,input().split())
print(Decimal(str((a+b)/2)).quantize(Decimal('0'), rounding=ROUND_HALF_UP))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if avr-int(avr) == 0:
  print(str(int(avr)))
else:
  print(str(int(avr)+1))

Submission status: Accepted

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

Submission status: Accepted

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

x = (a + b) / 2

print(math.ceil(x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math

# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b = inputMap()
    
    print(-(-(a+b)//2))
            	
if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC082-A
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(int((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())
m = a + b
print((m+1)//2)

Submission status: Accepted

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

import sys

input = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
a,b = [int(i) for i in 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())

res = (a+b)%2
mean = (a+b)//2

if res == 1:
  print(mean+1)
else:
  print(mean)

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

Submission status: Accepted

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

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

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

if __name__ == "__main__":
    a, b = map(int, input().split())

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

Submission status: Accepted

Solution code:
import math

lis = [int(i) for i in input().split()]

print(math.ceil((lis[0]+lis[1])/2))

Submission status: Accepted

Solution code:
a, b = [int(ab) for ab in input().split()]
if (a+b) % 2 == 0:
  ans = (a+b) // 2
else:
  ans = (a+b+1) // 2
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())
X = (A+B) // 2 + (A+B) % 2
print(X)

Submission status: Accepted

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

Submission status: Accepted

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

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

# solve & output
print(math.ceil((a + b) / 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil
from statistics import mean
a = list(map(int,input().split()))
print(ceil(mean(a)))

Submission status: Accepted

Solution code:
import math

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

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

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

Submission status: Accepted

Solution code:
#96
A,B = map(int,input().split())
ans= int((((A+B)/2)+0.5) //1)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
input = input().split()
a = int(input[0])
b = int(input[1])
all = a + b
print(-(-all // 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print((a+b+(a+b)%2)//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:
# !/usr/bin python3
# -*- coding: utf-8 -*-

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

import math

x = (a + b) / 2

print(math.ceil(x))

Submission status: Accepted

Solution code:
import math

ab = input().split(" ")
a = int(ab[0])
b = int(ab[1])
avg = (a + b) / 2
avg = math.ceil(avg)
print(avg)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

a, b = nl()

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

Submission status: Accepted

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

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict
import math


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def mod_inv(x):
    # available only when mod is prime
    global mod
    return pow(x, mod - 2, mod)


def gcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    ret = math.factorial(x)
    ret = ret // (math.factorial(x - y) * math.factorial(y))

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


def main():
    a, b = intin()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


def solve(a: int, b: int):
    print(math.ceil((a+b)/2))
    return


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

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 = input().split()
average = float((int(a)+int(b))*0.5)
rd = average - float(int(average))
plus = 0
if rd >=0.5:
    plus = 1
print(int(average)+plus)

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
MOD = 1000000007
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

a,b=LI()

print(math.ceil((a+b)*0.5))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
import math

num = list(map(int,input().split(' ')))
#print(num)
x = math.ceil(sum(num)/2)
print(x)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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:
from collections import defaultdict
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 numpy as np
a, b = [int(j) for j in input().split()]

print((a+b+1)//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())
print ((A+B+1)//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
input=sys.stdin.readline
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [input() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    from math import ceil
    a, b = MI()
    print(ceil((a+b)/2))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def round_up(divided_number, devide_by_number):
    return (divided_number + devide_by_number - 1)//devide_by_number


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

    x = a + b

    print(round_up(x, 2))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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())
import math
x = (a+b)/2
print(math.ceil(x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = (a + b) / 2 #商
c = (a + b) // 2 #商の整数部

if((x - c) > 0):
    print(c + 1)
else:
    print(c)

Submission status: Accepted

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

x = 2
ab = a + b

print(int((ab + x - 1) / x ))

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

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
a, b = [ int(v) for v in input().split() ]

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

Submission status: Accepted

Solution code:
import math

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

s=sum(nums)
n=len(nums)

mean=s/n

print(math.ceil(mean))

Submission status: Accepted

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

Submission status: Accepted

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

print(int(mean))

Submission status: Accepted

Solution code:

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

ab = a+b
ans = ab//2 + ab%2
print( ans )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    a, b = (int(_) for _ in input().split())
    print(math.ceil((a+b)/2))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from math import ceil
input = sys.stdin.readline
a, b = map(int, input().split())
print(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)