problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03607 | s551101395 | Wrong Answer | import collections
n=int(input())
d={}
for i in range(n):
A=int(input())
if A in d:
d[A]=0
else:
d[A]=1
print(sum(d.values())) |
p02601 | s011386743 | Accepted | a,b,c=map(int,input().split())
k=int(input())
ans=0
while(b<=a):
b=b*2
ans+=1
m=max(a,b)
while(c<=m):
c=c*2
ans += 1
if ans<=k:
print("Yes")
else:
print("No")
|
p03644 | s780452253 | Wrong Answer | count=0
n=int(input())
while n%2==0:
n=n/2
count+=1
print(count) |
p02970 | s983902533 | Accepted | def main():
N, D = (int(x) for x in input().split())
ans = int((N + (2 * D)) / ((2 * D) + 1))
print(ans)
if __name__ == "__main__":
main()
|
p03862 | s198405242 | Accepted | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,x=MI()
a=LI()
ans=0
if a[0]>x:
ans+=a[0]-x
a[0]=x
for i in range(N-1):
b=a[i]+a[... |
p03435 | s767938564 | Accepted | c = []
for _ in range(3):
c.append(list(map(int, input().split())))
for i in range(2):
if c[i][0]-c[i][1]!=c[i+1][0]-c[i+1][1]:
print('No')
break
if c[i][1]-c[i][2]!=c[i+1][1]-c[i+1][2]:
print('No')
break
if c[i][2]-c[i][0]!=c[i+1][2]-c[i+1][0]:
print('No')
... |
p02873 | s776761396 | Wrong Answer | S = input()
nums = [0] * (len(S)+1)
pos = 0
count = 0
pre_count = 0
now = '>'
for (i, s) in enumerate(S):
if s != now:
if s == '<':
nums[pos] = max(pre_count, count)
while pos != i:
pos += 1
count -= 1
nums[pos] = count
else:
pos = i
pre_count = count+1
co... |
p02663 | s413792171 | Wrong Answer | H1, M1, H2, M2, K = map(int, input().split())
hour = H2 - H1
if M1 > M2:
hour -= 1
minute = abs(M2 - M1)
ans = hour * 60 + minute - K
if ans < 0:
ans = 0
print(ans) |
p03720 | s596347842 | Wrong Answer | import numpy as np
N,M = list(map(int,input().split()))
a = list(np.array([input().split() for i in range(M)]).reshape(-1))
a = [int(i) for i in a]
for i in range(1,M+1):
print(a.count(i)) |
p02912 | s151463589 | Accepted | from heapq import heapify, heappop, heappush
N, M = map(int, input().split())
A = [-1*int(i) for i in input().split()]
heapify(A)
for i in range(M):
n = -1 * heappop(A)
heappush(A, -1*(n//2))
print(-1*sum(A)) |
p02792 | s075295191 | Wrong Answer | from sys import stdin
import math
n = int(stdin.readline().rstrip())
if n < 100:
poi = 0
for i in range(1,n+1):
for j in range(1,n+1):
if str(i)[0] == str(j)[-1] and str(i)[-1] == str(j)[0]:
poi += 1
print(poi)
else:
print((n//10)**2+8) |
p02767 | s867289154 | Wrong Answer | # C
N = int(input())
A = list(map(int,input().split()))
mi = min(A)
ma = max(A)
ans = 10 ** 12
for i in range(mi,ma):
su = 0
for j in A:
su += (i-j)**2
ans = min(ans,su)
print(ans) |
p02838 | s422741165 | Wrong Answer | import numpy as np
mod = 10**9+7
n = int(input())
a = np.array(list(map(int,input().split())))
result = 0
for i in range(60):
count_one = sum(a&1)
result += count_one*(n-count_one)*(2**i)%mod
a = a >> 1
print(result%mod) |
p02697 | s637721538 | Accepted | n,m=map(int,input().split())
if n%2==1:
for i in range(m):
print(i+1,n-i)
else:
for i in range(m):
if i<m/2:
print(i+1,n-i)
else:
print(i+1,n-i-1) |
p03637 | s137644052 | Wrong Answer | from numpy import log
def f(k):
c=0
while k % 2 == 0:
k //= 2
c+=1
if c==2:
break
return c
def g(k):
return f(int(k))
n=int(input())
a=list(map(g,input().split()))
a.sort()
ct0=a.count(0)
ct1=a.count(1)
ct2=a.count(2)
if ct0 > ct2 and ct1 != 0:
print("No")
else:
print("Yes") |
p02697 | s977877900 | Accepted | n,m=map(int,input().split());[print(i+1,n-i-((i>=m/2)&~n)) for i in range(m)] |
p02789 | s504765036 | Wrong Answer | lst = input().split(' ')
m = lst[0]
n = lst[1]
if n==m:
print('AC')
else:
print('WA') |
p02697 | s884457388 | Accepted | N ,M = map(int,input().split())
array = []
if N % 2 == 1:
for i in range(1,(N-1)//2 + 1):
array.append([i,N-i])
for i in range(M):
print(*array[i])
else:
for i in range(1,N//2):
if i <= N//4:
array.append([i,N+1-i])
else:
array.append([i,N-i])
for ... |
p03419 | s620969398 | Accepted | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
answer = abs((N-2) * (M-2))
print(answer)
|
p02918 | s735962475 | Accepted | n,k,s=open(0).read().split()
n,k=int(n),int(k)
d=0
for i in range(1,n):
if not s[i]==s[i-1]:
d+=1
print(n-1-max(d-2*k,0)) |
p02552 | s593571402 | Accepted | print(1^int(input())) |
p02983 | s440311772 | Accepted | import sys
input = sys.stdin.readline
l, r = map(int, input().split())
if r - l > 2019:
ans = 0
else:
ans = float('inf')
for i in range(l, r + 1):
for j in range(i + 1, r + 1):
ans = min(ans, (i * j) % 2019)
print(ans)
|
p02699 | s983360079 | Wrong Answer | S, W = map(int, input().split())
if S <= 2 * W:
print("unsafe")
else:
print("safe") |
p02946 | s149122413 | Accepted | K,X=map(int,input().split())
print(*range(X-K+1,X+K)) |
p02880 | s775056011 | Accepted | N = int(input())
l =[]
for i in range(1,10):
for j in range(1,10):
l.append(i*j)
if N in l:
print('Yes')
else:
print('No') |
p03377 | s479367768 | Wrong Answer | a, b, x = map(int, input().split())
if a+b >= x:
print("YES")
else:
print("NO") |
p02598 | s609990024 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
def f(x):
global a,n,k
if x==0:
return 10**10
ret=0
for i in range(n):
#print(-((-a[i])//x))
ret+=(-((-a[i])//x)-1)
return ret
l,r=0,10**10
while l+1<r:
x=l+(r-l)//2
if f(x)<=k:
r=x
else:
... |
p03997 | s104615207 | Wrong Answer | a=int(input())
b=int(input())
h=int(input())
print(((a+b)*h)/2) |
p02972 | s940267035 | Accepted | # -*- coding: utf-8 -*-
n = int(input())
a = [int(i) for i in input().split()]
count = [0 for _ in range(n)]
for i in reversed(range(1, n + 1)):
tmp = 0
for j in range(i, n+1, i):
tmp += count[j-1]
#print(tmp)
if a[i-1] % 2 != tmp % 2:
count[i-1] += 1
#print(count)
m = sum(count)
ans = ... |
p03035 | s644358604 | Wrong Answer | a,b=map(int,input().split())
if a>=13:
print(b)
elif 6<=a<=12:
print(b/2)
else:
print(0) |
p02748 | s668468407 | Accepted | import sys
input = sys.stdin.readline
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = min(a)+min(b)
for _ in range(M):
x, y, c = map(int, input().split())
ans = min(ans, a[x-1]+b[y-1]-c)
print(ans) |
p02677 | s569855784 | Accepted | import math
a,b,h,m = map(int,input().split())
h_hand = (m+(h*60))*0.5
m_hand = m*6
degree = abs(h_hand - m_hand)
cos_x = math.cos(math.radians(degree))
sq = a**2 + b**2 -2*a*b*cos_x
print(math.sqrt(sq)) |
p02817 | s828549807 | Accepted | s, t = input().split()
print(t + s) |
p03067 | s389482968 | Accepted | a, b, c = map(int, input().split())
print('Yes' if (a>c and b<c) or (a<c and b>c) else 'No' ) |
p02771 | s531158442 | Accepted | lis = list(map(int, input().split(" ")))
tmp_dic = {}
for n in lis:
if n not in tmp_dic:
tmp_dic[n] = 1
else:
tmp_dic[n] += 1
if len(tmp_dic) == 2:
print("Yes")
else:
print("No") |
p02811 | s143679753 | Accepted |
k, x =list(map(int, input().split()))
if 500*k >= x:
print("Yes")
else:
print("No")
|
p02600 | s195179425 | Wrong Answer | ans = int(input())
if 400 <= ans < 599:
ans = 8
elif 600 <= ans <= 799:
ans = 7
elif 800 <= ans <= 999:
ans = 6
elif 1000 <= ans <= 1199:
ans = 5
elif 1200 <= ans <= 1399:
ans = 4
elif 1400 <= ans <= 1599:
ans = 3
elif 1600 <= ans <= 1799:
ans = 2
elif 1800 <= ans <= 1999:
ans = 1
|
p03284 | s224426162 | Accepted | N, K = map(int, input().split())
print(1 if N % K != 0 else 0)
|
p03557 | s135740046 | Accepted | # https://atcoder.jp/contests/abc077/tasks/arc084_a
from bisect import bisect_left, bisect_right
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
# print(A)
# print(B)
# print(C)
total = 0
for b in B:
c1 = bise... |
p02600 | s950438084 | Accepted | X = int(input())
rank = 1
base = 1800
for i in range(100):
if X >= base:
print(rank)
break
else:
base -= 200
rank += 1
|
p03998 | s246616755 | Accepted | S = {}
S['a'] = input()
S['b'] = input()
S['c'] = input()
next = 'a'
lens = {'a':len(S['a']), 'b':len(S['b']), 'c':len(S['c'])}
counts = {'a':0, 'b':0, 'c':0}
while True:
now = next
counts[now]
if counts[now] == lens[now]:
print(now.upper())
exit()
next = S[now][counts[now]]
counts[now] += 1
|
p03761 | s444821966 | Accepted | from collections import Counter
N = int(input())
s = Counter(input())
for i in range(N-1):
s &= Counter(input())
print(''.join(sorted(s.elements())))
|
p02911 | s431326325 | Wrong Answer |
N,K,Q = map(int,input().split(" "))
ans = [K - Q for i in range(N)]
for i in range(Q-1):
A = int(input())
ans[A-1] = ans[A-1] + 1
for a in ans:
if a > 0:
print("Yes")
else:
print("No") |
p02642 | s257108056 | Accepted | from collections import Counter
import numpy as np
n = int(input())
a = list(map(int, input().split()))
MAX = 10 ** 6
c = Counter(a)
arr = np.zeros(MAX + 1, np.int64)
st = set()
for k, v in c.items():
if v != 1:
st.add(k)
arr[k] = 1
for i in range(MAX + 1):
if arr[i]:
arr[i*2::i] = 0
... |
p03475 | s530309172 | Accepted | def main():
N = int(input())
S = []
for _ in range(N-1):
c,s,f = map(int,input().split())
S.append([c,s,f])
for i in range(N-1):
t = S[i][1] + S[i][0]
for j in range(i+1,N-1):
t = max(S[j][1],-(-t//S[j][2])*S[j][2]) + S[j][0]
print(t)
print(0)
... |
p03814 | s760990128 | Accepted | def resolve():
S = input()
a = []
z = []
for i in range(len(S)):
if S[i] == "A":
a.append(i)
elif S[i] == "Z":
z.append(i)
print(z[-1]-a[0]+1)
resolve() |
p03994 | s001769662 | Wrong Answer | from string import ascii_lowercase
alp = ascii_lowercase
num = {char: i for i, char in enumerate(alp)}
s = input()
k = int(input())
ns = [num[char] for char in s]
for i in range(len(ns)):
v = ns[i]
if 26 - v <= k:
ns[i] = 0
k -= 26 - v
ns[-1] = (ns[-1] + k) % 26
print(''.join(alp[n] for n in... |
p02900 | s300705736 | Accepted | import math
n,m=map(int,input().split())
gcd=math.gcd(m,n)
i=1
ans=[]
max=int(math.sqrt(gcd))
for i in range(2,max+2):
while gcd%i==0:
ans.append(i)
gcd//=i
if gcd>1:
ans.append(n)
print(len(set(ans))+1) |
p02790 | s192017154 | Wrong Answer | a, b = input().split()
if a >= b:
print(a)
else:
print(b) |
p02854 | s821329773 | Wrong Answer | from itertools import accumulate
N = int(input())
A = list([int(x) for x in input().split()])
count = 0
ironbar = list(accumulate(A))
i = 0
j = len(A) - 1
while i + 1 < j:
left = ironbar[i]
right = ironbar[j] - ironbar[i]
if left > right:
j = (i+j) // 2
elif left < right:
i = (i+j) /... |
p03162 | s284156028 | Accepted | N = int(input().strip())
h = [[0] * (N+1) for i in range(3)]
for i in range(1, N+1):
a, b, c = map(int, input().split(" "))
h[0][i] = max(h[1][i-1], h[2][i-1]) + a
h[1][i] = max(h[0][i-1], h[2][i-1]) + b
h[2][i] = max(h[0][i-1], h[1][i-1]) + c
print(max(h[0][N], h[1][N], h[2][N])) |
p03471 | s597709417 | Accepted | # -*- coding: utf-8 -*-
from sys import exit
n, y = map(int, input().split())
for i in range(n+1):
for j in range(n+1-i):
if 10000*i+5000*j+1000*(n-i-j) == y:
print(i, j, n-i-j)
exit()
print(-1, -1, -1) |
p02624 | s336486541 | Wrong Answer | import sys
def resolve():
readline=sys.stdin.readline
n=int(readline())
answer=0
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += i
answer+=table[i]
print(answer)
return
resolve() |
p03387 | s348173583 | Wrong Answer | A,B,C = map(int, input().split())
ret = 0
if not (A%2 == B%2 and B%2 == C%2):
# どれか一つにイレギュラーがある
ret += 1
max_elem = max(A,B,C)
# print((A,B,C),max_elem, (max_elem-A)//2, (max_elem-B)//2, (max_elem-C)//2)
ret += (max_elem-A)//2 + (max_elem-B)//2 + (max_elem-C)//2
print(ret) |
p03086 | s248379204 | Accepted | import math
import sys
s = input()
def isACGT(n):
for i in range(len(n)):
if (n[i] != 'A' and n[i] != 'C' and n[i] != 'G' and n[i] != 'T'):
return False
return True
ans=0
for i in range(len(s)):
for j in range(1, len(s)+1):
if (isACGT(s[i:j]) and len(s[i:j]) > ans):
a... |
p03435 | s775282973 | Accepted | import numpy as np
IN = [list(map(int, input().split())) for _ in range(3)]
c = np.array(IN)
column = np.sum(c, axis=0)
row = np.sum(c, axis=1)
S = np.sum(c)
if S%3==0:
S_ = S//3
for i in range(S_+1):
x = i
y = S_ - x
row_ = row - y
column_ = column - x
if all(col % 3 == ... |
p03944 | s270279539 | Accepted | w, h, n = map(int, input().split())
x_reg = 0
y_reg = 0
for i in range(n):
x, y, a = map(int, input().split())
if a == 1 and x_reg < x:
x_reg = x
if a == 2 and w > x:
w = x
if a == 3 and y_reg < y:
y_reg = y
if a == 4 and h > y:
h = y
x_edge = max(0, w-x_reg)
y_edge... |
p02695 | s496009775 | Accepted | N,M,Q = map(int,input().split())
abcd = [list(map(int,input().split())) for i in range(Q)]
import itertools
A = list(itertools.combinations_with_replacement(range(1,M+1),N))
answer = 0
for i in range(len(A)):
ans = 0
for j in range(Q):
if A[i][ abcd[j][1]-1 ] - A[i][ abcd[j][0]-1 ] == abcd[j][2]:
... |
p02640 | s059281690 | Wrong Answer |
a,b = map(int,input().split())
if a*2<=b<=a*4:
print('Yes')
else:
print('No') |
p02646 | s662260366 | Accepted | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
d = abs(a-b)
if d <= t*(v - w):
print("YES")
else:
print("NO") |
p02677 | s795519518 | Wrong Answer | import math
A,B,H,M = list(map(int,input().split()))
Q = 30*H - 6*M
L = (A**2 + B**2 - 2*A*B*math.cos(math.radians(Q)))**(1/2)
print(L) |
p02818 | s936078745 | Wrong Answer | A,B,K = [int(i) for i in input().split()]
if K >= A:
A = 0
K = K-A
else:
A = A-K
if K >= B:
B = 0
else:
B = B-K
print(A,B) |
p03986 | s955567290 | Wrong Answer | from collections import deque
X = input()
stack = deque([X[0]])
before = X[0]
for i in range(1, len(X)):
if X[i] == 'S':
stack.appendleft(X[i])
if X[i] == 'T':
if stack:
check = stack.popleft()
if check == 'T':
stack.appendleft(check)
stack.appendlef... |
p03035 | s900558709 | Accepted | A, B = map(int, input().split())
if A >= 13:
print(B)
elif A >= 6:
print(B//2)
else:
print(0)
|
p02792 | s600500201 | Accepted | N = int(input())
c = []
for i in range(10):
c.append([0] * 10)
for i in range(N):
s = str(i+1)
i1 = int(s[0])
i2 = int(s[-1])
c[i1][i2] += 1
total = 0
for i in range(10):
for j in range(10):
total += c[i][j] * c[j][i]
print(total) |
p03001 | s477666843 | Wrong Answer | w,h,x,y=map(int,input().split())
a=min(x*h,h*w-x*h)
b=min(y*w,h*w-y*w)
if 2*h==y and 2*w==x:
print(max(a,b),1)
else:
print(max(a,b),0)
|
p02882 | s394020962 | Wrong Answer | def main():
import numpy as np
a, b, x = map(int, input().split())
if b < a:
theta = np.arctan(2 * (b / a - x / a ** 3)) / np.pi * 180
print(theta)
else:
theta = np.arctan(a * b ** 2 / 2 / x) / np.pi * 180
print(theta)
if __name__ == '__main__':
main()
|
p03773 | s119565843 | Accepted | a, b = map(int, input().split())
print((a + b) % 24) |
p03264 | s177054280 | Accepted | # ABC108A
k = int(input())
odd = k // 2
if k % 2 == 1:
odd += 1
print(odd * (k-odd))
|
p03380 | s312148874 | Accepted | N=int(input())
A=list(map(int,input().split()))
A.sort()
m=A[-1]
B=[0 for i in range(0,N-1)]
for i in range(0,N-1):
B[i]=min(A[i],m-A[i])
r=max(B)
if r in A:
print(m,r)
else:
print(m,m-r) |
p03555 | s360295150 | Accepted | a = list(input())
b = list(input())
if a[:] == b[::-1]:
print('YES')
else:
print('NO')
|
p02576 | s640644938 | Accepted | # -*- coding: utf-8 -*-
# A
import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
n, x, t = map(int, input().split())
print(math.ceil(n / x)*t)
|
p03767 | s832276727 | Accepted | N=int(input())
L=list(map(int,input().split()))
L=sorted(L)
K=0
for i in range(N):
K+=L[i*2+N]
print(K)
|
p03150 | s678256004 | Accepted | s = list(input())
ans = 'NO'
for i in range(len(s)):
if ''.join(s[:i] + s[len(s)-7+i:]) == 'keyence':
ans = 'YES'
break
print(ans)
|
p03455 | s633497576 | Accepted | a,b = map(int,input().split())
if a*b % 2 == 0:
print('Even')
else:
print('Odd') |
p03862 | s393171554 | Wrong Answer | # Beginner 50 C
import copy
N, x = map(int, input().split())
A = list(map(int, input().split()))
B = copy.deepcopy(A)
for i in range(N-1):
if A[i] + A[i+1] > x:
if A[i] > A[i+1]:
A[i] = x - A[i+1]
else:
A[i+1] = x - A[i]
cnt = sum(B) - sum(A)
print(cnt)
|
p02547 | s591088650 | Wrong Answer | n = int(input())
l = []
for _ in range(n):
d1,d2 = map(int,input().split())
l.append(d1)
l.append(d2)
for i in range(len(l)-2):
if l[i] == l[i+1] == l[i+2] == 3:
print ('Yes')
exit ()
print ('No')
|
p03208 | s729069787 | Accepted | n,k=map(int,input().split())
h=[int(input()) for _ in range(n)]
h.sort()
INF=2*10**9
ans=INF
for i in range(n-k+1):
diff=h[i+k-1]-h[i]
if ans>diff:
ans=diff
if ans==0:
print(0)
exit()
print(ans) |
p02713 | s933518585 | Wrong Answer | import math
from functools import reduce
from itertools import product
K=int(input())
gcd=0.
K=range(K)
for i,j,k in product(K,K,K):
gcd+=reduce(math.gcd,(i+1,j+1,k+1))
print(gcd)
|
p02973 | s051572191 | Accepted | import bisect
from collections import deque
N=int(input())
a=deque([int(input())])
for _ in range(N-1):
num=int(input())
if num<=a[0]:
a.appendleft(num)
else:
a[bisect.bisect_left(a, num)-1]=num
print(len(a))
|
p02708 | s732782838 | Accepted | def main():
MOD = 10**9 + 7
n, k = map(int, input().split())
ans = 0
for x in range(k, n+2):
ans += (n+2)*(n+1)//2 - (n-x+2)*(n-x+1)//2 - (x+1)*x//2 + 1
ans %= MOD
print(ans)
if __name__ == "__main__":
main() |
p03162 | s849240510 | Wrong Answer | N = int(input())
Q = [list(map(int, input().split())) for _ in range(N)]
dp = [[0]*3 for i in range(N)]
dp[0][0] = Q[0][0]
dp[0][1] = Q[0][1]
dp[0][2] = Q[0][2]
print(dp)
for i in range(1, N):
dp[i][0] = max(dp[i-1][1], dp[i-1][2]) + Q[i][0]
dp[i][1] = max(dp[i-1][0], dp[i-1][2]) + Q[i][1]
dp[i][2] = max(d... |
p02627 | s989566454 | Wrong Answer | α=input()
if α=='A' or 'B' or 'C' or 'D' or 'E' or 'F' or 'G' or 'H' or 'I' or 'J' or 'K' or 'L' or 'M' or 'N' or 'O' or'P' or 'Q' or 'R' or 'S' or 'T' or 'U' or 'V' or 'W' or 'X' or 'Y' or 'Z':
print('A')
elif α=='a' or 'b' or 'c' or 'd' or 'e' or 'f' or 'g' or 'h' or 'i' or 'j' or 'k' or 'l' or 'm' or 'n' or 'o' or... |
p02601 | s868535271 | Accepted | a,b,c = map(int, input().split())
k =int(input())
cnt = 0
while b<=a:
cnt += 1
b *= 2
while c <= b:
cnt += 1
c *= 2
if cnt <= k:
print("Yes")
else:
print("No") |
p03160 | s770190034 | Wrong Answer | N = int(input())
*h, = map(int, input().split())
dp = [float("inf") for _ in range(N)]
dp[0] = 0
for i in range(N - 1):
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i])
if i < N - 2:
dp[i + 2] =dp[i + 2], dp[i] + abs(h[i + 2] - h[i])
print(dp[N - 1]) |
p02646 | s289210257 | Wrong Answer | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A <= B:
print("YES" if A + V * T >= B + W * T else "NO")
else:
print("YES" if A - V * T >= B - W * T else "NO") |
p02780 | s956431286 | Accepted | from collections import defaultdict
d = defaultdict(int)
N, K = map(int, input().split())
li = list(map(int, input().split()))
for i in range(1, 1000+1):
t = 0
for s in range(1, i+1):
t += s * (1 / i)
d[i] = t
ans = 0
t = 0
for index, i in enumerate(li):
t += d[i]
if index > K-1:
t -= d[li[index... |
p02628 | s011743611 | Wrong Answer | n,k=map(int,input().split())
l=list(map(int,input().split()))
sorted(l)
sum=0
for i in range(k):
sum+=l[i]
print(sum) |
p02970 | s794065950 | Wrong Answer | n, d = map(int, input().split())
print((n + d * 2) / (d * 2 + 1)) |
p02613 | s931530964 | Accepted | n=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(n):
x=input()
if x == 'AC':
ac+=1
elif x == 'WA':
wa+=1
elif x == 'TLE':
tle+=1
elif x == 'RE':
re+=1
print('AC x '+str(ac))
print('WA x '+str(wa))
print('TLE x '+str(tle))
print('RE x '+str(re))
|
p03160 | s926760616 | Accepted | N = int(input())
h = list(map(int, input().split())) #1-index
dp = [float('inf')]*(N)
def chmin(a,b):
if a >= b:
return b
else:
return a
dp[0] = 0
for i in range(1,N):
dp[i] = chmin(dp[i], dp[i-1] + abs(h[i] - h[i-1]))
if i >= 2:
dp[i] = chmin(dp[i], dp[i-2] + abs(h[i] - ... |
p03474 | s009631312 | Accepted | a, b = map(int, input().split())
s = input()
cnt = 0
y = ['0','1','2','3','4','5','6','7','8','9']
for i in range(a+b+1):
if i == a:
if s[a] == '-':
cnt +=1
else:
if s[i] in y:
cnt += 1
if cnt == (a+b+1):
print('Yes')
else:
print('No') |
p02811 | s223015247 | Wrong Answer | k,x=map(int,input().split())
if 500*k>x:
print("Yes")
if 500*x<x:
print("No") |
p03030 | s451542844 | Accepted | n=int(input())
a=[]
for i in range(n):
a.append(list(input().split()))
for i in range(0,n):
a[i].append(i+1)
for i in range(0,len(a)):
a[i][1]=int(a[i][1])
a.sort(key=lambda x:(x[0],-x[1]),reverse = False)
for i in range(0,n):
print(a[i][2]) |
p03069 | s308651164 | Wrong Answer | import sys
input = sys.stdin.readline
N = int(input())
S = list(input().strip())
S = S[::-1]
ans = 0
for i in range(N-2):
if S[i] == ".":
if S[i+1] == "." and S[i+2] == "#":
S[i+2] = "."
ans += 1
if S[i+1] == "#":
ans += 1
elif S[i] == "#" and S[i+1] == "." ... |
p04011 | s524051206 | Wrong Answer | N=int(input())
K=int(input())
X=int(input())
Y=int(input())
print(X*K+(N-K)*Y) |
p02748 | s196319361 | Accepted | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
m = [0] * M
x = [0] * M
y = [0] * M
for i in range (M):
x[i], y[i], m[i] = map(int, input().split())
discount = [0] * M
for i in range(M):
discount[i] = a[x[i]-1] + b[y[i]-1] - m[i]
disc... |
p02660 | s172352128 | Wrong Answer | from math import sqrt
N = int(input())
prime = 2
total_count = 0
def different_nums(count, num=1):
if count - num == 0:
return 1
elif count - num > 0:
return 1 + different_nums(count - num, num + 1)
else:
return 0
while N != 1:
count = 0
rooted_N = sqrt(N)
if prime > rooted_N:
tot... |
p03997 | s134007886 | Wrong Answer | a = int(input())
b = int(input())
c = int(input())
print((a+b) * c / 2) |
p02684 | s176851969 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
a = [i-1 for i in a]
visited = [-1]*n
route = []
now = 0
hop = 0
while visited[now] == -1:
visited[now]=hop
route.append(now)
now = a[now]
hop+=1
loop_st = 0
for r in route:
if r==now: break
loop_st+=1
loop = route[loop_st:]
if... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.