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, input().split())
p = [0]*n
for i in range(q):
    a = int(input())
    p[a-1] += 1
print(p)
for i in range(n):
    print("Yes" if k - q + p[i] > 0 else "No")


n, k, q = map(int, input().split())
p = [0]*n
for i in range(q):
    a = int(input())
    p[a-1] += 1
for i in range(n):
    print("Yes" if k - q + p[i] > 0 else "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=[K-Q for i in range(N)]
for _ in range(Q):
  L[int(input())-1]+=1
for i in range(N):
  if L[i-1]>0:
    print("Yes")
  else:
    print("No")

N,K,Q=map(int,input().split())
L=[0 for i in range(N)]
for _ in range(Q):
  L[int(input())-1]+=1
for l in L:
  if K-Q+l>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):
import numpy
import sys
def input():
    return sys.stdin.readline()[:-1]

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

points = np.array([K for _ in range(N)])

for q in range(Q):
    A = int(input()) - 1
    points -= 1
    points[A] +=1

for p in points:
    if p < 1:
        print('No')
    else:
        print('Yes')


import numpy as np

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

points = np.array([K for _ in range(N)])

for q in range(Q):
    A = int(input()) - 1
    points -= 1
    points[A] += 1

[print('Yes') if p < 1 else print('No') for p in points]

import numpy as np

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

points = np.array([K for _ in range(N)])

for q in range(Q):
    A = int(input()) - 1
    points -= 1
    points[A] += 1

[print('Yes') if p < 1 else print('No') for p in points]

import numpy as np
import sys
def input():
    return sys.stdin.readline()[:-1]

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

points = np.array([K - Q for _ in range(N)])

for q in range(Q):
    A = int(input()) - 1
    points[A] +=1

for p in points:
    if p < 1:
        print('No')
    else:
        print('Yes')


Verdicts: 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):
def get_answer(input_list):
    c_list = [int(v) for v in input_list[0].split(" ")]
    n = c_list[0]
    k = c_list[1]
    q = c_list[2]
    a = [int(v) for v in input_list[1:]]
    ns = [k] * n
    for aa in a:
        index = aa - 1
        for i in range(len(ns)):
            if i != index:
                ns[i] -= 1

    nr = [""] * n
    for i in range(len(ns)):
        if ns[i] <= 0:
            nr[i] = "No"
        else:
            nr[i] = "Yes"

    return nr



if __name__ == "__main__":
    input_list = []
    while True:
        try:
            input1 = input()
            if not input1:
                break
            if len(input1) == 0:
                break
            input_list.append(input1)
        except EOFError:
            break
    print(get_answer(input_list))



def get_answer(input_list):
    c_list = [int(v) for v in input_list[0].split(" ")]
    n = c_list[0]
    k = c_list[1]
    q = c_list[2]
    a = [int(v) for v in input_list[1:]]
    ns = [k - q] * n
    for aa in a:
        index = aa - 1
        ns[index] += 1
        

    nr = [""] * n
    for i in range(len(ns)):
        if ns[i] <= 0:
            nr[i] = "No"
        else:
            nr[i] = "Yes"

    return nr



if __name__ == "__main__":
    input_list = []
    while True:
        try:
            input1 = input()
            if not input1:
                break
            if len(input1) == 0:
                break
            input_list.append(input1)
        except EOFError:
            break
    for a in get_answer(input_list):
        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):
import numpy as np
N,K,Q = map(int,input().split())
Qlist = [int(input()) for _ in range(Q)]
Alist = np.full(N,K)
for i in Qlist:
    Alist[i-1]+=1
    Alist-=1
    print(i,Alist)
for A in Alist:
    print("Yes" if A>0 else "No")

import numpy as np
N, K, Q = map(int, input().split())
first = K - Q
board = np.array([first] * N)
for _ in range(Q):
    A = int(input())
    board[A - 1] += 1
for player in board:
    if player > 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):
import time

t1 = time.time()

n,k,q = map(int,input().split())
a = [k-q]*n

t2 =time.time()

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

t3 = time.time()

for i in a:
	print('Yes' if i>0 else 'No')

t4 = time.time()

print(t2-t1)
print(t3-t2)
print(t4-t3)

n,k,q = map(int,input().split())
a = [k-q]*n
for i in range(q):
	a[int(input())-1] += 1
for i in a:
	print('Yes' if i>0 else '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 = list(map(int, input().split()))

a=[]
nScore=[]
for x in range(Q):
    a.append(input())

for x in range(N):
    nScore.append(K)

for x in range(Q):
    ＃print("----Scores-----")
    
    for y in range(N)#
        if(y+1 !=int(a[x])):
            nScore[y]-=1
            #print("{}: {}".format(y,str(nScore[y])))
        else:
            #print("{}: {} Scored".format(y,str(nScore[y])))

for x in range(N):
    if(nScore[x]<=0):
        print("No")
    else:
        print("Yes")




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

a=[]
nScore=[]
for x in range(Q):
    a.append(input())

for x in range(N):
    nScore.append(K)

for x in range(Q):
    print("----Scores-----")
    
    for y in range(N):
        if(y+1 !=int(a[x])):
            nScore[y]-=1
            print("{}: {}".format(y,str(nScore[y])))
        else:
            print("{}: {} Scored".format(y,str(nScore[y])))

for x in range(N):
    if(nScore[x]<=0):
        print("No")
    else:
        print("Yes")




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



a=[]
nScore=[]

for x in range(N):
    nScore.append(0)

for x in range(Q):
    nScore[int(input())-1]+=1


#     for x in range(N):
#         print("Yes")

for x in range(N):
    if K-Q+nScore[x]>0:
        print("Yes")
    else:
        print("No")





Verdicts: Runtime Error

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 players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in input().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(ans)

"""
- N players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in open(0).input().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(ans)


"""
- N players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in open(0).read().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(ans)


"""
- N players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in input().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(ans)


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


point = [K] * N


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


for i in range(N):
    if point[i] <= Q:
        print("No")
    else:
        print("Yes")

Verdicts: 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):
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
sanka = [K for _ in range(N)]

print(sanka)

for ai in A:
    sanka[ai-1] += 1

for i in range(N):
    if sanka[i] - Q > 0:
        print("Yes")
    else:
        print("No")


N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
sanka = [K for _ in range(N)]

for ai in A:
    sanka[ai-1] += 1

for i in range(N):
    if sanka[i] - Q > 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())
A=[int(input()) for _ in range(q)]

p=[0]*n

for a in A:
    p[a-1]+=1
    
for P in p:
    if q-P < k:
        print("yes")
    else:
        print("no")
        

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

p=[0]*n

for a in A:
    p[a-1]+=1
    
for P in p:
    if q-P < k:
        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())
P = [0 for i in '0'*N]
for n in '0'*Q:
    A = int(input()) - 1
    P[A] += 1
print(P)
for s in map(lambda x:'Yes' if x-Q+K>0 else 'No', P):
    print(s)

N, K, Q = map(int, input().split())
P = [0 for i in '0'*N]
for n in '0'*Q:
    A = int(input()) - 1
    P[A] += 1
for s in map(lambda x:'Yes' if x-Q+K>0 else 'No', P):
    print(s)

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())
ans_list =[]
point = []
for i in range(n):
  point.append(k)
#print(point)      
for j in range(q):
  ans_list.append(int(input()))
#print(ans_list)
for k in ans_list:
  point[k] += 1
for l in range(n):
  point[l] -= q
  if point[l]>0:
    print("Yes")
  else:
    print("No")
#print(point)

ans_list =[]
point = []
for i in range(n):
  point.append(k)
#print(point)      
for j in range(q):
  ans_list.append(int(input()))
#print(ans_list)
for k in ans_list:
  point[k-1] += 1
#print(point)
for l in range(n):
  point[l] -= q
  if point[l]>0:
    print("Yes")
  else:
    print("No")
#print(point)

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

Verdicts: 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):
from collections import Counter

n, k, q = map(int,input().split())
if (k>q):
    for i in range(n):
        print('Yes')
else:
    A = []
    for i in range(q):
        A.append(int(input()))
    As = list(set(A))
    S=Counter(A)
    B = [k-q]*n
    for k,v in S.items():
        B[k-1]+=v

    for i in B:
        if(i>0):
            print('Yes')
    else:
        print('No')

from collections import Counter

n, k, q = map(int,input().split())      
A = []
for i in range(q):
    A.append(int(input()))
As = list(set(A))
S=Counter(A)
B = [k-q]*n
for k,v in S.items():
  B[k-1]+=v

for i in B:
  if(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):




def calculate(n,k,q,arr):
    result = [k]*n
    print(result)
    for index in range(q):
        result[arr[index] - 1] = result[arr[index] - 1] + 1

    for index in range(len(result)):
        if (result[index] - q) > 0:
            print("Yes")
        else:
            print("No")

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

arr = []
for i in range(Q):
    arr.append(int(input()))

calculate(N,K,Q,arr)





def calculate(n,k,q,arr):
    result = [k]*n
    for index in range(q):
        result[arr[index] - 1] = result[arr[index] - 1] + 1

    for index in range(len(result)):
        if (result[index] - q) > 0:
            print("Yes")
        else:
            print("No")

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

arr = []
for i in range(Q):
    arr.append(int(input()))

calculate(N,K,Q,arr)

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())
a=[]
for i in range(q):
    a.append(int(input()))
p=[0]*n
for i in range(k):
    for j in range(n):
        p[j]+=1
print(p)
for i in range(n):
    for j in range(q):
        p[i]-=1
        if a[j]-1 == i:
            p[i]+=1
print(p)


for i in range(n):
    if p[i]>0:
        print("Yes")
    else:
        print("No")


n,k,q=(int(x) for x in input().split())
a=[]
for i in range(q):
    a.append(int(input()))
p=[0]*n
for i in range(k):
    for j in range(n):
        p[j]+=1
print(p)
for i in range(n):
    for j in range(q):
        p[i]-=1
        if a[j]-1 == i:
            p[i]+=1
print(p)


for i in range(n):
    if p[i]>=1:
        print("Yes")
    else:
        print("No")

n,k,q=(int(x) for x in input().split())
a=[]
for i in range(q):
    a.append(int(input()))
p=[k-q]*n

for i in range(q):
    p[a[0]-1]+=1
    del a[0]

for i in range(n):
    if p[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):
ansed = []
for x in range(0,Q):
    ansed.append(int(input()))
for y in range(1,N+1):
    if K - Q + ansed.count(y) > 0:
        print("Yes")
    else:
        print("No")

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

points = []
for x in range(N):
    points.append(K-Q)

for y in range(Q):
    ansed = int(input()) - 1
    points[ansed] += 1

for point in points:
    if point > 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):
import sys

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

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

d=[0]*n

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

print(d)

for j in d:
    if j>q-k:
        print('Yes')
    else:
        print('No')

import sys

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

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

d=[0]*n

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

for j in d:
    if j>q-k:
        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):
# -*- coding: utf-8 -*-

def main():
    n, k, q = map(int, input().split())
    a_list = []

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

    participant_list = [k-q] * n


    for i in range(q):
        participant_list[a_list[i]-1] += 1

    for i in range(n):
        if(participant_list[i] > 0):
            print("Yse")
        else:
            print("No")

if __name__ == "__main__":
    main()


# -*- coding: utf-8 -*-

def main():
    n, k, q = map(int, input().split())
    a_list = []

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

    participant_list = [k-q] * n


    for i in range(q):
        participant_list[a_list[i]-1] += 1

    for i in range(n):
        if(participant_list[i] > 0):
            print("Yes")
        else:
            print("No")

if __name__ == "__main__":
    main()


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=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    import collections
    c = collections.Counter(a)
    
    l=([int(i[0]) for i in c.items() if i[1] > q-k])
    #print(l)
    for i in range(n):
        if (i in l):
            print('Yes')
        else:
            print('No')

n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    c = collections.Counter(a)
    for i in range(n):
        if c[str(i)]>q-k:
            print('Yes')
        else:
            print('No')

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

 
  #      print('Yes')
#else:
c = collections.Counter(a)
for i in range(n):
    #print(k-c[str(i+1)])
    if q-c[str(i+1)]<k:
        print('Yes')
    else:
        print('No')

n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    c = collections.Counter(a)
    for i in range(n):
        if c[str(i+1)]>q-k:
            print('Yes')
        else:
            print('No')

n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    import collections
    c = collections.Counter(a)
    for i in range(n):
        #print(k-c[str(i+1)])
        if q-c[str(i+1)]<k:
            print('Yes')
        else:
            print('No')

Verdicts: Wrong Answer

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):
import sys
input = sys.stdin.readline

n, k, q = [int(w) for w in input().split()]


score = [0] * n

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

for s in score:
    cond = k - q + a > 0
    print("Yes" if cond else "No")


import sys
input = sys.stdin.readline

n, k, q = [int(w) for w in input().split()]


score = [0] * n

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

for s in score:
    cond = k - q + a > 0
    print("Yes" if cond else "No")


import sys
input = sys.stdin.readline

n, k, q = [int(w) for w in input().split()]


score = [0] * n

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


for s in score:
    print('Yes' if s + k - q > 0 else '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 = map(int,input().split())

points = [K] * N
for i in range(Q):
    anser = int(input())-1
    for x in range(N):
        if x != anser:
            points[x] += -1
    
for y in range(N):
    if points[y] < 1:
        print('NO')
    else:
        print('Yes')

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

points = [K for _ in range(N)]
for i in range(Q):
    ansers.append(int(input())-1)



for anser in ansers:
    for x in range(N):
        if x != anser:
            points[x] += -1
    print(points)
for y in range(N):
    if points[y] < 1:
        print('NO')
    else:
        print('Yes')



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

s = K-Q

points = [s] * N

for _ in range(Q):
    ans = int(input())
    points[ans-1] += 1

for p in points:
    print('Yes' if p>0 else '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 = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [0 for i in range(N)]
for x in A:
  B[x-1] += 1
for x in B:
  k = Q - x
  if K - k + x > 0:
    print("Yes")
  else:
    print("No")


N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [K for i in range(N)]
for x in A:
  B[x-1] += 1
for x in B:
  k = Q - x
  if K - k + x > 0:
    print("Yes")
  else:
    print("No")


N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [0 for i in range(N)]
for x in A:
  B[x-1] += 1
print(B)
for x in B:
  k = Q - x
  if K - k > 0:
    print("Yes")
  else:
    print("No")


N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [K for i in range(N)]
for x in A:
  B[x-1] += 2
for x in B:
  if x > K+Q:
    print("Yes")
  else:
    print("No")

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

A = [0]*Q
for i in range(Q):
    A[i] = int(input())

B = [0]*N

for i in range(Q):
    B[A[i] - 1] += 1


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


Verdicts: Wrong Answer

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):
m = list(map(int,input().split()))
a=[int(input()) for i in range(m[2])]

n = [m[1]] * m[2]

for i in range(m[2]):
    n = [i-1 for i in n]
    n[a[i]-1] +=1

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

m = list(map(int,input().split()))
a=[int(input()) for i in range(m[2])]

n = [m[1]] * m[2]
print(n)

for i in range(m[2]):
    n = [i-1 for i in n]
    n[a[i]-1] +=1

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

m = list(map(int,input().split()))
n = [0] * m[0]

for i in range(m[2]):
    n[int(input())-1] += 1
  
for i in range(m[0]):
    if n[i] - m[2] + m[1] > 0:
        print('Yes')
    else:
        print('No')

Verdicts: 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):
n, k, q = map(int, input().split())
a = list()
for i in range(0, q):
    a.append(int(input()))

score = [k]*n

for i in a:
    score[i-1] += 1
    for x in range(len(score)):
         score[x] = score[x] - 1
    print(score)

for x in score:
    if x > 0:
        print("Yes")
    else:
        print("No")


n, k, q = map(int, input().split())
a = list()
for i in range(0, q):
    a.append(int(input()))

score = [k - q]*n

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

for x in score:
    if x > 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):
def solve():
    n, k, q = map(int, input().split())
    a = []
    for i in range(q):
        a.append(0)
    for i in range(q):
        aa = int(input()) - 1
        a[aa] = a[aa]+1
    for i in range(n):
        if k - (q-a[i]) > 0:
            print('Yes')
        else:
            print('No')

if __name__ == "__main__":
    solve()
    

def solve():
    n, k, q = map(int, input().split())
    a = []
    for i in range(n):
        a.append(0)
    for i in range(q):
        aa = int(input()) - 1
        a[aa] = a[aa]+1
    for i in range(n):
        if k - (q-a[i]) > 0:
            print('Yes')
        else:
            print('No')

if __name__ == "__main__":
    solve()
    

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

score = [K-Q]*N

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

for j in score:
    if j > 0:
        print('YES')
    else:
        print('NO')
    

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

score = [K-Q]*N

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

for j in score:
    if j > 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())
a = []
for i in range(q):
  a.append(int(input()))
  
m = [0]*n
for i in a:
  m[i] += 1
for i in range(n):
  if m[i] - q + k > 0:
    print('Yes')
  else:
    print('No')

n, k, q = map(int, input().split())
a = []
for i in range(q):
  a.append(int(input()) - 1)
  
m = [0]*n
for i in a:
  m[i] += 1
for i in range(n):
  if m[i] - q + k > 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 = [0] * Q
for i in range(Q):
    A[i] = int(input())
list = [K-Q] *N
for i in range(Q):
  list[A[i]] += 1
for i in range(N):
  if list[i] >= 1:
    print('Yes')
  else:
    print('No')
  

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

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

Verdicts: 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):
n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))
p=[k-q]*n
for num in a:
  p[num-1] += 1
print(p)
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')


n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))
p=[-k]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')


n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))
p=[k-q]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')


Verdicts: Wrong Answer

Wrong Answer

Accepted