problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02726 | s391294332 | Accepted | N, X, Y = map(int, input().split())
dis_comb = [0]*N
for i in range(1, N):
for j in range(i+1, N+1):
dis_comb[min(abs(i-j), abs(X-i)+1+abs(Y-j))] += 1
for i in range(1, N):
print(dis_comb[i])
|
p02645 | s396221345 | Accepted | s=input()
ans=s[0]+s[1]+s[2]
print(ans) |
p02899 | s264010863 | Wrong Answer | N = int(input())
import heapq
student = list(map(int,input().split()))
a = []
heapq.heapify(a)
for i in range(N):
heapq.heappush(a,student.index(i+1) + 1)
print(a) |
p02743 | s549103609 | Wrong Answer | import math
a,b,c = map(int,input().split())
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
print("Yes")
else:
print("No") |
p02817 | s686399712 | Wrong Answer | S,T=input().split()
print(S+T)
|
p02755 | s705829502 | Wrong Answer | A, B = map(int, input().split())
before = B * 10
not_found = True
for i in range(13):
res = before + i
tmp = int((before + i) * 0.08)
if tmp == A:
print(res)
not_found = False
break
if not_found:
print(-1) |
p03210 | s634369773 | Wrong Answer | a=int(input())
if a==3 or a==5 or a==7:
print('YES')
else:
print('No') |
p02957 | s561372563 | Accepted | def solve():
a, b = map(int, input().split())
if (a + b) % 2 == 1:
return "IMPOSSIBLE"
else:
return int((a + b) / 2)
if __name__ == "__main__":
print(solve()) |
p02861 | s923557006 | Accepted | import math
import itertools
N = int(input())
X, Y = [], []
for _ in range(N):
x, y = map(int, input().split())
X.append(x)
Y.append(y)
D = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
D[i][j] = math.sqrt((X[i] - X[j]) ** 2 + (Y[i] - Y[j]) ** 2)
res = 0
for t in itertools.permutations([i for i in range(N)]):
for j in range(1, N):
res += D[t[j]][t[j - 1]]
print(res / math.factorial(N))
|
p02755 | s520597551 | Accepted | b,a = map(int,input().split())
ans = a*10
for i in range(11):
if i == 10:
ans = -1
break
if int(ans*0.08) == b:
break
ans += 1
print(ans) |
p03105 | s372269860 | Accepted | a,b,c=map(int,input().split())
if b//a>c:
print(c)
else:
print(b//a) |
p03645 | s436211857 | Accepted | n, m = [int(_) for _ in input().split()]
dict = {}
can = True
for i in range(m):
a, b = [int(_) for _ in input().split()]
if a in dict.keys():
dict[a].append(b)
else:
dict[a] = [b]
if not 1 in dict.keys():
can = False
else:
for i in dict[1]:
if i in dict.keys() and n in dict[i]:
can = True
break
else:
can = False
print('POSSIBLE' if can else 'IMPOSSIBLE')
|
p03282 | s517788114 | Wrong Answer | s = input()
k = int(input())
for i in range(k):
if s[i] != '1':
print(s[i])
break
if i == k-1:
print(1) |
p02712 | s550317743 | Accepted | n=int(input())
count = 0
for i in range(1,n+1):
if not(i%3==0 or i%5==0):
count += i
print(count)
|
p03086 | s388605299 | Accepted | s = input()
n = len(s)
ans = 0
for i in range(n):
for j in range(i,n):
if all("ATGC".count(c) == 1 for c in s[i:j+1]):
ans = max(ans,j - i + 1)
print(ans) |
p02823 | s647727241 | Wrong Answer | N,A,B = map(int,input().split())
if (B-A) % 2 == 0:
print((B-A)//2)
else:
print(min(N-A, B-1)) |
p03943 | s600932843 | Wrong Answer | def main():
candy = [int(v) for v in input().split()]
candy.sort()
total = sum(candy)
half = total // 2
ac = 0
for c in candy:
ac += c
if ac == half:
print("Yes")
exit()
print("No")
main()
|
p02761 | s370197303 | Wrong Answer | n,m = map(int,input().split())
a = [0]*n
b = [0]*n
for i in range(m):
t,s = map(int,input().split())
if (a[t-1] == 0 and b[t-1] == 0) or (a[t-1] == s):
a[t-1] = s
else:
print('-1')
exit()
if s == 0 :
b[t-1] = 1
tmp = ''
if sum(a) == 0:
print('-1')
exit()
for i in range(n):
tmp += str(a[i])
print(int(tmp))
|
p02873 | s854576309 | Accepted | import numpy as np
s=input()
n=len(s)
ans=[0]*(n+1)
for i in range(n):
if s[i] == "<":
ans[i+1] = max(ans[i+1], ans[i]+1)
for i in reversed(range(n)):
if s[i] == ">":
ans[i] = max(ans[i+1]+1,ans[i])
print(sum(ans)) |
p02923 | s272406401 | Accepted | N = int(input())
H = list(map(int, input().split()))
cnt = 0
ans = []
for i in range(N-1):
if H[i] >= H[i+1]:
cnt += 1
else:
ans.append(cnt)
cnt = 0
ans.append(cnt)
print(max(ans)) |
p03160 | s245675120 | Accepted | times = int(input())
line = input()
list1 = []
if times <= 1:
print("%s" % 0)
else:
for i in line.split():
if i:
list1.append(int(i))
mem = [0] * times
mem[-2] = abs(list1[-1] - list1[-2])
for i in range(len(list1)-3, -1, -1):
step1 = abs(list1[i] - list1[i+1]) + mem[i+1]
step2 = abs(list1[i] - list1[i+2]) + mem[i+2]
mem[i] = min(step1,step2)
print("%s" % mem[0]) |
p02717 | s740307697 | Accepted | a,b,c = list(map(int,input().split()))
a,b = b,a
a,c = c,a
print(a,b,c) |
p03252 | s626729325 | Accepted | s=list(input())
t=list(input())
n=len(s)
a=[s.count(chr(97+i)) for i in range(26)]
b=[t.count(chr(97+i)) for i in range(26)]
if all(a[ord(s[i])-97]==b[ord(t[i])-97] for i in range(n)):
print("Yes")
else:
print("No")
|
p03264 | s193594870 | Wrong Answer | k=int(input())
if k%2==0:
print(k*k//4)
else:
print((k+1)*(k-1)//2) |
p03417 | s426321110 | Wrong Answer | N,M = map(int,input().split())
#N>=Mとして一般性を失わない
if N==M==1:
print(1)
if N==1 and M>=2:
print(M-2)
if N==2 and M>=2:
print(0)
if N>=3 and M>=3:
print((N-2)*(M-2)) |
p02833 | s844473091 | Accepted | n=int(input())
if n%2:print(0)
else:
n//=2
a=0
while 0<n:
n//=5
a+=n
print(a) |
p03067 | s943467927 | Accepted | a,b,c = map(int,input().split())
if a <= c <= b or b <= c <= a:
print("Yes")
else:
print("No") |
p02811 | s986167000 | Wrong Answer | K,X=map(int,input().split())
total = K*500
if total > X:
print("yes")
else:
print("no") |
p02602 | s016879838 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n-k):
if a[i] < a[i+k]:
print('Yes')
else:
print('No') |
p02880 | s084522472 | Wrong Answer | N = int(input())
for i in range(1, 10):
if N % i == 0 and N // i < 9:
print("Yes")
break
else:
print("No") |
p03778 | s432468179 | Accepted | MM = input().split()
W = int(MM[0])
a = int(MM[1])
b = int(MM[2])
if a+W < b:
print(b-(a+W))
elif (b+W) < a:
print(a -(b+W))
else:
print(0) |
p02556 | s371155099 | Accepted | n = int(input())
XY = list(map(int, input().split()) for _ in range(n))
x_max = -float("inf")
y_max = -float("inf")
x_min = float("inf")
y_min = float("inf")
for x, y in XY:
a, b = x-y, x+y
x_max = max(x_max, a)
x_min = min(x_min, a)
y_max = max(y_max, b)
y_min = min(y_min, b)
s = x_max - x_min
t = y_max - y_min
ans = max(s, t)
print(ans) |
p03105 | s216092947 | Wrong Answer | a,b,c = map(int,input().split())
print(max(c,b//a)) |
p03645 | s118783595 | Wrong Answer | n, m = map(int,input().split())
data = [list(map(int, input().split())) for _ in range(m)]
start = set(i[1] for i in data if i[0] == 1)
goal = set(j[0] for j in data if j[1] == m)
if start & goal:
print('POSSIBLE')
else:
print('IMPOSSIBLE') |
p02783 | s282716841 | Accepted | import math
H,A=map(int,input().split())
print(math.ceil(H/A))
|
p02552 | s453640763 | Accepted | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import defaultdict
from collections import deque
import bisect
from decimal import *
def main():
x = I()
if x == 0:
print(1)
else:
print(0)
if __name__ == "__main__":
main()
|
p03962 | s828004035 | Accepted | a, b, c= map(int, input().split())
if a==b and b==c:
print(1)
elif a==b or b==c or a==c:
print(2)
else:
print(3) |
p02660 | s154103980 | Accepted | from collections import Counter
n = int(input())
tmp = n
d = []
for i in range(2, int(n ** 0.5) + 1):
if tmp % i == 0:
while tmp % i == 0:
d.append(i)
tmp //= i
if tmp != 1:
d.append(tmp)
dv = Counter(d)
cnt = 0
for p in dv.keys():
for e in range(1, dv[p]+1):
z = p ** e
if n % z == 0:
cnt += 1
n //= z
print(cnt)
|
p02554 | s667476593 | Accepted | n = int(input())
mod = 10**9+7
ans = 10**n - 9**n*2 + 8**n
print(ans % mod)
|
p02823 | s680276730 | Accepted | n,a,b = map(int, input().split())
if (b-a)%2 == 0:
print(((b-a)//2))
else:
print(min(a-1,n-b)+1+((b-a-1)//2)) |
p03495 | s122752251 | Accepted |
N, K = map(int, input().split())
A = list(map(int, input().split()))
kind = len(set(A))
cnt = [0] * 202020
for a in A:
cnt[a] += 1
cnt = sorted(filter(lambda x: x > 0, cnt))
ans = 0
for c in cnt:
if kind <= K:
break
ans += c
kind -= 1
print(ans) |
p03071 | s458128256 | Accepted | a, b = map(int, input().split())
print(2 * a) if(a == b) else print(max(a, b) + max(a, b) - 1)
|
p02780 | s340842159 | Accepted | from itertools import accumulate
N, K = list(map(int, input().split()))
P = list(map(lambda x: int(x) + 1, input().split()))
P_cumsum = [0] + list(accumulate(P))
print(max([P_cumsum[i+K]-P_cumsum[i] for i in range(N-K+1)])/2) |
p02909 | s317074085 | Accepted | s = input()
if s == 'Sunny':
print('Cloudy')
elif s == 'Cloudy':
print('Rainy')
else:
print('Sunny') |
p03038 | s443754821 | Accepted | def main():
n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
bc = []
for _ in range(m):
b, c = map(int, input().split())
bc.append((b, c))
total = 0
for num, v in sorted(bc, key=lambda x: -x[1]):
total += num
a.extend([v]*num)
if total >= n:
break
print(sum(sorted(a)[-n:]))
if __name__ == '__main__':
main()
|
p04005 | s898935039 | Wrong Answer | A = sorted(list(map(int, input().split())))
if all(a % 2 == 0 for a in A):
print(0)
else:
print(A[0] * A[1]) |
p03281 | s999714310 | Accepted | n=int(input())
cnt=0
i=1
while i<=n:
c=0
for j in range(1,i+1):
if i%j==0:
c+=1
if c==8:
cnt+=1
i+=2
print(cnt) |
p02660 | s393960597 | Accepted | n = int(input())
n1 = n
pn = []
cnt = 2
ans = 0
while cnt <= int(n ** 0.5):
while n1 % cnt == 0:
n1 = n1 // cnt
pn.append(cnt)
cnt += 1
pns = list(set(pn))
ansa = []
for i in pns:
ansa.append(pn.count(i))
for i in ansa:
x = 1
while i > 0:
i -= x
if i < 0:
break
x += 1
ans += 1
print(ans + 1 if n1 != 1 else ans) |
p03723 | s524766801 | Accepted | a,b,c=map(int,input().split())
e=a-b|b-c
print((e!=b&1)*len(f'{e&-e:b}')-1) |
p02833 | s721814809 | Accepted | N = int(input())
if N%2==1:
print(0);exit()
x=10
ans=0
while x<=N:
ans+=N//x
x*=5
print(ans) |
p03379 | s505298858 | Wrong Answer | N = int(input())
X = list(map(int,input().split()))
sor = sorted(X)
l = sor[N//2-1]
r = sor[N//2]
print(l,r)
for i in range(0,N,1):
print(l if X[i]>=r else r) |
p02642 | s329080107 | Accepted | import sys
sys.setrecursionlimit(500005)
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
a = na()
f = [0] * 1000005
for v in a:
f[v] += 1
for i in range(1000000, 0, -1):
if f[i] == 0:
continue
j = i*2
while j <= 1000000:
f[j] += f[i]
j += i
ct = 0
for v in a:
if f[v] == 1:
ct += 1
print(ct)
|
p03239 | s339477079 | Accepted | N,T=map(int,input().split())
CT=[[0,0]]*N
i=0
while i<N:
CT[i]=list(map(int,input().split()))
i+=1
CT=sorted(CT)
ans='TLE'
for x,y in CT:
if y<=T:
ans=x
break
print(ans)
|
p03309 | s259567976 | Accepted | from statistics import median
n=int(input())
A=list(map(int,input().split()))
B=[A[i]-(i+1) for i in range(n)]
middle=median(B)
ans=0
for i in range(n):
ans +=abs(A[i]-(middle+i+1))
print(int(ans)) |
p02897 | s454875417 | Wrong Answer | N = int(input())
if N == 1:
print("1.0000000000")
elif N % 2 == 0:
print("0.5000000000")
else:
print("0.4000000000") |
p02771 | s291551797 | Wrong Answer | A, B, C = map(int, input().split())
if A == B:
if C == A or C == B:
print('No')
else:
print('Yes')
if B == C:
if A == B or A == C:
print('No')
else:
print('Yes')
if C == A:
if B == A or B == C:
print('No')
else:
print('Yes')
else:
print('No')
|
p03086 | s897876519 | Accepted | S = input()
ans = 0
n = len(S)
for i in range(n):
for j in range(i, n):
if all('ACGT'.count(c) == 1 for c in S[i:j+1]):
ans = max(ans, j+1-i)
print(ans) |
p04030 | s846274286 | Accepted | def main():
a=[]
for s in input():
if s == "B":
if len(a) > 0:
a.pop()
else:
a.append(s)
print("".join(a))
pass
if __name__ == "__main__":
main() |
p03127 | s017837551 | Accepted | import math
from functools import reduce
_=input()
print(reduce(math.gcd,map(int,input().split()))) |
p02935 | s132037268 | Wrong Answer | N = int(input())
v = sorted(list(map(int,input().split())))
print((sum(v[:-1])/(N-1)+v[-1])/2)
|
p02793 | s316349837 | Accepted | #a,bの最大公約数
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
mod = 10**9+7
n = int(input())
a = list(map(int,input().split()))
l = a[0]
for e in a:
l = lcm(l,e)
a_sum = 0
for e in a:
a_sum = (a_sum + pow(e,mod-2,mod))%mod
print((l%mod)*a_sum%mod) |
p03419 | s540984653 | Wrong Answer | n, m = map(int, input().split())
if n == 1:
ans = m - 2
elif m == 1:
ans = n - 2
else:
ans = (n - 2) * (m - 2)
print(ans)
|
p03038 | s596139804 | Wrong Answer | N, M = map(int, input().split())
A = list(map(int, input().split()))
B, C = [0]*M, [0]*M
result = 0
for i in range(M):
B[i], C[i] = map(int, input().split())
A.extend([C[i]]*B[i])
A.sort(reverse=True)
print(A)
for i in range(N):
result += A[i]
print(result) |
p03623 | s480192564 | Wrong Answer | x,a,b = map(int,input().split())
if abs(x-a) > abs(x-b):
print('A')
else:
print('B') |
p02795 | s890201539 | Accepted | from math import *
h = int(input())
w = int(input())
n = int(input())
print(ceil(n / max(h, w))) |
p03943 | s323076061 | Accepted | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------------------
A = list(map(int,input().split()))
A.sort()
print("Yes" if A[0]+A[1]==A[2] else "No")
|
p03994 | s083330234 | Accepted | s=list(input())
k=int(input())
for i in range(len(s)):
if k==0:break
num=ord(s[i])
ch_num=123-num
if i==len(s)-1:
s[i]=chr(97+(num+k-97)%26) #if num+k>122 else chr(num+k)
#print(97+(num+k-97)%26)
k=0
break
elif s[i]=='a':continue
elif ch_num<=k:
s[i]='a'
k-=ch_num
print(''.join(s)) |
p03455 | s330413736 | Accepted | a,b=map(int,input().split())
print("Even" if (a*b)%2 == 0 else "Odd" ) |
p03284 | s447010010 | Wrong Answer | n, k = map(int, input().split())
print((n % k + n // k) - n // k) |
p02707 | s790767666 | Accepted | N = int(input())
*A, = map(int,input().split())
ans = [0]*N
for a in A:
a -=1
ans[a] += 1
for out in ans:
print(out) |
p02792 | s471663894 | Accepted | import math
import numpy as np
N = int(input())
ans = 0
num_mat = np.zeros((9, 9))
for i in range(N+1):
head = int(list(str(i))[0])
tail = int(list(str(i))[-1])
rev = ''.join(list(str(i))[::-1])
if tail==0:
continue
num_mat[head-1, tail-1] += 1
for i in range(9):
for j in range(i+1):
if i==j:
num = num_mat[i,j]
ans += num + num * (num-1)
else:
ans += num_mat[i,j] * num_mat[j,i] * 2
print(int(ans))
|
p02694 | s941695161 | Wrong Answer | X = int(input())
default = 100
year = 1
while True:
default = default + round(1 % default)
if default == X:
print(year)
break
year += 1 |
p03997 | s175895740 | Accepted | a=int(input())
b=int(input())
c=int(input())
print((a+b)*c//2) |
p02659 | s618703350 | Accepted | def main():
ab = [_x for _x in input().split()]
n = ab[1]
bb = (int(n[0])*100 + int(n[2])*10 + int(n[3]))
aa = int(ab[0])
if aa == 0:
print(0)
return
if bb == 0:
print(0)
return
result = str(aa*bb)
if len(result) <= 2:
print(0)
else:
print(str(result)[:-2])
main()
|
p02661 | s648807360 | Wrong Answer | n=int(input())
c=[list(map(int,input().split())) for _ in range(n)]
a=[i[0] for i in c]
b=[i[1] for i in c]
a.sort()
b.sort()
if n%2==0:
print(b[n//2]-a[n//2-1]-b[n//2-1]+a[n//2]+1)
else:
print(b[n//2]-a[n//2]+1) |
p02607 | s254134047 | Wrong Answer | def main():
n = int(input())
A=[int(i) for i in input().split()]
res = 0
for i in range(1,n,2):
if(A[i]%2==1):
res+=1
print(res)
if __name__ == '__main__':
main()
|
p02842 | s555419103 | Accepted | N = int(input(""))
ans = int(N/1.08)-1
f = 0
while ans < (N/1.08)+1:
if int(ans*1.08) == N:
print(ans)
f += 1
ans += 1
if f == 0:
print(":(") |
p02793 | s123743003 | Accepted | def gcd(n,m):
if n>m:
return gcd(m,n);
if n==0:
return m;
return gcd(m-n*(m//n),n)
def lcm(x, y):
return (x * y) // gcd(x, y)
n=int(input())
a=list(map(int,input().split()))
s=1
for i in a:
s=lcm(s,i)
ans=0
for i in a:
ans+=s//i
print(ans % 1000000007) |
p02848 | s461057944 | Accepted | N = int(input())
S = input()
ans=""
for i in range(len(S)):
ans += chr((ord(S[i])+N+13)%26+52+13)
print(ans) |
p03017 | s046163090 | Wrong Answer | N, A, B, C, D = map(int, input().split())
S = list(input())
for i in range(A, max(C, D)):
if S[i-1:i+1] == '##':
print('No')
exit(0)
if C < D:
print('Yes')
exit(0)
for i in range(B-1, D):
if S[i-1:i+2] == '...':
print('Yes')
exit(0)
print('No')
|
p02847 | s099865247 | Accepted | daw = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
S = input()
idx = daw.index(S)
print(7 - idx)
|
p03617 | s867125568 | Wrong Answer | # -*- coding: utf-8 -*-
"""
Created on Sat May 9 23:33:40 2020
@author: shinba
"""
q,h,s,d = map(int,input().split())
n = int(input())
a = [4*q,2*h,s,d/2]
a.sort()
if a[0] != d/2:
print(int(n*a[0]))
else:
if n % 2 == 0:
print(int(n*a[0]))
else:
print(int((n-1)*a[0])+int(a[1]))
|
p02552 | s091811463 | Accepted | x=int(input())
if(x==1):
print(0)
else:
print(1) |
p02957 | s378218875 | Wrong Answer | a,b = map(int, input().split())
if (a+b)%2 == 0:
print((a+b)/2)
else:
print("IMPOSSIBLE") |
p02584 | s182418241 | Accepted | X,K,D = map(int,input().split())
if X > 0:
if X // D >= K:
ans = X - D*K
else:
K -= X//D
X = X%D
if K%2 == 0:
ans = X
else:
ans = abs(X -D)
if X < 0:
if -1*X // D >= K:
ans = abs(X + D*K)
else:
K -= (-1*X)//D
X = (-1*X)%D
if K%2 == 0:
ans = X
else:
ans = abs(X -D)
if X == 0:
if K%2==0:
ans = 0
else:
ans = D
print(ans)
|
p03836 | s654186664 | Wrong Answer | sx, sy, tx, ty = map(int, input().split())
ver = ty - sy
hor = tx - sx
go1 = 'U'*ver+"R"*hor
back1 = "D"*ver+"L"*hor
go2 = "D"+"R"*(hor+1)+'U'*(ver+1)
back2 = "U"+"L"*(hor+1)+"D"*(ver+1)+"R"
print(go1+back1+go2+back2) |
p03836 | s134551490 | Accepted | sx, sy, tx, ty = map(int, input().split())
dx, dy = tx-sx, ty-sy
path1 = 'U'*dy + 'R'*dx
path2 = 'D'*dy + 'L'*dx
path3 = 'L' + 'U'*(dy+1) + 'R'*(dx+1) + 'D'
paht4 = 'R' + 'D'*(dy+1) + 'L'*(dx+1) + 'U'
ans = path1 + path2 + path3 + paht4
print(ans) |
p03623 | s296059504 | Wrong Answer | x,a,b=map(int,input().split())
print(min(abs(x-a),abs(x-b)))
|
p03695 | s658678220 | Accepted | def main():
n = int(input())
a_list = list(map(int, input().split()))
rate_list = [0] * 9
for a in a_list:
rate = a // 400
if rate < 8:
rate_list[rate] += 1
else:
rate_list[-1] += 1
min_cnt = 0
for i in range(8):
if rate_list[i] > 0:
min_cnt += 1
print(max(min_cnt, 1), min_cnt + rate_list[-1])
if __name__ == "__main__":
main()
|
p02911 | s526246995 | Wrong Answer | """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, Q, *A = map(int, read().split())
point = np.zeros(N + 1)
for i in A:
point[i] += 1
point += K - Q
print(*['Yes' if i > 0 else 'No' for i in point], sep='\n')
|
p02691 | s060400101 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
AJ = tuple(a - i for i, a in enumerate(A))
maxnum = 2*10**5
count = 0
for i in range(0, N-1):
if A[i] >= maxnum:
break
iai = i + A[i]
for aj in AJ[iai+1:]:
if iai + aj == 0:
count += 1
print(count) |
p03282 | s266298751 | Accepted | s = input()
k = int(input())
if k <= 100:
if set(s[:k]) == set('1'):
print(1)
exit()
for _ in s:
if _ != '1':
print(_)
exit()
|
p03836 | s776745041 | Wrong Answer | def resolve():
sx, sy, tx, ty = map(int, input().split())
tx, ty = (tx-sx), (ty-sy)
sx, sy = 0, 0
ans1 = ["R"]*tx + ["U"]*ty
ans2 = ["L"]*tx + ["D"]*ty
ans3 = ["D"]+["R"]*(tx+1)+["U"]*(ty+1)+["L"]
ans4 = ["U"] + ["L"]*(tx+1)+["R"]*(ty+1)+["R"]
print("".join(ans1+ans2+ans3+ans4))
resolve() |
p03221 | s525061195 | Accepted | N,M=map(int, input().split())
A=[[] for i in range(N)]
for i in range(M):
p,y=map(int, input().split())
A[p-1].append((y, i))
X=[0]*M
for i,d in enumerate(A):
d.sort()
for k,(y,j) in enumerate(d):
X[j]=str(i+1).zfill(6)+str(k+1).zfill(6)
print(*X,sep='\n') |
p04011 | s190202133 | Wrong Answer | N=int(input())
K=int(input())
X=int(input())
Y=int(input())
print(X*K+(N-K)*Y) |
p03774 | s382356798 | Wrong Answer | N, M = map(int, input().split())
ab = [tuple(map(int, input().split())) for _ in range(N)]
cd = [tuple(map(int, input().split())) for _ in range(M)]
for a, b in ab:
tmp_dist = 10 ** 8 * 2
tmp_point = 0
count = 0
for c, d in cd:
count += 1
if tmp_dist > abs(a - c) + abs(b - d):
tmp_point = count
tmp_dist = min(tmp_dist, abs(a - c) + abs(b - d))
else:
print(tmp_point) |
p03013 | s895421694 | Accepted | N, M = [int(i) for i in input().split()]
a = [int(input()) for _ in range(M)]
divisor = 10**9 + 7
fl = [True] * N
for i in range(M):
fl[a[i]] = False
dp = [0] * (N+1)
dp[0] = 1
for i in range(1, N+1):
if i > 0 and fl[i-1]:
dp[i] += dp[i-1] % divisor
if i > 1 and fl[i-2]:
dp[i] += dp[i-2] % divisor
print(dp[N]%divisor) |
p03472 | s823732309 | Wrong Answer | import sys
input = sys.stdin.readline
n, h = map(int, input().split())
a, b = [0]*n, [0]*n
for i in range(n):
aa, bb = map(int, input().split())
a[i], b[i] = aa, bb
a_max = max(a)
b_thr = []
for i in b:
if i > a_max:
b_thr.append(i)
ans = 0
for i in b_thr:
if h > 0:
h -= i
ans += 1
else:
print(ans)
exit()
if h % a_max == 0:
ans += h // a_max
else:
ans += h // a_max + 1
print(ans) |
p02879 | s469436477 | Wrong Answer | #ABC144A
a,b = map(int,input().split())
print(a*b if 1<=a<=b<=9 else -1) |
p02694 | s618212674 | Accepted | x = int(input())
m = 100
n = 0
while m < x:
m += m // 100
n += 1
print(n) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.