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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(int(({0} + {1} - 1)//2).format(input().split())

Submission status: Runtime Error

Solution code:
print(int((a + b - 1)//2))

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
s = input()
t = input()

if sorted(s) < sorted(t, reverse=True):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a=(input())
b=(input())
print((a+b+1)/2)

Submission status: Runtime Error

Solution code:
s=sorted(input())
t=sorted(input())[::-1]
print('Yes' if t>s else 'No')

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りでの入力
a, b = map(int,input().split)
#平均値の計算
ave = float((a+b)/2)
#数字の切り上げ
N = round(ave)
print({},"N")

Submission status: Runtime Error

Solution code:
print('Yes' if sorted(input()) < sorted(input(), reverse=True) else 'No')

Submission status: Runtime Error

Solution code:
a=input()
b=input()
if (a+b)/2%1:
  print (a+b)/2 +1

Submission status: Runtime Error

Solution code:
%%cython
int n = int(input())
if n:
    int[] arr = list(map(int, input().split()))
    t = 0
    for i in set(arr):
        if i > arr.count(i):
            continue
        t += i
    print(n-t)
else:
    print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
A = int(input())

if N % 500 <= A:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = input()
t = input()
s = sorted(s)
t = sorted(t, reverse=1)
if s<t:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a, b = map(int,iput().split(" "))
print("{}".format((a+b-1)/b))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
s1 = sorted(s)
s2 = input()


ans = 0
ans2 = 0



for i in s2:
    if s == s2:
        break
    if s1[0] <= i:
        ans = ans + 1
        for k in range(0,len(s1)):
            if s1[k] <= i:
                ans2 = ans2 + 1
    
if ans != 0 and ans2 != 0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
s = list(input())
t = list(input())

s.sort(reverse=True)
t.sort(reverse=True)

s_len = len(s)
t_len = len(t)

if(s_len < t_len):
    short = s_len
else:
    short = t_len

flag = False
for i in range(short+1):
    if(s[i] < t[i]):
        flag = True

if(s < t or flag):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
A,B,C,D=map(int,input().split())
if (A+B)%2!=0:
  print((A+B)//2+1)
else:
  print((A+B)//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ab=input()
x=input()

a, b = ab.split()
a=int(a)
b=int(b)
x=int(x)

print(int(a/b=x))

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())

c=(a+b)/2
print(int(c))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
a = [map(int, input().split())]
print(math.ceil(sum(a)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
l = list(map(int, input().split()))
dic = {}
count = 0

for i in range(n):
  dic.setdefault(l[i],0)
  dic[l[i]] += 1
#print(dic)
for x,y in dic.items():
  if x <= y:
    count += y - x
  else:
    count += y
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
l = list(map(int, input().split()))
L = list(set(l))
count = 0
for x in L:
  if l.count(x) == x:
    continue
  elif l.count(x) > x:
    count += l.count(x) - x
  else:
    count += l.count(x)
print(count)

Submission status: Runtime Error

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

x = (a+b)/2

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(ceil(a+b)/2)

Submission status: Runtime Error

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

s = input()
t = input()

s_list = list(s)
t_list = list(t)

import itertools

flag = False

for i in itertools.permutations(s_list):
    s_new = ''.join(i)
    for n in itertools.permutations(t_list):
        t_new = ''.join(n)

        if s_new < t_new:
            flag = True
if flag:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
))

print("{:.0f}".format((a+b)/2))

Submission status: Runtime Error

Solution code:
a, b = map(int, open(0)); print((a + b + 1) // 2)

Submission status: Runtime Error

Solution code:
a, b = map(int, open(0)); print((a + b) // 2 + (a + b) % 2)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;

int main(){
  int a,b;
  cin >> a >> b;
  cout << a+b-(a+b)//2
}

Submission status: Runtime Error

Solution code:
def round_up_mean(a,b):
  ans = -(-(a+b)//2)
  print(ans)


a,b = int(input().split(" "))
round_up_mean(a, b)

Submission status: Runtime Error

Solution code:
def round_up_mean(a,b):
  ans = -(-(a+b)//2)
  print(ans)


a,b = int(input().split(""))
round_up_mean(a, b)

Submission status: Runtime Error

Solution code:
#import math
def round_up_mean(a,b):
#  ans = math.ceil((a+b)/2)
#  print(ans)
  ans = -(-(a+b)//2)
  print(ans)


a = int(input())
b = int(input())
round_up_mean(a, b)

Submission status: Runtime Error

Solution code:
import sys
s = input()
gx,gy = map(int, input().split(' '))
x_d = [0]
y_d = []
cnt = 0
for i in range(len(s)):
    if s[i] == "T":
        cnt += 1
        if cnt % 2 == 0:
            x_d.append(0)
        elif cnt % 2 == 1:
            y_d.append(0)
    if s[i] == "F":
        if cnt % 2 == 0:
            x_d[-1] += 1
        elif cnt % 2 == 1:
            y_d[-1] += 1
x_d.append(0)
y_d.append(0)
if (sum(x_d)-gx) % 2 or (sum(y_d)-gy) % 2:
    print("No")
    sys.exit()
x_n = (sum(x_d)-gx)//2
y_n = (sum(y_d)-gy)//2
DPx = [[False for i in range(x_n+2)] for j in range(len(x_d))]
DPy = [[False for i in range(y_n+2)] for j in range(len(y_d))]
for x in DPx:
    x[0] = True
for y in DPy:
    y[0] = True
for i in range(len(x_d)-1):
    for j in range(x_n+1):
        if DPx[i][j]:
            DPx[i+1][j] = True
            if j+x_d[i] <= x_n:
                DPx[i+1][j+x_d[i]] = True
for i in range(len(y_d)-1):
    for j in range(y_n+1):
        if DPy[i][j]:
            DPy[i+1][j] = True
            if j+y_d[i] <= y_n:
                DPy[i+1][j+y_d[i]] = True

if DPx[len(x_d)-1][x_n] and DPy[len(y_d)-1][y_n]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys
s = input()
gx,gy = map(int, input().split(' '))
x_d = [0]
y_d = []
cnt = 0
for i in range(len(s)):
    if s[i] == "T":
        cnt += 1
        if cnt % 2 == 0:
            x_d.append(0)
        elif cnt % 2 == 1:
            y_d.append(0)
    if s[i] == "F":
        if cnt % 2 == 0:
            x_d[-1] += 1
        elif cnt % 2 == 1:
            y_d[-1] += 1
x_d.append(0)
y_d.append(0)
if (sum(x_d)-gx) % 2 or (sum(y_d)-gy) % 2:
    print("No")
    sys.exit()
x_n = (sum(x_d)-gx)//2
y_n = (sum(y_d)-gy)//2
DPx = [[False for i in range(x_n+1)] for j in range(len(x_d))]
DPy = [[False for i in range(y_n+1)] for j in range(len(y_d))]
for x in DPx:
    x[0] = True
for y in DPy:
    y[0] = True
for i in range(len(x_d)-1):
    for j in range(x_n+1):
        if DPx[i][j]:
            DPx[i+1][j] = True
            if j+x_d[i] <= x_n:
                DPx[i+1][j+x_d[i]] = True
for i in range(len(y_d)-1):
    for j in range(y_n+1):
        if DPy[i][j]:
            DPy[i+1][j] = True
            if j+y_d[i] <= y_n:
                DPy[i+1][j+y_d[i]] = True

if DPx[-2][x_n] and DPy[-2][y_n]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
s＿asc = "".join(sorted(s))
    
t = input()
t_dasc = "".join(sorted(t, reverse=True))

if s_asc < t_desc:
	print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
s = input()
s＿asc = "".join(sorted(s))
    
t = input()
t_dasc = "".join(sorted(t, reverse=True))

if s_asc < t_desc:
        print("Yes")
else:
        print("No")

Submission status: Runtime Error

Solution code:
import math
a, b = int(input().split(" "))
c = (a + b)/2 # 平均値
if (a+b) % 2 != 0: # 余りが０以外の時小数点以下をきりあげる必要がある。
  print(math.ceil(c))
else:
  print(c)

Submission status: Runtime Error

Solution code:
##### 解けた #####

a,b=list(map(int,input()))

print((a+b)//2)

Submission status: Runtime Error

Solution code:
N = input()
M = input()

sorted_asc = sorted(list(N))
sorted_desc = sorted(list(M), reverse=True)
res = ""

for (x, y) in zip(sorted_asc, sorted_desc):
    if x < y:
        res = "Yes"
        break
    elif x > y:
        res = "No"
        break

if res == "" and len(N) == len(M):
    res = "No"
elif res == "" and len(N) < len(M):
    res = "Yes"

print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
avg = (a+b) /2
if (avg*10)%10 == 0:
  print(avg)
else:
  print(avg+1)

Submission status: Runtime Error

Solution code:
print((sum(int(input()))+1)//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
//
//  roudupthemean.cpp
//
//
//  Created by 田中諒 on 2019/10/22.
//

#include <iostream>
using namespace std;

int main()
{
    int a, b;
    cin >> a >> b;
    cout << (a + b) / 2 << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
s = list(input())
t = list(input())

s.sort()
s=''.join(s)

s.sort()
t.reverse()
t=''.join(t)

if s < t:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = list(input())
t = list(input())

s.sort()
s=''.join(s)

s.sort()
t.reverse()
t=''.join(t)

print(s)
print(t)

if s < t:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import ceil
x = (a + b) / 2
print(ceil(x))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
def check(z, zz, z_list, dire):
  zz += z_list[0] * dire
  if len(z_list) == 1:
    if z == zz:
      return 1
    else:
      return 0
  else:
    if check(z, zz, z_list[1:], 1) == 0:
      if check(z, zz, z_list[1:], -1) == 0:
      	return 0
    return 1

    
def func(x, y, xx, yy, x_list, y_list):
  if len(x_list) == 0:
    if x != xx:
      return 0
  else:
    if check(x, xx, x_list, 1) == 0:
      if check(x, xx, x_list, -1) == 0:
      	return 0
  if len(y_list) == 0:
    if y != yy:
      return 0
  else:
    if check(y, yy, y_list, 1) == 0:
      if check(y, yy, y_list, -1) == 0:
      	return 0
  return 1

s = input()
x, y = map(int, input().split())
data = s.split("T")
xx, yy = 0, 0
i = 0
x_list = []
y_list = []
for Fs in data:
  if len(Fs) == 0:
    i += 1
  else:
    if i == 0:
      xx = len(Fs)
    elif i % 2 == 0:
      x_list.append(len(Fs))
    else:
      y_list.append(len(Fs))
    i += 1
if func(x, y, xx, yy, x_list, y_list) == 1:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b = map(open(0).read().split())

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

Submission status: Runtime Error

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

c = a + b

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

Solution code:
a,b=int(input())

x=(a+b)//2

print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
import numpy as np
import math
c=np.mean(a,b)
print(math.ceil(c))

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
print((int(input())+int(input()))//2+1)

Submission status: Runtime Error

Solution code:
from collections import Counter

n=int(input())
a=list(map(int,input().split()))
a_s=list(set(a))
c_l=Counter(a)

cnt=0
for i in a_s:
    cnt+=c_l[i] if c_l[i]<i else cnt+=c_l[i]-i
print(cnt)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
 
b=list(set(a))
c=0
for i in b:
    nc=0
    for j in a:
        if j==i:
          nc+=1
        else:
          nc+=0    
    er = nc - i
    if er<0:
        c+= er+i
print(c)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
 
b=list(set(a))
c=0
for i in b:
    nc=0
    for j in range(len(a)):
        if a[j]==i:
          nc+=1
        else:
          nc+=0    
    er = nc - i
    if er<0:
        c+= er+i
    else:
        c+=er
print(c)

Submission status: Runtime Error

Solution code:
print('Yes'*(sorted(input())<sorted(input())[::-1])or'No')

Submission status: Runtime Error

Solution code:
s1 = input()
t1 = input()

s = list(s1)
t = list(t1)

s.sort()
t.sort(reverse=1)

i = 0
while(1):
  if ord(s[i]) < ord(t[i]):
    print('YES')
    break
  else :
    if i+1 == min(len(s1),len(t1)):
    	print('NO')
    	break
    else : i+=1

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#Two Anagrams
s = list(input()).sorted
t = list(input()).sorted
if s < t:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
a,b = input().split()
print('{:.0f}'.np.ceil((int(a)+int(b))/2))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
a,b = input().split()
np.trunc((a+b)/2)

Submission status: Runtime Error

Solution code:
import numpy as np
a,b = input().split()
np.trunc((a+b)2)

Submission status: Runtime Error

Solution code:
import numpy as np
a,b = input().split()
np.trunc(a+b/2)

Submission status: Runtime Error

Solution code:
import numpy as np
a,b = input().split()
numpy.trunc(a+b/2)

Submission status: Runtime Error

Solution code:
i = lits(map(int, input().split()))
j = i[0] * i[1]
if j % 2 == 0:
  print(j / 2)
else:
  print(int(j/2)+1)

Submission status: Runtime Error

Solution code:
i = lits(map(int, input().split()))
j = i[0] * i[1]
if j % 2 == 0:
  print(j / 2)
else:
  print(int (j/2)+1)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
t = input()
ss = sorted(s)
tt = sorted(t)
print("Yes" if ss < tt[::-1] else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
print(math.ceil(int(input() + int(input()))))

Submission status: Runtime Error

Solution code:
print((int(input())+int(input())+1)/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = [int(c) for c in input().split{' '}]
print((a+b-1)/2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s = input()
t = input()

sdash = "".join(sorted(s))
tdash = "".join(sorted(t, reverse = True))

print("Yes" if sdash < tdash else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = list(input())
t = list(input())

sdash = "".join(sorted(s))
tdash = "".join(sorted(s, reverse = True))

print("Yes" if sdash < tdash else "No")

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int a, b;
  cin >> a >> b;
  cout << (a + b + 1) / 2 << endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
from collections import Counter
n = input()
c = Counter(map(int, input().split()))
print(sum(v if v < k else v - k for k,v in c.items()))

Submission status: Runtime Error

Solution code:
a,b = [int(i)for i in input().spilt()]
x= (a+b)/2
if((a+b)%2 == 0):
    print(int(x))
else:
    print(int(x)+1)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s = sorted(input())
t = sorted(input(), reverse=True)

if s[0] < t[0]:
    print("Yes")
elif s[0] == t[0]:
    if len(s) <= len(t):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=sorted(str(input()))
t=sorted(str(input()),reverse=True)
if s<t:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s=sorted(str(input()))
t=sorted(str(input()),reverse=True)
if s<=t:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s=sorted(str(input())
t=sorted(str(input(),reverse=True))
if s<=t:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s=sorted(str(input()))
t=sorted(str(input(),reverse=True))
if s<=t:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a,b=map(int, input(),split())
x=round(a/b)
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = str(input())
t = str(input())
s = (sorted(s))
t = (sorted(t,reverse = True))
s2 = ''.join(s)
t2 = ''.join(t)

if s2 < t2:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = str(input())
t = str(input())
s2 = ''.join(sorted(s))
t2 = ''.join(sorted(t,reverse=True))

if s2 < t2:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = str(input())
t = str(input())
s2 = ''.join(sorted(s))
t2 = ''.join(sorted(t))

if s2 < t2:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import round

a, b = map(int, input().split())
print(round(avg([a, b])))

Submission status: Runtime Error

Solution code:
from math import round

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

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

Solution code:
a = sorted(input())
b = reversed(input())
c = ''.join(a) 
d = ''.join(b)
if c < d:
	print("Yes")
elif c >= d:
	print("No")

Submission status: Runtime Error

Solution code:
a = sorted(input())
b = reversed(input())
c = ''.join(a) 
d = ''.join(b)

if c < d:
	print("Yes")
elif c >= d:
	print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
x = int((a+b)//2 + 1)
print(x)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
x = (a+b)//2 + 1
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = list(input())
t = list(input())

s = sorted(s)
t = sorted(t, reverse=True)

s = "".join(s)
t = "".join(t)

if s < t:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
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()

S = input()
X,Y=LI()

while S and S[0] == 'F':
    S = S[1:]
    X -= 1
isX = True
cur = 0
xs = []
ys = []
for i in range(len(S)):
    if S[i] == 'T':
        if cur:
            if isX:
                xs.append(cur)
            else:
                ys.append(cur)
        isX = not isX
        cur = 0
    elif S[i] == 'F':
        cur += 1

if cur:
    if isX:
        xs.append(cur)
    else:
        ys.append(cur)

sumxs = sum(xs)
sumys = sum(ys)
if abs(X) > sumxs or abs(Y) > sumys:
    print('No')
    exit()

memo1 = [[0]*(sumxs*2+10) for i in range(len(xs)+1)]
memo2 = [[0]*(sumys*2+10) for i in range(len(ys)+1)]

memo1[0][0] = 1
memo2[0][0] = 1
for i in range(1, len(xs)+1):
    for j in range(-sumxs, sumxs+1):
        memo1[i][j] = memo1[i-1][j+xs[i-1]]
        memo1[i][j] = memo1[i-1][j-xs[i-1]]

for i in range(1, len(ys)+1):
    for j in range(-sumys, sumys+1):
        memo2[i][j] = memo2[i-1][j+ys[i-1]]
        memo2[i][j] = memo2[i-1][j-ys[i-1]]

print('Yes' if memo1[len(xs)][X] and memo2[len(ys)][Y] else 'No')

Submission status: Runtime Error

Solution code:
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()

S = input()
X,Y=LI()

while S and S[0] == 'F':
    S = S[1:]
    X -= 1

isX = True
cur = 0
xs = []
ys = []
for i in range(len(S)):
    if S[i] == 'T':
        if cur:
            if isX:
                xs.append(cur)
            else:
                ys.append(cur)
        isX = not isX
        cur = 0
    elif S[i] == 'F':
        cur += 1

if cur:
    if isX:
        xs.append(cur)
    else:
        ys.append(cur)

X=abs(X)
Y=abs(Y)
sumxs = sum(xs)
sumys = sum(ys)
if X > sumxs or Y > sumys:
    print('No')
    exit()

memo1 = [[0]*(sumxs*2+10) for i in range(len(xs)+1)]
memo2 = [[0]*(sumys*2+10) for i in range(len(ys)+1)]

memo1[0][0] = 1
memo2[0][0] = 1
for i in range(1, len(xs)+1):
    for j in range(-sumxs, sumxs+1):
        memo1[i][j] = memo1[i-1][j+xs[i-1]]
        memo1[i][j] = memo1[i-1][j-xs[i-1]]

# print(len(ys))
# print(len(memo2))
for i in range(1, len(ys)+1):
    for j in range(-sumys, sumys+1):
        memo2[i][j] = memo2[i-1][j+ys[i-1]]
        memo2[i][j] = memo2[i-1][j-ys[i-1]]

print('Yes' if memo1[len(xs)][X] and memo2[len(ys)][Y] else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

mean = (a + b) / 2

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print((int(input())+int(input())+0.99999999999)//2)

Submission status: Runtime Error

Solution code:
s=list(input())
t=list(input())
s.sort()
t.sort(reverse=True)

if s<t:
    print("Yes")
else:
    print("No")