problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02687
|
s392462809
|
Accepted
|
s=input()
if s=="ABC":
print("ARC")
else:
print("ABC")
|
p04012
|
s923679911
|
Accepted
|
w = input()
import collections as c
counts = c.Counter(w)
if all(elem % 2 == 0 for elem in counts.values()):
print('Yes')
else:
print('No')
|
p02935
|
s038870874
|
Accepted
|
n = int(input())
v = list(map(int,input().split()))
v.sort()
value = v[0]
for i in range(1,n):
value = (value+v[i])/2
print(value)
|
p02731
|
s410984602
|
Wrong Answer
|
L = int(input())
print(L/3**3)
|
p03799
|
s987070966
|
Accepted
|
N,M=map(int,input().split())
print((min(2*N,M)+M)//4)
|
p02723
|
s222940987
|
Accepted
|
s = input()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
|
p03163
|
s865136066
|
Wrong Answer
|
def solve(ls, n, w):
dp = [0] * (w + 1)
for i in range(1, w + 1):
for j in range(n):
if i - ls[j][0] >= 0:
dp[i] = max(dp[w - ls[j][0]] + ls[j][1], dp[i])
else:
dp[i] = dp[i - 1]
return dp[w]
n, w = map(int, input().split())
ls = []
for i in range(n):
ls.append(list(map(int, input().split())))
print(solve(ls, n, w))
|
p02787
|
s533467243
|
Wrong Answer
|
h,n=map(int,input().split())
a_=0
magic=[]
for i in range(n):
a,b=map(int,input().split())
a_=max(a,a_)
c=[a,b]
magic.append(c)
dp=[10**7+1]*(h+a_+1)
dp[0]=0
for i in range(n):
a,b=magic[i]
for j in range(len(dp)):
u=1
while j+u*a<=h+a_:
dp[j+u*a]=min(dp[j+u*a],dp[j]+u*b)
u+=1
print(min(dp[h:]))
|
p02983
|
s498476129
|
Accepted
|
L, R = map(int, input().split())
A = []
Lm = L % 2019
Rm = R % 2019
for _ in range(min(R - L + 1, 2019 * 2)):
A.append(Lm)
Lm = (Lm + 1) % 2019
A.sort()
ans = 2018
for i in range(len(A)):
for j in range(i + 1, len(A)):
ans = min(ans, (A[i] * A[j]) % 2019)
if ans == 0:
break
print(ans)
|
p02630
|
s862872739
|
Accepted
|
from collections import Counter
def resolve():
n = int(input())
a = list(map(int, input().split()))
acc = sum(a)
counter = Counter(a)
q = int(input())
for _ in range(q):
b, c = map(int, input().split())
if b in counter:
if c not in counter:
counter[c] = 0
acc += counter[b] * c - counter[b] * b
counter[c] += counter[b]
counter[b] = 0
print(acc)
if __name__ == "__main__":
resolve()
|
p03352
|
s561619472
|
Wrong Answer
|
n=int(input())
ans = 1
i = 2
while i**2 <= n:
u = 2
while i**u <= n:
ans = i**u
u += 1
i += 1
print(ans)
|
p03359
|
s227920169
|
Accepted
|
a,b = map(int,input().split())
ans = a-1
if a<=b:
ans += 1
print(ans)
|
p02677
|
s295377710
|
Wrong Answer
|
import math
(A, B, H, M) = list(map(int, input().split()))
print(math.sqrt(A * A + B * B - 2 * A * B * math.cos(abs(30 * H - 6 * M) * math.pi * 2 / 360)))
|
p02759
|
s751892454
|
Accepted
|
N=int(input())
N = N+ (N%2)
N/=2
N=int(N)
print(N)
|
p03437
|
s436851560
|
Wrong Answer
|
import collections
import math
def main():
x, y = map(int, input().split())
if y % x == 0:
print(-1)
return
print(x)
if __name__ == '__main__':
main()
|
p02631
|
s531450099
|
Accepted
|
n = int(input())
lst = list(map(int, input().split()))
all = 0
for i in range(n):
all ^= lst[i]
for i in range(n-1):
print(all ^ lst[i], end=' ')
print(all ^ lst[n-1])
|
p04044
|
s589900558
|
Accepted
|
n, l = map(int, input().split())
S = [str(input()) for _ in range(n)]
S.sort()
print(''.join(S))
|
p03673
|
s317414965
|
Accepted
|
from collections import deque
def main():
n=int(input())
x=deque()
r=False
for i in map(int,input().split()):
if r:
x.appendleft(i)
else:
x.append(i)
r = not r
if r:
x.reverse()
print(*x)
if __name__ == "__main__":
main()
|
p03472
|
s708893794
|
Accepted
|
import math
n, h = map(int, input().split())
a = []
b = []
ans = 0
for i in range(n):
x, y=map(int, input().split())
a.append(x)
b.append(y)
b.sort(reverse=True)
a.sort(reverse = True)
for i in range(n):
if b[i] >= a[0]:
h -= b[i]
ans += 1
if h <= 0:
break
if h > 0:
ans += math.ceil(h / a[0])
print(ans)
|
p03433
|
s118658284
|
Accepted
|
N = int(input())
A = int(input())
cnt = N//500
if(N-cnt*500<=A):
print("Yes")
else:
print("No")
|
p03087
|
s401054104
|
Wrong Answer
|
N,Q=map(int,input().split())
S=input()
L=[]
R=[]
for i in range(Q):
l,r=map(int,input().split())
L.append(l)
R.append(r)
for j in range(Q):
print(S.count("AC",L[j],R[j]+1))
|
p02691
|
s528835537
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
#Ai+i = j-Aj(j > i)
dic = {}
for i in range(N):
if dic.get(A[i]+i) == None:
dic[A[i]+i] = 1
else:
dic[A[i]+i] += 1
ans = 0
for j in range(N):
if dic.get(j-A[j]) != None:
ans += dic.get(j-A[j])
print(ans)
|
p02719
|
s197375175
|
Accepted
|
n,k = map(int,input().split())
n = n % k
if n > k/2 :
print(k-n)
else:
print(n)
|
p02645
|
s813446802
|
Accepted
|
import sys
sys.setrecursionlimit(300000)
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')
S = input()
print(S[:3])
|
p03862
|
s999925598
|
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]=x
for i in range(n-1):
if a[i]+a[i+1]>=x:
ans+=a[i]+a[i+1]-x
a[i+1]=x-a[i]
# print(a)
print(ans)
|
p02665
|
s304192259
|
Accepted
|
import sys
import math
from collections import deque
import heapq
import itertools
MAX_INT = int(10e25)
MIN_INT = -MAX_INT
mod = 998244353
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
N = I()
a = IL()
num = sum(a)
ans = 0
ko = 1
for i in range(N):
ans += ko
ko -= a[i]
num -= a[i]
ko = min(ko*2, num)
if ko <= 0:
print(-1)
break
else:
ans += ko
ko -= a[-1]
if ko < 0:
print(-1)
else:
print(ans)
|
p02552
|
s621378050
|
Wrong Answer
|
a = list(map(int, input().split()))
tmp = 0
if(len(a) != 4):
exit()
if(a[0] > a[1]):
tmp = a[1]
a[1] = a[0]
a[0] = tmp
if(a[2] > a[3]):
tmp = a[3]
a[3] = a[2]
a[2] = tmp
a_len = list(range((a[0]), a[1] + 1))
b_len = list(range((a[2]), a[3] + 1))
max = -100000
print(a_len, b_len)
for str1 in a_len:
for str2 in b_len:
if(str1 * str2 > max):
max = str1 * str2
print(max)
|
p03241
|
s681082887
|
Wrong Answer
|
N, M = map(int, input().split())
d = 1
ds = []
while d ** 2 <= M:
if M % d == 0:
ds.append(d)
d += 1
ds.sort(reverse=True)
for d in ds:
if N <= M // d:
print(d)
break
|
p02947
|
s373484780
|
Accepted
|
N=int(input())
s=[list(input()) for _ in range(N)]
b=0
cnt=0
for i in range(N):
s[i].sort()
s.sort()
for i in range(N-1):
if s[i]==s[i+1]:
b=b+1
if not(s[i]==s[i+1])and(s[i]!=0):
cnt=cnt+(b*(b+1))//2
b=0
#print(b)
cnt=cnt+(b*(b+1))//2
print(cnt)
|
p03435
|
s147990121
|
Accepted
|
c = []
for _ in range(3):
c.append([int(x) for x in input().split()])
a = [0]
b = [c[0][i] for i in range(3)]
for j in range(1, 3):
a.append(c[j][j] - b[j])
ans = 'Yes'
for k in range(3):
for m in range(3):
if c[k][m] != a[k] + b[m]:
ans = 'No'
break
print(ans)
|
p03331
|
s182709313
|
Wrong Answer
|
N = int(input())
def digit_sum(a, b):
ab_sum = 0
for i in range(1, len(str(a))+1):
ab_sum += a % (10*i)
a = a // (10*i)
for i in range(1, len(str(b))+1):
ab_sum += b % (10*i)
b = b // (10*i)
return ab_sum
max_sum = float("inf")
for i in range(1, N//2+1):
a = i
b = N - i
if digit_sum(a, b) < max_sum:
max_sum = digit_sum(a, b)
print(max_sum)
|
p02696
|
s696472212
|
Accepted
|
A, B, N = map(int,input().split())
def floor(x):
return (A * x // B) - A * (x // B)
print(floor(min(B - 1, N)))
|
p02556
|
s529306768
|
Accepted
|
n = int(input())
l, l2 = [], []
for i in range(n):
x, y = map(int, input().split())
l.append(x + y)
l2.append(x - y)
print(max(max(l) - min(l), max(l2) - min(l2)))
|
p03852
|
s950736546
|
Accepted
|
s=input()
if s == "a" or s == "i" or s == "u" or s =="e" or s == "o":
print("vowel")
else:
print("consonant")
|
p02676
|
s874810284
|
Accepted
|
K = int(input())
S = input()
if len(S)<=K:
print(S)
else:
print(S[0:K] + "...")
|
p03998
|
s432476555
|
Accepted
|
a=list(input())
b=list(input())
c=list(input())
next=a.pop(0)
while True:
if next=="a":
if not a:
print("A")
break
else:
next=a.pop(0)
elif next=="b":
if not b:
print("B")
break
else:
next=b.pop(0)
else :
if not c:
print("C")
break
else:
next=c.pop(0)
|
p03000
|
s582926678
|
Wrong Answer
|
import bisect
N, X = map(int, input().split())
L = list(map(int, input().split()))
for i in range(N-1):
L[i+1] += L[i]
print(bisect.bisect_right(L, X))
|
p03360
|
s154314697
|
Accepted
|
def solve():
A, B, C = map(int, input().split())
K = int(input())
ans = A+B+C+max([A,B,C])*(pow(2,K)-1)
return ans
print(solve())
|
p03001
|
s051312034
|
Accepted
|
W, H, x, y = map(int, input().split())
if (W / 2 == x) and (H / 2 == y):
print(W * H / 2, 1)
else:
print(W * H / 2, 0)
|
p03785
|
s868548889
|
Wrong Answer
|
n, c, k = map(int, input().split())
t = []
for i in range(n):
t.append(int(input()))
t.sort()
ans = 0
counter = 0
lim = t[0]
for i in range(n):
if counter < c and (t[i] - lim) < k:
counter += 1
else:
bus = []
counter = 0
lim = t[i]
ans += 1
print(ans + 1)
|
p02912
|
s451875624
|
Wrong Answer
|
N, M = [int(i) for i in input().split(' ')]
A = [int(i) for i in input().split(' ')]
print("N:", N, "M:", M)
print("A:", A)
for i in range(M):
max_value = max(A)
A[A.index(max_value)] = max_value // 2
print(sum(A))
|
p03387
|
s422789048
|
Wrong Answer
|
A,B,C = map(int,input().split())
if (A+B+C)%2 == 0:
candidates = [i for i in range(0,151,6)]
else:
candidates = [i for i in range(3,151,6)]
for i in candidates:
x = i/3
if A<= x and B<= x and C<=x and ((x-A)+(x-B)+(x-C))%2==0:
print(int((i-(A+B+C))/2))
break
|
p03377
|
s776378224
|
Accepted
|
a,b,x = map(int, input().split())
if a > x:
print('NO')
elif a+b < x:
print('NO')
else:
print('YES')
|
p02730
|
s182962344
|
Wrong Answer
|
inp = input()
part1 = inp[0:int((len(inp)-1)/2)]
part2 = inp[int((len(inp)+1)/2):]
def isParin(S):
n = len(S)
flg = 0
for i in range(int(n/2)):
if S[i] != S[n-1-i]:
flg += 1
if flg == 0:
return True
else:
return False
if isParin(inp):
if isParin(part1) and isParin(part2):
print('Yes')
else:
print('No')
|
p03126
|
s343465859
|
Accepted
|
n,m = map(int,input().split())
menu = [i for i in range(1,m+1)]
cnt = [0]*m
a = []
for i in range(n):
ka = list(map(int,input().split()))
ka.pop(0)
a.append(ka)
for i in menu:
for j in a:
if i in j:
cnt[i-1] += 1
print(cnt.count(n))
|
p03478
|
s583821112
|
Accepted
|
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
N, A, B = map(int, input().split())
# 文字列の入力
#s = input()
#print(s[0:K-1]+s[K-1].lower()+s[K:N])
i=1
ans=0
while(i<=N):
s=str(i)
array=list(map(int,s))
#print(sum(array))
SUM=sum(array)
if A<=SUM and SUM<=B:
#print(i)
ans=ans+i
i=i+1
print(ans)
|
p02817
|
s578966919
|
Wrong Answer
|
a,b=input().split()
for i in a,b:
print(i,end="")
|
p02688
|
s175064346
|
Accepted
|
n,k = map(int,input().split())
t = [0] * n
for _ in range(k):
d = int(input())
a = list(map(int,input().split()))
for e in a:
t[e-1] += 1
ans = 0
l = [i for i in t if i == 0]
# print(l)
print(len(l))
|
p02712
|
s414548948
|
Accepted
|
n = int(input())
count = 0
for i in range(1, n+1):
if i % 3 != 0 and i % 5 != 0:
count += i
print(count)
|
p02717
|
s615982375
|
Accepted
|
x,y,z=map(int,input().split())
print(z,x,y)
|
p03565
|
s530089755
|
Accepted
|
S = list(input())
T = list(input())
def compare(s, t):
if len(s) != len(t): return False
res = True
for i in range(len(s)):
res &= (s[i] == t[i] or s[i] == '?')
return res
n = len(S)
m = len(T)
pos = -1
for i in range(n):
if compare(S[i:i+m], T):
pos = i
if pos == -1:
print('UNRESTORABLE')
else:
S[pos:pos+m] = T
S = ''.join(S)
S = S.replace('?', 'a')
print(S)
|
p02756
|
s658176805
|
Wrong Answer
|
from collections import deque
S=deque(input())
q=int(input())
for i in range(q):
c=list(input().split())
print(c)
if c[0]=='1':
S.reverse()
elif c[0]=='2':
if c[1]=='1':
S.appendleft(c[2])
elif c[1]=='2':
S.append(c[2])
ans=''.join(S)
print(ans)
|
p02552
|
s919040168
|
Accepted
|
x=int(input())
if x==1:
print(0)
elif x==0:
print(1)
|
p03723
|
s668691781
|
Accepted
|
A,B,C = map(int,input().split())
cnt=0
if A==B==C:
if A%2==0:
cnt=-1
else:
cnt=0
else:
while A%2==0 and B%2==0 and C%2==0:
s=A//2
t=B//2
u=C//2
A=t+u
B=u+s
C=s+t
cnt +=1
print(cnt)
|
p02691
|
s676850666
|
Wrong Answer
|
from collections import defaultdict
N = int(input())
A = list(map(int, input().split()))
memo = defaultdict(int)
ans = 0
for i, h in enumerate(A, start=1):
ans += memo[h+i]
memo[i-h] += 1
print(ans)
|
p02983
|
s906447092
|
Accepted
|
L, R = map(int, input().split())
target = R+1
if R - L > 2018:
target = L + 2018
mi = 2019
for i in range(L,target):
for j in range(i+1,target):
mi = min(mi,(i*j)%2019)
print(mi)
|
p02621
|
s040205056
|
Accepted
|
a = int(input())
print(a*(a**2 + a +1))
|
p03836
|
s477448274
|
Accepted
|
sx,sy,tx,ty=map(int,input().split())
iki=["U" for i in range(ty-sy)]+["R" for i in range(tx-sx)]
kaeri=["D" for i in range(ty-sy)]+["L" for i in range(tx-sx)]
iki2=["L"]+["U" for i in range(ty-sy+1)]+["R" for i in range(tx-sx+1)]+["D"]
kaeri2=["R"]+["D" for i in range(ty-sy+1)]+["L" for i in range(tx-sx+1)]+["U"]
ans=iki+kaeri+iki2+kaeri2
print(*ans,sep="")
|
p03331
|
s805843564
|
Accepted
|
N = int(input())
def SumDigits(num):
sum = 0
while True:
sum += num % 10
num //= 10
if num == 0:
break
return sum
infinity = float('inf')
min = infinity
for x in range(1, N):
if SumDigits(x) + SumDigits(N - x) < min:
min = SumDigits(x) + SumDigits(N - x)
print(min)
|
p04030
|
s495516648
|
Accepted
|
t=""
for x in input():
if x=="B":
t=t[:-1]
else:t+=x
print(t)
|
p02772
|
s121871500
|
Wrong Answer
|
N=int(input())
A=list(map(int, input().split()))
for i in range(N):
if A[i]%2==0:
if A[i]%3==0 or A[i]%5==0:
print('APPROVED')
exit()
print('DENIED')
|
p03711
|
s207907184
|
Wrong Answer
|
n1 = [1, 3, 5, 7, 8, 10, 12]
n2 = [4, 6, 9, 11]
n3 = [2]
nums = [map(int, input().split())]
print("Yes" if nums in n1 or nums in n2 or nums in n3 else "No")
|
p03759
|
s795249968
|
Accepted
|
a, b, c = map(int,input().split())
print("YES" if b-a == c-b else "NO")
|
p03250
|
s067469452
|
Accepted
|
a,b,c = map(int,input().split())
anli = sorted([a,b,c])
print(anli[2] * 10 + anli[1] +anli[0])
|
p02612
|
s459642033
|
Wrong Answer
|
# -*- coding: utf-8 -*-
a = int(input())
b = a % 1000
print(b)
|
p02987
|
s505843763
|
Accepted
|
s = list(input())
s = sorted(s)
if s[0] == s[1] and s[2] == s[3] and s[0] != s[2]:
print('Yes')
else:
print('No')
|
p03109
|
s421710823
|
Accepted
|
def readinput():
s=input()
return s
def main(s):
y=int(s[:4])
m=int(s[5:7])
d=int(s[9:])
if m<=4:
return 'Heisei'
else:
return 'TBD'
if __name__=='__main__':
s=readinput()
ans=main(s)
print(ans)
|
p02663
|
s756923997
|
Wrong Answer
|
H = list(map(int,input().split()))
h = H[2]-H[0]
m = H[3]-H[1]
if h < 0:
h = h + 24
if m < 0:
h -= 1
m *= -1
mini = h*60 + m - H[4]
if mini < 0:
mini = 0
print(mini)
|
p03017
|
s278679764
|
Accepted
|
import re
n, a, b, c, d = map(int, input().split())
s = input()
for i in range(a-1, c-1):
if s[i] + s[i+1] == "##":
print("No")
exit()
for i in range(b-1, d-1):
if s[i] + s[i+1] == "##":
print("No")
exit()
if c < d:
print("Yes")
else:
f = False
for i in range(b-2, min(d-1, n-2)):
if s[i] + s[i+1] + s[i+2] == "...":
f = True
if f:
print("Yes")
else:
print("No")
|
p03495
|
s987347536
|
Accepted
|
from collections import Counter
n, k = map(int, input().split())
A = list(map(int, input().split()))
cnt = Counter(A)
alt = sorted(cnt.values(), reverse=True)
print(sum(alt[k:]))
|
p03437
|
s625831885
|
Wrong Answer
|
x,y=map(int,input().split())
if y%x==0:
print(-1)
else:
print(x)
|
p02833
|
s189138846
|
Wrong Answer
|
from sys import stdin
input = stdin.readline
def main():
N = int(input())
nz = 0
i = 1
while True:
if N//(5**i)//2 > 0:
nz += (N//(5**i)//2)
i += 1
else:
break
print(nz)
if(__name__ == '__main__'):
main()
|
p02916
|
s714252969
|
Wrong Answer
|
n=int(input())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
c=[int(i) for i in input().split()]
ans=0
for i in range(n-1):
if a[i]+1==a[i+1]:
ans+=c[i-1]
print(ans+sum(b))
|
p02753
|
s120406777
|
Wrong Answer
|
S=input()
if S[0:1]==S[1:2]==S[2:3]:
print('Yes')
else:
print('No')
|
p03645
|
s423106984
|
Accepted
|
def main ():
n,m = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
g = [[] for _ in range(n+1)]
for a,b in ab:
g[a].append(b)
g[b].append(a)
if set(g[1]) & set(g[n]) != set([]):
print('POSSIBLE')
else:
print('IMPOSSIBLE')
if __name__ == '__main__':
main()
|
p02963
|
s603271255
|
Accepted
|
def resolve():
S = int(input())
x1, y1 = 0, 0
x2, y2 = 1, 10 ** 9
x3 = (S + y2 - 1) // y2
y3 = x3 * y2 - S
print(x1, y1, x2, y2, x3, y3)
if __name__ == "__main__":
resolve()
|
p03681
|
s998887837
|
Accepted
|
N, M = map(int, input().split())
MOD = int(1e9) + 7
def factorial_cor(n):
fact = 1
for integer in range(1, n + 1):
fact = (fact * integer) % MOD
return fact
if abs(N - M) >= 2:
print(0)
else:
if abs(N - M) == 1:
print((factorial_cor(N) * factorial_cor(M))%MOD)
else:
print(((factorial_cor(N) * factorial_cor(M))*2)%MOD)
|
p02754
|
s882437985
|
Accepted
|
N,A,B=list(map(int,input().split()));print(A*(N//(A+B))+min([N%(A+B),A]))
|
p02598
|
s719650052
|
Accepted
|
N,K = map(int, input().split())
A = list(map(int, input().split()))
l,r = 0, max(A)
while r-l>1:
mid = (l+r)//2
cnt = 0
for i in range(N):
if A[i]%mid!=0:
cnt+= A[i]//mid
else:
cnt += A[i]//mid - 1
if cnt <= K:
r = mid
else:
l = mid
print(r)
|
p03073
|
s806026278
|
Accepted
|
s=list(input())
ans=0
for i in range(len(s)-1):
if s[i]==s[i+1]:
if s[i+1]=='0':
s[i+1]='1'
else:
s[i+1]='0'
ans+=1
print(ans)
|
p02823
|
s756670936
|
Wrong Answer
|
N,A,B=map(int,input().split())
ans=0
if (B-A)%2==0:
ans=(B-A)//2
else:
if A-1<N-B:
if B-A==1:
ans=B-1
else:
ans=A+(B-A-1)//2
else:
if B-A==1:
ans=N-A
else:
ans=N-B-1+(A+N-B-1)//2
print(ans)
|
p03910
|
s410136666
|
Accepted
|
N=int(input())
r=int((2*N+.25)**0.5 + 0.5)
l=r*(r+1)//2-N
[print(i) for i in list(range(1,r+1)) if i!=l]
|
p03243
|
s471562046
|
Accepted
|
import math
n=int(input())
print(math.ceil(n/111)*111)
|
p02780
|
s054698734
|
Wrong Answer
|
import numpy as np
N,K=map(int,input().split())
P=list(map(int,input().split()))
Q=[]
def ex(A):
return (1+A)/2.0
for i in range(N):
Q.append(ex(P[i]))
Q=np.array(Q)
R=Q.cumsum()
ans=0
for i in range(K,N):
S=R[i]-R[i-K]
if ans<S:
ans=S
print(ans)
|
p03319
|
s080338525
|
Accepted
|
import math
N,K=map(int,input().split())
A=list(map(int,input().split()))
print(math.ceil((N-K)/(K-1))+1)
|
p03723
|
s292190112
|
Wrong Answer
|
a,b,c = map(int,input().split())
for i in range(600):
if a == b and b == c:
break
a,b,c = a//2, b//2, c//2
a, b, c = b + c, a + c, a + b
ans = i if i < 600 else -1
print(ans)
|
p03069
|
s054046750
|
Accepted
|
#!/usr/bin/env python3
n = int(input())
s = input()
w = s.count(".")
b = 0
ans = w
for i in s:
b += i =="#"
w -= i == "."
ans = min(ans, w+b)
print(ans)
|
p02707
|
s091341959
|
Accepted
|
import collections
n=int(input())
a= list(map(int, input().split()))
c = collections.Counter(a)
for i in range(1,n+1):
if c[i]:
print(c[i])
else:
print(0)
|
p04034
|
s041712648
|
Accepted
|
N,M=map(int,input().split())
op=[list(map(int,input().split())) for _ in range(M)]
susflag=[0]*N
susflag[0]=1
num=[1]*N
fr=0
to=0
#print(susflag,num)
for i in range(M):
fr=op[i][0]-1
to=op[i][1]-1
num[fr]=num[fr]-1
num[to]=num[to]+1
if susflag[fr]==1:
susflag[to]=1
if num[fr]==0:
susflag[fr]=0
#print(susflag,num)
print(sum(susflag))
|
p03778
|
s026374605
|
Accepted
|
w, a, b = map(int, input().split())
if a <= b:
print(max(0, b-a-w))
else:
print(max(0, a-b-w))
|
p02623
|
s034061097
|
Accepted
|
N,M,K = map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a,b = [0],[0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
ans = 0
j = M
for i in range(N+1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans,i+j)
print(ans)
|
p03448
|
s982605994
|
Accepted
|
a = int(input())
b = int(input())
c = int(input())
x = int(input())
ans = 0
for i in range(a+1):
for j in range(b+1):
nc = (x - 500*i - 100*j) // 50
if nc < 0 or c < nc:
continue
ans += 1
print(ans)
|
p02899
|
s363319829
|
Wrong Answer
|
n=int(input())
a=[int(i)for i in input().split()]
res=[str(a[i]) for i in range(n)]
print(" ".join(res))
|
p02729
|
s977817695
|
Accepted
|
n,m=map(int,input().split())
print(int(n*(n-1)/2+m*(m-1)/2))
|
p03352
|
s972102563
|
Accepted
|
x = int(input())
c = 1
for b in range(1, x):
for p in range(2, x):
if b**p <= x:
c = max(c, b**p)
else:
break
print(c)
|
p02814
|
s011929653
|
Wrong Answer
|
from fractions import gcd
N, M = map(int, input().split())
a = list(set(map(int,input().split())))
flag = 0
x = 1
for i in range(len(a)):
a[i] = a[i] / 2
if a[i] % 2 == 0:
flag = 1
print(0)
break
x = (x * a[i]) // gcd(x, a[i])
if flag == 0:
print(int((M // x + 1) // 2))
|
p03617
|
s335663805
|
Accepted
|
q, h, s, d = map(int, input().split())
n = int(input())
cost = 0
q_ef = q*8
h_ef = h*4
s_ef = s*2
if min(q_ef, h_ef, s_ef, d) == d:
cost += d * (n//2)
n %= 2
if min(q_ef, h_ef, s_ef) == q_ef:
cost += q * (n*4)
elif h_ef <= s_ef:
cost += h * (n*2)
else:
cost += s * n
print(cost)
|
p03815
|
s636551112
|
Accepted
|
x = int(input())
a = x // 11
b = x % 11
if b >6:
c = 2
elif b == 0:
c = 0
else:
c = 1
print(2*a+c)
|
p02711
|
s399737160
|
Wrong Answer
|
import sys
input = sys.stdin.readline
n = int(input())
a = n // 100
if a == 7:
print("Yes")
b = (n - a*100) // 10
if b == 7:
print("Yes")
c = (n - a*100 - b*10)
if c == 7:
print("Yes")
else:
print("No")
|
p02684
|
s712982842
|
Accepted
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
visited={}
for i in range(1,n+1):
visited[i]=-1
l=[1]
visited[1]=0
i=1
while True:
if visited[a[l[i-1]-1]]==0:
roop_start=l.index(a[l[i-1]-1])
break
visited[a[l[i-1]-1]]=0
l.append(a[l[i-1]-1])
i+=1
roop_dif=i-roop_start
if k<roop_start:
print(l[k])
else:
k-=roop_start
k%=roop_dif
print(l[roop_start+k])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.