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):
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    n, k, q = map(int, input().split())
    qk = q - k
    l = [0] * (n+1)
    for _ in range(q):
        l[int(input())] += 1
    print('\n'.join(['YES' if (i > qk) else 'NO' for i in l][1:]))

if __name__ == '__main__':
    main()


import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    n, k, q = map(int, input().split())
    qk = q - k
    l = [0] * (n)
    for _ in range(q):
        l[int(input()) - 1] += 1
    print('\n'.join(['Yes' if (i > qk) else 'No' for i in l]))

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):
from collections import Counter
N, K, Q = map(int, input().split())
answers = [int(input()) for i in range(Q)]
counts = Counter(answers)
print(counts)
for i in range(1,N+1):
  if K-(Q-counts[i])>0:
    print("Yes")
  else:
    print("No")

from collections import Counter
N, K, Q = map(int, input().split())
answers = [int(input()) for i in range(Q)]
counts = Counter(answers)
for i in range(1,N+1):
  if K-(Q-counts[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 = map(int, input().split())

scores = [k - q] * n

for index in range(q):
    winner = int(input())
    scores[winner] += 1

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


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

scores = [k] * n

for index in range(q):
    winner = int(input())
    for participant in range(n):
        if not participant == winner:
            scores[participant] -= 1

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


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

scores = [k - q] * n

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

for participant in range(n):
    print('Yes') if scores[participant] > 0 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):
x = input().split()
pointdict = {}
y = []
for i in x[0]:
    pointdict[i] = x[1]

for i in x[2]:
    ans = input()
    y.append(ans)

for i in y:
    for e in x[0]:
        if e != i:
            pointdict[e] -= 1

for p in pointdict:
    if pointdict[p] is not 0:
        print("Yes")
    else:
        print("No")


x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    plist[1] += 1

for p in plist:
    if p - int(x[2]) > 0:
        print("Yes")
    else:
        print("No")


x = input().split()
plist = list(range(1, int(x[0])+1))
pointdict = {}
y = []
i = 1
while i < int(x[0]) + 1:
    pointdict[i] = int(x[1])
    i += 1

l = 0
while l < int(x[2]):
    ans = input()
    y.append(ans)
    l += 1

print(y)

for i in y:
    for e in plist:
        if e != int(i):
            pointdict[e] -= 1

print(pointdict)

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


x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    plist[i-1] += 1

for p in plist:
    if p - int(x[2]) > 0:
        print("Yes")
    else:
        print("No")


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):
10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9

#!/usr/bin/env python3
a,b,c=map(int,input().split())
d=[b]*a
for i in[int(input())-1for _ in range(0,c)]:d[i]+=1
for i in d:print("Yes")if i-c>0 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_list=[int(input()) for i in range(q)]

for i in range(n):
  if a_list.count(i) > q-k:
    print("Yes")
  else:
    print("No")

n,k,q=map(int,input().split())
li=[0]*n
for i in range(q):
  a=int(input())
  li[a-1]+=1
for i in range(n):
  if li[i]>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):
def main():
    N,K,Q=map(int,input().split())
    sum2=[]
    score=[K]*N
    for i in range(Q):
        num=int(input())
        comp[i][:num-1]=[-1]*[num-1]
        comp[i][num-1]=[0]
        comp[i][num:N]=[-1]*[N-num]
    for i in range(N):
        sum2.append(sum(comp[i]))
    for i,j in score,sum2:
        score.append(i+j)
    for s in score:
        if s>0:
            print('Yes')
        else:
            print('No')

if __name__=='__main__':
    main()


n, k, q = map(int, input().split())
points = [k] * n
a = []
for i in range(q):
    a.append(int(input())-1)
for cand in a:
    points[cand] += 1
points = [i-q for i in points]
ans = ["YES" if i > 0 else "NO" for i in points]
print(*ans, sep="\n")

def main():
    N,K,Q=map(int,input().split())
    sum2=[]
    score=[K]*N
    for i in range(Q):
        num=int(input())
        comp[i][:num-1]=[-1]*[num-1]
        comp[i][num-1]=[0]
        comp[i][num:N]=[-1]*[N-num]
    for i in range(N):
        sum2.append(sum(comp[i]))
    for i,j in zip(score,sum2):
        score.append(i+j)
    for s in score:
        if s>0:
            print('Yes')
        else:
            print('No')

if __name__=='__main__':
    main()


def main():
    N,K,Q=map(int,input().split())
    sum2=[]
    score=[]
    for i in range(Q):
        num=int(input())
        comp[i][:num-1]=[-1]*[num-1]
        comp[i][num-1]=[0]
        comp[i][num:N]=[-1]*[N-num]
    for i in range(N):
        sum2.append(sum(comp[i]))
    for i,j in score,sum2:
        score.append(i+j)
    for s in score:
        if s>0:
            print('Yes')
        else:
            print('No')

if __name__=='__main__':
    main()


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

Verdicts: Runtime Error

Wrong Answer

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 = [int(input())-1 for _ in range(Q)]
Point = [K]*N
print(A)
for i in range(Q):
    Point[A[i]] += 1
    for j in range(N):
        Point[j] -= 1

for p in Point:
    if p>0:
        print('Yes')
    else:
        print('No')

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

for p in Point:
    if p>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):
# ABC141c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

sanka = [k]*n

for i in a:
    sanka[i-1] += 1
    for j in range(n):
        sanka[j] -= 1
print(sanka)

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

# ABC141c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

sanka = [0]*n

for i in a:
    sanka[i-1] += 1
# print(sanka)

for i in sanka:
    print('Yes' if i+k-q > 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())
score = [K-Q]*N
A = [0]*Q
for i in range(Q):
    A[i] = int(input())

for a in A:
    score[a] += 1

print(*map(lambda x:['No','Yes'][x>0],score),sep='\n')

N,K,Q = map(int,input().split())
score = [K-Q]*N
A = [0]*Q
for i in range(Q):
    A[i] = int(input())

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

for i in map(lambda x:['No','Yes'][x>0],score):
    print(i)

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


n,k,q =map(int, input().split())
a = [int(input()) for _ in range(q)]
score = [k-q]*n
for i in range(q):
    temp = a[i]-1
    score[temp] =  score[temp] + 1
for i in range(n):
    if score[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):
# input
N, K, Q = map(int, input().split())
points = {}
for i in range(1, N + 1):
    points[i] = K

for q in range(Q):
    A = int(input())

    
    for k in points.keys():
        if k != A:
            points[k] -= 1

# output
for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")

# input
N, K, Q = map(int, input().split())
points = [K] * N
for q in range(Q):
    A = int(input())

    
    map(lambda x: x - 1, points)
    points[A - 1] += 1

for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")

# input
N, K, Q = map(int, input().split())
points = {}
for i in range(1, N + 1):
    points[i] = 0

for q in range(Q):
    A = int(input())

    
    points[A] += 1

# output
for k in points.keys():
    if K - Q + points[k] > 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):
# coding: utf-8

def reader(N):
    for n in range(N):
        yield input()

def main():
    N, K, Q = input().split()
    N, K, Q = int(N), int(K), int(Q)
    participants = [K-Q for _ in range(N)]
    for a in reader(Q):
        participants[int(a)-1] += 1
    
    print(participants)
    for p in participants:
        if p > 0:
            print('Yes')
        else:
            print('No')

main()


# coding: utf-8

def reader(N):
    for n in range(N):
        yield input()

def main():
    N, K, Q = input().split()
    N, K, Q = int(N), int(K), int(Q)
    participants = [K-Q for _ in range(N)]
    for a in reader(Q):
        participants[int(a)-1] += 1
    
    for p in participants:
        if p > 0:
            print('Yes')
        else:
            print('No')

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):
X = list(map(int, input().split()))
N = [X[1]-X[2]]*X[0]
Q = []
for i in range(X[2]):
  Q.append(int(input()))
for i in range(X[2]):
  N[Q[i]]+=1
for result in N:
  if(result >= 1):
    print('Yes')
  else:
    print('No')

X = list(map(int, input().split()))
N = [X[1]-X[2]]*X[0]
Q = []
for i in range(X[2]):
  Q.append(int(input()))
for i in range(X[2]):
  N[Q[i]-1]+=1
for result in N:
  if(result >= 1):
    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 collections
N,K,Q = map(int,input().split())

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
    ans_list[key[i]] = val[i]
#print(ans_list)

for i in range(N):
    if ans_list[i] > jud:
        print("Yes")
    else:
        print("No")

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

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

ans_list = [K] * N

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

for i in range(N):
    if ans_list[i] > K+1:
        print("Yes")
    else:print("No")

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

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
  ans_list[key[i]-1] = val[i]

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > jud:
        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):
import numpy as np
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

b = [k for _ in range(n)]
list = [0 for _ in range(n)]

for i in a:
    list[i-1] += 1
print(list)

for i in list:
    if q -k < i:
        print('Yes')
    else:
        print('No')

import numpy as np
n,k,q = map(int,input().split())
a = [int(input()) for _ in range(q)]

b = [k for _ in range(n)]
list = [0 for _ in range(n)]

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

for i in list:
    if q -k < i:
        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 _ in range(Q):
  A.append(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
for ii in range(N):
  if point_list[ii] > 0 :
    print('yes')
  else :
    print('No')

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

N,K,Q = map(int,input().split())
A = []
for _ in range(Q):
  A.append(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
for ii in range(N):
  if point_list[ii] > 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):
import numpy as np
def python_list_sub(in1, in2):
    wrk = np.array(in1) - np.array(in2)
    return wrk.tolist()


n, k, q = map(int,input().split())
#A = []
Po = []
De = [1 for i in range(n)]

A = [int(input()) for i in range(q)]
#print(A)

for i in range(n):
    Po.append(int(k))
print(Po)



for i in range(q):
    
    ans = python_list_sub(Po, De)
print(ans)

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








'''
import numpy as np
def python_list_sub(in1, in2):
    wrk = np.array(in1) + np.array(in2)
    return wrk.tolist()
'''


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


A = [int(input()) for i in range(q)]
#print(A)


for i in range(n):
    Po.append(int(k-q))
#print(Po)



for j in A:
    #print(j,A[j])
    Po[j-1] += 1
#print(Po)

for i in range(n):
    if Po[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,*A = map(int, open(0).read().split())
ans = [K] * N

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

for x in ans:
    y = x - Q
    print('Yes' if x > 0 else 'No')


N,K,Q,*A = map(int, open(0).read().split())
ans = [K] * N

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

for x in ans:
    y = x - Q
    print('Yes' if y > 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())
points = [k] * n
for i in range(q):
    x = int(input())
    points[x] += 1
for x in points:
    x -= q
    if x <= 0:
        print("No")
    else:
        print("Yes")






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






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


for i in range(q):
    x = int(input())
    points[x-1] += 1
for x in points:
    x -= q
    if x <= 0:
        print("No")
    else:
        print("Yes")






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_i = list()
for k in range(Q):
    k = int(input())
    A_i.append(k)

First = [K-Q] * N

for i in A_i:
    First[i] += 1
for j in First:
    if j <= 0:
        print('No')
    else:
        print('Yes') 

N,K,Q = map(int,input().split(' '))
A_i = list()
for k in range(Q):
    k = int(input())
    A_i.append(k)

First = [K-Q] * N

for i in A_i:
    First[i-1] += 1
for j in First:
    if j <= 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):
def main():
  
  n, k, q = map(int, input().split())
  a = [ int(input()) for i in range(q) ]
  a_count = a.count

  for i in range(1,n+1):
    x = a_count(i)
    if k-q+x > 0:
      print('Yes')
      else:
        print('No')


if __name__ == '__main__':
    main()

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

for i in range(1,n+1):
    x = a.count(i)
    if k-q+x > 0:
        print('YES')
    else:
        print('NO')

n, k, q = map(int, input().split())
a = [ int(input()) for i in range(q) ]
score = [k-q]*n
for i in a:
    score[i-1] += 1
for i in score:
    print('Yes' if i > 0 else '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):
10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9

import sys

N,K,Q=(int(x) for x in input().split())
#Ai=[]
par=[]
for i in range(N):
	par.append(K)

par = [0] * N

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


#Ai.append(a)
#print(par)
for i in range(N):
	if par[i]+K > Q:
		print("Yes")
	else:
		print("No")
#print(par)

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())
initializer_list = [0] * N
print(initializer_list)
for _ in range(Q):
    i = int(input())-1
    initializer_list[i] += 1
    

[print('Yes') if (Q - initializer_list[i] < K) else print('No')  for i in range(N)]


import numpy as np
N , K ,Q = map(int, input().split())
initializer_list = [0] * N
for _ in range(Q):
    i = int(input())-1
    initializer_list[i] += 1
    

[print('Yes') if (Q - initializer_list[i] < K) else print('No')  for i in range(N)]


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 _ in range(N)]
for _ in range(Q):
    A = int(input()) - 1
    P[A] += 1

for p in P:
    if Q + 1 <= p:
        print('Yes')
    else:
        print('No')


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

P = [K for _ in range(N)]
for _ in range(Q):
    A = int(input()) - 1
    P[A] += 1

for p in P:
    if Q > p:
        print('No')
    else:
        print('Yes')


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

P = [K for _ in range(N)]
for _ in range(Q):
    A = int(input()) - 1
    P[A] += 1

for p in P:
    if Q + 1 <= p:
        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 = map(int, input().split(' '))
res = [K for _ in range(N)]
for i in range(Q):
    a = int(input())
    res = list(map(lambda n: n-1, res))
    res[a] = res[a] + 1
for i in range(N):
    print('Yes' if res[i] > 0 else 'No')


N, K, Q = map(int, input().split(' '))
res = [0 for _ in range(N)]
for i in range(Q):
    a = int(input()) - 1
    res[a] = res[a] + 1
res = list(map(lambda n: n - Q + K, res))
for i in range(N):
    print('Yes' if res[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 = input().split()
N=int(N)
K=int(K)
Q=int(Q)
 
seikai_list = [K - Q] * N
for i in range(Q):
  num = int(input()) -1
  seikai_list[num] = seikai_list[num] +1

for n in seikai_list:
  if n > 0:
    print("yes")
  else:
    print("No")


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

seikai_list = [K - Q] * N
for i in range(Q):
  num = int(input()) -1
  seikai_list[num] = seikai_list[num] +1

for n in seikai_list:
  if 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())
A = list(map(int, input().split))

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)



import numpy as np

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

players_score = np.array([k for i in range(k)])

for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)

import numpy as np

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

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)



import numpy as np

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

players_score = np.full(n, k-q)

for item in a:
    players_score[item-1] += 1

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

Verdicts: 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):
# INPUT
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
print(A)
# PROCESS
points = [0 for x in range(N+1)]
for x in A:
    points[x]+=1
print(points)
threshold = K - Q
# OUPUT
for y in range(1, N+1):
    if threshold + points[y] > 0:
        print("Yes")
    else:
        print("No") 






# INPUT
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
# PROCESS
points = [0 for x in range(N+1)]
for x in A:
    points[x]+=1
threshold = K - Q
# OUPUT
for y in range(1, N+1):
    if threshold + points[y] > 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 sys	

num1 = list(map(int, input().split()))
N = num1[0] 
K = num1[1] 
Q = num1[2] 
ans_list = []
for index1 in range(Q):
	ans_list.append(int(input()))
for index1 in range(1,N+1):
	point = 0
	for index2 in ans_list:
		if index1==ans_list[index2]:
			point +=1

	fin=K+point-Q
	
	if fin <=0:
		print("No")
	else:
		print("Yes")
		

N, K, Q = map(int,input().split())
point_list = [0 for i in range(N+1)]
for i in range(Q):
    A = int(input())
    point_list[A]+=1
for i in range(1,N+1):
    if point_list[i]+K-Q<=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())
a = [int(input()) for _ in range(q)]
p = k - q
s = [[i, p] for i in range(n)]
for i in a:
    s[i][1] += 1

for i in s:
    if i[1] < 1:
        print("No")
    else:
        print("Yes")


n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
p = k - q
s = [p]*n
for i in a:
    s[i-1] += 1

for i in s:
    if i < 1:
        print("No")
    else:
        print("Yes")


Verdicts: Runtime Error

Accepted