input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n_people, full_p, n_ques = list(map(int, input().split()))
point = [full_p]*n_people
for i in range(n_ques):
people = int(eval(input()))
for j in range(n_people):
if (j+1) != people: point[j] -= 1
for i in range(n_people):
if point[i]>0: print('Yes')
else: print('No') | n_people, full_p, n_ques = list(map(int, input().split()))
count = [0]*n_people
for i in range(n_ques):
people = int(eval(input()))
count[people-1] += 1
for i in range(n_people):
if count[i] > n_ques-full_p:
print('Yes')
else:
print('No') | p02911 |
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(Q)]
S=[K]*N
for i in range(Q):
S[A[i]-1]+=1
for j in range(N):
S[j]-=1
if S[j]<=0:
S[j]=-10000000000
for k in range(N):
if S[k]>0:
... | import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(Q)]
S=[K-Q]*N
for i in range(Q):
S[A[i]-1]+=1
for k in range(N):
if S[k]>0:
print("Yes")
else:
print("No")
| p02911 |
def main():
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
point = [k] * n
for i in range(q):
point = list([x - 1 for x in point])
point[a[i]-1] += 1
for i in range(n):
if point[i] > 0:
... | def main():
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
point = [0] * n
for i in range(q):
# point = list(map(lambda x: x - 1, point))
point[a[i]-1] += 1
for i in range(n):
if k - (q - point[i]) ... | p02911 |
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
""" main """
N,K,Q = list(map(int,... | import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
""" main """
N,K,Q = list(map(int,... | p02911 |
n,k,q=list(map(int,input().split()))
l=[0]*n
for i in range(q):
l[int(eval(input()))-1]+=1
for i in range(n):
if l[i]>q-k:print("Yes")
else:print("No") | import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
n,k,q=list(map(int,input().split()))
A=[q-k]*n
for i in range(q):
A[int(eval(input()))-1]-=1
for i in A:
print(("Yes"... | p02911 |
#!/usr/bin/env python3
N,K,Q=(int(x) for x in input().split())
a=[int(eval(input())) for i in range(Q)]#正解者
l=[]
for j in range(N):
l.append(K)
for k in range(Q):
for m in range(N):
l[m]-=1
if m+1==a[k]:
l[m]+=1
for n in range(N):
if(l[n]>=1):
print("Yes")
... | #!/usr/bin/env python3
N,K,Q=(int(x) for x in input().split())
a=[int(eval(input())) for i in range(Q)]#正解者
l=[]
for j in range(N):
l.append(K-Q)
for k in range(Q):
l[a[k]-1]+=1
for n in range(N):
if(l[n]>=1):
print("Yes")
else:
print("No") | p02911 |
# coding: utf-8
# In[3]:
N,K,Q=list(map(int,input().split()))
# In[6]:
A = []
for i in range(Q):
A.append(int(eval(input())))
# In[10]:
for i in range(N):
score = K-Q + A.count(i+1)
if score > 0:
print("Yes")
else:
print("No")
|
# coding: utf-8
# In[11]:
N,K,Q=list(map(int,input().split()))
# In[13]:
ans = [0] * N
for i in range(Q):
ans[int(eval(input()))-1]+=1
# In[14]:
for i in range(N):
score = K-Q + ans[i]
if score > 0:
print("Yes")
else:
print("No")
| p02911 |
N,K,Q=list(map(int,input().split()))
ans=[K for i in range(N)]
ans=list([x-Q for x in ans])
for i in range(Q):
A=int(eval(input()))
ans[A-1]=ans[A-1]+1
for i in range(N):
if ans[i]>0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
a_list = [int(eval(input()))-1 for _ in range(q)]
p_list = [k-q for _ in range(n)]
for a in a_list:
p_list[a] += 1
for p in p_list:
if p <= 0:
print("No")
else:
print("Yes")
| p02911 |
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
t = int(eval(input()))
a.append(t)
m = [k] * n
for i in a:
for j in range(n):
if j != i - 1:
m[j] -= 1
for i in m:
print(("Yes" if i>0 else "No")) | n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
t = int(eval(input()))
a.append(t)
m = [k - q] * n
for i in a:
m[i-1] += 1
for i in m:
print(("Yes" if i>0 else "No")) | p02911 |
import sys
input = sys.stdin.readline
n,k,q = list(map(int,input().split()))
A = []
for i in range(q):
A.append(int(eval(input())))
for i in range(1,n+1):
if A.count(i) > q-k:
print('Yes')
else:
print('No')
| import sys
input = sys.stdin.readline
n,k,q = list(map(int,input().split()))
A = [0]*n
for i in range(q):
A[int(eval(input()))-1] +=1
for i in range(n):
if A[i] > q-k:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int, input().split()))
corr = [k-q]*n
for _ in range(q):
a = int(eval(input())) - 1
corr[a] += 1
for c in corr:
if c > 0:
print('Yes')
else:
print('No') | n,k,q = list(map(int, input().split()))
a_cnt = [0]*n
for _ in range(q):
a = int(eval(input())) - 1
a_cnt[a] += 1
for a in a_cnt:
if k - (q-a) > 0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
A = list(int(eval(input())) for i in range(Q))
for i in range(N):
cnt = A.count(i + 1)
if K - (Q - cnt) > 0:
print('Yes')
else:
print('No') | N, K, Q = list(map(int, input().split()))
A = list(int(eval(input())) for i in range(Q))
P = [-(Q - K)] * N
for a in A:
P[a - 1] += 1
for p in P:
if p > 0:
print('Yes')
else:
print('No')
| p02911 |
n,k,q = list(map(int,input().split()))
a = []; b = [0]*n
for i in range(q):
c = int(eval(input()))
a.append(c)
b[c-1] += 1
for i in b:
if k-(q-i) <= 0:
print("No")
else:
print("Yes") | n,k,q = list(map(int,input().split()))
b = [0]*n
for i in range(q):
c = int(eval(input()))
b[c-1] += 1
for i in b:
if k-(q-i) <= 0:
print("No")
else:
print("Yes") | p02911 |
N, K, Q = list(map(int, input().split()))
PO = [K]*N
while Q:
c = int(eval(input()))
for i in range(N):
if i==(c-1):
pass
else:
PO[i]-=1
Q-=1
for i in range(N):
if PO[i]>0:
print("Yes")
else:
print("No")
| n, k, q = list(map(int, input().split()))
po = [0]*n
r = q-k
while q:
c = int(eval(input()))
po[c-1]+=1
q-=1
for i in range(n):
if po[i]>r:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
#B = [0]*N
S = - K + Q
for i in range(N):
if A.count(i+1) > S :
# B[i] += S + A.count(i+1)
# if B[i] > 0:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [K-Q]*N
for i in range(Q):
B[A[i]-1] += 1
for i in range(N):
#if A.count(i+1) > S :
# B[i] += S + A.count(i+1)
if B[i] > 0:
print("Yes")
else:
print("No")
| p02911 |
N, K, Q = list(map(int, input().split()))
a = [K]*N
for i in range(Q):
b = [1]*N
s = int(eval(input()))
b[s-1] = 0
for j in range(N):
a[j] -= b[j]
for i in a:
if i > 0:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
a = [-1*Q]*N
for i in range(Q):
s = int(eval(input()))
a[s-1] += 1
for i in a:
#print(i)
if K + i > 0:
print("Yes")
else:
print("No")
| p02911 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fr... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fr... | p02911 |
N,K,Q=list(map(int,input().split()))
check=[K]*N
for i in range(Q):
A=int(eval(input()))-1
for j in range(N):
if j!=A:
check[j]-=1
for i in range(N):
print(("Yes" if check[i]>0 else "No"))
| N,K,Q=list(map(int,input().split()))
check=[K-Q]*N
for i in range(Q):
A=int(eval(input()))-1
check[A]+=1
for i in range(N):
print(("Yes" if check[i]>0 else "No"))
| p02911 |
n, k ,q =list(map(int, input().split()))
lis = []
for _ in range(q):
lis.append(int(eval(input())))
ori = k - q
for i in range(n):
if ori + lis.count(i+1) > 0:
print("Yes")
else:
print("No")
| n, k ,q =list(map(int, input().split()))
lis = [k-q] * n
for _ in range(q):
tmp = int(eval(input()))
lis[tmp - 1] += 1
for i in lis:
if i > 0:
print("Yes")
else:
print("No") | p02911 |
import sys
input = sys.stdin.readline
N, K, Q = [int(value) for value in input().split(' ')]
A = [int(eval(input())) for _ in range(Q)]
for i in range(N):
if K - Q + A.count(i + 1) > 0:
print('Yes')
else:
print('No')
| import sys
input = sys.stdin.readline
N, K, Q = [int(value) for value in input().split(' ')]
A = [int(eval(input())) for _ in range(Q)]
points = [K - Q] * N
for value in A:
points[value - 1] += 1
for point in points:
if point <= 0:
print('No')
else:
print('Yes')
| p02911 |
N, K, Q = [int(x) for x in input().strip().split()]
A = [int(input().strip()) for _ in range(Q)]
dp = [K] * N
for a in A:
a -= 1
for n in range(N):
if n != a:
dp[n] -=1
for s in dp:
if s > 0:
print('Yes')
else:
print('No') | N, K, Q = [int(x) for x in input().strip().split()]
A = [int(input().strip()) for _ in range(Q)]
dp = {p:0 for p in range(N)}
for a in A:
dp[a-1] += 1
for n in range(N):
if dp[n] + K - Q > 0:
print('Yes')
else:
print('No') | p02911 |
# 入力
data = input().split()
# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])
# はじめの各プレイヤのポイント
playerPoint = []
for i in range(player):
playerPoint.append(initPoint)
# 問題解答
for i in range(question):
# 全員のポイントを-1
playerPoint = [i-1 for i in... | # 入力
data = input().split()
# プレイヤ人数
player = int(data[0])
# はじめのポイント
initPoint = int(data[1])
# 質問回数
question = int(data[2])
# 正解しない場合のプレイヤのポイント
playerPoint = []
for i in range(player):
playerPoint.append(initPoint - question)
# 問題解答
for i in range(question):
# 正解者
corrPlayer = int(eva... | p02911 |
N,K,Q= [int(s) for s in input().split()]
A = [int(eval(input())) for _ in range(Q)]
temp=[0]*N
for i in A:
temp[i-1]=temp[i-1]+1
ans = list([K-(Q-x) for x in temp])
for t in ans:
if t>0:
print("Yes")
else:
print("No") | N,K,Q= [int(s) for s in input().split()]
A = [int(eval(input())) for _ in range(Q)]
temp=[0]*N
for i in A:
temp[i-1]=temp[i-1]+1
ans=[K - (Q- d) for d in temp]
#ans = list(map(lambda x: K-(Q-x), temp))
for t in ans:
if t>0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
Point = []
for i in range(N):
Point.append(K - Q + A.count(i+1))
if Point[i] > 0:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
A = sorted(A)
Acount = 0
j = 0
Point = []
for i in range(N):
while j != len(A):
if A[j] == i + 1:
Acount += 1
j +=1
else:
break
Point.append(K - Q + Acoun... | p02911 |
def main():
n, k, q = list(map(int, input().split()))
point = [0]+[k-q]*n
point_add = [0]*(n+1)
for a in range(q):
a = int(eval(input()))
point[a] += 1
result = [x + y for (x, y) in zip(point, point_add)]
for i in result[1:]:
if i <= 0:
print("No... | def main():
n, k, q = list(map(int, input().split()))
point = [0]+[k-q]*n
for a in range(q):
point[int(eval(input()))] += 1
for i in point[1:]:
if i <= 0:
print("No")
else:
print("Yes")
if __name__ == '__main__':
main()
| p02911 |
n,k,q=list(map(int,input().split()))
l=[k]*n
for i in range(q):
a=int(eval(input()))
for j in range(n):
l[j]-=1
if j==a-1:
l[j]+=1
for k in l:
if k>0:
print('Yes')
else:
print('No') | n,k,q=list(map(int,input().split()))
l=[k-q]*n
for i in range(q):
a=int(eval(input()))
l[a-1]+=1
for k in l:
if k>0:
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split()))
list_A = []
for _ in range(q):
i = int(eval(input()))
list_A.append(i)
list_per = [k]*n
for i in list_A:
i = i -1
list_per = [x-1 for x in list_per]
list_per[i] = list_per[i] + 1
for i in list_per:
if i <=0:
print("No")
... | n, k, q = list(map(int, input().split()))
list_A = []
for _ in range(q):
i = int(eval(input()))
list_A.append(i)
list_per = [0]*n
for i in list_A:
i = i - 1
list_per[i] = list_per[i] + 1
for i in list_per:
if k - q + i > 0:
print("Yes")
else:
print("No")
| p02911 |
N,K,Q = list(map(int, input().split()))
A =[int(eval(input())) for _ in range(Q)]
ans =[]
for i in range(N):
if K - (Q-(A.count(i+1))) > 0:
print("Yes")
else:
print("No") | N,K,Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
cnt =[0,]*N
for i in range(Q):
cnt[(A[i]-1)] += 1
for i in range(N):
if K-Q+cnt[i] > 0:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int,input().split()))
pts = [0]*(n+1)
for _ in range(q):
a = int(eval(input()))
pts[a] += 1
ans = [k+a-q for a in pts]
for v in ans[1:]:
print(('Yes' if v>0 else 'No')) | n,k,q = list(map(int,input().split()))
pts = [0]*(n+1)
for _ in range(q):
a = int(eval(input()))
pts[a] += 1
for v in pts[1:]:
print(('Yes' if v+k-q>0 else 'No')) | p02911 |
n,k,q = list(map(int,input().split()))
pts = [0]*(n+1)
for _ in range(q):
a = int(eval(input()))
pts[a] += 1
for v in pts[1:]:
print(('Yes' if v+k-q>0 else 'No')) | n,k,q=list(map(int,input().split()))
pts=[0]*n
for _ in range(q):pts[int(eval(input()))-1]+=1
for v in pts:print(('Yes' if v+k-q>0 else 'No')) | p02911 |
n, k, q = list(map(int, input().split()))
arr = [int(k)] * n
for i in range(q):
q_i = int(eval(input()))
for j in range(len(arr)):
arr[j] = arr[j] - 1
arr[q_i - 1] += 1
for go_or_not in arr:
if go_or_not > 0:
print("Yes")
else:
print("No")
| n, k, q = list(map(int, input().split()))
q_list = [int(eval(input())) for i in range(q)]
arr = [k - q] * n
for q_i in q_list:
arr[q_i - 1] += 1
for go_or_not in arr:
if go_or_not > 0:
print("Yes")
else:
print("No")
| p02911 |
a = []
a = input().split()
N = int(a[0])
K = int(a[1])
Q = int(a[2])
A = []
for i in range(Q) :
A.append(eval(input()))
A = [int(n) for n in A]
Point = [K for i in range(N)]
for i in range(Q) :
for j in range(N) :
if j+1 == A[i] :
Point[j] = Point[j]
else :
Point[j] = Poin... | a = []
a = input().split()
N = int(a[0])
K = int(a[1])
Q = int(a[2])
A = []
for i in range(Q) :
A.append(int(eval(input())))
point = [K-Q for i in range(N)]
for i in range(Q) :
point[A[i]-1] = point[A[i]-1] + 1
for i in range(N) :
if point[i] > 0 :
print('Yes')
else :
print('No')
| p02911 |
# n: 参加者人数
# k: 初期ポイント
# q: ラウント回数
n, k, q = list(map(int, input().split()))
data = [ int(eval(input())) for _ in range(q) ]
table = [k] * n
for winnner in data:
for j in range(n):
table[j] -= 1
table[winnner - 1] += 1
for k in range(n):
if table[k] > 0:
print("Yes")
... | # n: 参加者人数
# k: 初期ポイント
# q: ラウント回数
n, k, q = list(map(int, input().split()))
data = [ int(eval(input())) for _ in range(q) ]
table = [k] * n
for winnner in data:
table[winnner - 1] += 1
for j in range(n):
table[j] -= q
for k in range(n):
if table[k] > 0:
print("Yes")
els... | p02911 |
n, k, q = list(map(int, input().split()))
correct = []
for _ in range(q):
a = int(eval(input()))
correct.append(a)
for i in range(1, n+1):
if k - (q - correct.count(i)) > 0:
print("Yes")
else:
print("No") | n, k, q = list(map(int, input().split()))
point = [k-q] * n
for _ in range(q):
a = int(eval(input()))
point[a-1] += 1
for p in point:
if p > 0:
print("Yes")
else:
print("No")
| p02911 |
from collections import Counter
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
count_a = Counter(a)
for i in range(1, n+1):
point = k
for key, value in list(count_a.items()):
if key != i:
point -= value
if point <= 0:
print("No")
... | #正解者以外のポイントを1減らすことと、全員のポイントを1減らしてから正解者のポイントだけ1増やすのは同じこと
from collections import Counter
n, k, q = list(map(int, input().split()))
point = k - q
participant = [point] * n
answer = [int(eval(input())) for _ in range(q)]
count_a = Counter(answer)
for key, value in list(count_a.items()):
participant[key-1] ... | p02911 |
# C - Attack Survival
N, K, Q = list(map(int, input().split()))
P = [K] * N
for _ in range(Q):
P = [p - 1 for p in P]
i = int(eval(input())) - 1
P[i] += 1
for p in P:
if 0 < p:
print('Yes')
else:
print('No')
| # C - Attack Survival
N, K, Q = list(map(int, input().split()))
P = [0] * N
for _ in range(Q):
P[int(eval(input())) - 1] += 1
for p in P:
if 0 < K - Q + p:
print('Yes')
else:
print('No')
| p02911 |
#!/usr/bin/env python
# coding: utf-8
from collections import Counter
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def main():
n, k, q = rli()
ca = Counter()
for _ in range(q):
a = ri()... | #!/usr/bin/env python
# coding: utf-8
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def check(s):
for i in range(len(s)):
if s[i] != s[len(s)-1-i]:
return False
return True
def m... | p02911 |
def resolve():
n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
pnt=[k]*n
for i in range(q):
for k in range(n):
pnt[k]-=1 if k!=a[i]-1 else 0
for i in range(n):
print(('Yes' if pnt[i]>0 else 'No'))
resolve() | def resolve():
n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
pnt=[k-q]*n
for i in a:
pnt[i-1]+=1
for i in range(n):
print(('Yes' if pnt[i]>0 else 'No'))
resolve() | p02911 |
N,K,Q = list(map(int,input().split()))
human = [K for i in range(N)]
for i in range(Q):
p = int(eval(input()))
human = [human[j]-1 if j != p-1 else human[j] for j in range(N)]
for i in range(N):
if human[i] <= 0:
print("No")
else:
print("Yes")
| N,K,Q = list(map(int,input().split()))
human_win = [0 for i in range(N)]
win = Q - K
for i in range(Q):
human_win[int(eval(input()))-1] += 1
for i in range(N):
if human_win[i] > win:
print("Yes")
else:
print("No") | p02911 |
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(Q)]
score=[]
answer=[]
for i in range(N):
score.append(K)
for j in range(Q):
for k in range(N):
if k+1==A[j]:
pass
else:
score[k]-=1
for m in range(N):
if score[m]<=0:
... | N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(Q)]
a=[K-Q]*N
for i in A:
a[i-1]+=1
for j in a:
if j>0:
print("Yes")
else:
print("No") | p02911 |
N,K,Q=list(map(int, input().split()))
A=[]
for _ in range(Q):
A.append(int(eval(input()))-1)
for i in range(N):
if K-Q+A.count(i)>0:
print("Yes")
else:
print("No") | N,K,Q=list(map(int, input().split()))
S=[0]*N
for _ in range(Q):
S[int(eval(input()))-1]+=1
for i in range(N):
if K-Q+S[i]>0:
print("Yes")
else:
print("No") | p02911 |
# 入力の取得(1行目。数値)
i = list(map(int, input().split()))
# 変数セット
# 1.配列[添字=人数、値=初期の点数]
points = [i[1]] * i[0]
# 2.正解数(引数の数)
correntCount = i[2]
# 正解数ループ
for i in range(correntCount):
correcter = int(eval(input())) - 1
#全てを1減算
points = [ n - 1 for n in points]
#正解者に1加算(正解者以外を減算するため)
p... | # 入力の取得(1行目。数値)
i = list(map(int, input().split()))
# 変数セット
# 1.配列[値=初期の点数-★正解数(解説より)★、個数=人数]
points = [i[1]- i[2]] * (i[0] )
# 2.正解数(引数の数)
correntCount = i[2]
# 正解数ループ
for i in range(correntCount):
correcter = int(eval(input())) - 1
#正解者に1加算
points[correcter] += 1
# 値が0以下の参加者は敗退(No)、1... | p02911 |
n, k, q = list(map(int, input().split()))
participants = [k for i in range(n)]
a = []
for i in range(q):
line = eval(input())
a.append(line)
for i in a:
for j in range(n):
if (int(i)-1) != j:
participants[j] -= 1
for i in participants:
if i <= 0:
print("No")
els... | n, k, q = list(map(int, input().split()))
points = [k-q for i in range(n)]
for i in range(q):
num = int(eval(input()))
points[num-1] += 1
for i in points:
if i <= 0:
print("No")
else:
print("Yes") | p02911 |
N, K, Q = list(map(int, input().split()))
P = [0] * N
for _ in range(Q):
a = int(eval(input())) - 1
P[a] += 1
for p in P:
if Q - p < K:
print("Yes")
else:
print("No") | import sys
N, K, Q = list(map(int, input().split()))
points = [0] * N
for _ in range(Q):
a = int(sys.stdin.readline())
points[a-1] += 1
for point in points:
if point > (Q - K):
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
alist = [int(eval(input())) for i in range(q)]
for i in range(1, n + 1):
if k + (-1)*(q - alist.count(i)) <= 0:
print('No')
else:
print('Yes') | n, k, q = map(int, input().split())
alist = [int(input()) for i in range(q)]
ans = [k - q] * n
for Ai in alist:
ans[Ai - 1] += 1
for Ai in ans:
print('Yes') if Ai > 0 else print('No')
| p02911 |
N, K, Q = list(map(int, input().split()))
acc_list = []
for i in range(Q):
acc_list.append(int(eval(input())))
point_dict = {}
for i in range(1, N+1):
point_dict[i] = K
for a in acc_list:
for key, valu in list(point_dict.items()):
if a != key:
point_dict[key] = valu - 1
... | N, K, Q = list(map(int, input().split()))
acc_list = []
for i in range(Q):
acc_list.append(int(eval(input())))
point_dict = {}
for i in range(1, N+1):
point_dict[i] = 0
for a in acc_list:
point_dict[a] += 1
for key, valu in list(point_dict.items()):
if (K - Q + valu) <= 0:
pri... | p02911 |
#!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(N: int, K: int, Q: int, A: "List[int]"):
p = [K] * N
for i in range(Q):
q = A[i]
p = list([x -1 for x in p])
p[q-1] += 1
for i in range(N):
if p[i] > 0:
... | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(N: int, K: int, Q: int, A: "List[int]"):
p = [Q] * N
for i in range(Q):
p[A[i]-1] -= 1
for i in range(N):
if K - p[i] > 0:
print(YES)
else:
print(N... | p02911 |
N,K,Q = list(map(int, input().split()))
seikaisha = [0 for _ in range(N)]
for _ in range(Q):
seikaisha[int(eval(input()))-1] += 1
for _ in seikaisha:
shitten = sum(seikaisha) - _
if K - shitten > 0:
print('Yes')
else:
print('No')
| N,K,Q = list(map(int, input().split()))
seikaisha = [0 for _ in range(N)]
for _ in range(Q):
seikaisha[int(eval(input()))-1] += 1
sum_seikai = sum(seikaisha)
for seikai in seikaisha:
shitten = sum_seikai - seikai
if K - shitten > 0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(Q)]
if K>Q:
for n in range(N):
print("Yes")
else:
N_dic={n+1:K for n in range(N)}
for a in A:
for k,v in list(N_dic.items()):
if a!=k:
N_dic[k]=v-1
for v in list(N_dic.values(... | N,K,Q=list(map(int,input().split()))
# A=[int(input()) for _ in range(Q)]
point=[0]*N
for i in range(Q):
point[int(eval(input()))-1]+=1
for i in range(N):
ans=K-(Q-point[i])
if ans>0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int,input().split()))
a = []
b = [0] * N
for i in range(Q):
A = int(eval(input()))
a.append(A)
for i in a:
for j in range(1,N + 1):
if i == j:
b[j - 1] += 1
for i in b:
if i > Q - K:
print('Yes')
else:
print('No')
| N, K, Q = list(map(int,input().split()))
a = []
b = [0] * N
for i in range(Q):
A = int(eval(input()))
a.append(A)
for i in a:
b[i - 1] += 1
for i in b:
if i > Q - K:
print('Yes')
else:
print('No')
| p02911 |
n,k,q = list(map(int, input().split()))
nl = [k]*n
a = []
for i in range(q):
a.append(int(eval(input())))
for j in a:
nl = list([x - 1 for x in nl])
nl[j-1] += 1
for k in range(n):
if nl[k] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int, input().split()))
nl = [k - q]*n
a = []
for i in range(q):
a.append(int(eval(input())))
for j in a:
nl[j-1] += 1
for k in range(n):
if nl[k] > 0:
print("Yes")
else:
print("No") | p02911 |
lis_NKQ = list(map(int, input().split()))
lis_A = []
lis_K = [lis_NKQ[1] for i in range(lis_NKQ[0])]
for i in range(lis_NKQ[2]):
lis_A.append(int(eval(input())))
for i in range(lis_NKQ[2]):
lis_K = list([x - 1 for x in lis_K])
for i in lis_A:
lis_K[i - 1] += 1
for i in lis_K:
if i > ... | lis_NKQ = list(map(int, input().split()))
lis_A = []
lis_K = [lis_NKQ[1] for i in range(lis_NKQ[0])]
lis_K = list([x - lis_NKQ[2] for x in lis_K])
for i in range(lis_NKQ[2]):
inp = int(eval(input()))
lis_A.append(inp)
lis_K[inp - 1] += 1
for i in lis_K:
if i > 0:
print("Yes")
... | p02911 |
n,k,q = list(map(int,input().split()))
L = [int(eval(input())) for i in range(q)]
P = [k - q for i in range(n)]
for i in range(q):
P[L[i] - 1] += 1
for i in range(n):
if P[i] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
A=[int(eval(input())) for i in range(q)]
P=[k-q for i in range(n)]
for i in range(q):
P[A[i]-1] +=1
for i in range(n):
if P[i]>0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
for i in range(1, N + 1):
if A.count(i) > Q - K:
print('Yes')
else:
print('No') | N, K, Q = list(map(int, input().split()))
A = [0] * N
for i in range(Q):
A[int(eval(input())) - 1] += 1
for i in range(N):
if A[i] > Q - K:
print('Yes')
else:
print('No') | p02911 |
n,k,q=(list(map(int,input().split())))
l=[int(eval(input())) for i in range(q)]
y=k-q
for i in range(1,n+1):
print(("Yes" if y+l.count(i)>0 else "No")) | n,k,q=list(map(int, input().split()))
p=[-q+k]*n
for i in range(0,q):
p[int(eval(input()))-1]+=1
for i in range(0,n):
print(("Yes" if p[i]>0 else "No")) | p02911 |
n,k,q=list(map(int,input().split()))
a=[]
for i in range(q):
a.append(int(eval(input())))
import collections
c=collections.Counter(a)
c=list(c.items())
p=[0]*n
for i in c:
p[i[0]-1]=i[1]
line=1-(k-q)
for i in p:
if i>=line:
print('Yes')
else:
print('No') | n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for i in range(q)]
score=[k-q]*n
for i in a:
score[i-1]+=1
for i in score:
if i>=1:
print('Yes')
else:
print('No') | p02911 |
n,k,q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(q)]
for i in range(n):
a=A.count(i+1)
ans=k-q+a
if ans>0:
print("Yes")
else:
print("No") | n,k,q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(q)]
li=[k-q for i in range(n)]
for i in range(q):
li[A[i]-1]=li[A[i]-1]+1
for i in range(n):
if li[i]>0:
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
l = [int(eval(input())) for i in range(q)]
points = [k] * n
for i in range(q):
points = list([x - 1 for x in points])
points[l[i] - 1] += 1
for i in points:
if i <= 0:
print('No')
else:
print('Yes')
| n, k, q = list(map(int, input().split()))
l = [int(eval(input())) for i in range(q)]
points = [k - q] * n
for i in range(q):
points[l[i] - 1] += 1
for i in points:
if i <= 0:
print('No')
else:
print('Yes')
| p02911 |
n, k, q = (int(_) for _ in input().split())
a = [int(eval(input())) for _ in range(q)]
for i in range(1, n+1):
print(('Yes' if k - q + a.count(i) > 0 else 'No'))
| n, k, q = (int(_) for _ in input().split())
a = [k-q] * (n+1)
for i in range(q):
a[int(eval(input()))] += 1
for i in range(1, n+1):
print(('Yes' if a[i] > 0 else 'No'))
| p02911 |
n, k, q = list(map(int, input().split()))
As = [int(eval(input())) for i in range(q)]
points = {i: k for i in range(n)}
for i in range(q):
solver = As[i] - 1
for j in range(n):
if j == solver:
continue
else:
points[j] -= 1
for i in range(n):
if points[i] <=... | n, k, q = list(map(int, input().split()))
As = [int(eval(input())) for i in range(q)]
points = {i: k for i in range(n)}
accepted = [0] * n
for i in range(q):
accepted[As[i]-1] += 1
for i in range(n):
if k - q + accepted[i] <= 0:
print("No")
else:
print("Yes")
| p02911 |
N,K,Q=list(map(int,input().split()))
B=[K]*N
def minu(n):
return n-1
for i in range(Q):
A=int(eval(input()))
if A==1:
B[1:]=list(map(minu,B[1:]))
elif A==N:
B[:-2]=list(map(minu,B[:-2]))
else:
B[:A-1]=list(map(minu,B[:A-1]))
B[A:]=list(map(minu,B[A:]))
for i in range(N):
if B[i... | N,K,Q=list(map(int,input().split()))
B=[0]*N
def minu(n):
return n-1
for i in range(Q):
A=int(eval(input()))
B[A-1]+=1
for i in range(N):
if B[i]>Q-K:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(1, Q+1)]
for i in range(1,N+1):
if A.count(i) > (Q-K):
print('Yes')
else:
print('No')
| N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
Point = [K-Q] * N
for c in A:
Point[c-1] += 1
for p in Point:
if p > 0:
print('Yes')
else:
print('No')
#if A.count(i) > (Q-K):
# print('Yes')
#else:
# print('No')
| p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
if p[x] <= 0:
return 'No'
else:
return 'Yes'
for j in range(q):
for i in range(n):
if i + 1 == a[j]:
continue
else:
p[i] -= 1
b... | n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
if p[x] - q <= 0:
return 'No'
else:
return 'Yes'
for i in range(q):
p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print(('\n'.join(b))) | p02911 |
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N, K, Q = rl()
A = []
for i in range(Q):
a = ri()
A.append(a)
scores = [K] * N
for a in A:
idx = a-1
for i in range(N):
if i !=... | import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N, K, Q = rl()
A = []
for i in range(Q):
a = ri()
A.append(a)
scores = [0] * N
for a in A:
idx = a-1
scores[idx] += 1
for s in ... | p02911 |
n,k,q = list(map(int,input().split()))
score = [k for i in range(n)]
a_i = [int(eval(input()))-1 for i in range(q)]
for i in range(len(a_i)):
for j in range(len(score)):
if(a_i[i] == j):
score[j] += 0
else:
score[j] -= 1
for i in score:
if(i > 0):
... | import sys
n,k,q = list(map(int,input().split()))
score = [k-q for i in range(n)]
a_i = [int(eval(input()))-1 for i in range(q)]
for i in range(len(a_i)):
score[a_i[i]] += 1
for i in score:
if(i > 0):
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split()))
answerer = []
for i in range(q):
answerer.append(int(eval(input())))
for i in range(1,n+1):
count_ans = answerer.count(i)
last_point = count_ans + k - q
if last_point > 0:
print("Yes")
else:
print("No")
| n, k, q = list(map(int, input().split()))
point = [k-q]*n
for i in range(q):
answerer = int(eval(input()))-1
point[answerer] += 1
for i in range(n):
if point[i] > 0:
print("Yes")
else:
print("No")
| p02911 |
def resolve():
N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
a = int(eval(input()))
A.append(a)
for i in range(1, N+1):
if K-Q+A.count(i)>0:
print("Yes")
else:
print("No")
resolve() | def resolve():
N, K, Q = list(map(int, input().split()))
A = [K-Q]*N
for _ in range(Q):
a = int(eval(input()))
A[a-1] += 1
for i in range(N):
if A[i] > 0:
print("Yes")
else:
print("No")
resolve() | p02911 |
get = list(map(int, input().split()))
N = get[0]
K = get[1]
Q = get[2]
point = [K]*N
list = [0]*N
for i in range(Q):
A = eval(input())
list.append(int(A))
for i in range(N):
if point[i] - (Q - list.count(i+1)) > 0:
print("Yes")
else:
print("No") | get = list(map(int, input().split()))
N = get[0]
K = get[1]
Q = get[2]
list = [0]*N
for i in range(Q):
list[int(eval(input())) - 1] += 1
for i in range(N):
if K - (Q - list[i]) > 0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
hit = [0]*N
poi = [K]*N
for i in range(N):
hit[i] = A.count(i+1)
poi[i] = K - Q + hit[i]
if poi[i] > 0: print('Yes')
else: print('No')
| N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
poi = [K-Q]*N
for i in range(Q):
poi[A[i]-1] += 1
for i in range(N):
if poi[i] > 0: print('Yes')
else: print('No') | p02911 |
n , k , q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
points = [k - q]*n
for i in range(n):
points[i] += a.count(i+1)
if points[i] >= 1:
print('Yes')
else:
print('No') | n , k , q = list(map(int, input().split()))
points = [k - q] * n
for i in range(q):
c = int(eval(input()))
points[c-1] += 1
for i in range(n):
if points[i] >= 1:
print('Yes')
else:
print('No') | p02911 |
# -*- coding: UTF-8 -*-
n, k, q = list(map(int, input().split(" ")))
a = []
points = []
for i in range(0,n):
points.append(k)
for s in range(0,q):
a = int(eval(input())) - 1
for l in range(0, len(points)):
if l != a:
points[l] = points[l]-1
for t in range(0, n):
result = "Yes"
if ... | n, k, q = list(map(int, input().split(" ")))
a = []
points = []
for i in range(0,n):
points.append(k - q)
for s in range(0,q):
a = int(eval(input())) - 1
points[a] = points[a] + 1
for t in range(0, n):
result = "Yes"
if points[t] <= 0:
result = "No"
print(result) | p02911 |
N,K,Q = list(map(int, input().split()))
A = []
for a in range(Q):
A.append(int(eval(input())))
for i in range(1,N+1):
judge = ((K-Q) + (A.count(i)))
if judge > 0 :
print("Yes")
else:
print("No") | N,K,Q = list(map(int, input().split()))
A = []
for a in range(Q):
A.append(int(eval(input())))
P = [K-Q] * N
for i in range(Q):
P[A[i]-1] += 1
for i in range(N):
if P[i] <= 0:
print("No")
else:
print("Yes")
| p02911 |
#ABC 141
N, K, Q = list(map(int, input().split()))
A = [int(eval(input()))-1 for i in range(Q)]
score = [K for i in range(N)]
for a in A:
for i in range(N):
if i == a:
continue
else:
score[i] -= 1
# 勝ち抜けチェック
for i in range(N):
if score[i] > 0:
print("Yes")
else:
print("No")
| #ABC 141
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
score = [0 for i in range(N)]
for a in A:
score[a-1] += 1
# 勝ち抜けチェック
for i in range(N):
if K-Q+score[i] > 0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
A.append(int(eval(input())))
#print(N,K,Q)
#print(A)
P = [K for _ in range(N)]
#print(P)
for a in A:
for n in range(N):
if (n==(a-1)):
P[n] += 1
#print(P)
for n in range(N):
if(P[n]-Q>0):
... | N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
A.append(int(eval(input())))
#print(N,K,Q)
#print(A)
P = [K for _ in range(N)]
#print(P)
for a in A:
P[a-1] += 1
#print(P)
for n in range(N):
if(P[n]-Q>0):
print('Yes')
else:
print('No') | p02911 |
N,K,Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
score = [K]*N
for i in range(Q):
score[A[i]-1] += 1
for j in range(N):
score[j] -= 1
for i in range(N):
if score[i] <= 0:
print('No')
else:
print('Yes') | N,K,Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
score = [0]*N
for i in range(Q):
score[A[i]-1] += 1
for i in range(N):
print(('YNeos'[score[i] + K <= Q::2])) | p02911 |
n, k, q = list(map(int, input().split()))
a = []
for _ in range(q):
a.append(int(eval(input())) - 1)
s = [k] * n
for i in range(q):
for j in range(n):
if a[i] != j:
s[j] -= 1
for i in range(n):
if s[i] > 0:
print("Yes")
else:
print("No") | n, k, q = list(map(int, input().split()))
win = [0] * n
for _ in range(q):
win[int(eval(input())) - 1] += 1
for i in range(n):
if k - q + win[i] > 0:
print("Yes")
else:
print("No") | p02911 |
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(Q)]
p=[K]*N
for a in A:
p = list([x-1 for x in p])
p[a-1]+=1
for i in p:
print(('Yes' if 0<i else 'No')) | N,K,Q=list(map(int,input().split()))
A=[0]*N
for _ in range(Q):
A[int(eval(input()))-1]+=1
p=[K-Q]*N
for a,b in zip(A,p):
print(('Yes' if 0<a+b else 'No')) | p02911 |
n,k,q = list(map(int,input().split()))
points = [k]*n
for i in range(q):
winner = int(eval(input()))
for j in range(n):
points[j] -= 1
points[winner - 1] += 1
for i in points:
if i > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
points = [k-q]*n
for i in range(q):
winner = int(eval(input()))
points[winner - 1] += 1
for i in points:
if i >0:
print("Yes")
else:
print("No") | p02911 |
import sys
input = sys.stdin.readline
n,k,q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(q)]
minus=[]
for i in range(1,n+1):
minus.append(A.count(i))
for i in range(n):
if k-(q-minus[i])<=0:
print('No')
else:
print('Yes') | import sys
import itertools
input = sys.stdin.readline
n,k,q=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(q)]
ans=[k]*n
for i in range(q):
ans[A[i]-1]+=1
for i in range(n):
if ans[i]-q>0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
if K > Q:
for _ in range(N):
print("Yes")
else:
for i in range(1, N + 1):
if i in A:
print(("{}".format("Yes" if (K + A.count(i) - Q) > 0 else "No")))
else:
print("No... | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
pnts = [0] * N
for i in A:
pnts[i - 1] += 1
for i in pnts:
if K - Q + i > 0:
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
score = [k]*n
for i in A:
score = list([x-1 for x in score])
score[i-1] = score[i-1]+1
for s in score:
if s > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
score = [k-q]*n
for i in A:
score[i-1] = score[i-1]+1
for s in score:
if s > 0:
print('Yes')
else:
print('No') | p02911 |
[N, K, Q] = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [K for i in range(N)]
for i in range(Q):
for j in range(N):
if j != A[i]-1:
B[j] -= 1
for i in range (N):
if B[i] <=0:
print('No')
else:
print('Yes')
| [N, K, Q] = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [0 for i in range(N)]
for i in range(Q):
B[A[i]-1] += 1
for i in range(N):
if K + B[i] - Q > 0:
print('Yes')
else:
print('No')
| p02911 |
n,k,q=list(map(int,input().split()))
ans=[k]*n
for i in range(q):
a=int(eval(input()))
for j in range(n):
if a-1!=j:
ans[j]=ans[j]-1
for i in range(n):
if ans[i]<=0:
print("No")
else:
print("Yes")
| n,k,q=list(map(int,input().split()))
ans=[k-q]*n
a=[0]*q
for i in range(q):
a[i]=int(eval(input()))
for i in range(q):
ans[a[i]-1]=ans[a[i]-1]+1
for i in range(n):
if ans[i]<=0:
print("No")
else:
print("Yes")
| p02911 |
N,K,Q = [int(x) for x in input().split()]
a = [K]*N
for _ in range(Q):
ai = int(eval(input()))
for i,aa in enumerate(a):
if i != ai-1:
a[i] -= 1
for aa in a:
if aa > 0:
print('Yes')
else:
print('No')
| N,K,Q = [int(x) for x in input().split()]
AI = [0]*N
for _ in range(Q):
ai = int(eval(input()))
AI[ai-1] += 1
sum_a = sum(AI)
for ai in AI:
if sum_a - ai >= K:
print('No')
else:
print('Yes')
| p02911 |
N,K,Q=list(map(int, input().split()))
list=[(K-Q) for j in range(N)]
for i in range(Q):
a=int(eval(input()))-1
list[a]+=1
for score in list:
if 0<score:
print("Yes")
else:
print("No")
| N,K,Q=list(map(int, input().split()))
list=[(K-Q) for j in range(N)]
for i in range(Q):
A=int(eval(input()))-1
list[A]+=1
for score in list:
if score>0:
print("Yes")
else:
print("No") | p02911 |
N,K,Q=list(map(int,input().split()))
A=[]
for i in range(Q):
A.append(int(eval(input())))
for j in range(1,N+1):
count=0
for k in A:
if k==j:
count+=1
if K-(Q-count)>0:
print('Yes')
else:
print('No') | N,K,Q=list(map(int,input().split()))
A=[0]*N
for i in range(Q):
a=int(eval(input()))
A[a-1]+=1
for j in range(N):
if A[j]>Q-K:
print('Yes')
else:
print('No')
| p02911 |
n, k, q = list(map(int, input().split()))
point = {}
tmp = 0
for i in range(q):
tmp = int(eval(input()))
if tmp in point:
point[tmp] += 1
else:
point[tmp] = 1
for b in range(1, n + 1):
tmp = 0
if b in point:
tmp = sum(point.values()) - point[b]
else... | n, k, q = list(map(int, input().split()))
point = {}
tmp = 0
for i in range(q):
tmp = int(eval(input()))
if tmp in point:
point[tmp] += 1
else:
point[tmp] = 1
total = sum(point.values())
for b in range(1, n + 1):
if b in point:
if total - point[b] >= k:
... | p02911 |
n,k,q=list(map(int,input().split()))
point=[k for i in range(n)]
for i in range(q):
point=[i-1 for i in point]
point[int(eval(input()))-1]+=1
for i in point:
if(i>0):
print("Yes")
else:
print("No") | n,k,q=list(map(int,input().split()))
a=[0 for i in range(n)]
for i in range(q):
a[int(eval(input()))-1]+=1
for i in a:
if k-q+i>0:
print('Yes')
else:
print('No')
| p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
A.append(int(eval(input())))
if K > Q:
for i in range(N):
print('Yes')
exit()
for i in range(N):
B = Q-A.count(i+1)
if B >= K:
print('No')
else:
print('Yes')
| n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
cnt = [0] * n
for i in a:
cnt[i - 1] += 1
for c in cnt:
if k - (q - c) > 0:
print('Yes')
else:
print('No')
| p02911 |
n, k, q = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(q)]
for i in range(1, n + 1):
c = a.count(i)
print(('Yes' if k - q + c > 0 else 'No'))
| n, k, q = list(map(int,input().split()))
a = dict((i,0) for i in range(1,n+1))
for _ in range(q):
a[int(eval(input()))] += 1
for i in range(1, n + 1):
print(('Yes' if k - q + a[i] > 0 else 'No')) | p02911 |
def t(n, k, q, a):
for i in range(n):
print(("Yes" if (-q + k + a.count(i + 1)) > 0 else "No"))
if __name__ == "__main__":
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
r = t(n, k, q, a)
| def t(n, k, q, a):
p = [-q + k] * n
for i in range(q):
p[a[i-1]-1] += 1
return ["Yes" if i > 0 else "No" for i in p]
if __name__ == "__main__":
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
r = t(n, k, q, a)
for i in r:
... | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
points = [K for _ in range(N)]
for i in range(Q):
points[A[i] - 1] += 1
for j in range(N):
points[j] -= 1
for j in range(N):
if points[j] >= 1:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
points = [K for _ in range(N)]
for i in range(Q):
points[A[i] - 1] += 1
for j in range(N):
points[j] -= Q
for j in range(N):
if points[j] >= 1:
print("Yes")
else:
print("No")
| p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
A.append(int(eval(input())))
for i in range(N):
if K > Q-A.count(i+1):
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
A = [0]*N
for i in range(Q):
num = int(eval(input()))
A[num-1] += 1
# n番目の人の正解数がA[n-1]に入る
for i in range(N):
if K > Q-A[i]:
print("Yes")
else:
print("No")
| p02911 |
N,K,Q = list(map(int,input().split()))
A = []
[A.append(int(eval(input()))) for i in range(Q)]
B = [K]*N
for a in A:
B = list([x-1 for x in B])
B[a-1] += 1
for b in B:
if b>0:
print("Yes")
else:
print("No")
| N,K,Q = list(map(int,input().split()))
A = []
[A.append(int(eval(input()))) for i in range(Q)]
B = [K]*N
for a in A:
B[a-1] += 1
B = list([x-Q for x in B])
for b in B:
if b>0:
print("Yes")
else:
print("No")
| p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
b = [k]*n
for i in a:
b[i-1] += 1
b = [j-1 for j in b]
for k in b:
if k > 0:
print('Yes')
else:
print('No')
| n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
b = [k-q]*n
for i in a:
b[i-1] += 1
for k in b:
if k > 0:
print('Yes')
else:
print('No')
| p02911 |
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
cur_k = [k] * n
for i in range(q):
for j in range(n):
if (a[i] - 1) != j:
cur_k[j] -= 1
# print(a[i], cur_k)
for i in cur_k:
if (i > 0):
print("Yes")
else:
print("No") | n, k, q = list(map(int, input().split()))
a = [0] * q
for i in range(q):
a[i] = int(eval(input()))
cur_k = [k] * n
for i in range(q):
cur_k[a[i] - 1] += 1
for i in cur_k:
if (i > q):
print("Yes")
else:
print("No") | p02911 |
n,k,q = list(map(int, input().split()))
correct_answers = [int(eval(input())) for i in range(q)]
points = [k for i in range(n)]
for i in range(q):
for m in range(len(points)):
if m != correct_answers[i]-1:
points[m] -= 1
for point in points:
if point < 1:
print("No")
el... | n,k,q = list(map(int, input().split()))
correct_answers = [int(eval(input())) for i in range(q)]
points = [k-q for i in range(n)]
for i in range(q):
points[correct_answers[i]-1] += 1
for point in points:
if point < 1:
print("No")
else:
print("Yes") | p02911 |
n, k, q = list(map(int, input().split()))
a = sorted([0] + list(int(eval(input())) for _ in range(q)))
p = [k - q] * (n + 1)
for i in range(1, n + 1):
p[i] += a.count(i)
for j in range(1, n + 1):
if p[j] > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
a = [0] + list(int(eval(input())) for _ in range(q))
p = [k - q] * (n + 1)
for i in range(1, q + 1):
p[a[i]] += 1
for j in range(1, n + 1):
if p[j] > 0:
print('Yes')
else:
print('No') | p02911 |
n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
if k-q>0:
for _ in range(n):
print("Yes")
else:
for i in range(n):
if k-q+a.count(i+1)>0:
print("Yes")
else:
print("No") | n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
b=[0]*n
for i in range(q):
b[a[i]-1]+=1
if k-q>0:
for _ in range(n):
print("Yes")
else:
for i in range(n):
if k-q+b[i]>0:
print("Yes")
else:
print("No") | p02911 |
def resolve():
n, k, q = list(map(int, input().split()))
score = [k for _ in range(n)]
for _ in range(q):
a = int(eval(input()))
stay = score[a-1]
score = list([x-1 for x in score])
score[a-1] = stay
for i in range(n):
if score[i] > 0:
print(... | def resolve():
n, k, q = list(map(int, input().split()))
score = [0] * n
for _ in range(q):
a = int(eval(input()))
score[a-1] += 1
for i in range(n):
s = k + score[i] - q
if s > 0:
print("Yes")
else:
print("No")
resolve() | p02911 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.