problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03705 | s839802162 | Wrong Answer | n,a,b=map(int,input().split())
print(max(0,(n-1)*(b-a)+1)) |
p03472 | s452969947 | Accepted | from math import ceil
N,H=list(map(int,input().split()))
a_max=0
b_list=[]
for _ in range(N):
a,b=list(map(int,input().split()))
a_max = max(a_max,a)
b_list.append(b)
b_list = sorted(b_list,reverse=True)
ans=ceil(H/a_max)
bcount=0
for b in b_list:
bcount+=1
H=max(0,H-b)
ans=min(ans,bcount+ceil(H/a_max))
print(ans) |
p03137 | s210221838 | Accepted | n, m = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
if n >= m:
print(0)
exit()
l = [0 for _ in range(m-1)]
for i in range(m-1):
l[i] = x[i+1] - x[i]
l.sort(reverse=True)
print(sum(l[n-1:])) |
p02983 | s034495867 | Wrong Answer | def divisor(n):
i = 1
table = []
while i * i <= n:
if n % i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
def main():
l, r = map(int, input().split())
ans = float("inf")
if r - l >= 2500:
ans = 0
else:
for i in range(l, r):
ans = min((i*(i+1) % 2019), ans)
print(ans)
if __name__ == "__main__":
main()
|
p02970 | s649003423 | Accepted | import math
a = list(map(int, input().split()))
print(math.ceil(a[0]/(a[1]*2+1))) |
p02661 | s439576451 | Accepted | n = int(input())
ls = []
rs = []
for _ in range(n):
x, y = map(int, input().split())
ls.append(x)
rs.append(y)
ls = sorted(ls)
rs = sorted(rs)
if n % 2 == 1:
print(rs[len(rs)//2] - ls[len(ls)//2] + 1)
else:
a = (rs[len(rs)//2-1] * 10 + rs[len(rs)//2] * 10) // 2
b = (ls[len(ls)//2-1] * 10 + ls[len(ls)//2] * 10) // 2
print((a - b) // 5 + 1) |
p03723 | s907957000 | Wrong Answer | A,B,C=[int(s) for s in input().split(" ")]
A=[A]
B=[B]
C=[C]
Count=0
for i in range(1000):
A.append(B[i]/2+C[i]/2)
B.append(A[i]/2+C[i]/2)
C.append(B[i]/2+A[i]/2)
Count+=1
if A[i+1]%2!=0 or B[i+1]%2!=0 or C[i+1]%2!=0:
break
if Count>=1000:
Count=-1
print(Count) |
p03814 | s317182004 | Accepted | s = input()
print(s.rfind("Z") - s.find("A") + 1)
|
p02688 | s270294565 | Wrong Answer | N, K = map(int, input().split())
max_n = 0
for i in range(K):
d = int(input())
A = list(map(int, input().split()))
max_n = max(max_n, d)
print(N - max_n)
|
p03637 | s889263140 | Wrong Answer | n = int(input())
aa = list(map(int,input().split()))
d2 = 0
d4 = 0
for ai in aa:
if ai % 4 == 0:
d4 += 1
elif ai % 2 == 0:
d2 += 1
else:
pass
if d2<=1:
d2=0
dd = (d4*2 +1) + d2
if d4==0:
dd -= 1
if dd >= n :
print('Yes')
else:
print('No') |
p03319 | s141898427 | Accepted | N, K= map(int, input().split())
A = list(map(int, input().split()))
print(-(-(N-K)//(K-1))+1) |
p02832 | s284304215 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
now_number = 0
now_count = 0
for i in range(n):
if a[i] == now_number+1:
now_number = a[i]
now_count = i
if now_number == 0:
print(-1)
else:
print(now_count+1 - now_number) |
p03627 | s651535113 | Accepted | import math
import collections
import fractions
import itertools
def solve():
n = int(input())
a = list(map(int, input().split()))
c = collections.Counter(a)
box = []
for i in c:
if c[i] >= 2:
for _ in range(c[i]//2):
box.append(i)
if len(box) < 2:
print(0)
else:
box.sort(reverse=True)
print(box[0]*box[1])
return 0
if __name__ == "__main__":
solve()
|
p03998 | s254274028 | Accepted | D = {}
D["A"] = input()
D["B"] = input()
D["C"] = input()
t = "A"
while 1:
if len(D[t]) == 0:
winner = t
break
if D[t][0] == "a":
u = "A"
elif D[t][0] == "b":
u = "B"
elif D[t][0] == "c":
u = "C"
D[t] = D[t][1:]
t = u
print(winner)
|
p03077 | s770911354 | Accepted | import math
e=[int(input()) for i in range(6)]
ans=5+math.ceil(e[0]/min(e[1:])-1)
print(ans) |
p02699 | s208799281 | Accepted | s, w = list(map(int, input().split()))
if s <= w:
print("unsafe")
else:
print("safe")
|
p03206 | s304813133 | Accepted | x = int(input())
print("Christmas"+" Eve"*(25-x)) |
p02935 | s253431003 | Accepted | N=int(input())
v=sorted(list(map(int,input().split())))
s=v[0]
for i in range(N-1):
s=(s+v[i+1])/2
print(s)
|
p02594 | s550029640 | Accepted | n = int(input())
if n >= 30:
print("Yes")
else:
print("No") |
p02712 | s598105237 | Wrong Answer | n = int(input())
l = 0
for i in range(n):
if i % 3 != 0 and i % 5 != 0:
l += i
print(l) |
p02989 | s479721739 | Accepted | n = int(input())
dlist = list(map(int, input().split()))
dlist_sorted = sorted(dlist)
kiwa_upper = dlist_sorted[n//2]
kiwa_low = dlist_sorted[(n//2)-1]
# 同じ数の選び方が存在しない場合
if len(dlist_sorted[n//2:]) != n//2:
print(0)
# 存在する場合
else:
print(kiwa_upper - kiwa_low) |
p03126 | s865645095 | Wrong Answer | import numpy as np
N,M = map(int,input().split())
A = [[int(i) for i in input().split()] for _ in range(N)]
ans=-1
for i in range(1,M+1):
count=0
for j in range(N):
if not i in A[j]:
break
else:
count+=1
if count==N:
ans+=1
print(ans)
|
p03665 | s812502312 | Accepted | N, P = map(int, input().split())
A = list(map(int, input().split()))
def comb(x, y):
m = c = 1
for i in range(y):
m *= x-i
c *= y-i
return m//c
even = odd = 0
for a in A:
if a%2 == 0:
even += 1
else:
odd += 1
if P == 0:
ans = 0
for i in range(0, odd+1, 2):
ans += comb(odd, i)
print(pow(2, even) * ans)
else:
ans = 0
for i in range(1, odd+1, 2):
ans += comb(odd, i)
print(pow(2, even) * ans) |
p02760 | s571783433 | Wrong Answer | import numpy as np
def check_bingo(A):
for i in range(3):
if not np.all(A[i]) or not all(A[:, i]):
return 'Yes'
if not np.all(A[list(range(3)), list(range(3))]):
return 'Yes'
return 'No'
def main():
A = np.array([list(map(int, input().split())) for _ in range(3)])
n = int(input())
for i in range(n):
b = int(input())
A = np.where(A == b, 0, A)
ans = check_bingo(A)
print(ans)
if __name__ == '__main__':
main()
|
p02819 | s831861522 | Accepted | x = int(input())
def q(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
l = 6
ans = 0
while l > 1:
b = q(x)
x += 1
l = len(b)
print(x - 1) |
p03264 | s024187006 | Wrong Answer | n = int(input())
print((n/2)**2) if n%2 == 0 else print((n//2) * (n//2+1)) |
p02594 | s511570273 | Accepted | x = int(input())
if x>=30:
print('Yes')
else:
print('No')
|
p03380 | s384267230 | Accepted | import bisect
N = int(input())
numbers = list(map(int, input().split()))
numbers.sort()
maximum = numbers[-1]
half = maximum/2
index = bisect.bisect_left(numbers, half)
if index != 0:
if numbers[index] - half < half - numbers[index-1]:
print('{} {}'.format(maximum, numbers[index]))
else:
print('{} {}'.format(maximum, numbers[index-1]))
else:
print('{} {}'.format(maximum, numbers[0]))
|
p02880 | s088617323 | Accepted | N = int(input())
seki = set()
for i in range(9):
for j in range(9-i):
seki.add((i+1)*(i+j+1))
if N in seki:
print("Yes")
else:
print("No") |
p02732 | s879468543 | Accepted | import sys
n=int(sys.stdin.readline())
arr=list(map(int,sys.stdin.readline().split()))
from collections import defaultdict
s=0
dic=defaultdict(int)
for i in range(n):
dic[arr[i]]+=1
for i in dic:
s+=(dic[i]*(dic[i]-1))//2
#print(s,'s')
for i in range(n):
a=arr[i]
ans=s
ans-=dic[a]*(dic[a]-1)//2
if dic[a]-2>=0:
ans+=(dic[a]-1)*(dic[a]-2)//2
print(ans)
|
p02756 | s311173089 | Accepted | from collections import deque
S = input()
Q = int(input())
W = 0
ans = deque(list(S.rstrip()))
for _ in range(Q):
# print(W,ans)
qry = list(input().rstrip().split())
if qry[0] == "1":
W = 1-W
continue
T,F,C = qry
C.rstrip()
if (W == 0 and F=="2") or (W==1 and F=="1"):
ans.append(C)
else:
ans.appendleft(C)
ans = "".join(map(str,ans))
if W == 1:
ans = ans[::-1]
print(ans) |
p02696 | s382775948 | Wrong Answer | import math
A, B, N = map(int, input().split())
def f(x):
return math.floor(A * x / B) - A * math.floor(x / B)
high = N
low = 0
while high - low > 1:
mid_left = high / 3 + low * 2 / 3
mid_right = high * 2 / 3 + low / 3
# print(mid_left, mid_right)
if f(mid_left) >= f(mid_right):
high = mid_right
else:
low = mid_left
print(f(high))
|
p03077 | s916960635 | Wrong Answer | n = int(input())
city = [int(input()) for _ in range(5)]
if n <= min(city):
print(5)
exit()
print(round(n/min(city))+4) |
p03106 | s483372566 | Accepted | a,b,k = map(int,input().split())
target = list()
for i in range(1, max(a,b)+1):
if a%i==0 and b%i==0:
target.append(i)
print(target[-k])
|
p02847 | s043917071 | Accepted | D = {"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(D[input().strip()]) |
p03827 | s312303411 | Accepted | n=int(input())
s=list(str(input()))
x=0
ans=0
for i in range(n):
if s[i]=="I":
x+=1
else:
x-=1
ans=max(ans,x)
print(ans) |
p02546 | s962022317 | Accepted | s = input().lower()
if s[-1] == 's':
print(str(s)+"es")
elif s[-1] != 's':
print(str(s)+"s") |
p02584 | s859926186 | Wrong Answer | #c
x,k,d = map(int,input().split())
if x//d <k:
if (k-x//d)%2 == 0:
if x%d > abs(x%d-d):
print(x%d-d)
else:
print(x%d)
else:
print(abs(x%d-d))
else:
print(x-d*k)
|
p03000 | s500510718 | Wrong Answer | #ABC130 B
N,X = map(int,input().split())
L = list(map(int,input().split()))
D = [0,L[0]]
count = 0
for i in range(2,N+2):
D.append(D[i-1]+L[i-2])
for i in range(0,N+2):
if D[i]<= X:
count += 1
print(count) |
p03827 | s212344958 | Accepted | n = int(input())
s = input()
x = 0
max = 0
for i in range(n):
if s[i] =="I":
x += 1
if x>max:
max = x
else:
x -= 1
print(max) |
p03796 | s922871024 | Accepted | import math
mod = 1000000007
def solve():
N = int(input())
ans = math.factorial(N) % mod
print(ans)
if __name__ == "__main__":
solve()
|
p02726 | s048377902 | Accepted | N, X, Y = map(int, input().split())
dis = [0 for _ in range(N)]
for i in range(1, N):
for j in range(i + 1, N + 1):
d = min(abs(i - j),
abs(i - X) + 1 + abs(j - Y),
abs(i - Y) + 1 + abs(j - X))
dis[d] += 1
for k in range(1, N):
print(dis[k]) |
p03827 | s431217405 | Wrong Answer | N = int(input())
S = input()
x = 0
maxCount = 0
for s in S:
former = x
if s == "I":
x += 1
elif s == "D":
x -= 1
maxCount = max(former, x)
print(maxCount) |
p02595 | s118127722 | Accepted | import datetime
import string
import re
import math
inp = list(map(int, input().split()))
N=int(inp[0])
D=int(inp[1])
alist = [input().split() for i in range(N)]
count = 0
for i in range(N):
if int(alist[i][0])**2 + int(alist[i][1])**2 <= D**2: count += 1
print(count) |
p02792 | s531804421 | Accepted | from collections import Counter
from itertools import combinations
n = int(input().rstrip())
c = Counter()
for i in range(1,n+1):
i = str(i)
a = int(i[0])
b = int(i[-1])
c[a, b] += 1
ans = 0
for a, b in combinations(range(1,10), 2):
ans += 2 * c[a,b] * c[b,a]
for i in range(1,10):
ans += c[i,i] ** 2
print(ans) |
p03838 | s775269666 | Accepted | X, Y = map(int, input().split())
ans = 10 ** 18
# flipしない
if Y - X >= 0:
ans = Y - X
# はじめにflip
if Y - (-X) >= 0:
ans = min(ans, 1 + Y - (-X))
# 最後にflip
if (-Y) - X >= 0:
ans = min(ans, (-Y) - X + 1)
# 両方flip
if (-Y) - (-X) >= 0:
ans = min(ans, 1 + (-Y) - (-X) + 1)
print(ans)
|
p02779 | s748817551 | Accepted | n = int(input())
a = list(map(int, input().split()))
if n == len(set(a)):
print("YES")
else:
print("NO") |
p02660 | s333419015 | Accepted | n = int(input())
ans = 0
d = 2
while d * d < n:
if n % d != 0:
d += 1
continue
e = d
while n % e == 0:
n //= e
e *= d
ans += 1
while n % d == 0:
n //= d
if n != 1:
ans += 1
print(ans) |
p03860 | s448975783 | Accepted | a,s,c=input().split()
print("A"+s[0]+"C") |
p03698 | s009191744 | Accepted | def main():
s = input()
length = len(s)
print("yes" if length == len(set(list(s))) else "no")
if __name__ == '__main__':
main()
|
p02578 | s720281106 | Accepted | n = int(input())
a = list(map(int, input().split()))
level = 0
step = 0
for i in range(n):
if level < a[i]:
level = a[i]
else:
step += level - a[i]
print(step) |
p02983 | s045928802 | Accepted |
[L,R] = list(map(int,input().split()))
flag=0
for i in range(L,R+1):
if i%2019 == 0:
flag=1
break
LL = L%2019
RR = R%2019
dammy=[]
for i in range(LL,RR):
for j in range(i+1,RR+1):
dammy.append((i*j)%2019)
if flag==0:
print(min(dammy))
else:
print(0) |
p03472 | s062898982 | Wrong Answer | def main():
from math import ceil
from itertools import accumulate
from bisect import bisect
n, h, *ab = map(int, open(0).read().split())
x = max(ab[::2])
*y, = filter(lambda i: i >= x, ab[1::2])
y.sort(reverse=True)
*z, = accumulate(y)
if z[-1] <= h:
print(len(y) + ceil((h - z[-1]) / x))
else:
print(bisect(z, h))
if __name__ == '__main__':
main()
|
p03997 | s321799838 | Wrong Answer | a = int(input())
b = int(input())
h = int(input())
area = 0.5*(a+b)*h
print(area)
|
p03262 | s629884343 | Accepted | import fractions
n,st=map(int,input().split())
*x,=map(int,input().split())
e=abs(x[0]-st)
for i in range(1,n):
e=fractions.gcd(e,abs(x[i]-st))
print(e) |
p02881 | s904538779 | Wrong Answer | n=int(input())
ans=10**13
for i in range(1,10**6):
if n%i==0:
cal=n//i+i-2
ans=min(cal,ans)
print(int(ans)) |
p02772 | s047433230 | Accepted | N = int(input())
A = list(map(int, input().split()))
for a in A:
if a%2 == 0 and not (a%3 == 0 or a%5 == 0):
print('DENIED')
break
else:
print('APPROVED') |
p02795 | s141627405 | Accepted | # coding: utf-8
h = int(input())
w = int(input())
n = int(input())
count = num = 0
higher = max(h,w)
lower = min(h,w)
for i in range(lower):
count = higher*(i+1)
num += 1
if count>=n:
print(num)
exit() |
p02747 | s319431027 | Accepted | S=list(str(input()))
l=len(S)
if l%2 != 0:
print("No")
exit()
for i in range(l):
if i%2 == 0 and S[i]!="h":
print("No")
exit()
if i%2 != 0 and S[i]!="i":
print("No")
exit()
print("Yes")
|
p02935 | s520684640 | Accepted | # 問題：https://atcoder.jp/contests/abc138/tasks/abc138_c
n = int(input())
v = list(map(int, input().strip().split()))
v.sort(reverse=True)
res = 0
for i in range(n-1):
res += v[i] / (2**(i+1))
res += v[-1] / (2**(n-1))
print(res)
|
p02753 | s703009330 | Wrong Answer | def solve(s):
if s == 'AAA' or s == 'BBB':
print("No")
else:
return("Yes")
s = raw_input()
solve(s)
|
p03994 | s525111613 | Accepted | # https://atcoder.jp/contests/code-festival-2016-quala/tasks/codefestival_2016_qualA_c
s = input()
k = int(input())
n = len(s)
ans = []
for i in range(n):
t = (ord('z') - ord(s[i]) + 1) % 26
if k - t >= 0:
ans.append('a')
k -= t
else:
ans.append(s[i])
if k > 0:
k %= 26
ans[-1] = chr(ord(ans[-1]) + k)
print(''.join(ans)) |
p02639 | s057614038 | Accepted | x = list(map(int,input().split()))
x.reverse()
a = x.index(0)
if a == 4:
print(x[a-1]-1)
else:
print(x[a+1]+1)
|
p02622 | s752995203 | Wrong Answer | s = str(input())
t = str(input())
revise = 0
len_str = len(s)
for i in range(len_str):
if s[i] != t[i]:
revise += 1 |
p03262 | s187207211 | Accepted | import math
def main():
n, s = map(int, input().split())
xs = sorted(list(map(int, input().split())))
for i in range(n):
xs[i] = abs(xs[i] - s)
for i in range(1, n):
xs[i] = math.gcd(xs[i], xs[i-1])
print(xs[n-1])
if __name__ == "__main__":
main()
|
p02899 | s152525257 | Accepted | def main():
import sys
n=int(input())
AA=tuple(map(int,sys.stdin.readline().split()))
b=[None]*n
I=1
for index in AA:
b[index-1]=I
I+=1
print(" ".join(map(str,b)))
if __name__=="__main__":
main() |
p03219 | s918861260 | Accepted | X,Y=map(int,input().split())
a=Y/2
print(int(X+a)) |
p02817 | s639294250 | Wrong Answer | # -*- coding: utf-8 -*-
# スペース区切りの整数の入力
S, T = input().split()
U = S+T
print(U)
|
p02621 | s298340141 | Accepted | a = int(input())
print(a + a ** 2 + a ** 3) |
p03624 | s046401163 | Accepted | S = list(input())
alpha = 'abcdefghijklmnopqrstuvwxyz'
for a in alpha:
if S.count(a) == 0:
print(a)
break
else:
print("None") |
p02814 | s417024562 | Wrong Answer | N, M = map(int, input().split())
A = list(map(int, input().split()))
from fractions import gcd
def Lcm(x):
L = 1
for a in x:
a=a//2
L = (a // gcd(a, L))*L
return L
X=Lcm(A)
fg = 0
for i in A:
if (X//i)%2==0:
fg=1
break
if fg==1:
print(0)
else:
print(((M//X)+1)//2) |
p03386 | s996784659 | Accepted | a, b, k = map(int, input().split())
if b-a <= k:
for i in range(a, b+1):
print(i)
else:
ans = []
for i in range(a, a+k):
if i not in ans:
ans.append(i)
print(i)
for j in range(b-k+1, b+1):
if j not in ans:
print(j)
|
p02630 | s257540441 | Wrong Answer | N = int(input()) #ここで標準入力
A = list(map(int, input().split()))
Q= int(input()) #ここで標準入力
list = []
for i in range(Q):
a,b=input().split()
list.append((int(a), int(b)))
for k in range(Q):
for j in range(N):
if list[k][0] == A[j]:
A.remove(list[k][0])
A.append(list[k][1])
print(sum(A))
|
p03795 | s410097274 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def main():
n = int(input())
x = 800 * n
y = 200 * n // 15
print(x - y)
if __name__ == "__main__":
main()
|
p02958 | s275612498 | Accepted | n = int(input())
a = list(map(int, input().split()))
pre = 0
onef = False
twef = False
badf = False
for i,num in enumerate(a):
if i+1 != num:
if not onef:
onef = True
badf = True
elif not twef:
twef = True
badf = False
else:
badf = True
if not badf:
print('YES')
else:
print('NO') |
p03380 | s788816273 | Accepted |
n=int(input())
A=sorted(list(map(int, input().split())))
amax=max(A)
half=amax/2
ans=0
now=amax
for a in A:
if abs(a-half)<=now and a<amax:
now=abs(a-half)
ans=a
print(amax, ans) |
p02615 | s695340037 | Accepted | num=int(input().rstrip())
m=input().rstrip().split()
main=[]
for i in m:
main.append(int(i))
sample=sorted(main,reverse=True)
result=0
for i in range(2,num+1):
if i%2==0:
y=i/2-1
result+=sample[int(y)]
else:
y=(i+1)/2-1
result+=sample[int(y)]
print(result)
|
p03485 | s645301397 | Wrong Answer | a,b=map(int,input().split(" "))
print(round((a + b) / 2)) |
p02694 | s388816379 | Accepted | X = int(input())
x = 100
i = 0
while True:
if x >= X:
print(i)
break
i += 1
x = int(x*1.01) |
p03126 | s129636180 | Accepted | N,M = map(int,input().split())
A = []
for i in range(N):
K, *B = map(int, input().split())
A += B
ans = 0
#print(A)
for i in set(A):
if A.count(i) == N:
ans += 1
print(ans)
|
p03556 | s525001980 | Accepted | import math
N=int(input())
print(int(pow(int(math.sqrt(N)),2))) |
p03000 | s899297457 | Accepted | n, x = list(map(int, input().split()))
l = list(map(int, input().split()))
c, p = 0, 0
while c < n:
if p + l[c] <= x:
p += l[c]
c += 1
else:
break
print(c + 1)
|
p03785 | s232061740 | Accepted | import sys
input = sys.stdin.readline
N, C, K = [int(x) for x in input().split()]
T = [int(input()) for _ in range(N)]
T.sort()
depart = T[0] + K # 出発時刻
passenger = 0 # 乗客数
bus = 1
for i in range(N):
if passenger >= C or depart < T[i]: # すでに満員または待ち時間オーバー
bus += 1
passenger = 1
depart = T[i] + K
else:
passenger += 1
print(bus) |
p02727 | s394709043 | Wrong Answer | import copy
x, y, a, b, c = map(int, input().split())
#s= list(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort()
q.sort()
r.sort()
por = p[a-x:a]
qor = q[b-y:b]
qp = por.copy()
qp.extend(qor.copy())
qp.sort()
i=0
while(i < x+y and i < c and r[c-i-1] > qp[i]):
qp[i] = r[c-i-1]
ans = sum(qp)
print(ans) |
p02866 | s282503643 | Wrong Answer | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
AC = list(Counter(A).items())
AC.sort()
MOD = 998244353
ans = 1
last_v = 1
last_k = -1
for k, v in AC:
if k == 0:
if v > 1:
print(0)
exit()
last_k = 0
continue
if k != last_k+1:
print(0)
exit()
ans = ans*pow(last_v, v, MOD)%MOD
last_v = v
last_k = k
print(ans) |
p02780 | s558169720 | Accepted | import sys
readline = sys.stdin.readline
N, K = map(int, readline().split())
P = list(map(int, readline().split()))
AP = P[:]
for i in range(1, N):
AP[i] += AP[i-1]
AP = [0] + AP
ans = 0
for st in range(N-K+1):
en = st+K
ans = max(ans, AP[en] - AP[st])
print((ans+K)/2) |
p02696 | s372157071 | Accepted | import math
A, B, N = map(int, input().split())
if B <= N:
x = B - 1
else:
x = N
print(math.floor(A * x / B)) |
p02912 | s464031951 | Wrong Answer | import heapq
n,m = map(int,input().split())
a = list(map(int,input().split()))
while m > 0 :
m -= 1
heapq.heapify(a)
heapq.heappush(a, heapq.heappop(a) // 2)
print(sum(a))
|
p02552 | s516929457 | Accepted | #s = input()
n = int(input())
if n == 1:
print(0)
else:
print(1) |
p04031 | s259238861 | Accepted | def cost(x):
cost = (x - ave)**2
return cost
n = input()
a = list(map(int, input().split()))
ave = round(sum(a)/int(n))
print(sum(list(map(cost, a)))) |
p03803 | s639143268 | Accepted | a,b = map(int,input().split())
if a == b:
print("Draw")
elif a == 1:
print("Alice")
elif b == 1:
print("Bob")
elif a > b:
print("Alice")
else:
print("Bob") |
p02584 | s241184307 | Accepted | x, k, d = map(int, input().split())
x = abs(x)
n = x // d
if k <= n:
print(x - k * d)
quit()
k -= n
x %= d
print(x if k % 2 == 0 else d - x)
|
p03478 | s878978007 | Accepted | N_,A_,B_=input().split()
N = (int)(N_)
A = (int)(A_)
B = (int)(B_)
sum = 0
for n in range(1,N+1):
count = 0
n_ = (str)(n)
n_num = len(n_)
for i in range(n_num):
count = count + (int)(n_[i])
if A<=count and B>=count:
sum = sum + n
print(sum)
|
p02727 | s652432099 | Wrong Answer | from collections import deque
X,Y,A,B,C = map(int, input().split())
A=[int(a) for a in input().split()]
B=[int(b) for b in input().split()]
C=[int(c) for c in input().split()]
A=sorted(A, reverse=True)[:X]
B=sorted(B, reverse=True)[:Y]
AB=deque(sorted(A+B))
for c in C:
if c > AB[0]:
AB.popleft()
AB.append(c)
break
print(sum(AB)) |
p03803 | s005338074 | Accepted | a, b = map(int, input().split())
st_l = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1]
if st_l.index(a) > st_l.index(b):
print('Alice')
elif st_l.index(a) < st_l.index(b):
print('Bob')
else:
print('Draw') |
p02761 | s462327770 | Accepted | import sys
n,m = map(int, input().split())
SCs = [list(map(int, input().split())) for _ in range(m)]
for i in range(10**n):
X=str(i)
tf=True
if len(X)==n:
for j in SCs:
if X[j[0]-1]!=str(j[1]):
tf=False
break
if tf:#全ループ終わって条件を満たしていれば
print(i)
sys.exit()
print(-1) |
p02873 | s851944285 | Accepted | S=input()
L=[0]*(len(S)+1)
#print(L)
for i in range(len(S)):
if S[i]=='<':
L[i+1]=L[i]+1
for i in range(len(S)-1,-1,-1):
if S[i]=='>':
L[i]=max(L[i],L[i+1]+1)
print(sum(L))
|
p03328 | s142642318 | Wrong Answer | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import collections
a,b = map(int,input().split())
li = []
for i in range(1,1000):
li.append((1/2)*i*(i+1))
for i in range(len(li)):
if li[i]>a and li[i]<=b:
check = i
break
print(int(li[check]-a))
|
p03067 | s414306306 | Accepted | A, B, C = map(int, input().split())
if A < C < B or B < C < A:
print('Yes')
else:
print('No') |
p03448 | s319222913 | Accepted | # -*- coding: utf-8 -*-
a=int(input()) #500
b=int(input()) #100
c=int(input()) #50
x=int(input()) #sum
cnt=0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
tmp=500*i+100*j+50*k
if tmp==x:
cnt+=1
elif tmp>x:
break
print(cnt)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.