TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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?

Submission attempts (in order):
bingo = []
for i in range(3):
    array = list(map(int, input().strip().split()))
    bingo.append(array)

N = int(input())
number = []

for j in range(N):
    number.append(int(input()))

result = []
for n in range(N):
    for t in range(3):
        for y in range(3):
            if(bingo[t][y] == number[n]):
                result.append([t,y])

bingo_a = 'No'
for r in range(len(result)):
    for t in range(3):
        t_a = 0
        for y in range(3):
            if(result[r][0] == t or result[r][1] == y):
                t_a = t_a + 1
        if(t_a == 3):
            bingo_a = 'Yes'

for r in range(len(result)):
    for y in range(3):
        y_a = 0
        for t in range(3):
            if(result[r][0] == t or result[r][1] == y):
                y_a = y_a + 1
        if(y_a == 3):   
            bingo_a = 'Yes'

ans = 0
for rr in range(len(result)):
    if(result[rr][0] == 0 or result[rr][1] == 0):
        ans = ans + 1
    if(result[rr][1] == 1 or result[rr][1] == 1):
        ans = ans + 1
    if(result[rr][0] == 2 or result[rr][1] == 2):
        ans = ans + 1
if(ans == 3):
    bingo_a = 'Yes'

ans = 0
for rr in range(len(result)):
    if(result[rr][0] == 0 or result[rr][1] == 2):
        ans = ans + 1
    if(result[rr][1] == 1 or result[rr][1] == 1):
        ans = ans + 1
    if(result[rr][0] == 2 or result[rr][1] == 0):
        ans = ans + 1
if(ans == 3):
    bingo_a = 'Yes'

print(bingo_a)
print(result)

bingo = []
for i in range(3):
    array = list(map(int, input().strip().split()))
    bingo.append(array)

N = int(input())
number = []

for j in range(N):
    number.append(int(input()))

result = []
for n in range(N):
    for t in range(3):
        for y in range(3):
            if(bingo[t][y] == number[n]):
                result.append([t,y])

bingo_a = 'No'
t_a = 0
for r in range(len(result)):
    for t in range(3):
        for y in range(3):
            if(result[r][0] == t and result[r][1] == y):
                t_a += 1
        if(t_a == 3):
            bingo_a = 'Yes'

y_a = 0
for r in range(len(result)):
    for y in range(3):
        for t in range(3):
            if(result[r][0] == t and result[r][1] == y):
                y_a += 1
        if(y_a == 3):   
            bingo_a = 'Yes'

ans = 0
for rr in range(len(result)):
    if(result[rr][0] == 0 or result[rr][1] == 0):
        ans = ans + 1
    if(result[rr][1] == 1 or result[rr][1] == 1):
        ans = ans + 1
    if(result[rr][0] == 2 or result[rr][1] == 2):
        ans = ans + 1
if(ans == 3):
    bingo_a = 'Yes'

ans = 0
for rr in range(len(result)):
    if(result[rr][0] == 0 or result[rr][1] == 2):
        ans = ans + 1
    if(result[rr][1] == 1 or result[rr][1] == 1):
        ans = ans + 1
    if(result[rr][0] == 2 or result[rr][1] == 0):
        ans = ans + 1
if(ans == 3):
    bingo_a = 'Yes'

print(bingo_a)

N = int(input())
print(int(N / 2 + 0.5))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())

if n%2 == 0:
    print(n/2)
else:
    print(math.floor(n/2)+1)

n = int(input())

if n%2 == 0:
    print(n/2)
else:
    print(math.floor(n/2)+1)

import math

n = int(input())

if n%2 == 0:
    print(n//2)
else:
    print(math.floor(n//2)+1)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

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

N = int(input())
if N%2==0:
  print('{:.0f}'.format(N/2))
else:
  print('{:.0f}'.format((N+1)/2))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
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')

n = int(input())

ans = n // 2

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
-((-int(input()))//2)

print(-((-int(input()))//2))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a1 = na()
a2 = na()
a3 = na()

A = a1+a2+a3
C = [0,0,0,0,0,0,0,0,0]

n = ni()

for i in range(n):
    b = ni()
    if b in A:
        C[A.index(b)] = 1
    if sum(C[0:3]) == 3 or sum(C[3:6])==3 or sum(C[6:9]) == 3 or sum(C[::4]) == 3 or sum(C[2:7:2]) == 3 or sum(C[0::3]) == 3 or sum(C[1::3]) == 3 or sum(C[2::3]) == 3:
        print('Yes')
        exit()

print("No")

import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n = ni()
print((n+1)//2)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,m=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(m)]
if n == 1:
  start,end = 0,9
elif n == 2:
  start,end = 10,99
else:
  start,end = 100, 999

for i in range(start, end+1):
  flg = True
  for j in l:
    si = str(i)
    if len(si) < j[0]:
      flg = False
      continue

    if si[j[0]-1] != str(j[1]):
      flg = False
      
  if flg == True:
    print(i)
    break
else:
  print(-1)


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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
s=input()
if s+%2==0:
  print(s/2)
  else:
    print((s+1)/2)

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

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
#!/usr/bin/env python3


def main():
    N = map(int, open(0).read().split())
    print(-(-N // 2))


main()


#!/usr/bin/env python3


def main():
    N = int(input())
    print(-(-N // 2))


main()


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
A = []
A11,A12,A13 = map(int, input().split())
A21,A22,A23 = map(int, input().split())
A31,A32,A33 = map(int, input().split())
N = int(input())
B = []
for i in range(N):
  B.append(int(input()))
  
A = [[A11,A12,A13],
     [A21,A22,A23],
     [A31,A32,A33]]

sets = []

for i in range(3):
  s = []
  for j in range(3):
  	s.append(A[i][j])
  sets.append(s)
  
for j in range(3):
  s = []
  for i in range(3):
  	s.append(A[i][j])
  sets.append(s)
  
sets.append([A11,A22,A33])
sets.append([A13,A22,A31])

for s in sets:
  count = 0
  for b in B:
    if b in s : 
      count+=1
  if count == 3:
    print("Yes")
    break
else:
  print("No")

N = input()
print(N // 2 + N % 2)

N = int(input())
print(N // 2 + N % 2)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N = input()
N = N /2
print(N)

N = input()
N = int(N) /2 + int(N)%2
print(N)

N = input()
N = int(N) //2 + int(N)%2
print(N)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
print(int((N-N%2)/2))

N = int(input())
print(int((N-N%2)/2+ N%2))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
N = N / 2 + N % 2
print(N)

N = int(input())
N = int(N / 2 + N % 2)
print(N)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
print(int(n/2))

n = int(input())
print(round(n/2))

import math
n = int(input())
print(math.ceil(n/2))

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
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)

import sys
import math
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 = i()
print(n//2 if n%2==0 else n//2+1)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N = input()

print(N//2 + N % 2)

N = int(input())
 
print(N//2 + N % 2)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N = input()
if N % 2 == 1:
  a = 1
else:
  a = 0
print(N//2+a)

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
print(int(input)+1//2)

print((int(input())+1)//2)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
print(n // 2)

n = int(input())
print((n + 1) // 2)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, m = map(int, input().split())
s = [0] * m
c = [0] * m
tmp = [0] * m

for i in range(m):
    s[i], c[i] = map(int, input().split())
    
for x, y in zip(s, c):
    if tmp[x-1]==0:
        tmp[x-1] = y
    elif tmp[x-1]==y:
        continue
    else:
        print(-1)
        exit()

ans = 0

for i, a in enumerate(tmp[::-1]):
    ans += a*10**(i)

if n==1 & ans==0:
    print(ans)
elif ans // 10**(m-1) < 1:
    print(-1)
    exit()
    
print(ans)

import sys
n, m = map(int, input().split())
S = [0] * m
C = [0] * m
tmp = [0] * n

for i in range(m):
    S[i], C[i] = map(int, input().split())

for s, c in zip(S, C):
    if tmp[s-1] == 0:
        tmp[s-1] = c
    elif tmp[s-1] == c:
        pass
    else:
        print(-1)
        sys.exit()

ans = 0
for i, a in enumerate(tmp[::-1]):
    ans += a*10**(i)

print(ans)

import math
print(math.ceil(int(input())/2))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
for i in range(1,101):
    if i % 2 != 0:
        ans = (i//2)+1
    if i % 2 == 0:
        ans = (i//2)
    print(round(ans,2))

A11,A12,A13,A21,A22,A23,A31,A32,A33 = map(int,input().split(" "))
bingo = [A11,A12,A13,A21,A22,A23,A31,A32,A33]
bingo = ",".join(map(str,bingo))
N = int(input())
for i in range(N):
    b = input()
    if b in bingo:
        bingo.replace(b,True)
    else:
        pass
Bingo = bingo.split(",")
Flag = False
if Bingo[0] == Bingo[1] == Bingo[2]==True:
    Flag = True
if Bingo[3] == Bingo[4] == Bingo[6]==True:
    Flag = True
if Bingo[6] == Bingo[7] == Bingo[8]==True:
    Flag = True
if Bingo[0] == Bingo[3] == Bingo[6]==True:
    Flag = True
if Bingo[1] == Bingo[4] == Bingo[7]==True:
    Flag = True
if Bingo[2] == Bingo[5] == Bingo[8]==True:
    Flag = True
if Bingo[0] == Bingo[4] == Bingo[8]==True:
    Flag = True
if Bingo[2] == Bingo[4] == Bingo[6]==True:
    Flag = True
else:
    pass
if flag == True:
    print("Yes")
else:
    print("No")

N = int(input())
if N % 2 != 0:
    ans = (N//2)+1
if N % 2 == 0:
    ans = (N//2)
print(round(ans,N))


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N=int(input())

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

N=int(input())

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
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")

    




N=int(input())

print(-(-N//2))
 
    


    

    




Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):

def main():
    n = int(input())
    print((n+1)/2)

if __name__ == "__main__":
    main()


def main():
    n = int(input())
    print((n+1)//2)

if __name__ == "__main__":
    main()

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())

print(n/2 + n%2)

n = int(input())

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
a=int(input())
print(int(a/2))


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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = input()
if n % 2 == 0:
  print(n/2)
else:
  print(n//2 + 1)

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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, M = map(int,(input().split()))
table = [input().split() for l in range(M)]
ans = 0
array1 = []
array2 = []
array3 = []
keta1 = -1
keta2 = -1
keta3 = -1
s1 = 0
s2 = 0
s3 = 0
for k in range(M):
    for j in range(2):
        table[k][j] = int(table[k][j])

for k in range(M):
    if table[k][0] == 1:
        if table[k][1] == 0 or (not(table[k][1] in array1) and s1 == 1):
            keta1 = -1
        else:
            keta1 = table[k][1]
        s1 = 1
        array1.append(table[k][1])

    elif table[k][0] == 2:
        if not(table[k][1] in array2) and s2 ==1:
            keta2 = -1
        else:
            keta2 = table[k][1]
        s2 = 1
        array2.append(table[k][1])
    else:
        if not(table[k][1] in array3) and s3 == 1:
            keta3 = -1
        else:
            keta3 = table[k][1]
        s3 = 1
        array3.append(table[k][1])

if s1 != 1:
    keta1 = 1
if s2 != 1:
    keta2 = 0
if s3 != 1:
    keta3 = 0

if keta1 == -1 or keta2 == -1 or keta3 == -1:
    ans = -1
else:
    ans = keta1 * 100 + keta2 * 10 + keta3

print(ans)

N = int(input())
n = 0

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

print(int(n))

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
x = n//2
n =n%2 
print(x+y)

N = int(input())
print(N//2)

n = int(input())
x = n//2
n =n%2 
print(x+n)


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())

print(n//2)

n = int(input())

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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
print(int(n/2))

n = int(input())
print(int((n+1)/2))

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
print((n/2)+1)

n = int(input())
print((n+1)//2)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())

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

N = int(input())

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
ans = n // 4 if n % 4 == 0 else n // 4 + 1
print(ans)


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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
print(N / 2 + N % 2)

N = int(input())
print(N // 2 + N % 2)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
does not name a type

N = int(input())

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

                
if __name__ == "__main__":
    main()



Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
print(((int(input())+1)//2)

print((int(input())+1)//2)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
#!/usr/bin/env python

def func():
    n,m = [int(i) for i in input().split(" ")]
    pibot = 10**(m-1)
    dic = {}

    for i in range(m):
        tmp = [int(i) for i in input().split(" ")]

        if tmp[0] not in dic.keys():
            dic[tmp[0]] = tmp[1]
        else:
            if dic[tmp[0]] != tmp[1]:
                print("-1")
                return

    a = [0] * m
    for key in dic.keys():
        a[key-1] = dic[key]

    tmp_s = ""
    for i in a:
        tmp_s += str(i)

    if int(tmp_s) < pibot:
        tmp_s = "-1"

    print(tmp_s)

if __name__ == "__main__":
    func()

#!/usr/bin/env python

n, m = input().split(" ")
n = int(n)
m = int(m)
s_len = []
c_len = []
dig = 10**(n-1)

for i in range(m):
    tmp = input().split(" ")
    s_len.append(int(tmp[0]))
    c_len.append(int(tmp[1]))

c_t = 0
for i in c_len:
    c_t += int(i)

for i in range(dig-1, dig*10):
    flag = False
    for j,s in enumerate(s_len):
        if str(i)[s-1] != str(c_len[j]) and flag == False:
            flag = True
            break
    if flag==False:
        print(i)
        exit()

print("-1")

#!/usr/bin/env python

import math

n = int(input())
print(math.ceil(n/2))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N = input()
x = int(N/2)
print(x)

import collections

N = int(input())
S = input()
Q = int(input())
querys = [list(map(str, input().split())) for i in range(Q)]
for i in range(Q):
    query = querys[i]
    if query[0] == "1":
        qi = int(query[1])
        S = S[:qi-1] + query[2] + S[qi:]
    else:
        c = collections.Counter(S[int(query[1]) - 1:int(query[2])])
        print(len(c))

N = input()

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,m=map(int,input().split())
L=[10]*n
for i in range(m):
	s,c=map(int,input().split())
	if L[s-1]==10 or L[s-1]==c:
		L[s-1]=c
	else:
		print('-1')
		exit()
if n==1:
	if L[0]==10:
		print(0)
		exit()
	else:
		print(L[0])
		exit()
else:
	if L[0]==10:
		L[0]=1
	elif L[0]==0:
		print('-1')
		exit()
	else:
		for i in range(1,n):
			if L[i]==10:
				L[i]=0
	print(''.join(map(str,L)))

n=int(input())
print((n+2-1)//2)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n=int(input())

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

n=int(input())

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
print(int(N+1)/2)

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())

n = n // 2 + 1

n

n = int(input())

n= n//2 + n%2


n

n = int(input())

print(n//2 + n%2)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):

from collections import deque


N, M, K = map(int, input().split())
friend = [list(map(int,input().split())) for _ in range(M)]
block = [list(map(int, input().split())) for _ in range(K)]

#print(friend)
#print(block)
graph = [[] for _ in range(N)]
bgraph = [[] for _ in range(N)]
cnt = []
for i in range(M):
    ii, jj = friend[i]
    graph[ii-1].append(jj-1)
    graph[jj-1].append(ii-1)

for i in range(K):
    ii, jj = block[i]
    bgraph[ii-1].append(jj-1)
    bgraph[jj-1].append(ii-1)

#print(graph)
#print(bgraph)

seen = [False for _ in range(N)]

def dfs(i):
    #if i not in bgraph[j]:
    
    #else:
    
    #if graph[i]:
    #    for nec in graph[i]:
    
    #            dfs(nec,j)
    seen[i] = True
    que = deque([i])
    while que:

        neci = que.pop()
        for nec in graph[neci]:
            if seen[nec]== False:
                if nec not in bgraph[i]:
                    seen[nec]=True
                else:
                    seen[nec]="block"
                que.append(nec)

for i_n in range(N):
    seen = [False for _ in range(N)]
    dfs(i_n)
    
    cnt.append(seen.count(True) - 1 - len(graph[i_n]))

print(*cnt)


N = int(input())

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
import sys
input=sys.stdin.readline
n,m,k = map(int,input().split())
ab = [list(map(int,input().split())) for i in range(m)]
cd = [list(map(int,input().split())) for i in range(k)]
num = [0]*(n+1)
g = [[] for i in range(n+1)]
uf = UnionFind(n+1)
for a,b in ab:
  g[a].append(b)
  g[b].append(a)
  uf.union(a,b)
for c,d in cd:
  if uf.same(c,d) == True:
    g[c].append(d)
    g[d].append(c)
for i in range(1,n+1):
  print(uf.size(i)-len(g[i])-1,end=" ")


print((int(input())+1)//2)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
if n % 2 ==0:
    print(n/2)
else:
    print((n+1)/2)

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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n=int(input())
if n%2==0:
  print(n/2)
else:
  print(n/2+1)

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n=int(input())
print(n//3+n%2)

n=int(input())
print(n//2+n%2)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())

print(round(n/2))


import numpy as np
n = int(input())

print(int(np.ceil(n/2)))


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n=int(input(n))
print(n//2+n%2)

n = int(input())
print(n//2+n % 2)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
page_N = input("Please Number")
min_page = round(page_N / 2)
print(min_page)

import math

N = [int(input()) for i in range(100)]
min_page = math.ceil(N/2)
print(min_page)


import math
N = input()
min_page = math.ceil(N/2)
print(min_page)

import math
N = int(input())
min_page = math.ceil(N/2)
print(min_page)


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N=input("")
try:N=int(N)
if 1<=N<=100:
  if N%2==0:
    N=N/2
    N=int(N)
    print(N)
  else:
    N=(N+1)/2
    N=int(N)
    print(N)
else:
  None
except:
  None

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

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

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


Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(intput())
res = n // 2
if n % 2 == 1:
  res += 1
print(res)


n = int(intput())
res = n // 2
if res % 2 == 1:
  res += 1
print(res)

n = int(input())

res = n //2 

if n%2 == 1:
  res += 1
  
return res

n = int(intput())
res = n // 2
if n % 2 == 1:
  res += 1
print(res)


n = int(intput())

res = n // 2
if res % 2 == 1:
  res += 1
  
print(res)

n = int(intput())
res = n // 2
if n % 2 == 1:
  res += 1
print(res)


n = int(input())

res = n//2
if res % 2 == 1:
  res += 1

return res

n = int(intput())
res = n // 2
if n % 2 == 1:
  res += 1
print(res)

n = int(input())
res = n // 2
if n % 2 == 1:
  res += 1
print(res)


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
number = []
result = "No"

for i in range(3):
	for n in input().split():
		n = int(n)
		number.append(n)

bingo = [None for _ in range(9)]

N  = int(input())
for i in range(N):
	b = int(input())
	for j in range(9):
		if b == number[j]:
			bingo[j] = True


for i in range(3):
	if bingo[3*i] == bingo[3*i+1] and bingo[3*i+1] == bingo[3*i+2] and bingo[3*i] == True:
		result = "Yes"

for i in range(3):
	if bingo[i] == bingo[3+i] and bingo[3+i] == bingo[6+i] and bingo[i] == True:
		result = "Yes"

if bingo[0] == bingo[4] and bingo[4] == bingo[8] and bingo[0] == True:
	result = "Yes"

if bingo[2] == bingo[4] and bingo[4] == bingo[6] and bingo[2] == True:
	result = "Yes"

print(result)


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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,m=map(int,input().split())
list=[list(map(int,input().split())) for _ in range(m)]
flag=False
ans=['0']*n
for i in range(m):
  if list[i][0]==n:
    flag=True
  for j in range(i+1,m):
    if list[i][0]==list[j][0] and list[i][1]!=list[j][1]:
      print('-1')
      exit()
  ans[list[i][0]-1]=str(min(int(ans[list[i][0]-1]),list[i][1]))
if flag==True:
  print(''.join(ans))
else:
  print('-1')

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())

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

N = int(input())

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
if n % 2 == 0:
    print(n//2+1)
else:
    print(n//2)

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
import math
print(math.celi(N/2))

N = int(input())
import math
print(math.ceil(N/2))

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, m = map(int, input().split())
sc = [list(map(int, input().split())) for i in range(m)]
l = []
l2 = []
l3 = [0 for i in range(n)]
cnt = 0
if (m == 0 and n == 1) or (n == 1 and m == 1 and sc[0] == [1, 0]):
    print(0)
    exit()
for i in sc:
    if i[0] == 1 and i[1] == 0:
        print(-1)
        exit()
    elif i[0] in l and l2[l.index(i[0])] != i[1]:
        print(-1)
        exit()
    else:
        l.append(i[0])
        l2.append(i[1])
        l3[i[0] - 1] = i[1]
        cnt += 1
if l3[0] == 0:
    l3[0] = 1
print(*l3, sep="")

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
a = str(input())

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

a = int(input())
b = int(a / 2)
c = int((a + 1) / 2)

if a % 2 == 0:
    print(b)
else:
    print(c)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
print(n+1//2)

n = int(input())
print((n+1)//2)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import numpy as np

N=int(input())
#a = list(map(int, input().split()))
m = N%2 
if (m == 0):
    print(N/2)
else:
    print(N/2+1)
#for x in range(0,N,1):

import numpy as np

N=int(input())
#a = list(map(int, input().split()))
m = N%2 
if (m == 0):
    print(int(N/2))
else:
    print(int(N/2+1))
#for x in range(0,N,1):

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n=int(input())
if n%2==0:
  print(n/2)
else:
  print(n/2+1)

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
number=int(input())
print(number//2 if number%2==0 (number//2)+1 else number%2==1)

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
a = int(input())
print(a + 1 // 2)

a = int(input())
print((a + 1) // 2)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
a=int(input())
if a%2==0:
  ans=a/2
else:
  ans=(a-1)/2+1
print(ans)

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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
print((int(input)+1)//2)

print((int(input())+1)//2)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, m = map(int, input().split())
req = [list(map(int, input().split())) for i in range(m)]
for i in range(10000):
    st = str(i)
    if len(st) != n:
        continue
    ok = True
    for s, c in req:
        if int(st[s-1]) != int(c):
            ok = False
    if ok:
        print(st)
        exit(0)

print(-1)

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, m = map(int, input().split())

lis = []
for i in range(m):
    lis.append(list(map(int, input().split())))
    
ans = [0,0,0]
if n == 2:
    ans[1] = 1
elif n == 3:
    ans[0] = 1
    
k = 0
out = []

for i in lis:
    if i[0] not in out:
        ans[int(i[0]-1)] = int(i[1])
        out.append(i[0])
    elif i[0] in out and i[1] != ans[i[0]-1]:
        k += 1

inte = ans[0] * 100 + ans[1]*10 + ans[2]
    
    
if inte > 0 and k ==0:
    print(inte)
else:
    print(-1)


f = list(map(int, input().split()))
s = list(map(int, input().split()))
t = list(map(int, input().split()))
n = int(input())
k = []
for i in range(n):
    k.append(int(input()))

lis = []

lis.append(f)
lis.append(s)
lis.append(t)

ans = 0

for i in lis:
    c =0
    for n in range(len(i)):
        if i[n] in k:
            i[n] = 'X'
            c += 1
            if c == 3:
                ans +=1
                break

if f[0] == 'X' and s[0] == 'X' and t[0] == 'X':
    ans +=1
elif f[1] == 'X' and s[1] == 'X' and t[1] == 'X':
    ans += 1
elif f[2] == 'X' and s[2] == 'X' and t[2] == 'X':
    ans += 1
elif f[0] == 'X' and s[1] == 'X' and t[3] == 'X':
    ans += 1
elif f[3] == 'X' and s[2] == 'X' and t[1] == 'X':
    ans += 1
    
if ans >= 1:
    print('Yes')
else:
    print('No')
        

n = int(input())

p = n//2 + n%2
print(p)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
# -*- coding: utf-8 -*-
a = []
for i in range(3):
  tmp = input()
  a.append(list(map(int, tmp.split())))

n = int(input())
b = []
for j in range(n):
    b.append(int(input()))

# print(a)
# print(b)

for i in range(3):
    for j in range(3):
        if a[i][j] in b:
           a[i][j] = 0
# print(a)

def check(a):
    
    for i in range(3):
        if (a[i][0] == 0 & a[i][1] == 0 & a[i][2] == 0):
            print('Yes')
            exit()
    
        if a[i] == [0, 0, 0]:
            print('Yes')
            exit()
    
    if a[0][0] == 0 & a[1][1] == 0 & a[2][2] == 0:
            print('Yes')
            exit()
    if a[0][2] == 0 & a[1][1] == 0 & a[2][0] == 0:
            print('Yes')
            exit()
    print('No')

check(a)

n = int(input())

def calc(n):
    if n % 2 != 0:
        return int(n / 2) + 1
    else:
        return int(n / 2)

print(calc(n))


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
print(N//2)

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
a=int(input())
b=int2((a+1)/2)
print(b)

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

# -*- coding: utf-8 -*-
a=int(input())
b=int((a+1)/2)
print(b)

Verdicts: Runtime Error

Runtime Error

Accepted