Problem:


Score : 100 points

Problem Statement

Takahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.

At least how many sheets of paper does he need?

Constraints

N is an integer.

1 \leq N \leq 100

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer.

Sample Input 1

5

Sample Output 1

3

By printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.

Sample Input 2

2

Sample Output 2

1

Sample Input 3

100

Sample Output 3

50



Sample input:
5


Sample output:
3

Submission status: Runtime Error

Solution code:
bingo = [[],[],[]]
 
for i in range(3):
  a, b, c = map(int,input().split())
  bingo[i].append(a)
  bingo[i].append(b)
  bingo[i].append(c)
  
N = int(input())
  
for i in range(N):
  S = int(input())
  for j in range(3):
    if S in bingo[j]:
      for k in range(3):
        if S == bingo[j][k]:
          bingo[j][k] = 'ok'
          
ANS = 0
 
for i in range(3):
  for j in range(3):
    if bingo[i][j] == 'ok':
      ANS += 1
      if ANS == 3:
        print("Yes")
  ANS = 0
 
for i in range(3):
  for j in range(3):
    if bingo[j][i] == 'ok':
      ANS += 1
      if ANS == 3:
        print("Yes")
  ANS = 0
 
if bingo[1][1] == 'ok':
  if bingo[0][0] == 'ok' and bingo[2][2] == 'ok':
    print("Yse")
  elif bingo[0][2] == 'ok' and bingo[2][0] == 'ok':
    print("Yse")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
S=[]
C=[]
for i in range(M):
  s,c=map(int,input().split())
  S+=[s]
  C+=[c]
tf=1
ans=[]
for i in range(N):
  ans+=[-1]
for i in range(M):
  if ans[S[i]-1] ==-1:
    ans[S[i]-1]=C[i]
  else:
    if ans[S[i]-1]!=C[i]:
      tf=0
      break
    else:
      continue
for i in range(N):
  if ans[i]==-1:
    if i!=0 or (i==0 and N==1):
      ans[i]=0
    else:
      ans[i]=1
  elif ans[i]==0 and i==0 and N!=1:
    tf=0
    break
if tf==0:
  print('-1')
else:
  ansnum=''
  for i in range(N):
    ansnum+=str(ans[i])
  print(ansnum)

Submission status: Runtime Error

Solution code:
import sys
import math
import itertools as it
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
n ,m = i2()
l = [0]*n
for i in range(m):
    s,c = i2()
    if l[s-1] == 0 or l[s-1] == c:
        l[s-1] = c
    else:
        print(-1)
        exit()
num = ""
for i in l:
    num = num + str(i)
num = int(num)
print(num if len(str(num)) == n else -1)

Submission status: Runtime Error

Solution code:
bingo = [[],[],[]]
 
for i in range(3):
  a, b, c = map(int,input().split())
  bingo[i].append(a)
  bingo[i].append(b)
  bingo[i].append(c)
  
N = int(input())

  
for i in range(N):
  S = int(input())
  for j in range(3):
    if S in bingo[j]:
      for k in range(3):
        if S == bingo[j][k]:
          bingo[j][k] = 'ok'
          
ANS = 0
 
for i in range(3):
  for j in range(3):
    if bingo[i][j] == 'ok':
      ANS += 1
      if ANS == 3:
        print("Yes")
  ANS = 0
 
for i in range(3):
  for j in range(3):
    if bingo[j][i] == 'ok':
      ANS += 1
      if ANS == 3:
        print("Yes")
  ANS = 0
 
if bingo[1][1] == 'ok':
  if bingo[0][0] == 'ok' and bingo[2][2] == 'ok':
    print("Yse")
  elif bingo[0][2] == 'ok' and bingo[2][0] == 'ok':
    print("Yse")
 
 
print("No")

Submission status: Runtime Error

Solution code:
a = [input().split() for l in range(3)]

n=int(input())
b = [(input()) for i in range(n)]
s=[]
for i in range(n):
  for j in range(3):
    if b[i] in a[j]:
      k=a[j].index(b[i])
      s.append([j,k])
      if [j,0] in s and [j,1] in s and [j,2] in s:
        print("Yes")
        break
      elif [0,k] in s and [1,k] in s and [2,k] in s:
        print("Yes")
        break
      elif j==k:
        if [0,0] in s and [1,1] in s and [2,2] in s:
          print("Yes")
          break
        elif [0,2] in s and [1,1] in s and [2,0] in s:
          print("Yes")
          break
  else:
    continue
  break
else:
  print("No")

Submission status: Runtime Error

Solution code:
bingo = [[],[],[]]
 
for i in range(3):
  a, b, c = map(int,input().split())
  bingo[i].append(a)
  bingo[i].append(b)
  bingo[i].append(c)
  
N = int(input())
if N < 9:
  print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
if n % 2 = 0 :
    print(n / 2)
elif n % 2 = 1 :
    print(n / 2 +　1)

Submission status: Runtime Error

Solution code:
bingo = [[],[],[]]
 
for i in range(3):
  a, b, c = map(int,input().split())
  bingo[i].append(a)
  bingo[i].append(b)
  bingo[i].append(c)
  
N = int(input())
if N < 9:
  print("No")
  
'''for i in range(N):
  S = int(input())
  for j in range(3):
    if S in bingo[j]:
      for k in range(3):
        if S == bingo[j][k]:
          bingo[j][k] = 'ok'
          
ANS = 0
 
for i in range(3):
  for j in range(3):
    if bingo[i][j] == 'ok':
      ANS += 1
      if ANS == 3:
        print("Yes")
  ANS = 0
 
for i in range(3):
  for j in range(3):
    if bingo[j][i] == 'ok':
      ANS += 1
      if ANS == 3:
        print("Yes")
  ANS = 0
 
if bingo[1][1] == 'ok':
  if bingo[0][0] == 'ok' and bingo[2][2] == 'ok':
    print("Yse")
  elif bingo[0][2] == 'ok' and bingo[2][0] == 'ok':
    print("Yse")
 
 
print("No")'''

Submission status: Runtime Error

Solution code:
N = input().split()
page = (page/N)+1
print(page)

Submission status: Runtime Error

Solution code:
N = int(input())

if n%2==0:
  print(N//2)
else:
  print(N//2+1)

Submission status: Runtime Error

Solution code:
N=input()
print -(-N//2)

Submission status: Runtime Error

Solution code:
num = input()
num = int(num)

page = math.ceil(num/2)
print(page)

Submission status: Runtime Error

Solution code:
k=N%2
if k==0:
    print(round(N/2.0))
else:
    print(round(N/2+1/2.0))

Submission status: Runtime Error

Solution code:
n = input()
print(n // 2  + (n % 2))

Submission status: Runtime Error

Solution code:
N = int(input())
if N%2 ==1:10

    N +=1
print(int(N/2))

Submission status: Runtime Error

Solution code:
A,B,C=map(int,input().split())
D,E,F=map(int,input().split())
G,H,I=map(int,input().split())
N=int(input())
b=[input() for i in range(N-1)]
if b.count(A)>0 and b.count(B)>0 and b.count(C)>0:
    print("Yes")
    exit()
if b.count(D)>0 and b.count(E)>0 and b.count(F)>0:
    print("Yes")
    exit()
if b.count(G)>0 and b.count(H)>0 and b.count(I)>0:
    print("Yes")
    exit()
if b.count(A)>0 and b.count(D)>0 and b.count(G)>0:
    print("Yes")
    exit()
if b.count(B)>0 and b.count(E)>0 and b.count(H)>0:
    print("Yes")
    exit()
if b.count(C)>0 and b.count(F)>0 and b.count(I)>0:
    print("Yes")
    exit()
if b.count(A)>0 and b.count(E)>0 and b.count(I)>0:
    print("Yes")
    exit()
if b.count(C)>0 and b.count(E)>0 and b.count(G)>0:
    print("Yes")
    exit()
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math
import string


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


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


a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
# print(a)
# print(b)
# print(c)
n = int(input())
d = [int(input()) for i in range(n)]
# print(d)

if (a[0]in d) and (a[1]in d) and(a[2]in d):
    print("Yes")
    exit()
if (b[0]in d)and(b[1]in d)and(b[2]in d):
    print("Yes")
    exit()
if (c[0]in d)and(c[1]in d)and(c[2]in d):
    print("Yes")
    exit()
if (a[2]in d)and(b[1]in d)and(c[0]in d):
    print("Yes")
    exit()
if (a[0]in d)and(b[1]in d)and(c[2]in d):
    print("Yes")
    exit()
if (a[0]in d)and(b[0]in d)and(c[0]in d):
    print("Yes")
    exit()
if (a[2]in d)and(b[2]in d)and(c[2]in d):
    print("Yes")
    exit()
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

Solution code:
N = int(input())

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

Submission status: Runtime Error

Solution code:
N = int(input())
if N % ==1:
  print(int(N/2+1))
elif N %  ==0:
  print(int(N/2))

Submission status: Runtime Error

Solution code:
n = input()
res = n // 2 
print(res + (res & 2))

Submission status: Runtime Error

Solution code:
N = input()
if N%2 ==0:
  print(N/2)
else:
  print(N/2 + 1)

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
ans = ["0"]*n
if(m==0 and n==1):print(0);exit()
for i in range(m):
    a, b = map(int, input().split())
    if(ans[a-1] == "0"):ans[a-1] = str(b)
    elif(int(ans[a-1]) > b):ans[a-1] = str(b)
if(ans[0] == "0"):print(-1)
else:print("".join(ans))

Submission status: Runtime Error

Solution code:
n=int(input()
print(n//2+n%2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input();
if N%2==0:
  print(N/2)
else:
  print(N/2 + 1)

Submission status: Runtime Error

Solution code:
lines = [x.strip() for x in sys.stdin.readlines()]
def solve(lines):
    N = int(lines.pop(0))
    print(math.ceil(N/2))
solve(lines)

Submission status: Runtime Error

Solution code:
def solve(lines):
    N = int(lines.pop(0))
    print(math.ceil(N/2))
solve(lines)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
    int n;
    cin >> n;
    int ans = 0;
    if (n%2 == 1) ans = (n+1)/2;
    else ans = n/2;
    cout << ans << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
a = [int(j) for i in range(3) for j in input().split(' ')]
n = int(input())
nn = [int(input()) for i in range(n)]

for ni in nn:
  if ni in a:
    a[a.index(ni)] = 0

judge = Yes
if a[4]!=0 and a[2]!=0 and a[6]!=0:
  judge = No
  
print(judge)

Submission status: Runtime Error

Solution code:
import sys
import math

for line in sys.stdin.readline():
    g = float(line.rstrip())
    ans = math.ceil(n/2)
    print(ans,end="")
    break

Submission status: Runtime Error

Solution code:
List = [list(map(int, input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]

ans = [[0,0,0] for i in range(3)]
ans1 = [[0,0,0] for i in range(3)]

res = False

for i in range(n):
    for a in range(3):
        for c in range(3):
            if b[n] == List[a][c]:
                ans[a][c] = 1
                ans1[c][a] = 1
                
if ans[1][1] == 1:
    if ans[0][0] > 0 and ans[2][2] > 0:
        res = True
    if ans[2][0] > 0 and ans[0][2] > 0:
        res = True
                
for i in range(3):
    if ans[i][0] > 0 and ans[i][1] > 0 and ans[i][2] > 0:
        res = True
    if ans1[i][0] > 0 and ans1[i][1] > 0 and ans1[i][2] > 0:
        res = True
   
            
if res:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
d = {}
for _ in range(m):
  s,c = map(int,input().split())
  if s > n:
    print(-1)
    exit()
  if s in d:
    if d[s] == c:
      continue
    else:
      print(-1)
      exit()
  else:
    d[s] = c

ans = ''
for i in range(n):
  if i+1 in d:
    ans += str(d[i+1])
  else:
    ans += '1'
print(ans)

Submission status: Runtime Error

Solution code:
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
x=[[0 for i in range(3)] for j in range(3)]
N=int(input())
if N>=3:
  for i in range(N):
    b=int(input())
    for j in range(3):
      if A[j]==b:
        x[0][j]=1
      elif B[j]==b:
        x[1][j]=1
      elif C[j]==b:
        x[2][j]=1
  flag=0
  if x[0][0]==1:
    if x[0][1]==1 and x[0][2]==1:
      flag=1
    elif x[1][0]==1 and x[2][0]==1:
      flag=1
    elif x[1][1]==1 and x[2][2]==1:
      flag=1
  if x[1][1]==1:
    if x[0][1]==1 and x[2][1]==1:
      flag=1
    elif x[1][0]==1 and x[2][0]==1:
      flag=1
    elif x[0][2]==1 and x[2][0]==1:
      flag=1
  if x[2][2]==1:
    if x[2][0]==1 and x[2][1]==1:
      flag=1
    elif x[0][2]==1 and x[1][2]==1:
      flag=1
  if flag==1:
    print("Yes")
  else:
    print("No")
  #print(x)
else:
  print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
num = input()
if num % 2 == 0:
  print(num // 2)
else:
  print(num // 2 + 1)

Submission status: Runtime Error

Solution code:
n = input()
if n % 2 == 0:
  print(n/2)
else:
  print(n//2 + 1)

Submission status: Runtime Error

Solution code:
N = int(input())
if N % 2 == 0:
    answer = N /2
else:
    answer = (N + 1) / 2

print(int(answer)

Submission status: Runtime Error

Solution code:
import math
def myfunc(N):
    math.floor(N/2)
    
myfunc(N)

Submission status: Runtime Error

Solution code:
import sys

def main(n):

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

if __name__ == '__main__':
    main(input())

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=input()

if N%2==0:
    print(N/2)

elif N%2==1:
    print(int(N/2)+1)

Submission status: Runtime Error

Solution code:
num = input()

print(int(num/2))

Submission status: Runtime Error

Solution code:
does not name a type

Submission status: Runtime Error

Solution code:
import sys

def main(argv):

  #L = int(argv.pop())
  #tree = [int(s) for s in argv]
  n = int(argv[0])
  if n%2 == 0:
    print(n/2)
  else:
    print(int(n/2)+1)

if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Runtime Error

Solution code:
N=int(input())
if N%2==0:
    print(N/2)
else:
    print(int(n/2+1))

Submission status: Runtime Error

Solution code:
N = input()

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

Submission status: Runtime Error

Solution code:
if N%2==0:
    print(N/2)
else:
    print((N+1)/2)

Submission status: Runtime Error

Solution code:
import sys

def main(argv):
 #L = int(argv.pop())
 #tree = [int(s) for s in argv]
 n = int(argv[0])
 if n%2 == 0:
    print(n/2)
 else:
    print(int(n/2)+1)

if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Runtime Error

Solution code:
#N,K = map(int,input().split())
N=int(input())
if N%2==0:
    print(N/2)
else:
    print(int(n/2+1))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
N = int(input())
# 割り算の商
a = N // 2
# 割り算のあまり
b = N % 2
# 余りが計算
if b = 0 :
  #出力
  print(a)
else:
  print(a + 1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
if N%2==0:
  print(N/2)
if N==1:
  print("1")
if N==3:
  print("2")
if else:
  print(N/2+1)

Submission status: Runtime Error

Solution code:
N = input()
if N % 2 == 1:
	n = N + 1
else:
	n = N
print(int(n / 2))

Submission status: Runtime Error

Solution code:
a = input()
b = 0
while a >= 0:
	a -= 2
    b += 1
    if a == 1:
      break
else:
	print(b)
print(b + 1)

Submission status: Runtime Error

Solution code:
N = int(input())
if 
if N % 2 == 0:
    answer = N /2
else:
    answer = (N + 1) / 2

print(answer)

Submission status: Runtime Error

Solution code:
import math
n = input()
print(math.ceil(n/2))

Submission status: Runtime Error

Solution code:
import sys

def main(argv):
 #L = int(argv.pop())
 #tree = [int(s) for s in argv]
 n = int(argv[0])
 if n%2 == 0:
    print(n/2)
 else:
    print(n/2+1)

if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = str(input())
if n%2==0:
    print(n/2)
else:
    print(int(n/2)+1)

Submission status: Runtime Error

Solution code:
N = input()
if N % 2 == 1:
	n = N + 1
else:
	n = N
print(n / 2)

Submission status: Runtime Error

Solution code:
import sys

def main(argv):
 #L = int(argv.pop())
 #tree = [int(s) for s in argv]
 n = argv[1]
 if n%2 == 0:
    print(n/2)
 else:
    print(n/2+1)

if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())

if n % 2 >  :
  print(n // 2 + 1)
else:
  print(n // 2)

Submission status: Runtime Error

Solution code:
a = input()
n, mod = divmod(a, 2)
print(n if mod == 0 else n + 1)

Submission status: Runtime Error

Solution code:
N = input()
if N % 2 == 0:
  print(N/2)
else:
  print(N//2 ＋1）

Submission status: Runtime Error

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

        a = int(sys.stdin.readline().strip())
        n, mod = divmod(a, 2)
    print(n if mod == 0 else n + 1)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define inar ll ar[n];for(ll i=0;i<n;i++) cin>>ar[i];
#define loop for(ll i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(NULL);
  #define endl "\n"
  #define inf ll(1e19)
  #define mod int(1000000007)
 typedef long long int ll;
using namespace std;
int main()
{
	
	int n;
	cin>>n;
	cout<<n/2+(n%2);
}

Submission status: Runtime Error

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

        a = int(sys.stdin.readline().rstrip())
        n, mod = divmod(a, 2)
    print(n if mod == 0 else n + 1)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:

def a(n):

    return -(-n // 2)

def main():
    n = int(input())¥
    print(a(n))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n = input()
return (n // 2) + (n % 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

if N % 2 == 1
print(N // 2 + 1)
else 
print(N // 2)

Submission status: Runtime Error

Solution code:
m = int(input())


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

Submission status: Runtime Error

Solution code:
n = input()
if n%2==0:
  print(n/2)
else:
  print(n//2+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
x = int(N/2)
print(x)

Submission status: Runtime Error

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

// GNU C Compiler
//template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

// type
using ll = int_fast64_t;
using ull = uint_fast64_t;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
//using pair<T1, T2> = p12;

//container
#define PB emplace_back
#define MP make_pair 
#define SZ(a) int((a).size())
#define ALL(v) v.begin(),v.end()

//repetition
#define REP(n) for(int i=0; i<(n); i++)
#define REPj(n) for(int j=0; j<(n); j++)
#define REPinit(i,a,n) for(int i=(a); i<(n); i++)
#define REPinitj(j,a,n) for(int j=(a); j<(n); j++)

//algorithm
//#define SORT(c) sort((c).begin(),(c).end())

//constant

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//Optimizer
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

/*
    add utility Algorithm
*/

int main(int argc, char const* argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;

    cout << ((N + 2 - 1) / 2)   << endl;


    return 0;
}

Submission status: Runtime Error

Solution code:
N = int(input())

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

Submission status: Runtime Error

Solution code:
N , R = tuple(list(map(int, input().split(' '))))
if N >= 10:
    print(R)
else:
    print(R + 100 * (10 - N))

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left
INF = float('inf')

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

Submission status: Runtime Error

Solution code:
import bisect, collections

def solution():
    n = input().strip()
    print(n//2)
    

    

def main():    
    # T = int(input().strip())
    for _ in range(1):
        solution()
    

main()

Submission status: Runtime Error

Solution code:
N=input()

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

Submission status: Runtime Error

Solution code:
N = int(input())
if(n%2 ==0):
  print(n/2)
else:
  print((n/2)+1)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
 
typedef pair<ll,ll> pairs;
vector<pairs> p;
bool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
    return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N]={0};
 
ll fib(ll a){
    if (fibl[a]!=0)return fibl[a];
    if (a==0){
        return 0;
    }else if (a==1){
        return 1;
    }
    return fibl[a]=fib(a-1)+fib(a-2);
}
 
ll eratosthenes(ll n) {
    int p = 0;
    for (ll i=0; i<=n; ++i) x[i] = true;
    x[0] = x[1] = false;
    for(int i=2; i<=n; ++i) {
        if(x[i]) {
            p++;
            for(int j=2*i; j<=n; j+=i) x[j] = false;
        }
        
        num[i] = p;
    }
    return p;
}
 
ll gcd(ll a,ll b){
    if (a%b==0)return(b);
    else return(gcd(b,a%b));
}
 
ll keta(ll N){
    int tmp{};
    while( N > 0 ){
        tmp += ( N % 10 );
        N /= 10;
    }
    N = tmp;
    return N;
}
 
int main(){
    ll n,x;
    cin >> n;
    x=n/2;
    if (n%2==1)x+=1;
    cout << x << endl;
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

#define select(_1, _2, x, ...) x

#define repn(i, n) for (int i = 0; i < (n); i++)
#define repr(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, ...) select(__VA_ARGS__, repr, repn)(i, __VA_ARGS__)

#define rrepn(i, n) for (int i = (n - 1); i >= 0; i--)
#define rrepr(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define rrep(i, ...) select(__VA_ARGS__, rrepr, rrepn)(i, __VA_ARGS__)

#define all(v) v.begin(), v.end()
#define debug(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;

const int INF = 1e9;
const ll LINF = 1e18;


int main() {
    int n;
    cin >> n;

    cout << (int)((n + 1) / 2) <<  endl;

    return 0;
}

Submission status: Runtime Error

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

        a = int(sys.stdin.readline().rstrip())

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


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n = int(input)

print(round(n/2))

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
from statistics import median,median_high,median_low
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
n=ii()
if n%2==0:
    print(n//2)
else:
    print((n+1)//2)

Submission status: Runtime Error

Solution code:
n = int(input())
print n//2

Submission status: Runtime Error

Solution code:
from collections import deque
import collections
from collections import Counter
import bisect
import math
import fractions
import itertools
import scipy
import numpy
from scipy.special import comb

N=int(input())
if(N%2==1):
    print((N//2)+1)
else:
    print(N//2)

Submission status: Runtime Error

Solution code:
-(-int(input())) // 2import sys
input = sys.stdin.readline
print(-(-int(input()) // 2))

Submission status: Runtime Error

Solution code:
N=int(input())
S=N%2
if S==0:
  print(N//2)
else:
  print(N//2)+1

Submission status: Runtime Error

Solution code:
n = int(input())
print(ceil(n/2))

Submission status: Runtime Error

Solution code:
import math
print(ceil(int(input()) / 2))

Submission status: Runtime Error

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

#define ASC(vec) vec.begin(), vec.end()		// 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend()	// 降順ソート 例:sort(DESC(vec));
#define rep(i, n) for(int i = 0; i < (n); i++)
#define Rep(i, n) for(int i = 1; i < n; i++)

const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;

using ii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vii = vector<pair<int, int>>;

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return (a * b) / GCD(a, b); }
int round_int(int a, int b) { return (a + (b - 1)) / b; }

// 素因数分解; 返り値は(素数, 乗数)のvector配列
vector<pair<ll, int>> factorize(ll n) {
	vector<pair<ll, int>> res;
	for (ll i = 2; i * i <= n; ++i) {
		if (n % i) continue;
		res.emplace_back(i, 0);
		while (n % i == 0) {
			n /= i;
			res.back().second++;
		}
	}
	if (n != 1) res.emplace_back(n, 1);
	return res;
}

constexpr array<int, 9> dx = { 0, 1, 0, -1, -1, 1, 1, -1, 0 };
constexpr array<int, 9> dy = { 1, 0, -1, 0, 1, 1, -1, -1, 0 };
constexpr auto MAX = 100010;

// ──────────────────────────────────────────────────────────────────

int main() {
	int n;
	cin >> n;
	cout << round_int(n, 2) << endl;
}

Submission status: Runtime Error

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