problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03612 | s578543729 | Accepted | n = int(input())
p = list(map(int,input().split()))
i = 1
res = 0
while i < n+1:
if p[i-1] == i:
res += 1
i += 1
i += 1
print(res) |
p03721 | s153847052 | Wrong Answer | n,k = map(int, input().split())
for i in range(n):
a,b = map(int, input().split())
k -= b
if k <= 0:
print(a)
exit() |
p02768 | s334058646 | Accepted | MOD = 1000000007
n, a, b = list(map(int, input().split()))
res = pow(2, n, MOD) - 1
dpa = {}
dpb = {}
factriala = 1
factrialb = n
for i in range(1, max(a, b)+1):
if i in [a, b]:
dpb[i] = factrialb
factriala *= i
factriala %= MOD
factrialb *= n-i
factrialb %= MOD
if i in [a, b]:
dpa[i] = factriala
def ncr_count(r):
return dpb[r] * pow(dpa[r], MOD-2, MOD)
res = res - ncr_count(a) - ncr_count(b)
print(res%MOD) |
p03799 | s431867048 | Accepted | #!/usr/bin/env python3
S, C = map(int, input().split())
ret = 0
if 2 * S <= C:
ret += S
C -= 2 * S
S = 0
else:
ret += C // 2
S -= C // 2
C %= 2
ret += C // 4
print(ret)
|
p04034 | s435797301 | Wrong Answer | n, m = map(int, input().split())
s = [0] * n
s[0] = 1
b = [1] * n
for i in range(m):
x, y = map(int, input().split())
b[x-1] -= 1
b[y-1] += 1
if s[x-1] == 1 and s[y-1] == 0:
s[x-1] = int(b[x-1] != 0)
s[y-1] = 1
ans = 0
for i in range(n):
if s[i] and b[i]:
ans += 1
print(ans)
|
p04045 | s902335902 | Accepted | n, k = map(int, input().split())
d_k = set(map(int, input().split()))
ans = n
while ans <= n * 10:
isOK = True
for x in range(len(str(ans))):
if int(str(ans)[x]) in d_k:
isOK = False
break
if isOK == True: break
ans += 1
print(ans) |
p02583 | s234232734 | Accepted | n=int(input())
a=list(map(int,input().split()))
count=0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
s=[a[i],a[j],a[k]]
if a[i]!=a[j] and a[i]!=a[k] and a[j]!=a[k]:
if max(s)<sum(s)-max(s):
count+=1
print(count)
|
p03323 | s855887654 | Wrong Answer | a, b = map(int, input().split())
if a <= 8 or b <= 8:
print('Yay!')
else:
print(':(') |
p03862 | s136532528 | Accepted | N, x = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
# 先頭の箱のキャンディを食べるか否か
if A[0] > x:
ans += A[0] - x
A[0] -= A[0] - x
flg = 1
while flg:
flg = 0
for i in range(1, N):
adj_box_sum = A[i - 1] + A[i]
if adj_box_sum > x:
ans += adj_box_sum - x
A[i] -= adj_box_sum - x
if A[i - 1] + A[i] > x:
flg = 1
print(ans) |
p02899 | s515456439 | Accepted | # -*- coding:utf-8 -*-
N = int(input())
a = list(map(int,input().split()))
L = {}
for i in range(N):
L[i] = a[i]
sort_L = sorted(L.items(), key=lambda x:x[1])
for j in sort_L:
print(j[0]+1, end =" ")
|
p02553 | s768452131 | Wrong Answer | a, b, c, d = map(int, input().split())
x=0
y=0
if b < 0:
x=b
else:
x=a
if d < 0:
y=d
else:
y=c
print(x*y) |
p03380 | s852873679 | Accepted | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(input())
A = list(map(int, input().split()))
x = max(A)
A = list(filter(lambda a: a != x, A))
med = x / 2
num = INF
y = 0
for a in A:
if abs(med - a) < num:
num = abs(med - a)
y = a
print(x, y)
|
p02759 | s561441968 | Wrong Answer | N=int(input())
if N%2==1:
a=int(N/2)
print(a+1)
else:
b=N/2
print(b)
|
p03038 | s274586360 | Accepted | import numpy as np
n, m = list(map(int,input().split()))
a = list(map(int, input().split()))
a.sort()
bc = [list(map(int,input().split())) for _ in range(m)]
bc.sort(key=lambda x:x[1], reverse=True)
position = 0
counter_ = 0
checker_ = 0
for b,c in bc:
while position-counter_ < b and position < n:
if a[position] < c:
a[position] = c
position += 1
else:
checker_ = 1
break
if checker_:
break
counter_ = position
print(sum(a)) |
p03352 | s183387569 | Accepted | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
def solve():
X = ini()
ans = 1
for p in range(2, X):
a = p * p
while a <= X:
ans = max(ans, a)
a *= p
return ans
print(solve())
|
p02682 | s698956945 | Accepted | import sys
s = input()
a, b, c, k = s.split()
a = int(a)
b = int(b)
c = int(c)
k = int(k)
ans = 0
if k <= a:
print(k)
sys.exit()
ans += a
k -= a
if k <= b:
print(ans)
sys.exit()
k -= b
print(ans - k)
|
p02923 | s188463841 | Accepted | from sys import stdin
n = int(stdin.readline().rstrip())
h = [int(x) for x in stdin.readline().rstrip().split()]
m = 0
count = 0
for i in range(n):
if i == n - 1:
if m < count:
m = count
else:
if h[i] >= h[i + 1]:
count += 1
else:
if m < count:
m = count
count = 0
print(m) |
p03623 | s441395254 | Wrong Answer | x, a, b = map(int, input().split())
print('A' if abs(x-a)>abs(x-b) else 'B') |
p03160 | s487917624 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(h[0] - h[1])
for i in range(2, n):
dp[i] = min(dp[i-2] + abs(h[i-2] - h[i]), dp[i-1] + abs(h[i-1] - h[i]))
print(dp[-1])
|
p02720 | s212700595 | Wrong Answer | k = int(input())
q = [1,2,3,4,5,6,7,8,9]
for i in range(k-1):
x = q.pop(0)
if x%10 != 0:
q.append(10*x + (x%10) -1)
q.append(10*x + (x%10))
if x%9 != 0:
q.append(10*x + (x%10) +1)
print(q[0])
|
p02584 | s254473629 | Wrong Answer | x, k, d = map(int, input().split())
#x = abs(x)
#0に最も近い距離になる。
ans = x % d
#ansへの移動回数分、kから引く
if k- (x//d) < 0:
print(x - k*d)
exit()
else:
k -= x//d
tmp = abs(ans - d)
if k % 2 == 0:
print(min(ans, tmp))
else:
print(max(ans, tmp)) |
p02683 | s812682625 | Wrong Answer | import numpy as np
import itertools
N, M, K = map(int, input().split())
Q = [np.asarray(input().split(), dtype=int) for i in range(N)]
min_cost = 10**9
def dfs(cost, C, depth=0):
global min_cost
if depth == N:
return
if (C >= K).all():
min_cost = min([cost, min_cost])
return
dfs(cost+Q[depth][0], C + Q[depth][1:], depth+1)
dfs(cost, C, depth+1)
dfs(0, np.zeros(M))
print(min_cost) if min_cost != 10**9 else print(-1)
|
p03043 | s776173120 | Wrong Answer | N,K = map(int,input().split())
j = 0
point = 0
for i in range(1,N+1):
while (2*i)**j < K:
j += 1
point += (1/N)*((1/2)**j)
i += 1
print(point) |
p03286 | s475700963 | Accepted |
N = int(input())
def base(x, n):
ret = []
while x != 0:
ret.append( x % abs(n))
if n < 0:
x = - ( (-x)//n )
else:
x //= n
return ret
if N == 0:
print(0)
else:
print("".join(map(str, reversed(base(N, -2))))) |
p02786 | s935728630 | Accepted | H = int(input())
def atk(n):
if n==1: return 1
return 1 + 2*(atk(n//2))
print(atk(H)) |
p02603 | s009084758 | Accepted | N = int(input())
A = list(map(int, input().split()))
tmp_money = 1000
tmp_min = A[0]
for i in range(1, N):
if A[i] <= tmp_min:
tmp_min = A[i]
else:
tmp_kabu = tmp_money // tmp_min
tmp_money = tmp_money - (tmp_kabu * tmp_min) + tmp_kabu * A[i]
tmp_min = A[i]
print(tmp_money)
|
p03721 | s693552109 | Accepted | N, K = map(int, input().split())
ab = [[0, 0]] * N
for i in range(N):
_a, _b = map(int, input().split())
ab[i] = [_a, _b]
ab.sort(key=lambda x:x[0])
total = 0
for pair in ab:
total += pair[1]
if total >= K:
print(pair[0])
break
|
p02717 | s961659302 | Accepted | x, y, z = input().split()
print(z, x, y) |
p02595 | s374911253 | Accepted | N, D = map(int, input().split())
c = 0
for _ in range(N):
a, b = map(int, input().split())
if a**2+b**2<=D**2:
c += 1
print(c) |
p02546 | s269091058 | Accepted | S = input()
if S[-1] == 's':
print(S+"es")
else:
print(S+"s") |
p02618 | s071934334 | Wrong Answer | D=int(input())
C=list(map(int,input().split()))
import sys
S=sys.stdin.readlines()
A=[0]*26
B=[0]*D
k=0
for i in range(26):
if C[i]!=0:
k+=C[i]
for i in range(26):
if i<25:
A[i]=int(C[i]/k*D)
else:
A[i]=D-sum(A[:25])
for i in range(25):
for j in range(A[i]):
B[(D+1)//(A[i]+1)*j]=i+1
for i in range(D):
if B[i]==0:
B[i]=26
print(A)
for i in range(D):
print(B[i]) |
p03944 | s380784247 | Wrong Answer | W,H,N=map(int,input().split())
W0=0
H0=0
for i in range(N):
x1,y1,a1=map(int,input().split())
if a1 ==1:
W0=x1
elif a1==2:
W=x1
elif a1==3:
H0=y1
elif a1==4:
H=y1
if W-W0>0 and H-H0>0:
print((W-W0)*(H-H0))
else:
print(0) |
p02732 | s989343632 | Accepted | import sys
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
N = II()
A = LI()
from collections import Counter
S = Counter(A)
result = sum(list(map(lambda x: int(x*(x-1)/2), S.values())))
for a in A:
n = S[a]
print(result-n+1) |
p02612 | s000727739 | Wrong Answer | print(1000 - int(input())%1000) |
p03471 | s644517814 | Wrong Answer | def main():
N, Y = map(int, input().split())
for i in range(0, N+1):
for j in range(0, N+1):
if i * 10000 + j * 5000 + (N-i-j) * 1000 == Y:
print(i, j, (N-i-j))
return
print(-1, -1, -1)
main() |
p03161 | s673716497 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
DP=[10**9+1]*n
DP[0]=0
DP[1]=abs(h[1]-h[0])
for i in range(1,n):
for j in range(max(0,i-k),min(i+1,n-1)):
DP[i]=min(DP[i],DP[i-j]+abs(h[i]-h[i-j]))
print(DP[-1]) |
p02859 | s450178431 | Wrong Answer | n = int(input())
n = n**n
print(round(n)) |
p02717 | s121643668 | Wrong Answer | a = list(map(int, input().split()))
b = [0, 0, 0]
b[0] = a[2]
b[1] = a[0]
b[2] = a[1]
print(b)
B = [str(a) for a in b]
B = " ".join(B)
print(B) |
p04012 | s837876502 | Wrong Answer | s = input()
s_list = [s[_] for _ in range(len(s))]
dic = dict()
for c in s_list:
if c in dic:
dic[c] += 1
else:
dic[c] = 1
flg = True
for key in dic:
if dic[key] != 2:
flg = False
if flg:
print('Yes')
else:
print('No')
|
p02618 | s249578869 | Accepted | D = int(input())
c = list(map(int, input().split()))
s = []
for k in range(D):
s.append(list(map(int, input().split())))
#print(s)
ans = [s[0].index(max(s[0]))+1 for k in range(D)]
for k in range(D):
print(ans[k]) |
p03437 | s836074369 | Accepted | x, y = map(int,input().split())
if x % y == 0:
print(-1)
else:
print(x) |
p03612 | s758968147 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n - 1):
if a[i] == i + 1:
a[i], a[i + 1] = a[i + 1], a[i]
ans += 1
if a[n - 1] == n:
ans += 1
print(ans) |
p02607 | s109494330 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(0,n):
if i%2!=0 or a[i]%2!=0:
c+=1
print(c) |
p03745 | s564246757 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 1
re = 0
for i in range(2,N,1):
#print(re)
if re == 0:
if A[i] <= A[i-1] <= A[i-2]:
re = 0
elif A[i-2] <= A[i-1] <= A[i]:
re = 0
else:
ans +=1
re = 1
else:
re = 0
print(ans)
|
p03162 | s887242908 | Accepted | n = int(input())
INF = 1 << 20
dp = [[INF] * (n + 1) for _ in range(3)]
# dp初期化
for i in range(3):
dp[i][-1] = 0
for i in range(n):
a, b, c = map(int, input().split())
dp[0][i] = max(dp[1][i - 1], dp[2][i - 1]) + a
dp[1][i] = max(dp[2][i - 1], dp[0][i - 1]) + b
dp[2][i] = max(dp[0][i - 1], dp[1][i - 1]) + c
print(max(list(zip(*dp))[n - 1])) |
p03339 | s937084119 | Wrong Answer | from itertools import accumulate
def main():
N = int(input())
people = list(input())
wests = list(accumulate([0]+people, lambda total, x: total + (1 if x == "W" else 0)))
easts = list(accumulate([0]+people, lambda total, x: total + (1 if x == "E" else 0)))
def fullsearch():
easts_total = easts[-1]
for i in range(N):
yield wests[i] + easts_total - easts[i]
print(min(fullsearch()))
main() |
p02838 | s248673413 | Accepted | import numpy as np
n = int(input())
arr = np.array([int(i) for i in input().split()])
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
#一桁目が1か0か調べて1の個数をカウント
c1 = np.count_nonzero(arr & 1)
#1の個数×0の個数(XORだから)
ans += 2 ** i * c1 * (n - c1)
#桁をシフト
arr =arr >> 1
print(ans % mod) |
p02556 | s812891921 | Wrong Answer | N=int(input())
xy=[]
for i in range(N):
x,y=map(int,input().split())
xy.append([x,y,x**2+y**2])
xy=sorted(xy,key=lambda x:x[2])
print(abs(xy[0][0]-xy[-1][0])+abs(xy[0][1]-xy[-1][1]))
|
p03095 | s129508210 | Accepted | n=int(input())
s=input()
import collections
c = collections.Counter(s)
ans=1
for v in c.values():
ans*=(v+1)
ans%=10**9+7
print(ans-1) |
p03211 | s553641017 | Accepted | s = input()
ans = float('inf')
for i in range(len(s)-2):
n = int(s[i:i+3])
ans = min(ans, abs(753-n))
print(ans) |
p02693 | s581609749 | Wrong Answer | k = int(input())
a, b = map(int,input().split())
c = b//k
ans=0
for i in range(c):
i += 1
ans = i*k
if a<= ans <=b:
print("OK")
break
else:
ans = -1
if ans == -1:
print("NG")
|
p03639 | s905649518 | Accepted | n=int(input())
a=list(map(int,input().split()))
yon=0
so=0
flag=False
for i in range(len(a)):
if a[i]%4==0:
yon+=1
elif a[i]%2==0:
flag=True
else:
so+=1
if flag:
so+=1
if so-1<=yon:
print("Yes")
else:
print("No") |
p02572 | s885915460 | Accepted | N = int(input())
A = list(map(int, input().split()))
MOD = 10**9 + 7
S = sum(A) % MOD
ans = (S ** 2) % MOD
for a in A:
ans -= a**2
ans %= MOD
ans *= pow(2, MOD-2, MOD)
ans %= MOD
print(ans) |
p03377 | s990352055 | Accepted | a, b, x = map(int, input().split())
if a + b >= x and x >= a:
print("YES")
else:
print("NO") |
p02612 | s033391063 | Wrong Answer |
a = int(input())
b = 0
while b <= a:
b = b + 1000
print(abs(a-b)) |
p02615 | s598450162 | Wrong Answer | def main():
n = int(input())
a = [int(i) for i in input().split()]
ans = solve(n, a)
print(ans)
def solve(n, a):
a.sort()
ans = 0
ans += sum(a[-(n // 2) - n % 2:])
ans *= 2
if n % 2:
ans -= a[-(n // 2)]
ans -= a[-1]
return ans
if __name__ == '__main__':
main() |
p03136 | s946416415 | Accepted | def main():
N = int(input())
L = [int(a) for a in input().split()]
lmax = max(L)
L.remove(lmax)
if sum(L) > lmax :
print("Yes")
else:
print("No")
main() |
p03592 | s885543270 | Accepted | h, w, k = map(int, input().split())
for r in range(h + 1):
for c in range(w + 1):
s = (h - r) * c + r * (w - c)
if s == k:
print('Yes')
exit()
print('No')
|
p02793 | s537752867 | Wrong Answer | import fractions as fr
import numpy as np
def main():
N=int(input())
A=np.array([int(i) for i in input().split()])
MOD=1000000007
lcm = 1
gcd=fr.gcd
for i in range(N):
lcm = A[i] * lcm //fr.gcd(A[i], lcm)
sumval = np.sum(lcm//A)
print(sumval%MOD)
main() |
p03162 | s186272911 | Wrong Answer | days = int(input())
dp = [[0, 0]]*days
sum = 0
dp[0][0], dp[0][1] = -1, -1
for i in range(days):
l = list(map(int, input().split()))
x = max(l)
y = l.index(x)
if dp[i-1][0] == y:
l[y] = 0
dp[i][1] = max(l)
dp[i][0] = l.index(dp[i][1])
else:
dp[i][1] = max(l)
dp[i][0] = l.index(dp[i][1])
sum += dp[i][1]
print(sum)
|
p02718 | s443513586 | Wrong Answer | n,m = map(int, input().split())
a = list(map(int, input().split()))
counter = 0
a.sort(reverse=True)
for i in a:
if i >= int(sum(a) / (4*m)):
counter =+ 1
print(counter)
if counter >= m:
print("Yes")
else:
print("No") |
p03485 | s040095104 | Wrong Answer | import sys
a, b = map(int, sys.stdin.readline().split())
def main():
print(int(round(a + b) / 2))
if __name__ == '__main__':
main() |
p02861 | s301370540 | Accepted | import itertools
import math
N=int(input())
XY=[list(map(int,input().split())) for i in range(N)]
ans=0.0
fact=1
for i in range(2,N+1):
fact*=i
ans=0.0
v=[]
for i in range(N):
v.append(i)
for s in itertools.permutations(v):
for j in range(N-1):
ans+=math.sqrt((XY[s[j]][0]-XY[s[j+1]][0])**2+(XY[s[j]][1]-XY[s[j+1]][1])**2)
print(ans/fact) |
p02677 | s045310146 | Accepted | import math
a, b, h, m = map(int, input().split())
o = 0
c = (h*30) + (m/60*30) - (m*6)
c = math.radians(c)
print(((a**2)+(b**2)-2*a*b*(math.cos(c)))**(1/2))
|
p03774 | s118038129 | Accepted | n,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)] #student
cd=[list(map(int,input().split())) for _ in range(m)] #check point
for i in range(n):
l=[]
for j in range(m):
l.append(abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1]))
k=l.index(min(l))+1
print(k) |
p02594 | s074858223 | Wrong Answer | x = int(input())
if x == 30:
print("Yes")
else:
print("No")
|
p03624 | s326802755 | Accepted | S = input()
s = [S[_] for _ in range(len(S))]
s.sort()
judge = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(s)):
judge = judge.lstrip(s[i])
if judge == "":
print("None")
else:
print(judge[0]) |
p03435 | s071917017 | Wrong Answer | c=[list(map(int, input().split())) for i in range(3)]
if (c[0][0] - c[1][0] == c[0][1] - c[1][1] == c[0][2] - c[1][2]) and \
(c[0][1] - c[1][2] == c[1][1] - c[2][1] == c[1][2] - c[2][2]):
print('Yes')
else:
print('No') |
p03607 | s481207133 | Accepted | n = int(input())
paper = set()
for _ in range(n):
a = int(input())
if not a in paper:
paper.add(a)
else:
paper.remove(a)
print(len(paper))
|
p02838 | s446225651 | Accepted | M=10**9+7
n=int(input())
l=list(map(int,input().split()))
a=0
for i in range(60):
t=sum((l[j]>>i)%2 for j in range(n))
a+=(t*(n-t)<<i)%M
print(a%M) |
p03679 | s079025610 | Accepted | x, a, b = map(int, input().split())
if a >= b:
print('delicious')
elif x >= b - a:
print('safe')
else:
print('dangerous') |
p02732 | s407320900 | Accepted | N=int(input())
a=list(map(int,input().split()))
b=[0]*N
sum=0
for i in range(N):
b[a[i]-1]+=1
for i in range(N):
sum+=b[i]*(b[i]-1)//2
for i in range(N):
print(sum-b[a[i]-1]+1) |
p02723 | s248045171 | Accepted | a=input()
if a[2]==a[3] and a[4]==a[5]:
print("Yes")
else:
print("No") |
p03705 | s149250702 | Accepted | n,Min,Max = map(int,input().split())
sum_min = Min * (n-1) + Max
sum_max = Max * (n-1) + Min
ans = sum_max - sum_min + 1
print(max(0,ans))
|
p03637 | s745069521 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
four = 0
two = 0
not_four = 0
for i in range(N):
if a[i] % 4 == 0:
four += 1
elif a[i] % 2 == 0 and a[i] % 4 != 0:
two += 1
if two == 2:
four += 1
two = 0
else:
not_four += 1
if two == 1:
not_four += 1
while four > 0 and not_four > 0:
four -= 1
not_four -= 2
if four >= not_four:
print("Yes")
else:
print("No")
|
p04033 | s147871343 | Wrong Answer | a,b = map(int, input().split())
if a == 0 or b == 0 or (a <= 0 and b >= 0):
print(0)
elif a>0 and b>0:
print("Positive")
elif (a - b)%2 == 0:
print("Negative")
else:
print("Positive") |
p02584 | s755205501 | Wrong Answer | x,k,d=map(int,input().split())
R=[]
for i in range(1,k+1):
res=abs(x-i*d)
R.append(res)
print(min(R)) |
p02823 | s254128102 | Accepted | N,A,B=map(int,input().split())
if (A+B)%2==0:
P=(B-A)//2
else:
P=float("inf")
if (A+B)%2==1:
Q=A
Q+=(B-Q-(B-Q+1)//2)
else:
Q=float("inf")
if (A+B)%2==1:
R=N-B+1
B=N
A+=R
R+=B-(A+B)//2
else:
R=float("inf")
print(min(P,Q,R)) |
p03328 | s513582379 | Accepted | a, b = map(int, input().split())
d = b - a - 1
print(d*(d+1)//2 - a) |
p02748 | s490461812 | Accepted | A, B, M = [int(n) for n in input().split()]
a = [int(n) for n in input().split()]
b = [int(n) for n in input().split()]
ma = sorted(a)[0]
mb = sorted(b)[0]
ans = ma + mb
for m in range(M):
x, y, c = [int(n) for n in input().split()]
dv = a[x-1] + b[y-1] - c
ans = min(ans , dv)
print(ans)
|
p03759 | s586113870 | Wrong Answer | a,b,c=map(int,input().split())
print("Yes" if b-a==c-b else "No") |
p02862 | s118816260 | Wrong Answer | X, Y = map(int, input().split())
MOD = 10**9+7
def mod_pow(n, m):
res = 1
while m > 0:
if m & 1:
res = (res*n)%MOD
n = (n*n)%MOD
m >>= 1
return res
if (2*Y-X)%3 != 0 or (2*X-Y)%3 != 0:
print(0)
else:
A = (2*X-Y)//3
B = (2*Y-X)//3
m = 1
n = 1
for i in range(A):
m = (m*(A+B-i))%MOD
n = (n*(A-i))%MOD
inverse_n = mod_pow(n, MOD-2)
print((m*inverse_n)%MOD)
|
p02761 | s468525941 | Accepted | N,M=map(int,input().split())
sc=[]
for i in range(M):
sc.append(list(map(int,input().split())))
ans=-1
cnt=10**(N-1)
if cnt==1:cnt-=1
while True:
if len(str(cnt))>N:break
if len(str(cnt))!=N:continue
ret=True
for i in range(M):
if str(cnt)[sc[i][0]-1]!=str(sc[i][1]):
ret=False
break
if ret:
ans=cnt
break
cnt+=1
print(ans) |
p03761 | s157747572 | Wrong Answer | def resolve():
n = int(input())
S0 = sorted(list(input()))
dic = dict(zip(set(S0), [0]*len(set(S0))))
for s0 in S0:
dic[s0] += 1
for i in range(n-1):
S = list(input())
for k, v in dic.items():
cnt = S.count(k)
dic[k] = min(v, cnt)
ans = ''
for k, v in dic.items():
ans += k * v
print(ans)
if __name__ == '__main__':
resolve() |
p03785 | s017859087 | Accepted | N,C,K=map(int,input().split())
T=sorted([int(input()) for i in range(N)])
cnt=0
i=0
while(i<N):
j=i
lim=T[i]+K
while(j<N and T[j]<=lim and j-i+1<=C):
j+=1
cnt+=1
i=j
print(cnt) |
p02571 | s245968260 | Accepted | s = input()
t = input()
ans = len(t)
for i in range(len(s)-len(t)+1):
temp = 0
for j in range(0,len(t)):
if s[i+j]==t[j]:
temp += 1
ans = min(ans,len(t)-temp)
print(ans) |
p03759 | s550519449 | Accepted | a,b,c=map(int,input().split())
if b-a==c-b:
print("YES")
else:
print("NO") |
p02677 | s351895232 | Wrong Answer | import math
a, b, H, M = map(int, input().split())
a_ = 360 / 12
b_ = 360 / 60
a_x = a * math.sin(math.radians(a_ * H))
a_y = a * math.cos(math.radians(a_ * H))
b_x = b * math.sin(math.radians(b_ * M))
b_y = b * math.cos(math.radians(b_ * M))
print(math.sqrt((b_x - a_x) ** 2 + (b_y - a_y) ** 2))
|
p02817 | s642359031 | Accepted | S,T = map(str,input().split())
print(T,S,sep='') |
p02952 | s035723674 | Accepted | N = int(input())
if N<10:
print(N)
elif 10<=N and N<100:
print(9)
elif 100<=N and N<1000:
print(9 + (N-100+1))
elif 1000<=N and N<10000:
print(909)
elif 10000<=N and N<100000:
print(909 + (N-10000+1))
else:
print(90909) |
p03407 | s297662216 | Accepted | #!/usr/bin/env python3
a, b, c = list(map(int, input().split()))
if a+b >= c:
print("Yes")
else:
print("No")
|
p03328 | s740352006 | Accepted | a,b = map(int, input().split())
n = b-a
print(n*(n+1)//2-b)
|
p03862 | s450924758 | Wrong Answer | # coding: utf-8
n, x = map(int,input().split())
A = list(map(int,input().split()))
ans=0
for i in range(n-1):
s = A[i] + A[i+1]
if s-x >= 0:
ans += s-x
A[i+1] -= s-x
print(ans) |
p03379 | s162642526 | Accepted | N = int(input())
X = list(map(int, input().split()))
sort_X = sorted(X)
L = sort_X[(N//2)-1]
R = sort_X[N//2]
for i in range(N):
if X[i] <= L:
print(R)
else:
print(L) |
p02933 | s587300878 | Wrong Answer | print("pink" if int(input())>=3200 else "red") |
p04045 | s537535533 | Wrong Answer | import sys
N, K = map(int, input().split())
Ds = list(input())
for i in range(N, 1000000):
for j in range(K):
if Ds[j] in str(i):
break
if j == K-1:
print(i)
sys.exit(0)
|
p03309 | s160395167 | Wrong Answer | n = int(input())
a = [x-(i+1) for i, x in enumerate(list(map(int, input().split())))]
b1 = sum(a)//len(a)
def ceil(a, b):
return -(-a // b)
b2 = ceil(sum(a), len(a))
ans1 = 0
ans2 = 0
for aa in a:
ans1 += abs(aa-b1)
ans2 += abs(aa-b2)
print(min(ans1, ans2))
|
p03293 | s454374543 | Wrong Answer | N = list(input())
M = list(input())
count =0
for i in range(len(N)):
a = M.pop(0)
M.append(a)
if M == N:
count +=1
if count == 1:
print('Yes')
else:
print('No') |
p03286 | s613592537 | Accepted | n = int(input())
if n != 0:
ans = []
while n != 0:
ans.append(abs(n % -2))
n += n % -2
n /= -2
n = int(n)
print(''.join([str(i) for i in reversed(ans)]))
else:
print(0) |
p02584 | s657024728 | Accepted | X,K,D=map(int,input().split())
X=abs(X)
q=X//D
r=X%D
if r < D-r:
n=q
ans1=r
ans2=D-r
else:
n=q+1
ans1=D-r
ans2=r
if K <= n:
ans=X-K*D
ans=abs(ans)
else:
d=K-n
if d%2==0:
ans = ans1
else:
ans = ans2
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.