problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02695 | s000329955 | Accepted | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
L = list(range(1, M+1))
D = [list(map(int, input().split())) for _ in range(Q)]
ans = []
for p in combinations_with_replacement(L, N):
tmp = 0
for a, b, c, d in D:
if p[b-1]-p[a-1] == c:
tmp += d
ans.append(tmp)
print(max(ans))
|
p03821 | s184796250 | Wrong Answer | n = int(input())
ls = []
for i in range(n):
a,b = map(int, input().split())
ls.append((a,b))
cnt = 0
for i, j in sorted(ls, reverse=True):
m = (i+cnt) % j
cnt += 0 if m == 0 else j-m
print(cnt) |
p03106 | s920859020 | Accepted | a, b, k = map(int, input().split())
lst = []
for i in range(1, 101)[::-1]:
if a % i == 0 and b % i == 0:
lst.append(i)
print(lst[k-1]) |
p03379 | s934320594 | Accepted | N=int(input())
L=list(map(int,input().split()))
n=N//2
R=sorted(L)
for i in L:
if i>R[n-1]:
print(R[n-1])
else:
print(R[n]) |
p02724 | s008773410 | Accepted | div500, rem = divmod(int(input()), 500)
print(div500 * 1000 + rem // 5 * 5) |
p02946 | s091986260 | Wrong Answer | k,n=map(int,input().split())
for i in range(k-1):
print(n-k+i)
print(n)
for i in range(k-1):
print(n+i+1)
|
p02817 | s878533820 | Wrong Answer | s, t = input().split()
print(s+t) |
p03555 | s232956146 | Accepted | s = str(input())
t = str(input())
if s[0] == t[2] and s[1] == t[1] and s[2] == t[0]:
result = 'YES'
else:
result = 'NO'
print(result) |
p03645 | s017817321 | Accepted | N, M = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
from_1 = set(b for a, b in AB if a == 1)
to_N = set(a for a, b in AB if b == N)
print('POSSIBLE' if from_1 & to_N else 'IMPOSSIBLE')
|
p02723 | s002084672 | Wrong Answer | lst = list(input())
if lst[2] == lst[3] and lst[4] == lst[5]:
print('True')
else:
print('No')
|
p03555 | s326387458 | Wrong Answer | l = input()
m = input()
if l[0] == m[2] and l[1] == m[1] and l[2] == l[0]:
print("YES")
else:
print("NO")
|
p02689 | s132307501 | Accepted | N, r = map(int, input().split())
hs = list(map(int, input().split()))
g = [1]*N
for i in range(r):
road = list(map(int, input().split()))
if hs[road[0] - 1] >= hs[road[1] - 1]:
g[road[1] - 1] = 0
if hs[road[0] - 1] <= hs[road[1] - 1]:
g[road[0] - 1] = 0
print(sum(g))
|
p02691 | s485800423 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=[]
c=[]
for i in range(n):
b.append(a[i]-(i+1))
c.append(-(a[i]+i+1))
from collections import defaultdict
#cnt_b=Counter(b)
cnt_c=defaultdict(int)
ans=0
for i in range(n):
v=cnt_c[b[i]]
ans+=v
cnt_c[c[i]]+=1
print(ans) |
p03493 | s112264271 | Wrong Answer | word = list(input())
print(word)
count = 0
for a in word :
if a == "1" :
count = count + 1
print(count) |
p03126 | s855704532 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N, M = map(int, readline().split())
cnt = [0] * (M + 1)
for _ in range(N):
K, *A = list(map(int, readline().split()))
for x in A:
cnt[x] += 1
print(cnt.count(N))
if __name__ == '__main__':
main()
|
p02659 | s981073849 | Accepted | a,b = map(int,input().replace(".","").split())
print(a*b//100) |
p02970 | s185002460 | Accepted | n, d = map(int, input().split())
ans = n / (2 * d + 1)
if ans == int(ans):
print(int(ans))
exit()
else:
print(int(ans) + 1)
exit()
|
p02630 | s894713257 | Wrong Answer | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
q = int(input())
cnt = Counter(a)
s = sum(cnt)
for i in range(q):
b, c = map(int, input().split())
s = s - b*cnt[b]
s = s + c*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(s) |
p02994 | s585101713 | Accepted | n,l=map(int,input().split())
no=1000
num=0
for i in range(n):
if abs(l+i)<no:
no=abs(l+i)
num=i
ans=0
for i in range(n):
ans+=l+i
ans=ans-l-num
print(ans) |
p02790 | s427472834 | Accepted | a , b =input().split()
if a <= b:
print(a*int(b))
else:
print(b*int(a)) |
p03077 | s088486269 | Accepted | import math
n = int(input())
cap = []
for _ in range(5):
cap.append(int(input()))
print(math.ceil(n/min(cap))+4)
|
p02789 | s543150981 | Accepted | N,M = map(int,input().split())
if N == M:
print('Yes')
else:
print('No') |
p03730 | s903187492 | Wrong Answer | A,B,C=map(int,input().split())
ans="NO"
for i in range(1,101):
if i%A==0:
if i%B==C:
ans='YES'
break
else:
continue
print(ans) |
p02922 | s404795461 | Wrong Answer | a, b = map(int, input().split())
cnt = 1
p = a
while p < b:
p += a - 1
cnt += 1
print(cnt)
|
p03862 | s840087725 | Accepted | import sys
readline = sys.stdin.buffer.readline
n,m = map(int,readline().split())
lst1 = list(map(int,readline().split()))
ans = 0
for i in range(1,n):
if lst1[i-1]+lst1[i] > m:
res = max(0,m-lst1[i-1])
ans += lst1[i]-res
lst1[i] = res
if lst1[0]+lst1[1] > m:
ans += lst1[0]-m
print(ans)
|
p03241 | s592776288 | Accepted | def divisor(n):
i = 1
res = set()
for i in range(1, int(n**.5) + 1):
if n%i == 0:
res.add(i)
res.add(n//i)
return res
def main():
n, m = map(int, input().split())
md = list(divisor(m))
md.sort(reverse=True)
for i in md:
if i*n <= m:
print(i)
exit()
if __name__ == '__main__':
main() |
p02880 | s351955248 | Wrong Answer | n = int(input())
a = 0
for i in range(1,10):
if n%i==0 and n%i<10:
a = 1
break
print('Yes' if a==1 else 'No') |
p03479 | s921877286 | Wrong Answer | import math
X, Y = list(map(int, input().split()))
val = 2
i = 1
while True:
val = 2**i
if val > 2*Y/X:
break
i += 1
print(i-1)
|
p03785 | s426927075 | Accepted |
n, c, k = map(int, input().split())
t = [int(input()) for _ in range(n)]
t.sort(reverse=True)
t_b = t[0]
cnt = 0
ans = 0
for i in t:
# print(i, t_b, cnt, ans)
if t_b - i <= k and cnt + 1 <= c: # 差がk以下で人数に余裕がある
cnt += 1
continue
else:
t_b = i
cnt = 1
ans += 1
print(ans + 1) |
p03208 | s325628425 | Accepted | n, k = map(int, input().split())
h_list = []
for _ in range(n):
h = int(input())
h_list.append(h)
h_list.sort()
ans = 10000000000
for i in range(n-k+1):
tmp = abs(h_list[i]-h_list[i+k-1])
if ans > tmp:
ans = tmp
print(ans)
|
p03696 | s102638776 | Wrong Answer | n = int(input())
s = list(input())
m = 0
c1, c2 = 0, 0
for i in range(n):
if s[i] == ")":
m += 1
c2 = c1
else:
c1 += 1
j = 0
while True:
if j == n:
break
if s[j] == "(":
break
j += 1
l = max((m - c2), j)
s1 = ["("] * l
for i in s:
if i == "(":
l += 1
else:
l -= 1
s2 = [")"] * l
s = s1 + s + s2
print("".join(s)) |
p03038 | s495540248 | Accepted | #7 Integer Cards
n,m = map(int,input().split())
a = list( map(int,input().split()))
bc=[[0]*2 for _ in range(m)]
for i in range(m):
bc[i] = list(map(int,input().split()))
a.sort()
bc.sort(reverse=True,key=lambda x:x[1])
nokori=n
bc2=[]
for (bb,cc) in bc:
if bb<=nokori:
bc2.extend([cc]*bb)
nokori-=bb
else:
bc2.extend([cc]*nokori)
nokori=0
break
print( sum(sorted(a+bc2,reverse=True)[:n]) )
|
p02775 | s153045056 | Accepted | def main():
s=input()
#while s%10==0:
# s//=10
#s=9**100
#s=str(s)
lens=len(s)
d=int(s[0])
p=11-int(s[0])
for c in s[1:]:
j=int(c)
a=min(d+j,p+j)
b=min(d+11-j,p+9-j)
d,p=a,b
print(min(d,p))
if __name__ == '__main__':
main()
|
p03243 | s646209334 | Accepted | n = int(input())
ans = 0
if 100 <= n <= 111:
ans = 111
elif 112 <= n <= 222:
ans = 222
elif 223 <= n <= 333:
ans = 333
elif 334 <= n <= 444:
ans = 444
elif 445 <= n <= 555:
ans = 555
elif 556 <= n <= 666:
ans = 666
elif 667 <= n <= 777:
ans = 777
elif 778 <= n <= 888:
ans = 888
elif 889 <= n <= 999:
ans = 999
print(ans) |
p02771 | s074007557 | Accepted | a,b,c = map(int, input().split())
if ((a == b ) + (b == c ) + (c==a))==1:
print('Yes')
else:
print('No') |
p02556 | s608232875 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
N = int(rl())
xy = [list(map(int, rl().split())) for _ in range(N)]
xy.sort(key=lambda n: sum(n))
ans = sum(xy[-1]) - sum(xy[0])
print(ans)
if __name__ == '__main__':
solve()
|
p03162 | s267598488 | Wrong Answer | n = int(input())
yesterday = "d"
happiness = 0
for i in range(n):
point = list(map(int,input().strip().split()))
if yesterday == 0:
point[0] = 0
elif yesterday == 1:
point[1] = 0
elif yesterday == 2:
point[2] = 0
yesterday = point.index(max(point))
happiness += max(point)
print(happiness) |
p03281 | s588076069 | Accepted | n = int(input())
count = 0
for i in range(1, n+1):
if i % 2 == 1:
yaku = 0
for j in range(1, i+1):
if i % j == 0:
yaku += 1
if yaku == 8:
count += 1
print(count) |
p02823 | s928112877 | Accepted | x,y,z = map(int, input().split())
if (z+y)%2==1:
d = min(y + z - 2, 2*x-y-z)+1
print(d//2)
else:
print((abs(y-z)+1)//2) |
p03639 | s369532444 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
baisu = [0,0,0]
flag = 0
for i in a:
if i % 4 == 0:
baisu[2] += 1
elif i % 2 == 0:
baisu[1] += 1
else:
baisu[0] += 1
if baisu[0] == 0 and (baisu[2] != 0 or baisu[1] != 1):
flag = 1
while baisu[2] != 0:
baisu[2] -= 1
baisu[0] -= 2
if baisu[1] > 0:
baisu[0] += 1
if baisu[0] < 1 or flag == 1:
print('Yes')
else:
print('No')
|
p02910 | s156730150 | Accepted | s=input()
n=len(s)
odd=[s[i] for i in range(0,n,2)]
even=[s[i] for i in range(1,n,2)]
if "L" in odd:
print("No")
elif "R" in even:
print("No")
else:
print("Yes") |
p03264 | s433579227 | Accepted | k = int(input())
o = (k + 1) // 2
e = k // 2
print(o * e)
|
p02690 | s958472820 | Wrong Answer | x = int(input())
flag = False
for a in range(0, 100):
for b in range(-100, 1000):
if a**5-b**5 == x:
print(a, b)
flag = True
break
if flag:
break |
p03377 | s064070203 | Accepted | A, B, X = map(int, input().split())
if A <= X <= (A + B):
print('YES')
else:
print('NO') |
p03478 | s907874457 | Accepted | n,a,b = map(int,input().split())
ans = 0
for i in range(n+1):
keta_wa = 0
x = i
while x != 0:
keta_wa += int(x % 10)
x = int(x /10)
#print(keta_wa,x)
if a <= keta_wa <= b:
ans += i
print(ans) |
p02622 | s497235542 | Accepted | s = input()
t = input()
ans = 0
for i in range(len(s)):
if s[i] != t[i]:
ans += 1
print(ans)
|
p03639 | s258144302 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
eight = 0
one = 0
two = 0
for i in A:
if i%4 == 0:
eight = eight + 1
if i == 1:
one = one + 1
if i % 2 == 0:
two = two + 1
if len(A)//2 <= eight:
print("Yes")
elif (len(A)//2) <= (eight + (two//2)):
print("Yes")
elif (eight >= one) and (eight + one +(two//2)) > (len(A)//2):
print("Yes")
else:
print("No") |
p03161 | s736594235 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [-1] * N
dp[0] = 0
inf = 100000
for i in range(1, N):
mindp_i = inf
for jump in range(1, min(i, K) + 1):
dpcand = dp[i - jump] + abs(h[i] - h[i - jump])
if dpcand < mindp_i:
mindp_i = dpcand
dp[i] = mindp_i
print(dp[N-1]) |
p02570 | s867176300 | Wrong Answer | D,T,S=map(int,input().split())
if D*S>T:
print("No")
else:
print("Yes") |
p02935 | s464232537 | Accepted | n=int(input())
v=list(map(int,input().split()))
v.sort()
bkv=(v[0]+v[1])/2
if n!=2:
for i in range(1,n-1):
bkv=(bkv+v[i+1])/2
print(bkv) |
p04030 | s025029613 | Accepted | s=input()
data=[]
for i in range(len(s)):
if s[i]=='0':
data.append('0')
elif s[i]=='1':
data.append('1')
else:
if len(data)==0:
continue
else:
data.pop()
print(*data,sep='') |
p03013 | s806769832 | Accepted | N, M = map(int, input().split())
bs = [True for i in range(N+1)]
for i in range(M):
a = int(input())
bs[a] = False
dp = [0 for i in range(N+1)]
dp[0] = 1
if bs[1] != False: dp[1] = 1
for i in range(2,N+1):
if bs[i-1] != False:
dp[i] += dp[i - 1]
if bs[i - 2] != False:
dp[i] += dp[i - 2]
print(dp[N] % 1000000007) |
p02882 | s425523899 | Accepted | import math
a, b, x = map(int, input().split())
if 2*x <= a*a*b:
t = math.atan((a*b*b)/(2*x))
else:
t = math.atan(2*(a*a*b-x)/(a*a*a))
print(180*t/math.pi) |
p02645 | s436937051 | Accepted | S = input()
print(S[0:3]) |
p02645 | s855716231 | Accepted | # 初期入力
import sys
input = sys.stdin.readline
#
S =input().strip()
ans =S[:3]
print(ans) |
p02690 | s766217356 | Wrong Answer | import sys
X = int(input())
b = 0
if X**(1/5) == int(X**(1/5)):
print("{0} {1}".format(int(X**(1/5)),0))
sys.exit(0)
b = 1
if (X+1)**(1/5) == int((X+1)**(1/5)):
print("{0} {1}".format(int((X+1)**(1/5)),1))
sys.exit(0)
b = -1
if (X-1)**(1/5) == int((X-1)**(1/5)):
print("{0} {1}".format(int((X-1)**(1/5)),-1))
sys.exit(0) |
p03433 | s445224324 | Wrong Answer | print('YNeos'[int(input())%50>int(input())::2]) |
p02996 | s847315169 | Accepted | import sys
N = int(input())
X = [list(map(int, input().split())) for i in range(N)]
X = sorted(X, key=lambda x:x[1])
t = 0
for x in X:
t += x[0]
if t > x[1]:
print('No')
sys.exit()
print('Yes') |
p03136 | s993770194 | Wrong Answer | N = int(input())
L_list = list(map(int, input().split()))
if max(L_list) * 2 > sum(L_list):
print('Yes')
else:
print('No') |
p02631 | s353272350 | Accepted | n=int(input())
x=[int(x) for x in input().split()]
s=x[0]
for i in range(1,len(x)):
s=s^x[i]
z=[]
for i in range(len(x)):
z.append(s^x[i])
print(*z)
|
p02676 | s554832018 | Accepted | k=int(input())
s=input()
if len(s)<=k:
print(s)
else:
print(s[:k]+'...') |
p02624 | s009983812 | Wrong Answer | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
NI = lambda : int(sys.stdin.readline())
N = NI()
ans = N * (N-1) - 1
for i in range(2,int(math.sqrt(N))+1):
ans += i*i
j = i + 1
while i * j <= N:
ans += 2 * i * j
j += 1
print(ans)
if __name__ == '__main__':
main() |
p02866 | s678232190 | Accepted | n = int(input())
d = list(map(int, input().split()))
e = [0 for i in range(n)]
if d[0] > 0:
exit(print(0))
for i in d:
e[i] += 1
ans = 1
for i in range(1, n):
ans *= e[d[i] - 1]
ans %= 998244353
print(ans) |
p03698 | s513803879 | Accepted | s = input()
print("yes" if len(set(s)) == len(s) else "no") |
p03474 | s079884329 | Accepted |
ma = lambda : map(int,input().split())
ni = lambda : int(input())
a,b = ma()
s = input()
if s[:a].isdecimal() and s[a] =="-" and s[a+1:].isdecimal():
print("Yes")
else:
print("No")
|
p03339 | s540502213 | Wrong Answer | n = int(input())
s = input()
ans = 3*(10**5)
to_east = 0
to_west = s.count('E', 1)
for i in range(1, n):
ans = to_east+to_west if ans>to_east+to_west else ans
if s[i-1]=='W':
to_east += 1
if s[i]=='E':
to_west -= 1
print(ans)
|
p02695 | s668979694 | Accepted | import itertools
from collections import defaultdict
N, M, Q = map(int, input().split())
seq = list(range(1, M+1))
dlist = defaultdict(list)
dres = defaultdict(int)
Na = 0
for i,v in enumerate(itertools.combinations_with_replacement(seq, N)):
dlist[i] = v
Na += 1
for i in range(Q):
ai, bi, ci, di = map(int, input().split())
for j in range(Na):
tmp = dlist[j]
if tmp[bi-1] - tmp[ai-1] == ci:
dres[j] += di
print(max([dres[i] for i in range(Na)])) |
p02918 | s918207222 | Wrong Answer | N, K = map(int, input().split())
S = input()
s = S[0]
count = 0
k = 0
for i in range(1, len(S)):
#print(S[i], s)
if s == S[i]:
count += 1
else:
s = S[i]
k += 1
if K > k:
count += k * 2
elif K < k:
count += K * 2
else:
count += K * 2 - 1
print(count) |
p02596 | s179644552 | Wrong Answer | K=int(input())
temp=0
for i in range(1,10**6+1):
t="7"*K
r=int(t)%K
if(r%K==0):
print(i)
temp=1
break
if(temp==0):
print(-1) |
p03767 | s618333506 | Accepted | n = int(input())
a = list(map(int,input().split()))
a = sorted(a)[::-1]
ans = sum(a[1:2*n:2])
print(ans) |
p02922 | s315588692 | Wrong Answer | a,b = map(int,input().split())
i = 0
while a+(a-1)*i <b:
i += 1
print(i+1) |
p04044 | s755581045 | Accepted | n, l = map(int,input().split())
a = [input() for i in range(n)]
a.sort()
print("".join(a))
|
p02660 | s069750160 | Accepted | from math import sqrt
n = int(input())
i = 2
c = []
while i*i <= n:
j = 0
while n%i == 0:
j += 1
n //= i
else:
if j != 0:
c.append(j)
i += 1
if n > 1:
c.append(1)
d = 0
if c == []:
print(d)
else:
for k in c:
d += int((sqrt(1 + 8*k)-1)/2)
print(d)
|
p02873 | s991975860 | Accepted | S=list(input())
s=0
f=0
g=0
h=0
for i in range(len(S)):
if S[i]==">":
g=0
f+=1
if h>=f:
s+=f-1
else:
s+=f
else:
f=0
g+=1
s+=g
h=g
print(s)
|
p02959 | s701710752 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
count = 0
for i in range(N):
if A[i] - B[i] < 0:
count += A[i]
B[i] -= A[i]
if A[i+1] - abs(A[i] - B[i]) < 0:
count += A[i+1]
A[i+1] = 0
else:
count += B[i]
A[i+1] -= abs(A[i] - B[i])
elif A[i] - B[i] == 0:
count += A[i]
else:
count += B[i]
print(count) |
p02600 | s838948000 | Accepted | #n, m = map(int,input().split())
x = int(input())
#hl = list(map(int,input().split()))
if 400 <= x <= 599:
print(8)
elif 600 <= x <= 799:
print(7)
elif 800 <= x <= 999:
print(6)
elif 1000 <= x <= 1199:
print(5)
elif 1200 <= x <= 1399:
print(4)
elif 1400 <= x <= 1599:
print(3)
elif 1600 <= x <= 1799:
print(2)
elif 1800 <= x <= 1999:
print(1) |
p03632 | s154756282 | Accepted | a, b, c, d = map(int, input().split())
t = [0]*101
for i in range(a, b):
t[i] += 1
for i in range(c, d):
t[i] += 1
ans = 0
for _t in t:
if _t == 2:
ans += 1
print(ans)
|
p02813 | s682842414 | Accepted | n = int(input())
p = input()
q = input()
import itertools
x = [str(i) for i in range(1,n+1)]
y = []
for i in itertools.permutations(x):
y.append(''.join(i))
p = list(p)
q = list(q)
p = [a for a in p if a != ' ']
q = [a for a in q if a != ' ']
p = ''.join(p)
q = ''.join(q)
#print(p,q,y)
print(abs(y.index(p) - y.index(q)))
|
p04011 | s346666504 | Wrong Answer | n=int(input())
k=int(input())
x=int(input())
y=int(input())
ans = k*x
if k <= n:
ans += (n -k)*y
print(ans) |
p02778 | s296914908 | Wrong Answer | s = input().split()
for c in s:
print("x", end="") |
p03962 | s601171414 | Accepted | x, y, z = map(int, input().split())
count = 1
if x != y:
count += 1
if x != z and y != z:
count += 1
print(count)
|
p03126 | s908618237 | Accepted | from collections import defaultdict
N, M = map(int, input().split())
tmp = [list(set(list(map(int, input().split()))[1:])) for _ in range(N)]
d = defaultdict(int)
for i in range(N):
for j in range(len(tmp[i])):
d[tmp[i][j]] += 1
print(list(d.values()).count(N)) |
p02596 | s896136124 | Accepted | K = int(input())
L = 0
if K % 7 == 0:
L = 9*K//7
else:
L = 9*K
ans = -1
s = 10
for i in range(1,L,1):
if s % L == 1:
ans = i
break
s = s % L * 10
print(ans) |
p02556 | s138530503 | Accepted | def get_ints():
return list(map(int,input().split()))
n = int(input())
a,b = [],[]
for i in range(n):
x,y = get_ints()
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
ans = max(a[-1]-a[0], b[-1]-b[0])
print(ans)
|
p02657 | s595351658 | Wrong Answer | def __input__():
X = str(input("―― "))
em = 0
Return = []
for spam in range(len(X)):
if X[spam] == " ":
Return.append(int(X[em:spam]))
em = spam+1
Return.append(int(X[em:]))
return Return
l = __input__();x = 1
for a in l:
x = x * a
print(x) |
p03698 | s406152127 | Wrong Answer | s=input()
if len(s) == len(set(s)):
print('Yes')
else:
print('No') |
p02688 | s173464137 | Accepted | n, k = map(int, input().split())
d = []
a = []
for i in range(k):
d.append(int(input()))
line = list(map(int, input().split()))
a += line
a_set = set(a)
cnt = 0
for i in range(1,n+1):
if not i in a_set:
cnt += 1
print(cnt)
|
p02970 | s062981460 | Accepted |
def main():
N,D = map(int, input().split())
print(-(-N//(2*D+1)))
if __name__ == '__main__':
main() |
p02603 | s624439547 | Accepted | N = int(input())
A = list(map(int,input().split()))
#総価値、現金、株数
dp = [[1000,1000,0] for i in range(N+1)]
for i in range(N):
dp[i+1][0] = max(dp[i][0],dp[i][1]+dp[i][2]*A[i])
dp[i+1][1] = dp[i+1][0] % A[i]
dp[i+1][2] = dp[i+1][0] // A[i]
print(dp[N][0]) |
p03105 | s969142688 | Accepted | # A - Favorite Sound
A,B,C=list(map(int,input().split()))
D=B//A
if C>D:
print(D)
else:
print(C)
|
p03261 | s614479694 | Accepted | num_s, *D, = [s.split() for s in open(0)]
flag = 0
D = [d[0] for d in D]
pw = D[0]
if len(D) != len(set(D)):
flag += 1
else:
for i in range(1, len(D)):
w = D[i]
if pw[-1] != w[0]:
flag += 1
break
pw = w
if flag:
print("No")
else:
print("Yes") |
p03293 | s536222456 | Accepted | s = input()
t = input()
s_lst = [i for i in s]
ans = 0
for i in range(len(s_lst)):
tmp = s_lst[len(s_lst)-1]
s_lst.pop()
a = []
a.append(tmp)
for j in s_lst:
a.append(j)
s_lst = a
b = "".join(a)
if b == t:
ans += 1
if ans >=1:
print("Yes")
else:
print("No") |
p03767 | s028137631 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
l.sort()
print(sum(l[n:2*n])) |
p02993 | s962056958 | Accepted | s=input()
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
print('Bad')
else:
print('Good') |
p02690 | s374875925 | Accepted | n=int(input())
x=0
while True:
if (x+1)**5-x**5>10**9:
x+=1
break
x+=1
for i in range(-x,x):
for j in range(-x,x):
if i**5-j**5==n:
print(i,j)
exit() |
p02612 | s967719613 | Wrong Answer | n = int(input())
print(n%1000) |
p03327 | s708098461 | Wrong Answer | N=int(input())
print("ABC" if N<=1000 else "ABD") |
p03997 | s141928159 | Accepted | a = int(input())
b = int(input())
h = int(input())
print((a + b) * h // 2) |
p03323 | s418580414 | Accepted | a,b = map(int, input().split())
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(") |
p03623 | s046160466 | Accepted | x,a,b=map(int, input().split())
if abs(x-a) > abs(b-x):
print('B')
else:
print('A') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.