TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]

for i in range(n):
	point[i]-=1
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]>0:
        print("Yes")
    else:
        print("No")

n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or print[i]-q>0:
        print("Yes")
    else:
        print("No")

n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]]+=1
for i in range(n):
    if point[i]==max(point):
        print("Yes")
    else:
        print("No")

n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i-1]]+=1
for i in range(n):
    if point[i]==max(point):
        print("Yes")
    else:
        print("No")

n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]]+=1
for i in range(n):
    if point[i]==max(point):
        print("Yes")
    else:
        print("No")

n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
for i in range(n):
    if point[i]-q>0:
        print("Yes")
    else:
        print("No")


Verdicts: Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
#ABC141_C
N,K,Q=map(int,input().split())
ans=(K-Q)*np.ones((1,N),dtype='int32')
print(ans)
for _ in range(Q):
    idx=int(input())
    ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No') 

#ABC141_C
N,K,Q=map(int,input().split())
ans=[K-Q]*N
for _ in range(Q):
    ans[int(input())-1]+=1
for i in range(Q):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')    

#ABC141_C
N,K,Q=map(int,input().split())
ans=(K-Q)*np.ones((1,N),dtype='int32')

for _ in range(Q):
    idx=int(input())
    ans[0,idx-1]+=1
ans=ans.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')    

#ABC141_C
import numpy as np

N,K,Q=map(int,input().split())
A_list=np.zeros((1,Q),dtype='int32')
HP_list=K*np.ones((1,N),dtype='int32')
for i in range(Q):
    A_list[:,i]=int(input())

for i in range(A_list.shape[1]):
    HP_list-np.ones((HP_list.shape))
    HP_list[:,A_list.tolist()[0][i]-1]-=1

for i in range(HP_list.shape[1]):
    print(HP_list.tolist()[0][i])

#ABC141_C
import numpy as np

N,K,Q=map(int,input().split())
A_list=np.zeros((1,Q),dtype='int32')
HP_list=K*np.ones((1,N),dtype='int32')
for i in range(Q):
    A_list[:,i]=int(input())

for i in range(A_list.shape[1]):
    HP_list-np.ones((HP_list.shape))
    HP_list[:,A_list.tolist()[0][i]-1]-=1

ans=HP_list.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No') 

#ABC141_C
import numpy as np

N,K,Q=map(int,input().split())
A_list=np.zeros((1,Q),dtype='int32')
HP_list=K*np.ones((1,N),dtype='int32')
for i in range(Q):
    A_list[:,i]=int(input())

for i in range(A_list.shape[1]):
    HP_list-np.ones((HP_list.shape))
    HP_list[:,A_list.tolist()[0][i]-1]+=1

ans=HP_list.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')    

#ABC141_C
N,K,Q=map(int,input().split())
ans=[K-Q]*N
for _ in range(Q):
    ans[int(input())-1]+=1
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No') 

Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [init_point]*participant

for i in range(participant):
  answer_person = int(input())
  tmp[answer_person-1] += 1
  tmp = [i-1 for i in tmp]
  
for item in tmp:
  if item>0: print("Yes")
  else: print("No")

import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

for i in range(correct):
  answer_person = int(input())-1
  tmp[answer_person] += 1
print(tmp)

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [init_point]*participant

for i in range(participant):
  answer_person = int(input())
  tmp[answer_person-1] += 1
  tmp -= 1
  
for item in tmp:
  if item>0: print("Yes")
  else: print("No")

import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

for i in range(correct):
  answer_person = int(input())-1
  tmp[answer_person] += 1

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
def minus(a):
  return a-1

a = input().split(" ")
mem = [int(a[1])] * int(a[0])
print(mem)
for i in range(int(a[2])):
  mem[int(input())-1] += 1
  mem = list(map(minus, mem))
for i in mem:
  if i < 1:
    print("No")
  else:
    print("Yes")

a = input().split(" ")
mem = [0] * int(a[0])
for i in range(int(a[2])):
  mem[int(input())-1] += 1
for i in range(int(a[0])):
  if int(a[1])-int(a[2])+mem[i] < 1:
    print("No")
  else:
    print("Yes")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
import numpy as np
n, k, q = map(int, input().split())

l=[]
for i in range(q):
    x = int(input())
    l.append(x)

p = np.array([k - q] * n)
pp = np.array([0] * n)

for i in range(q):
    index = l[i] - 1
    pp[index] += 1

xx = p + pp
print(xx)

for i in range(len(xx)):
    if xx[i] > 0:
        print('Yes')
    else:
        print('No')

import numpy as np
n, k, q = map(int, input().split())

l=[]
for i in range(q):
    x = int(input())
    l.append(x)

p = np.array([k - q] * n)
pp = np.array([0] * n)

for i in range(q):
    index = l[i] - 1
    pp[index] += 1

xx = p + pp

for i in range(len(xx)):
    if xx[i] >= 0:
        print('Yes')
    else:
        print('No')

import numpy as np
n, k, q = map(int, input().split())

l=[]
for i in range(q):
    x = int(input())
    l.append(x)

p = np.array([k - q] * n)
pp = np.array([0] * n)

for i in range(q):
    index = l[i] - 1
    pp[index] += 1

xx = p + pp

for i in range(len(xx)):
    if xx[i] > 0:
        print('Yes')
    else:
        print('No')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n, k, q = [ int(_) for _ in input().split() ]
a = [ int(input()) for _ in range(q) ]

p = [ k for _ in range(n) ]

for x in a:
	p[x-1] += 1
	p = [ y-1 for y in p ]

ans = []

for z in p:
	if z > 0:
		ans.append('Yes')
	else:
		ans.append('No')

print(ans)

n, k, q = [ int(_) for _ in input().split() ]
a = [ int(input()) for _ in range(q) ]

p = [ k for _ in range(n) ]

p = [ y-q for y in p ]

for x in a:
	p[x-1] += 1

ans = []

for z in p:
	if z > 0:
		ans.append('Yes')
	else:
		ans.append('No')

for blah in ans:
	print(blah)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
import sys

n,k,q = map(int,input().split())

if k > q:
    for _ in range(n):
        print('Yes')
sys.exit()

A = []
for _ in range(q):
    a = int(input())
    A.append(a)

ans = [0]*n

from collections import Counter
cnt = Counter(A)
for key,v in cnt.items():
    if v >= q-k+1:
        ans[key-1] = 1

for i in range(n):
    if ans[i] == 0:
        print('No')
    else:
        print('Yes')

n,k,q = map(int,input().split())


if k <= q:
    
    A = []
    for _ in range(q):
        a = int(input())
        A.append(a)

    ans = [0]*n

    from collections import Counter
    cnt = Counter(A)
    for key,v in cnt.items():
        if v >= q-k+1:
            ans[key-1] = 1

    for i in range(n):
        if ans[i] == 0:
            print('No')
        else:
            print('Yes')
        
else:
    for _ in range(n):
        print('Yes')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
ans = [K-Q]*N
for a in A:
    ans[a-1] += 1
print(ans)
for n in range(N):
    if ans[n] > 0:
        print("Yes")
    else:
        print("No")


N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
ans = [K-Q]*N
for a in A:
    ans[a-1] += 1
for n in range(N):
    if ans[n] > 0:
        print("Yes")
    else:
        print("No")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n,k,q=map(int,input().split())
l=[]
for i in range(n):
  v=[i,0]
  l.append(v)
for j in range(q):
  p=int(input())
  l[p-1][1]+=1
for l in range(n):
  if l[l][1]>q-k:
    print('Yes')
  else:
    print('No')

n,k,q=map(int,input().split())
l=[]
for i in range(n):
  v=[i,0]
  l.append(v)
for j in range(q):
  p=int(input())
  l[p-1][1]+=1
for m in range(n):
  if l[m][1]>q-k:
    print('Yes')
  else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
import numpy as np

N, K, Q = map(int, input().split())
A = np.array([int(input()) for i in range(Q)])
  
points = K - Q
for i in range(1, N+1):
  correct_num = len(np.where(A==i)[0])
  fin_point = points[i-1] + correct_num
  
  if fin_point > 0:
    print("Yes")
  else:
    print("No")  

import numpy as np

N, K, Q = map(int, input().split())
A = np.array([int(input()) for i in range(Q)])
  
points = np.full(N, K-Q)

for i in range(0, Q):
  points[A[i]-1] += 1
 
for i in points:
  if i > 0:
    print("Yes")
  else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N, K, Q = map(int, input().split())
A = np.array([int(input()) for _ in range(Q)])

ans = np.zeros(N)
ans += K

for a in A:
    ans[a-1] += 1

ans -= Q

for a in ans:
    if a>0:
        print("Yes")
    else:
        print("No")

import numpy as np
N, K, Q = map(int, input().split())
A = np.array([int(input()) for _ in range(Q)])

ans = np.zeros(N)
ans += K

for a in A:
    ans[a-1] += 1

ans -= Q

for a in ans:
    if a>0:
        print("Yes")
    else:
        print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [ k+q-L.count(i) for i in range(1,n+1) ]
for i in N:
    print('YES' if i>0 else 'NO')


n,k,q=map(int,input().split())
N= [k]*n
L = [-q]*n
for _ in range(q): L[int(input())-1] += 1 
N= map(lambda x,y: x+y, N,L)
for i in N:
    print('YES' if i>0 else 'NO')


n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [ k-q+L.count(i) for i in range(1,n+1) ]
for i in N:
    print('YES' if i>0 else 'NO')

n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [k]*n
j = 0
while(j<len(L)):
    for i in range(len(N)):
        if i+1 != L[j]:
            N[i] -= 1
    j +=1
print(N)

n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [k]*n
j = 0
while(j<len(L)):
    for i in range(len(N)):
        if i+1 != L[j]:
            N[i] -= 1
    j +=1

for i in range(N):
    if i>0:
        print('YES')
    else:
        print('NO')

n, k, q = map(int, input().split())
N = [k]*n
L = [-q]*n
for _ in range(q): L[int(input())-1]+=1
N = map(lambda x,y:x+y, N,L)
for p in N: print("Yes" if p>0 else "No")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n, k, q = (int(i) for i in input().split())

score = [0] * n

for i in range(q):
    score[int(input())-1] += 1
print(score)
for i in range(n):
    if score[i] <= q - k:
        print("No")
    else:
        print("Yes")


n, k, q = (int(i) for i in input().split())

score = [0] * n

for i in range(q):
    score[int(input())-1] += 1
for i in range(n):
    if score[i] <= q - k:
        print("No")
    else:
        print("Yes")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N,K,Q = map(int,input().split())

correct = [0]*N

for i in range(Q):
    winner = int(input()) - 1
    correct[winner] += 1

print(correct)

for i in range(N):
    score = K - (Q-correct[i])
    if score <= 0:
        print("No")
    else:
        print("Yes")

N,K,Q = map(int,input().split())

correct = [0]*N

for i in range(Q):
    winner = int(input()) - 1
    correct[winner] += 1


for i in range(N):
    score = K - (Q-correct[i])
    if score <= 0:
        print("No")
    else:
        print("Yes")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
num_line=input().rstrip().split(" ")

num=int(num_line[0])
firstpoint=int(num_line[1])
times=int(num_line[2])

pointlist=[0 for i in range(num)]


for i in range(times):
    win=int(input())-1
    pointlist[win]+=1


for i in range(num):
    if pointlist[i]>=times-firstpoint+1:
        print("YES")
    else:
        print("NO")

num_line=input().rstrip().split(" ")

num=int(num_line[0])
firstpoint=int(num_line[1])
times=int(num_line[2])

pointlist=[0 for i in range(num)]


for i in range(times):
    win=int(input())-1
    pointlist[win]+=1


for i in range(num):
    if pointlist[i]>=times-firstpoint+1:
        print("Yes")
    else:
        print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

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

scores = [0 for i in range(n)]

for a in range(q):
    scores[a-1] += 1

for s in scores:
    if q - s >= k:
        print('No')
    else:
        print('Yes')

n, k, q = map(int, input().split())

scores = [0 for i in range(n)]

for i in range(q):
    a = int(input())
    scores[a-1] += 1

for s in scores:
    if q - s >= k:
        print('No')
    else:
        print('Yes')


Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N, K, Q = [int(i) for i in input().split()]
ls = [K] * N

for i in range(Q):
    a = int(input())
    ls[a - 1] += 1
    print(ls)

for l in ls:
    if l - Q > 0:
        print('Yes')
    else:
        print('No')


N, K, Q = [int(i) for i in input().split()]
ls = [K] * N

for i in range(Q):
    a = int(input())
    ls[a - 1] += 1

for l in ls:
    if l - Q > 0:
        print('Yes')
    else:
        print('No')


Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N, K, Q = map(int, input().split(' '))
P = [0 for _ in range(N)]

for i in range(Q):
    a = int(input()) - 1
    P[a] += 1

for i in range(N):
    if K - (Q - P[i]) > 0:
        print('yes')
    else:
        print('No')


N, K, Q = map(int, input().split(' '))
P = [0 for _ in range(N)]

for i in range(Q):
    a = int(input()) - 1
    P[a] += 1

for i in range(N):
    if K - (Q - P[i]) > 0:
        print('Yes')
    else:
        print('No')


Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n,k,q = [int(x) for x in input().split()]
li = []
score = [k]*n
for i in range(q):
    a = int(input())
    li.append(a)
    score = [x-1 for x in score]
    score[pe-1] = score[pe-1]+1
result = []
for i in range(len(score)):
    if score[i]>0:
        print('Yes')
    else:
        print('No')
        


n,k,q = [int(x) for x in input().split()]
li = []
for i in range(q):
    a = int(input())
    li.append(a)
score = [k] * (n + 1)
temp =[0]*(n+2)
for pe in li:
    temp[1] += (-1)
    temp[pe] -= (-1)
    temp[pe + 1] += (-1)
    temp[n + 1] -= (-1)

for i in range(1,n + 2):
    temp[i] += temp[i - 1]
#print(temp)
for i in range(1,n + 1):
    score[i] += temp[i]
    if(score[i] <= 0):
        print('No')
    else:
        print('Yes')

Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N,K,Q=map(int,input().split())
L=[K for _ in range(N)]
a=[int(input()) for _ in range(Q)]

for i in a:
    L[i-1]=L[i-1]+1

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

N,K,Q=list(map(int,input().split()))
a=[K for _ in range(N)]
b=[0 for _ in range(Q)]
for i in range(Q):
    b[i]=int(input())

for i in range(Q):
    for j in range(N):
        if (b[i]-1)!=j:
            a[j]-=1

for i in range(N):
    if a[i]<=0:
        print("NO")
    else:
        print("YES")

n,k,q=map(int,input().split())
L=[k for i in range(n)]
a=[int(input()) for i in range(q)]

for i in a:
    L[i-1]=L[i-1]+1

for i in range(len(L)):
    if q<L[i]:
        print("YES")
    else:
        print("NO")

n,k,q=map(int,input().split())
L=[k for i in range(N)]
a=[int(input()) for i in range(q)]

for i in a:
    L[i-1]=L[i-1]+1

for i in range(len(L)):
    if q<L[i]:
        print("YES")
    else:
        print("NO")

N,K,Q=list(map(int,input().split()))
L=[K for _ in range(N)]
a=[int(input()) for _ in range(Q)]

for i in a:
    L[i-1]=L[i-1]+1

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

N,K,Q=map(int,input().split())
L=[K for i in range(N)]
a=[int(input()) for i in range(Q)]

for i in a:
    L[i-1]=L[i-1]+1

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

n, k, q = map(int, input().split())
L = [k for i in range(n)]
a = [int(input()) for i in range(q)]

for i in a:
    L[i-1] = L[i-1] + 1

for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
a = list(map(int,input().split()))
n = a[0]
k = a[1]
q = a[2]
#print(n,k,q)
n_list = [k]*n
#print(n_list[0]+100)
#print(n_list)
for i in range(q):
  #print('Q',i)
  seikaisha = int(input())
  
  for j in range(n):
    if j == seikaisha:
      n_list[j] += 0
    else:
      n_list[j] -= 1
  #print(n_list)
for k in range(n):
  if n_list[k] > 0:
    print('Yes')
  else:
    print('No')

a = list(map(int,input().split()))
n = a[0]
k = a[1]
q = a[2]
n_list = [0]*n
for i in range(q):
  seikaisha = int(input())
  n_list[seikaisha-1] += 1
  print(n_list)
for j in range(n):
  if n_list[j]+k-q > 0:
    print('Yes')
  else:
    print('No')

a = list(map(int,input().split()))
n = a[0]
k = a[1]
q = a[2]
n_list = [0]*n
for i in range(q):
  seikaisha = int(input())
  n_list[seikaisha-1] += 1
  #print(n_list)
for j in range(n):
  if n_list[j]+k-q > 0:
    print('Yes')
  else:
    print('No')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
x,y,z = map(int,input().split())
 
dp = [y-z for i in range(x)]

for j in range(z):
    k = int(input())
    dp[k-1] =+ 1

for l in dp:
    if l >= 1:
        print("Yes")
    else:
        print("No")

x,y,z = map(int,input().split())
 
dp = [y-z for i in range(x)]
 
for j in range(z):
    k = int(input())
    dp[k-1] += 1
 
for l in dp:
    if l >= 1:
        print("Yes")
    else:
        print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
ac_list = [-Q+K-1 for _ in range(N)]


for i in A:
  ac_list[i-1] += 1 

for i in ac_list:
  if i <= 0:
    print("No")
  else:
    print("Yes")
  

N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
ac_list = [-Q+K-1 for _ in range(N)]


for i in A:
  ac_list[i-1] += 1 

for i in ac_list:
  if i < 0:
    print("No")
  else:
    print("Yes")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n, k, q = map(int, input().split())
ar = [k for i in range(n)]
for i in range(q):
  index = int(input())
  ar[index] += 1
for i in range(n):
  if ar[i] - q > 0:
    print("Yes")
  else:
    print("No")

n, k, q = map(int, input().split())
ar = [k for i in range(n)]
for i in range(q):
  index = int(input())
  ar[index-1] += 1
for i in range(n):
  if ar[i] - q > 0:
    print("Yes")
  else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n, k, q = map(int, input().split())
A = []
for i in range(q):
		A.append(int(input()))
print()

points = [k for i in range(n)]

for i in A:
		points = list(map(lambda x: x-1, points))
		points[i-1] += 1


for i in  points:
		if i <= 0:
				print("No")
		else: 
				print("Yes")



n, k, q = map(int, input().split())
A = []

for i in range(q):
		A.append(int(input()))

points = [k-q for i in range(n)]

for i in A:
		points[i-1] += 1


for i in  points:
		if i <= 0:
				print("No")
		else: 
				print("Yes")


Verdicts: Time Limit Exceeded

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
N, K, Q = [int(n) for n in input().split()]
l = [0] * N
for i in range(Q):
    l[int(input())-1] += 1

ans = ['yes' if K + v - Q > 0 else 'No' for v in l]

for a in ans:
    print(a)

N, K, Q = [int(n) for n in input().split()]
l = [0] * N
for i in range(Q):
    l[int(input())-1] += 1

ans = ['Yes' if K + v - Q > 0 else 'No' for v in l]

for a in ans:
    print(a)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
eople,point,quiz = map(int,input().split())
an = [int(input()) for _ in range(quiz)]
each_p = [point-quiz] * people

for x in an:
    each_p[x-1] += 1

for y in each_p:
    if y <= 0:
        print("No")
    else:
        print("Yes")


people,point,quiz = map(int,input().split())
an = [int(input()) for _ in range(quiz)]
each_p = [point-quiz] * people

for x in an:
    each_p[x-1] += 1

for y in each_p:
    if y <= 0:
        print("No")
    else:
        print("Yes")


Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n, k, q = map(int, input().split())
if k-q >=1:
    for _ in range(q):
        print("Yes")
out = [k-q for _ in range(n)]
for _ in range(q):
    a = int(input())
    out[a] += 1
for i in range(n):
    msg = "Yes" if out[i] >= 1 else "No"
    print(msg)

n, k, q, *a = map(int, open(0).read().split())
out = [k-q for _ in range(n)]
for i in range(q):
    out[a[i]-1] += 1
for i in out:
    msg = "Yes" if i > 0 else "No"
    print(msg)

Verdicts: Runtime Error

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n,k,q=map(int,input().split())
print(n,k,q)
a=[k-q]*n
for i in range(q):
    c=int(input())
    c-=1
    a[c]+=1
for i in range(n):
    if(a[i]>0):
        print("Yes")
    else :
        print("No")

n,k,q=map(int,input().split())
#print(n,k,q)
a=[k-q]*n
for i in range(q):
    c=int(input())
    c-=1
    a[c]+=1
for i in range(n):
    if(a[i]>0):
        print("Yes")
    else :
        print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
L=list(map(int,input().split()))
N=L[0]
K=L[1]
Q=L[2]
S=[]
for i in range(Q):
  S.append(input())
S.sort()
point=[0]*N
num_ans=[0]*N
for i in range(N):
  num_ans[i]=S.count(i)
  point[i]=K-Q+num_ans[i]
  if point[i]>0 :
    print("Yes")
  else:
    print("No")
    




L=list(map(int,input().split()))
N=L[0]
K=L[1]
Q=L[2]
point=[K-Q]*N
for i in range(Q):
  ans=int(input())
  point[ans-1]+=1
for i in range(N):
  if point[i]>0 :
    print("Yes")
  else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.  A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.  When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.  At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.  In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i. For Kizahashi, write a program that determines whether each of the N players survived this game.

Submission attempts (in order):
n = int(input())
a = [int(i) for i in input().split()] 
out = 0

out = a[0] + a[n - 2]
for i in range(n - 2):
	out += min(a[i], a[i+1])  
    
print(out)
  

n, k, q = map(int, input().split())
scores = [0] * n
out = []

for i in range(q):
  x = int(input())
  scores[x-1] += 1
  
for x in scores:
  out = 'Yes' if q - x < k else 'No'
  print(out)
    

Verdicts: Runtime Error

Accepted