problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03221 | s109441308 | Accepted |
N,M = list(map(int, input().split()))
P = []
Y = []
for _ in range(M):
p,y = list(map(int, input().split()))
P.append(p)
Y.append(y)
count = [0]*(N+1)
ans = [0]*(M+1)
data = [[p,y,i] for p,y,i in zip(P,Y,range(1,M+1))]
data.sort(key=lambda x: x[1])
for i in range(M):
count[data[i][0]] += 1
ans[da... |
p02811 | s413881682 | Accepted | K, X = map(int, input().split())
if K * 500 >= X:
print("Yes")
else:
print("No") |
p03730 | s817554390 | Accepted | import math
a,b,c=map(int,input().split())
if c%(math.gcd(a,b))==0:
print('YES')
else:
print('NO') |
p02971 | s060464969 | Accepted | N = int(input())
lis = []
for i in range(N):
lis.append(int(input()))
max_value = max(lis)
max_index = lis.index(max_value)
max_count = lis.count(max_value)
next_max = sorted(lis)[-2]
if max_count ==1:
for i in range(N):
if i == max_index:
print(next_max)
else:
print(max_... |
p02718 | s991678326 | Accepted | n, m = map(int, input().split())
a = [ i for i in map(int, input().split())]
# print(n, m)
# print(a)
a.sort(reverse=True)
# print(a)
last = a[m-1]
# print(last)
total = sum(a)
if (last >= (total / (4 * m))):
print('Yes')
else:
print('No') |
p03659 | s284679194 | Accepted | import math
N = int(input())
A = list(map(int, input().split()))
sum_a = sum(A)
x = 0
ans = 1000000000000000
for i in range(N-1):
x += A[i]
ans = min(ans, abs(2*x-sum_a))
print(ans) |
p03352 | s505192352 | Wrong Answer | X = int(input())
ans = 0
for b in range(1, X):
for p in range(2, X):
tmp = b ** p
if ans < tmp and tmp <= X:
ans = tmp
print(ans) |
p02847 | s482216115 | Wrong Answer | S=input()
if S=="SUN":
print(7)
if S=="MON":
print(6)
if S=="TUE":
print(5)
if S=="WED":
print(4)
if S=="THU":
print(3)
if S=="FRI":
print(2)
else:
print(1) |
p02842 | s202640778 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n = int(input())
def bs(ok, ng, cond):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if cond(mid):
ok = mid
else:
ng = mid
return ok
ans = bs(n, 0, lambda x: x * 1.08 >= n)
if n == int(ans * 1.... |
p03556 | s648307453 | Wrong Answer |
import math
N = int(input())
for i in range(1, N+1):
if i*i > N:
print((i-1)**2)
exit()
|
p02778 | s474242684 | Wrong Answer | from sys import stdin
def get_result(data):
return 'x' * len(data[0])
if __name__ == '__main__':
data = list(map(str, stdin.readline().split(' ')))
result = get_result(data)
print(result)
|
p02793 | s023010404 | Accepted | from fractions import gcd
n=int(input())
A=list(map(int,input().split()))
a=1
for i in range(n):
a=a*A[i]//gcd(a,A[i])
ans=0
for i in range(n):
ans=ans+a//A[i]
print(ans%(10**9+7)) |
p02766 | s556174485 | Accepted | import math
n, k = map( int, input().split() )
print( int( math.log( n, k ) ) + 1 ) |
p02811 | s800384770 | Accepted | k,x=map(int, input().split())
if 500*k >=x:
print('Yes')
else:
print('No') |
p03696 | s668586216 | Wrong Answer | N = int(input())
S = input()
left = 0
right = 0
cnt1 = 0
for i in S:
if i == '(':
left += 1
else:
right += 1
cnt1 = max(cnt1, right - left)
cnt2 = 0
for i in S[::-1]:
if i == ')':
left += 1
else:
right += 1
cnt2 = max(cnt2, right - left)
ans = '(' * max(0, cnt1) +... |
p02786 | s802730901 | Accepted | #!/bin/bash
''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
/bin/bash -c "pypy3 /vo/$(basename $0) < /vo/g.inp"
exit $?
'''
import sys
def _i(): return int(sys.stdin.readline().strip())
h = _i()
n = 0
while h > 0:
h //= 2
n += 1
print(2**n - 1)
|
p03319 | s443772088 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
if n == k:
print(1)
exit()
pos_1 = a.index(1)
left = pos_1
right = n - pos_1 - 1
if left > right:
left, right = right, left
if left < k - 1:
right -= k - left - 1
print((left + k - 2) // (k - 1) + (right + k - 2) // (k - 1))
|
p02732 | s815264131 | Wrong Answer | import itertools
import copy
n = map(int, input())
a = list(map(int, input().split()))
matches = {}
for i in range(len(a)):
aa = copy.copy(a)
del aa[i]
for av in aa:
if av in matches:
matches[av] += 1
else:
matches[av] = 1
combi_cnt = 0
for v in matches:
combi_cnt += len(list(itertoo... |
p02647 | s938597643 | Wrong Answer | import numpy as np
n, k = map(int, input().split())
a = np.array(list(map(int, input().split())))
for i in range(k):
next_a = np.array([0 for _ in range(n)])
for j in range(n):
next_a[max(j - a[j], 0):min(j + a[j] + 1, n)] += 1
a = next_a
print(' '.join(list(map(str, a.tolist()))))
|
p03210 | s660833389 | Wrong Answer | a=int(input())
print('YES' if a=='5' or a=='3' or a=='7' else 'NO') |
p02958 | s088178208 | Wrong Answer | def check(n, list1):
new = []
for i in range(n):
new.append(list1[i])
new.sort()
swaps = 0
for i in range(n):
if list1[i] != new[i]:
swaps += 1
if swaps == 0 or swaps == 2:
return True
else:
return False
n = int... |
p03475 | s672640101 | Wrong Answer | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
csf = [list(map(int, readline().split())) for _ in range(n - 1)]
for i, (c, s, _) in enumerate(csf):
s += c
for j, (cc, ss, ff) in enumerate(csf... |
p03627 | s435341064 | Accepted | import collections
N =int(input())
A =list(map(int,input().split()))
col = (collections.Counter(A))
col_key = sorted(col.keys(),reverse = 1)
hen = []
counter =0
for i in range(len(col_key)):
if 2 <= col[col_key[i]] <4:
hen.append(col_key[i])
counter += 1
elif col[col_key[i]] >= 4:
hen.a... |
p02948 | s302133263 | Accepted | import heapq
N, M = map(int, input().split())
ABs = [tuple(map(int, input().split())) for _ in range(N)]
ABs.sort(reverse = True)
works = []
reward = 0
for i in range(1, M+1):
while ABs and ABs[-1][0] <= i:
heapq.heappush(works, -ABs.pop()[1])
if works:
reward -= heapq.heappop(works)
print(reward) |
p02633 | s611169801 | Accepted | X = int(input())
i = 1
while True:
if X * i % 360 == 0:
break
else:
i += 1
print(i) |
p02993 | s528094586 | Accepted | S = str(input())
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
print("Bad")
else:
print("Good") |
p02988 | s827206334 | Accepted | n = int(input())
p = list(map(int, input().split()))
ans = 0
for i in range(1,n-1):
tmp = sorted(p[i-1:i+2])
if tmp.index(p[i]) == 1:
ans += 1
print(ans) |
p02681 | s957178832 | Accepted | s = input()
t = input()
if len(s)+1 == len(t) and s == t[:-1]:
print("Yes")
else:
print("No") |
p02578 | s449877699 | Wrong Answer | N = int(input())
A = [0]*N
A = list(map(int, input().split()))
sum_step = 0
for n in range(1, N):
max_ = max(A[0:n])
sum_step += max_ - A[n]
print(sum_step) |
p03329 | s107795013 | Wrong Answer | N = int(input())
L = [1, 6, 9]
tmp = 6
while tmp < N:
tmp *= 6
L.append(tmp)
tmp = 9
while tmp < N:
tmp *= 9
L.append(tmp)
L.sort(reverse=True)
DP = [float('inf')] * 100001
DP[0]
for i in range(1, 6):
DP[i] = i
DP[6] = 1
for i in range(7, N+1):
for l in L:
if l <= i:
DP[... |
p02829 | s953507271 | Accepted | a=int(input())
b=int(input())
r=[1,2,3]
r.remove(a)
r.remove(b)
print(r[0]) |
p02577 | s705734916 | Accepted | N=input()
mod=0
for c in N:
mod+=int(c)%9
if mod%9==0:
print("Yes")
else:
print("No")
|
p02909 | s647897316 | Accepted | s=input()
if s[0]=='S':
print('Cloudy')
elif s[0]=='C':
print('Rainy')
else:
print('Sunny') |
p03449 | s704621411 | Accepted | n = int(input())
a = [list(map(int,input().split())) for _ in range(2)]
s = 0
for i in range(n):
s += a[0][i]
a[0][i] = s
a[1][0] += a[0][0]
for i in range(1, n):
a[1][i] += max(a[0][i], a[1][i - 1])
print(a[1][-1]) |
p02935 | s690848021 | Wrong Answer | n = int(input())
v = list(map(int, input().split()))
vs = sorted(v)
ans = vs[0]
for i in range(1,n):
ans = (ans + vs[i]) // 2
print(ans) |
p03625 | s817678319 | Accepted | from collections import Counter
n = int(input())
a = Counter(map(int, input().split()))
xy = []
a = sorted(a.items(), key=lambda x: x[0], reverse=True)
for i in a:
if len(xy) == 2:
break
if i[1] >= 4:
xy.append(i[0])
xy.append(i[0])
break
if i[1] >= 2:
xy.append(i[0]... |
p02796 | s230136195 | Wrong Answer | H = int(input())
_list = []
for i in range(H):
set = input().split(" ")
_list.append([int(set[0]), int(set[1])])
new_list = sorted(_list)
ans_list = [new_list[0]]
for i in new_list:
arm_long = ans_list[-1][0] + ans_list[-1][1] -1
arm_short = i[0] - i[1] +1
if arm_long < arm_short:
ans_list.append(... |
p02759 | s422099677 | Accepted | import math
pages = int(input())
print(math.ceil(pages/2)) |
p04043 | s204380750 | Wrong Answer | from sys import stdin, stdout
def main():
line = stdin.readline()
parts = line.split()
parts.sort()
stdout.write('Yes' if int(parts[0])==5 and int(parts[1])==5 and int(parts[2])==7 else 'No')
main() |
p03073 | s348934538 | Accepted | S=input()
a1=0
a2=0
p1='1'
p2='0'
for s in S:
if s!=p1:
a1+=1
else:
a2+=1
p=p1
p1=p2
p2=p
print(min(a1,a2)) |
p02854 | s469783876 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
l=0
r=0
li=0
ri=0
for i in range(N):
if l<=r:
l+=A[li]
li+=1
else:
r+=A[-1-ri]
ri+=1
print(l-r) |
p02982 | s538549780 | Accepted | import math
def solve(y, z):
res = 0
for i in range(len(y)):
res += (y[i]-z[i])**2
return math.sqrt(res)
n, d = map(int, input().split())
x = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n-1):
for j in range(i+1, n):
dist = solve(x[i], x[j])
if int(dist) == dist: ans ... |
p02768 | s309819843 | Wrong Answer | n, a, b = map(int, input().split())
law = 10 ** 9 + 7
def fermat(n, r, law):
x = 1
y = 1
for i in range(r):
x = x * (n - i) % law
y = y * (i + 1) % law
ans = x * pow(y, law - 2, law)
return ans
print((pow(2,n,law)- fermat(n,a,law)-fermat(n,b,law))%law) |
p03323 | s453516620 | Accepted | A, B = map(int, input().split())
if A <= 8 and B <= 8:
print("Yay!")
else:
print(":(") |
p02681 | s629678197 | Accepted | S = input()
T = input()
for s,t in zip(S,T):
if s != t:
print('No')
exit()
print('Yes')
|
p03778 | s639655453 | Accepted | w,a,b = map(int,input().split())
if a <= b <= a+w or a <= b <= a+w:
print(0)
elif a+w < b:
print(b-a-w)
else:
print(a-b-w) |
p02995 | s139321194 | Wrong Answer | from fractions import gcd
A,B,C,D = map(int,input().split())
N=B-A+1
CD = (C * D) // gcd(C,D)
print(N - (N//C) - (N//D) + (N//CD) ) |
p02677 | s013954497 | Accepted | import math
a,b,h,m = map(int,input().split())
h = h*30 + 0.5*m
m = m*6
rad = abs(h-m)
cosrad = math.cos(math.radians(rad))
c2 = a**2 + b**2 - 2*b*a*cosrad
c2 = c2 ** 0.5
print(c2) |
p03817 | s727625016 | Wrong Answer | # 大きくなるように取る
# 1 -> 5 -> 6 -> 5かな
# 1 6 12 17 23
N = int(input())
# N -= 1
cnt = 0
a = N // 11
amari = N % 11
cnt += a*2
# print(a, amari)
if amari == 0:
cnt += 0
elif amari <= 5:
cnt += 1
else:
cnt += 2
print(cnt) |
p02633 | s277360979 | Accepted | from math import gcd
g = gcd(int(input()), 360)
print(360 // g) |
p03408 | s528552851 | Accepted | n = int(input())
A = [input() for i in range(n)]
m = int(input())
B = [input() for i in range(m)]
T = [""] * n
ans = 0
for i in range(n):
if A[i] not in T:
T[i] = A[i]
ans = max(ans, A.count(A[i]) - B.count(A[i]), 0)
print(ans) |
p03827 | s152269877 | Accepted | n = int(input())
s = input()
x = 0
ans = x
for i in range(n):
if s[i] == 'I':
x += 1
else:
x -= 1
ans = max(ans,x)
print(ans) |
p03730 | s694607665 | Accepted | a, b, c = map(int, input().split())
for i in range(1, b+1):
if a*i % b == c:
print("YES")
break
else:
print("NO")
|
p02578 | s960465185 | Wrong Answer | n=int(input())
a_list=list(map(int,input().split()))
ans=0
tmp=a_list[0]
for i in range(n-1):
if a_list[i]>a_list[i+1]:
print(tmp,ans)
ans+=tmp-a_list[i+1]
else:
tmp=a_list[i+1]
print(ans) |
p03282 | s855017807 | Accepted | s = input()
k = int(input())
first = len(s)
for i in range(len(s)):
if s[i] != '1': first = i; break
if s[0] != '1': print(s[0]); exit(0)
print(1) if k <= first else print(s[first])
|
p02647 | s888969822 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(K):
tmp = [0] * (N+1)
for i in range(N):
tmp[max(0, i-A[i])] += 1
tmp[min(N-1, i+A[i]) + 1] -= 1
ans = [0]*N
A[0] = tmp[0]
for i in range(1, N):
A[i] = A[i-1] + tmp[i]
# print(*A)
i... |
p03556 | s315262887 | Wrong Answer | n = int(input())
for i in range(n):
if (i + 1) ** 2 > n:
break
print(i ** 2)
|
p03137 | s563825777 | Accepted | n,m=map(int,input().split())
x=list(map(int, input().split()))
if n >= m:
print('0')
exit(0)
x_sorted = sorted(x)
dx = [abs(x_sorted[i+1]-x_sorted[i]) for i in range(m-1)]
dx_sorted = sorted(dx,reverse=True)
result = sum(dx_sorted)
for i in range(n-1):
result -= dx_sorted[i]
print(result) |
p02958 | s975411530 | Accepted | n=int(input())
p=list(map(int,input().split()))
q=[i for i in p]
p.sort()
ans=0
for i in range(n):
if p[i]!=q[i]:
ans+=1
print("YES" if ans==0 or ans==2 else "NO") |
p02759 | s367510474 | Wrong Answer |
def main():
n = int(input())
if n % 2 == 1:
print(n // 2 + 1)
else:
print(n / 2)
if __name__ == "__main__":
main()
|
p02767 | s775403260 | Accepted | n = int(input())
X = list(map(int, input().split()))
ans = float('inf')
for p in range(101):
temp = 0
for x in X:
temp += (x-p)**2
ans = min(ans, temp)
print(ans)
|
p03659 | s774419102 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=[]
c=[]
s=sum(a)
t=0
for i in range(n-1):
b.append(t+a[i])
t=b[i]
for i in range(n-1):
c.append(abs(2*b[i]-s))
c.sort()
print(c[0]) |
p02695 | s010686543 | Accepted | import itertools
N, M, Q = map(int, raw_input().split())
data = [None] * Q
for i in range(Q):
data[i] = map(int, raw_input().split())
def calc_score(data, A):
score = 0
for a, b, c, d in data:
if A[b-1] - A[a-1] == c:
score += d
return score
print max(calc_score(data, A) for A in ... |
p02778 | s200559567 | Accepted | import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい
S = read().rstrip()
length = len(S)
ans = "x" * length
print(ans) |
p02833 | s759644431 | Accepted | #!/usr/bin/env python3
def solve(N: int):
if N % 2 == 0:
N = N // 2
answer = 0
div = 5
while N >= div:
answer += N // div
div *= 5
return answer
else:
return 0
return answer
def main():
N = int(input())
answer = solve(N)
... |
p02700 | s975960421 | Wrong Answer | a = list(map(int, input().split()))
if a[0]+a[1] <= a[2] + a[3]:
print('No')
else:
print('Yes') |
p02711 | s985022717 | Accepted | N = input()
hN = str(N)[0:1]
dN = str(N)[1:2]
mN = str(N)[2:3]
#print(str(N)+hN+dN+mN)
bool = 0
if hN == '7':
bool = bool + 1
elif dN == '7':
bool = bool + 1
elif mN == '7':
bool = bool + 1
if bool == 1:
print('Yes')
elif bool == 0:
print('No') |
p02720 | s796255387 | Accepted | from collections import deque
k = int(input())
q = deque(range(1,10))
while k:
k-=1
t=q.popleft()
if t%10 !=0 : q.append(10*t+t%10-1)
q.append(10*t+t%10)
if t%10 !=9 : q.append(10*t+t%10+1)
print(t) |
p02556 | s045401001 | Wrong Answer | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n = int(readline())
p = [list(map(int,readline().split())) for i in range(n)]
xmin = INF
ymin = INF
for (x,y) in p:
xmin = min(x,xmin)
ymin = min(y,ymin)
for i in range(n):
p[i... |
p03427 | s865073104 | Accepted | N = input()
ans1 = sum([int(c) for c in N])
ans2 = int(N[0]) - 1 + 9 * (len(N) - 1)
print(max(ans1, ans2))
|
p03797 | s680707071 | Wrong Answer | n,m = map(int,input().split())
if m < 2*n:
print(0)
else:
m -= 2*n
print(n+(m//4)) |
p03127 | s011121754 | Wrong Answer | N=int(input())
A=sorted(list(map(int,input().split(' '))))
ans = A[0]
for i in A[1:]:
if i%ans>0:
ans = i%ans
else:
print(ans)
break |
p02615 | s348755129 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
print(sum(A[:n-1]))
|
p03416 | s018720992 | Wrong Answer | a, b = map(int, input().split())
ans = 0
for i in range(a, b+1):
s = str(i)
sl = len(s) // 2
if s[:sl] == s[-sl:]: ans += 1
print(ans) |
p03127 | s631703016 | Wrong Answer | import numpy as np
n = int(input())
a = input().split(' ')
a = np.array(a).astype(int)
while a[a>0].shape[0] > 1:
not_0_a = a[a!=0]
min_ = not_0_a.min()
min_i = np.where(not_0_a == min_)
a = a % min_
if a[a>0].shape[0] == 1:
not_0_a = a[a!=0]
min_ = not_0_a.min()
break
if len(min_i[0]... |
p03329 | s653452162 | Accepted | C=[]
for i in range(1,100):
if 6**i<=10**5:
C.append(6**i)
for i in range(1,100):
if 9**i<=10**5:
C.append(9**i)
N=int(input())
dp=[i for i in range(N+1)]
for c in C:
for i in range(N+1):
if i-c>=0:
dp[i]=min(dp[i],dp[i-c]+1)
print(dp[N])
|
p02570 | s953152150 | Wrong Answer | m, t, s = input().split()
if float(m) / float(s) <= float(t):
print('YES')
else:
print('No') |
p03035 | s719629347 | Wrong Answer | A, B = map(int, input().split())
if 13 <= A:
ans = B
elif A < 6:
ans = 0
else:
ans = B / 2
print(ans) |
p02578 | s030440115 | Accepted | n = int(input())
a = list(map(int,input().split(" ")))
answer = 0
for i in range(1,n):
if a[i] < a[i - 1]:
answer += a[i-1] - a[i]
a[i]= a[i - 1]
print(answer) |
p02765 | s707794400 | Accepted | N, R = map(int,input().split())
print(R + 100 * (10 - N) if N < 10 else R) |
p02963 | s896430814 | Accepted | # x2y3 - y2x3 = S
s = int(input())
if s == 10**18:
print(0, 0, 10**9, 10**9, 0, 10**9)
exit()
x_2 = 10**9
x_3 = 10**9 - s%(10**9)
y_2 = 1
y_3 = s//(10**9) + 1
print(0, 0, x_2, x_3, y_2, y_3) |
p03408 | s907327134 | Wrong Answer | from collections import Counter
N = Counter([input() for _ in range(int(input()))])
M = Counter([input() for _ in range(int(input()))])
print(max(N[key]-M[key] for key in N.keys()))
|
p02861 | s913916927 | Accepted | #!/usr/bin/env python3
from math import sqrt
N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
sum = 0
for i in range(N):
for j in range(N):
sum += ((A[i][0] - A[j][0]) ** 2 + (A[i][1] - A[j][1]) ** 2) ** 0.5
print(sum/N) |
p03645 | s164766002 | Accepted | def int_(num_str):
return int(num_str) - 1
N, M = map(int, input().split())
graph = [set() for _ in range(N)]
for _ in range(M):
a, b = map(int_, input().split())
graph[a].add(b)
graph[b].add(a)
for i in range(1, N-1):
if (0 in graph[i]) and (N-1 in graph[i]):
print("POSSIBLE")
bre... |
p03693 | s317154899 | Wrong Answer | li = list(map(int,input().split()))
print('Yes' if (li[0] * 100 + li[1] * 10 + li[2]) % 4 == 0 else 'No')
|
p03681 | s548449879 | Wrong Answer | import math
def permutations(a,b):
return math.factorial(a)//math.factorial(a-b)
n, m = map(int, input().split())
if abs(n-m)>2:
print(0)
elif abs(n-m)==1:
print(permutations(n,n)*permutations(m,m)%(10**9+7))
else:
print(permutations(n,n)*permutations(m,m)*2%(10**9+7)) |
p02777 | s014774960 | Accepted | import sys
import socket
hostname = socket.gethostname()
if hostname == 'F451C':
sys.stdin = open('a1.in')
def read_int_list():
return list(map(int, input().split()))
def read_str_list():
return input().split()
def read_int():
return int(input())
def read_str():
return input()
def main()... |
p03243 | s046373766 | Wrong Answer | n=int(input())
print(1111 if n==999 else 111*(n//111) if n<111*(n//111) else 111*(n//111+1)) |
p03437 | s647843233 | Accepted | X, Y = map(int, input().split())
if X % Y != 0:
print(X)
elif X*2%Y != 0:
print(X*2)
else:
print(-1) |
p03137 | s496368525 | Wrong Answer | n,m=map(int,input().split())
x=list(map(int,input().split()))
x=sorted(x)
if n>=m:
print(0)
exit()
l=[]
for i in range(m-1):
l+=[x[i+1]-x[i]]
l=sorted(l)
print(sum(l)-sum(l[:-(n-1)]))
|
p02761 | s862145298 | Accepted | n, m = map(int, input().split())
j = [True]*(n + 1)
l = [1] + [0]*(n - 1)
jud = True
for i in range(m):
s, c = map(int, input().split())
if s == 1 and c == 0 and n != 1:
jud = False
if j[s]:
l[s - 1] = c
j[s] = False
else:
if l[s - 1] != c:
jud = False
if not ... |
p03721 | s434684301 | Accepted | n, m = map(int, input().split())
l = [list(map(int,input().split())) for i in range(n)]
d = [0 for i in range(10**5)]
for i in range(n):
d[l[i][0]-1] += l[i][1]
cnt = 0
for i in range(10**5):
cnt += d[i]
if cnt >= m:
print(i+1)
exit() |
p02811 | s114175556 | Accepted | K,X = map(int,input().split(" "))
print("Yes" if 500*K>=X else "No") |
p02860 | s363959216 | Accepted | n = int(input())
s = input()
for i in range(1, n):
if s[0] == s[i] and s[:i] == s[i:]:
print("Yes")
break
else:
print("No") |
p02946 | s974564048 | Wrong Answer | a,b=map(int,input().split())
c=b-a
print(c+1)
|
p03795 | s814041381 | Wrong Answer | N=int(input())
x=N*800
y=200*(N%15)
ans=x-y
print(ans) |
p04011 | s574545998 | Accepted | n,k=[int(input()) for i in range(2)]
print(min(n,k)*int(input()) + max(n-k,0)*int(input())) |
p03160 | s426456927 | Accepted | N = int(input())
H = list(map(int,input().split()))
dp = [float("inf")]*N
dp[0] = 0
for i in range(1,N):
if i == 1:
dp[i] = min(dp[i],dp[i-1] + abs(H[i]-H[i-1]))
else:
dp[i] = min(dp[i],dp[i-1]+abs(H[i]-H[i-1]),dp[i-2]+abs(H[i]-H[i-2]))
print(dp[N-1])
|
p03657 | s041985024 | Wrong Answer | a,b = map(int,input().split())
print('Possible' if (a+b)%3==0 else 'Impossible') |
p02659 | s533436967 | Accepted | import math
import decimal
a,b=input().split()
print(math.floor(int(a)*decimal.Decimal(b))) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.