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

def main():
  N=int(input())
  S=str(input())
  Q=int(input())
  Q1=[]
  Q2=[]
  Q3=[]
  for i in range(Q):
    i1,i2,i3=map(str,input().split())
    Q1+=[i1]
    Q2+=[i2]
    Q3+=[i3]
  Slist=[]
  for i in range(N):
    Slist+=[S[i]]
  tf=[[0 for  i in range(26)] for i in range(N+1)]
  for i in range(1,N):
    n=ord(Slist[i])-97
    tf[i][n]=tf[i-1][n]+1
  for i in range(Q):
    if int(Q1[i])==1:
      n=ord(Slist[int(Q2[i])-1])-97
      tf[int(Q2[i])-1][n]-=1
      Slist[int(Q2[i])-1]=Q3[i]
      n=ord(Q3[i])-97
      tf[int(Q2[i])-1][n]+=1
    elif int(Q1[i])==2:
      l=Q2[i]-2
      r=Q3[i]-1
      t=0
      for i in range(26):
        if tf[r][i]>tf[l][i]:
          t+=1
      print(t)
if __name__ == '__main__':
  main()


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):
from copy import deepcopy

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

def search(i, friends):
    copied_friends = deepcopy(friends)
    res = []
    for a, b in friends:
        if a == i:
            copied_friends.remove([a, b])
            res.append(b)    
        if b == i:
            copied_friends.remove([a, b])
            res.append(a)
    
    return res, copied_friends

    
def find(i, j, friends):
    for a, b in friends:
        if a == i and b == j:
            return True
        if b == i and a == j:
            return True
    
    return False

    
def dfs(i, friends):
    if len(friends) == 0:
        return [i]

    targets, new_friends = search(i, friends)
    for t in targets:
        if targets.count(t) <= 1:
            targets += dfs(t, new_friends)
        
    return targets


results = []
for i in range(1, N+1):
    targets = list(set(dfs(i, FRIENDS)))
    targets = filter(lambda x: not find(x, i, FRIENDS), targets)
    targets = filter(lambda x: not find(x, i, BLOCKS), targets)

    results.append(len(list(targets)))

print(" ".join(map(str, results)))

import math
N = int(input())
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 = int(input())

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

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

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

i = input()
a = int(i)//2
b = int(i)%2
print(a+b)

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):
m = int(input())

# n = list(map(int, input().split()))
print(m//2)


m = int(input())


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


m = int(input())

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

else:
  print((1+n)/2)

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

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

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

Wrong Answer

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):
import sys
n, m = map(int, input().split())
r = [-1] * n

for _ in range(m):
    s, c = map(int, input().split())
    if r[s-1] == -1 or r[s-1] == c:
        r[s-1] = c
    else:
        print(-1)
        sys.exit(0)

if r[0] == 0:
    print(-1)
    sys.exit(0)
if r[0] == -1 and n > 1:
    r[0] = 1

n_r = [0 if i == -1 else i for i in r]
result = ''.join([str(i) for i in n_r])
print(result)

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):
import sys
from io import StringIO
import unittest

class UnionFind():
    
    
    def __init__(self, n):
        self.n = n
        
        
        self.root = [-1]*(n+1)
        
        self.rnk = [0]*(n+1)

    
    def Find_Root(self, x):
        if(self.root[x] < 0):
            return x
        else:
            
            self.root[x] = self.Find_Root(self.root[x])
            return self.root[x]
    
    def Unite(self, x, y):
        
        x = self.Find_Root(x)
        y = self.Find_Root(y)
        
        if(x == y):
            return 
        
        elif(self.rnk[x] > self.rnk[y]):
            self.root[x] += self.root[y]
            self.root[y] = x

        else:
            self.root[y] += self.root[x]
            self.root[x] = y
            
            if(self.rnk[x] == self.rnk[y]):
                self.rnk[y] += 1
    
    def isSameGroup(self, x, y):
        return self.Find_Root(x) == self.Find_Root(y)

    
    def Count(self, x):
        return -self.root[self.Find_Root(x)]

def resolve():
    n,m,k=map(int, sys.stdin.readline().strip().split())
    #list(map(int,input().strip().split()))

    uf = UnionFind(n)

    res=[[] for i in range(n)]
    frd=[0 for i in range(n)]
    blk=[0 for i in range(n)]

    for i in range(m):
        #a,b=list(map(int,input().strip().split()))
        a,b=map(int, sys.stdin.readline().strip().split())
        a-=1
        b-=1
        uf.Unite(a,b)
        frd[a]+=1
        frd[b]+=1
    
    for i in range(k):
        #a,b=list(map(int,input().strip().split()))
        a,b=map(int, sys.stdin.readline().strip().split())
        a-=1
        b-=1
        if uf.isSameGroup(a,b):
            blk[a]+=1
            blk[b]+=1
    
    rescnt=[]

    for i in range(n):
        ri=uf.Count(i)-1-blk[i]-frd[i]
        rescnt.append(str(ri))
        
    
    print(" ".join(rescnt))

resolve()

import sys
from io import StringIO
import unittest
import math

def resolve():
    n = int(input().strip())

    n = round(n/2 + 0.1)
    print(int(n))
    return

resolve()

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):
A11, A12, A13 = (int(x) for x in input().split())
A21, A22, A23 = (int(x) for x in input().split())
A31, A32, A33 = (int(x) for x in input().split())

N = int(input())

b_list = list()
for i in range(0, N):
    i = int(input())
    b_list.append(i)

A_list = [A11, A12, A13, A21, A22, A23, A31, A32, A33]

for b in b_list:
    for i in range(0, 9):
        if A_list[i] == b:
            A_list[i] = 0

X, Y, Z = 0, 0, 0
for i in range(0, 3):
    k = 3 * i
    if A_list[k] + A_list[k + 1] + A_list[k + 2] == 0:
        X = X + 1
    elif A_list[i] + A_list[i + 3] + A_list[i + 6] == 0:
        Y = Y + 1
    elif A_list[0] + A_list[4] + A_list[8] == 0:
        Z = Z + 1
    elif A_list[2] + A_list[4] + A_list[6] == 0:
        Z = Z + 1
    else:
        continue

if (X+Y+Z) >= 1:
    print('Yes')
else:
    print('No')

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):
bingo = [ input().split() for j in range(3)]
N = int(input())
b = []
for n in range(N):
	b.append(input())
count = 0
total = 0
p = 'No'
for x in range(N):
	for i in range(3):
		for j in range(3):
			count = count + 1
			if bingo[i][j] == b[x]:
				total = total + count
	count = 0
	if total == 6 or total == 12 or total == 15 or total == 18 or total == 24 or total == 33 or total == 36 or total == 27 or total == 30 or total == 39 or total == 31 or total == 25 or total == 32:
		p = 'Yes'
		break
print(p)

N = int(input())
print(int(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 = int(input())

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


n = int(input())

if n % 2 == 0:
    print(int(n / 2))
elif n % 2 == 1:
    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)


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

mod=N%2
if(mod==0):
    num=N/2
    print(num)
elif(mod==1):
    num=N/2
    print(num+0.5)

import math

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

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

print(int((int(input())+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):
def main():
    N = int(input())
    if N%2 == 1:
      print((N+1)/2)
    else:
      print(N/2)
main()

def main():
    import itertools
    a = list(map(int,input().split()))
    b = list(map(int,input().split()))
    c = list(map(int,input().split()))
    d = [a[0],b[0],c[0]]
    e = [a[1],b[1],c[1]]
    f = [a[2],b[2],c[2]]
    g = [a[0],b[1],c[2]]
    h = [a[2],b[1],c[0]]
    n = int(input())
    listB = [int(input()) for x in range(n)]
    C = itertools.combinations(listB,3)
    if a in C or b in C or c in C or d in C or e in C or f in C or g in C or h in C:
      print("Yes")
    else:
      print("No")
main()

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

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

def main():
    import itertools
    a = tuple(map(int,input().split()))
    b = tuple(map(int,input().split()))
    c = tuple(map(int,input().split()))
    d = (a[0],b[0],c[0])
    e = (a[1],b[1],c[1])
    f = (a[2],b[2],c[2])
    g = (a[0],b[1],c[2])
    h = (a[2],b[1],c[0])
    A = set(a)
    B = set(b)
    C = set(c)
    D = set(d)
    E = set(e)
    F = set(f)
    G = set(g)
    H = set(h)
    n = int(input())
    listB = [int(input()) for x in range(n)]
    X = itertools.combinations(listB,3)
    R = set(list(X))
    if A in R or B in R or C in R or D in R or E in R or F in R or G in R or H in R:
      print("Yes")
    else:
      print("No")
main()

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

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

Verdicts: Wrong Answer

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):
N = int(input())
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):
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]

Size = 3
bingo = False
for row in a:
    if all(item in b for item in row):
        bingo = True
for col in zip(*a):
    if all(item in b for item in col):
        bingo = True
if all(a[i][i] in b for i in range(Size)):
    bingo = True
if all(a[i][Size - 1 - i] in b for i in range(Size)):
    bingo = True
 
print("Yes" if bingo else "No")

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

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())
A = N%2
B = int((N-A)/2)
print(B)

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

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:
    print((n+1)/2)
else:
    print(n/2)

n =int(input())

if n%2:
    print(int((n+1)/2))
else:
    print(int(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):
# -*- coding: <encoding name> -*-

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

# -*- coding: <encoding name> -*-

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

# -*- coding: <encoding name> -*-

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

# -*- coding: <encoding name> -*-

import math
n = int(input())
print(math.ceil(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=int(input())
print((n+2-1)/2)

n=int(input())
print(int((n+2-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())
n = N / 2

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

print (n);


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

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

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

print(round(N/2))

N = int(input())

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

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

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

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):
n = int(input())
re = (n + 1) / 2
print(re)

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

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) + 0.9))

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


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 0==n/2:
  n=n/2
  print(n)
else:
  n=n/2+1
  print(n)

import sys

def henkan(l1):
  maped_num = map(str,l1)
  s=''.join(maped_num)
  return s


keta,num = map(int,input().rstrip().split())
l=[]

if num ==0:
  print(num)
  sys.exit()
  
  
for i in range(keta):
  l.append("#")
  

for i in range(num):
    a,b = map(int,input().rstrip().split())
    a=a-1
    if l[a]=="#":
      l[a]=b 
    elif l[a] > b:
      l[a]=b     


      
if l[0] == "#":
  print("-1")
elif l[0] == 0:
  print("-1")
elif l[1]=="#":
  l[1]=0
  x=henkan(l)
  print(x)
elif l[2]=="#":
  l[2]=0
  x=henkan(l)
  print(x)
else:
  x=henkan(l)
  print(x)

  
  

  



n=int(input())

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

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/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):
page=int(input())
print(page/2)

page=int(input())
re=int((page/2.0)+0.5)
print(re)

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 /2

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

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

N = int(input())        

result = [[0,0,0],[0,0,0],[0,0,0]]      
for _ in range(N):      
    b = int(input())        
    for i in range(3):      
        for j in range(3):
            if b == card[i][j]:
                result[i][j] = 1

judge = "No"        

for i in range(3):      
    if result[i][0] * result[i][1] * result[i][2] == 1:
        judge = "Yes"

for i in range(3):      
    if result[0][i] * result[1][i]*result[2][i] == 1:
        judge = "Yes"

if result[0][0] * result[1][1] * result[2][2] == 1:     
    judge = "Yes"

if result[0][2] * result[1][1] * result[2][0] == 1:     
    judge = "Yes"

print(judge)    
 

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)

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

N = int(input())        

result = [[0,0,0],[0,0,0],[0,0,0]]      
for _ in range(N):      
    b = int(input())        
    for i in range(3):      
        for j in range(3):
            if b == card[i][j]:
                result[i][j] = 1

judge = "No"        

for i in range(3):      
    if result[i][0] * result[i][1] * result[i][2] == 1:
        judge = "Yes"

for i in range(3):      
    if result[0][i] * result[1][i]*result[2][i] == 1:
        judge = "Yes"

if result[0][0] * result[1][1] * result[2][2] == 1:     
    judge = "Yes"

if result[0][2] * result[1][1] * result[2][0] == 1:     
    judge = "Yes"

print(judge)    
 

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

N = int(input())        

result = [[0,0,0],[0,0,0],[0,0,0]]      
for _ in range(N):      
    b = int(input())        
    for i in range(3):      
        for j in range(3):
            if b == card[i][j]:
                result[i][j] = 1

judge = "No"        

for i in range(3):      
    if result[i][0] * result[i][1] * result[i][2] == 1:
        judge = "Yes"

for i in range(3):      
    if result[0][i] * result[1][i]*result[2][i] == 1:
        judge = "Yes"

if result[0][0] * result[1][1] * result[2][2] == 1:     
    judge = "Yes"

if result[0][2] * result[1][1] * result[2][1] == 1:     
    judge = "Yes"

print(judge)    
 

N = int(input())

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

n = int(input())

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

n = int(input())

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

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

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):
import math
page = int(input("num: "))
print(math.ceil(page/2))

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

import math
page = int(input())
print(math.ceil(page/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())
if N%2==0:
  print(N)
else :
  print(N+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())

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

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

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

a = int(input())
if a % 2 = 0:
  print(str(int(a//2)))
else:
  print(str(int(a//2)+1.0))

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

Verdicts: 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):
N = int(input())
check = N % 2
if check == 0:
  answer = N / 2
else:
  answer = (N + 1) / 2
print(answer)

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

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

n = int(input)

print(round(n/2))

n = int(input())
 
if n % 2 == 1:
  print(int((n+1)/2))
else:
  print(int(n/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):
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)

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

n = int(input())
print(int(n/2)+n%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):
N = int(input()) 
if N%2 ==1:
  N +=1
print(N/2)

def q1(N):
  if N%2 == 1:
    N = N+1
  print(N/2)
   	

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

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

N,M=input().split()
N,M=int(N),int(M)

guess = [] 
for i in range(N):
    guess.append(-1)
exits=True 
ans=-1

for i in range(M):
    s,c=input().split()
    
    s,c=int(s)-1,int(c)
    if guess[s]==-1 or guess[s]==c:
        guess[s]=c
    else:
        exits=False

if guess[0]==0 or guess[0]==-1 or M==0:
    exits=False 

if exits:
    ans=0
    for i in range(N):
        ans+= guess[i]*(10**(N-i-1)) if not guess[i]==-1 else 0
	
    if N==1:
        ans=c

print(ans)

N,M=input().split()
N,M=int(N),int(M)

guess = [] 
for i in range(N):
    guess.append(-1)
exits=True 
ans=-1

for i in range(M):
    s,c=input().split()
    
    s,c=int(s)-1,int(c)
    if guess[s]==-1 or guess[s]>c:
        guess[s]=c

if guess[0]==0 or guess[0]==-1 or M==0:
    exits=False 

if exits:
    ans=0
    for i in range(N):
        ans+= guess[i]*(10**(N-i-1)) if not guess[i]==-1 else 0
	
    if N==1:
        ans=c

print(ans)

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

Verdicts: Wrong Answer

Wrong Answer

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):
# -*- coding: utf-8 -*-
N = int(input())
g = N // 2
k = ( N + 1 ) // 1
if N % 2 == 0:
    print(g)
else:
    print(k)

# -*- coding: utf-8 -*-
N = int(input())
g = N // 2
k = ( N + 1 ) // 2
if N % 2 == 0:
    print(g)
else:
    print(k)

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(round(int(input())/2))

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

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 math
N = int(input().split())
print(math.ceil(N/2))

import math
N = int(input())
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 = int(input())
if n % 2 == 0:
  print(n / 2)
else:
  print((n+1)/2)

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


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

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


Verdicts: Wrong Answer

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):
a = int(input())
b = int(a / 4)
if (a % 4 !=0):
    b+=1
print(b)


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


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 math
print(ceil(int(input()) / 2))

x = int(input())
div, mod = divmod(x, 2)
if mod:
  div += 1
print(div)


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

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

N = int(input())

print(N//2) if N%2==0 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):
import math
n = input()
n = math.ceil(n / 2)
print(n)

import math
n = int(input())
n = math.ceil(n / 2)
print(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 = input()
if int(N) % 2 == 0:
  print(int(N) / 2)
else:
  print(int(N) / 2 + 0.5)

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

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+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, X = 6, 1
ARR = [1, 6, 1, 2, 0, 4]

N, X = 3, 3
ARR = [2, 2, 2]

N, X = 5, 9
ARR = [3, 1, 4, 1, 5]

N, X = 2, 0
ARR = [5, 5]

N, X = map(int, input().split())

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


def calculate(n, x, arr):
    result = 0
    for i in range(1, n):
        sSum = arr[i - 1] + arr[i]
        if sSum <= x:
            continue

        diff = sSum - x

        if diff <= arr[i]:
            arr[i] -= diff
            result += diff
        else:
            result += diff
            arr[i] = 0

    print(result)


calculate(N, X, ARR)


import math
N = int(input())

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=int(input())
if n%2==:
  print(n/2)
else:
  print(int(n/2)+1)  

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

n=int(input())
if n%2==0:
  print(int(n/2))
else:
  print(int((n+1)/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=int(input())
if N%2==0:
  print(N/2)
else:
  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):
for i in range(3):
    a = []
    for j in range(3):
      	a = input().split()
        a = [int(x) for x in a]
    A.append(a)
N = int(input())
C = []
for _ in range(3):
    C.append(np.zeros(3))
 
for _ in range(N):
    b = int(input())
    for i in range(3):
        for j in range(3):
            if A[i][j] == b: C[i][j] = 1
 
for i in range(3):
    if sum(C[:][i]) == 3:
        print('Yes')
        break
    elif sum(C[i][:]) == 3:
        print('Yes')
        break
if C[1][1]+C[2][2]+C[0][0] == 3:
    print('Yes')
elif C[0][2]+C[1][1]+C[2][0] == 3:
    print('Yes')
else: print('No')

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

N = int(input())
print(int(N/2)+N%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):
N = 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)


n = int(input())

ans = n//2 +n%2

print(ans)


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):
import sys

def main(n):

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

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


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:])


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:])


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:])

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:])


s = input().strip()
s = int(s)

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


Verdicts: 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):

a,b,c = list(map(int, input().split()))
d,e,f = list(map(int, input().split()))	
g,h,k = list(map(int, input().split()))
N = int(input())
l = []
for i in range(N):
	e=int(input())
	l.append(e)
L1 = {a,d,g}
L2 = {a,b,c}
L3 = {a,e,k}
L4 = {c,f,k}
L5 = {g,h,k}
L6=  {c,e,g}
for i in range(N):
	for j in range(N):
		for k in range(N):
			s = set([l[i],l[j],l[k]])
			if (s == L1) or (s == L2) or (s == L3) or (s == L4) or (s == L5) or (s==L6):
				print('Yes')
				exit(0)
		
print('No')












a,b,c = list(map(int, input().split()))
d,e,f = list(map(int, input().split()))	
g,h,k = list(map(int, input().split()))
N = int(input())
l = []
for i in range(N):
	e=int(input())
	l.append(e)
L1 = {a,d,g}
L2 = {a,b,c}
L3 = {a,e,k}
L4 = {c,f,k}
L5 = {g,h,k}
L6 = {c,e,g}
for i in range(N):
	for j in range(N):
		for k in range(N):
			s = set([l[i],l[j],l[k]])
			if (s == L1) or (s == L2) or (s == L3) or (s == L4) or (s == L5) or (s == L6) :
				print('Yes')
				exit(0)
		
print('No')












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

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

Verdicts: Runtime Error

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

N = int(input())
print(int(N/2) if N % 2 == 0 else 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+1) / 2)


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

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


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


Verdicts: Wrong Answer

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

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)

N = int(input())

if N % 2 = 0:
    print 'N'
else:
    print 'N + 1'

N = int(input())

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

N = int(input())

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

N = int(input())

print((N + 1)// 2)

Verdicts: 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):
print(int(input())//2)

print(int(input()//2)

n=int(input())
if n%2:
  print(n//2 + 1)
else:
  print(n//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())
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):
i = int(input())
j= i/2
k= i/2 +1
if (i== k or i==j):
    print(int(j))

i = int(input())
j = i/2
print(int(j))

i = int(input())
j= i/2
if (i%2==0):
    print(int(j))
elif (i%2 !=0):
    print(int(j+1))

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
import collections
import heapq
import numpy as np

rl = sys.stdin.readline

n, m = map(int, rl().split())

a = [-1] * 3
isOk = False
for _ in range(m):
    b = list(map(int, rl().split()))
    if b[0]-1 != 2 and b[1] == 0: 
        isOk = True
        break
    if a[b[0]-1] != -1 and a[b[0]-1] != b[1]:
        isOk = True
        break
    a[b[0]-1] = b[1]

if isOk:
    print(-1)
else:
    ans = 0
    a.reverse()
    for i in range(3):
        if a[i] == -1:
            a[i] = 0
        ans += a[i]*(10**(i))
    print(ans)



import sys
N = int(sys.stdin.readline())
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+1)/2)

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


N = int(input())
print((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())

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


N = int(input())

print(N // 2 + (0 if N % 2 == 0 else 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,M = list(map(int, input().split()))
s = []
c = []
for i in range(M):
  inputs = list(map(int, input().split()))
  s.append(inputs[0])
  c.append(inputs[1])
  
res = [0 for i in range(N)]
for digit, number in zip(s,c):
    digit -= 1
    if not res[digit] == 0:
        if res[digit] <= number:
            res[digit] = numer
        else:
            continue
    res[digit] = number

convert = list(map(str, res))
res = int("".join(convert))
if convert[0] == 0:
    print(-1)
elif len(str(res)) == N:
    print(res)
else:
    print(-1)

N,M = list(map(int, input().split()))
s = []
c = []
for i in range(M):
  inputs = list(map(int, input().split()))
  s.append(inputs[0])
  c.append(inputs[1])

res = [0 for i in range(N)]
for digit, number in zip(s,c):
  digit -= 1
  res[digit] = number

convert = list(map(str, res))
res = int("".join(convert))
if len(str(res)) == N:
  print(res)
else:
  print(-1)

N,M = list(map(int, input().split()))
s = []
c = []
for i in range(M):
    inputs = list(map(int, input().split()))
    s.append(inputs[0])
    c.append(inputs[1])

res = [0 for i in range(N)]
for digit, number in zip(s,c):
    index = digit - 1
    if res[index] == 0:
        res[index] = number
    else: 
        if res[index] >= number: 
            res[index] = number
        else:
            pass

convert = list(map(str, res))
res = int("".join(convert))
if len(str(res)) == N:
    print(res)
else:
    print(-1)

n,m = list(map(int, input().split()))
s = []
c = []
for _ in range(m):
    inputs = list(map(int, input().split()))
    s.append(inputs[0])
    c.append(inputs[1])

if n == 1:
    for i in range(10):
        istr = str(i)
        flag = True 
        for j in range(m):
            if not istr[s[j]-1] == str(c[j]):
                flag = False
            if flag == True:
                print(i)
                break
else: # n!=1
    for i in range(10**(n-1),10**n):
        istr = str(i)
        flag = True
        for j in range(m):
            if not istr[s[j]-1] == str(c[j]):
                flag = False
            else: 
                pass
        if flag:
            print(i)
            break

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

Verdicts: 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):
num = int(input())
if num % 2 == 0:
	print(num // 2)
elif:
	print(num // 2 + 1)

N = int(input())
if N % 2 == 0:
	print(N // 2)
elif N % 2 == 1:
	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())
SC=list(list(map(int, input().split())) for i in range(M))

def get_unique_list(seq):
    seen = []
    return [x for x in seq if x not in seen and not seen.append(x)]
sc=get_unique_list(SC)

if (N==3) & (max(sc)[0]!=3):
    sc.append([1,1])
if (N==2) & (max(sc)[0]!=2):
    sc.append([2,1])

res=0
if M==0:
    res=-1
for i in range(len(sc)):
    for j in range(len(sc)):
        if (i!=j) & (sc[i][0]==sc[j][0]):
            res=-1
            break
    break
for i in range(len(sc)):
    if (M!=1) & (sc[i][0]==1) & (sc[j][1]==0):
        res=-1
        break
if N<len(sc):
    res=-1
if res!=-1:
    for i in range(len(sc)):
        res = res + sc[i][1]*(10**(N-sc[i][0]))
print(res)

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

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

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

Verdicts: Runtime Error

Runtime Error

Accepted