problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03371 | s830652626 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
ans = 10**18
Z = max(X, Y)
for i in range(Z+1):
price = C*i + A*max(0, X-i) + B*max(0, Y-i)
ans = min(ans, price)
print(ans) |
p03262 | s329623118 | Accepted | from fractions import gcd
N , X = (map(int , input().split()))
x = list(map(int , input().split()))
ans = 0
for i in x:
ans = gcd(ans , abs(X-i))
print(ans) |
p03852 | s755648710 | Accepted | s = input()
b = ["a", "i", "u", "e", "o"]
if s in b:
print("vowel")
else:
print('consonant')
|
p02754 | s071157109 | Wrong Answer | N, A, B = [int(i) for i in input().split()]
g = 0
while N > A:
N = N - A - B
g = g + A
print(g + N) |
p02630 | s226462784 | Accepted | n = int(input())
a = list(map(int,input().split()))
asum = sum(a)
cnt = [0] * (10**5+1)
q = int(input())
for i in a:
cnt[i] += 1
for i in range(q):
b, c = map(int,input().split())
asum = asum + (c-b)*cnt[b]
cnt[c] += cnt[b]
cnt[b] = 0
print(asum) |
p03241 | s449481182 | Accepted | N, M = map(int, input().split())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
divs = sorted(make_divisors(M), reverse=True)
ans = 1
for div in divs:
res = div if div*N <= M else 1
ans = max(ans, res)
print(ans) |
p02706 | s106274973 | Accepted | n,m = map(int,input().split())
a = list(map(int,input().split()))
if n-sum(a)>=0:
print(n-sum(a))
else:
print("-1") |
p02582 | s136913935 | Wrong Answer | S = input()
if (S[0] == 'R' and S[1] == 'R') or (S[1] == 'R' and S[2] == 'R'):
print(2)
elif S == 'SSS':
print(0)
elif S == 'RRR':
print(3)
else:
print(1) |
p02784 | s901075532 | Accepted | H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
sm = sum(A)
print("Yes" if sm >= H else "No") |
p03455 | s539721854 | Accepted | if any(list(map(lambda x: int(x) % 2 == 0, input().split()))):
print("Even")
else:
print("Odd") |
p02836 | s085683831 | Accepted | S = input()
ans = 0
for i in range(int(len(S) / 2)):
if S[i] != S[len(S) - i - 1] :
ans += 1
print(ans)
|
p02900 | s903192393 | Accepted | from fractions import gcd
from math import sqrt
def prime_factorize(n):
result = []
for i in range(2, int(sqrt(n)) + 1):
if n % i != 0:
continue
t = 0
while n % i == 0:
n //= i
t += 1
result.append((i, t))
if n == 1:
break
if n != 1:
result.append((n, 1))
return result
A, B = map(int, input().split())
print(len(prime_factorize(gcd(A, B))) + 1) |
p03012 | s104317295 | Accepted | from itertools import accumulate
def LI():
return list(map(int, input().split()))
N = int(input())
W = LI()
total = sum(W)
Wsum = list(accumulate(W))
ans = 10000000
for i in range(N):
ans = min(ans, abs(Wsum[i]-(total-Wsum[i])))
print(ans)
|
p02694 | s536728420 | Accepted | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
x = int(input())
now = 100
ans = 0
while True:
if now >= x:
print(ans)
break
ans += 1
now = floor(now * 1.01) |
p03087 | s169162758 | Wrong Answer | n,q=map(int,input().split())
s=input()
for i in range(q):
l,r=map(int,input().split())
l,r=l-1,r-1
print(s[l:r].count("AC")) |
p02603 | s535455876 | Wrong Answer | def INT():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(map(int, input().split()))
N = INT()
A = LI()
ans = 1000
purchase = 0
for i in range(1, N):
tmp = ans
if A[i] > A[i - 1]:
for j in range(100):
if tmp - A[i - 1] < 0:
break
tmp -= A[i - 1]
purchase += 1
ans = max(ans, tmp + A[i] * purchase)
purchase = 0
print(ans) |
p03860 | s279793390 | Accepted | print(''.join([i[0]for i in input().split()])) |
p03679 | s970172597 | Accepted | x, a, b = map(int, input().split())
print("delicious" if a - b >= 0 else "safe" if b - a <= x else "dangerous") |
p03427 | s053939255 | Accepted | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n=input()
l=[0]*len(n)
l[0]=int(n[0])
for i in range(1,len(n)):
l[i]=l[i-1]+int(n[i])
ans=l[-1]
for i in range(len(n)):
ans=max(ans,l[i]-1+9*(len(n)-1-i))
print(ans) |
p02683 | s760036235 | Wrong Answer | import numpy as np
import itertools
N, M, X = map(int, input().split())
ca = []
for _ in range(N):
ca.append( list(map(int, input().split())))
ca = np.array(ca)
#print(ca)
ans = 1000000
b = [0,1]
for p in list(itertools.product(b, repeat=N)):
a = np.array(p)
to = a@ca
if min(to[1:]) >= X:
ans = min(ans, to[0])
#
if ans == 1000000:
print(-1)
else:
print(ans)
# |
p02836 | s254030177 | Accepted | S = input()
ans = 0
for i in range(len(S)//2):
if S[i] != S[-i-1]:
ans += 1
print(ans) |
p02711 | s513782432 | Accepted | n = input()
print('Yes') if '7' in n else print('No') |
p02633 | s018233218 | Accepted | X = int(input())
import math
tmp = 360*X//math.gcd(360,X)
ans = tmp//X
print(ans) |
p02744 | s287065051 | Accepted | n = int(input())
alp = [chr(i) for i in range(97, 97+26)]
def dfs(i):
if i == 1:
return [("a", 1)]
else:
ret = []
for i in dfs(i-1):
nowstr, nowmax = i
for j in range(nowmax+1):
ret.append((nowstr+alp[j], max(j+1,nowmax)))
return ret
ans = dfs(n)
#print(ans)
for i in range(len(ans)):
print(ans[i][0]) |
p03469 | s013541731 | Accepted | S=input()
print(S[0:3]+"8"+S[4:]) |
p03417 | s086788270 | Accepted | n, m = map(int, input().split())
import itertools
print(abs(m*n - ((n-1)*2 + (m-1)*2))) |
p03274 | s714295884 | Accepted | n,k = map(int,input().split())
l = list(map(int,input().split()))
ans = 10**13
for i in range(n-k+1):
left = l[i]
right = l[k+i-1]
if right <= 0:
time = abs(left)
elif 0 <= left:
time = abs(right)
else:
time = min(abs(left),abs(right))*2 + max(abs(left),abs(right))
ans = min(ans,time)
print(ans) |
p03319 | s272241510 | Accepted | import math
N,K=map(int,input().split())
A=list(map(int,input().split()))
ans=1
N-=K
K-=1
if K==0:
print(ans)
exit()
else:
print(ans+math.ceil(N/K)) |
p02747 | s775688832 | Wrong Answer | s = input()
if 'hi' not in s:
print('No')
elif 'hii' in s:
print('No')
else:
print('Yes') |
p02880 | s728668165 | Wrong Answer | n = int(input())
for i in range(2,10):
if n <= 81 and n % i == 0:
print('Yes')
break
else:
print('No') |
p02658 | s368282631 | Accepted | def main():
N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
return
prd = 1
for a in A:
prd *= a
if prd > 1000000000000000000:
print(-1)
return
print(prd)
main() |
p03471 | s363505877 | Accepted | N, Y = map(int,input().split())
for i in range(N + 1):
for j in range(N - i + 1):
if Y == 1000*i + 5000*j + 10000*(N - j - i):
print(N - j - i, j, i)
exit(0)
print(-1,-1,-1) |
p03487 | s140132166 | Accepted | from collections import Counter
N = int(input())
D = Counter([int(a) for a in input().split()])
cnt = 0
for k, v in D.items():
if k < v:
cnt += v - k
elif v < k:
cnt += v
print(cnt)
|
p02917 | s910532855 | Accepted | n = int(input())
B = list(map(int, input().split()))
A = [B[0]]
for i in range(0,len(B)-1):
A.append(min(B[i],B[i+1]))
A.append(B[n-2])
print(sum(A)) |
p03136 | s536964186 | Accepted | N = int(input())
L = sorted([int(x) for x in input().split()])
print('Yes' if sum(L[:-1]) > L[-1] else 'No')
|
p03852 | s682319835 | Wrong Answer | def main(S):
listdreamereraser = ['dreamer','eraser','dream','erase']
while True:
for i in listdreamereraser:
if i == S[-len(i):]:
S = S[:-len(i)]
break
else:
return False
if len(S) == 0:
return True
S = input()
print('YES' if main(S) else 'NO') |
p03623 | s041364774 | Accepted | x,a,b=map(int,input().split())
print('AB'[(x+x>a+b)^(a>b)]) |
p03251 | s768489190 | Accepted | n, m, x_capital, y_capital = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
ans = "War"
for i in range(100):
if x_capital < i and i <= y_capital and max(x) < i and i <= min(y):
ans = "No War"
print(ans)
|
p02688 | s094825536 | Wrong Answer | N, K = map(int, input().split())
d = []
A = []
for i in range(K):
d_pre = int(input())
A_pre = [int(x) for x in input().split()]
d.append(d_pre)
A.extend(A_pre)
A_unique = list(set(A))
ans = 0
for i in range(1, N):
if i in A_unique:
pass
else:
ans += 1
print(ans) |
p03251 | s441699679 | Wrong Answer | n,m,x,y = map(int,input().split())
xx = list(map(int,input().split()))
yy = list(map(int,input().split()))
if x < y and max(xx) < y and x < min(yy):
print("No War")
else:
print("War") |
p02553 | s480799716 | Wrong Answer | a,b,c,d = map(int,input().split())
if a >= 0:
if c>=0 or d>=0:
print(b*d)
else:
print(a*d)
elif b<=0:
if d<=0:
print(a*c)
else:
if a*c <= b*d:
print(b*d)
else:
print(a*c) |
p04029 | s654320065 | Accepted | n=int(input())
print(int(n*(n+1)/2))
|
p03107 | s586070722 | Accepted | #abc120 c
s=input()
r=s.count("1")
b=s.count("0")
ans=min(r,b)*2
print(ans) |
p03680 | s983043275 | Accepted | n=int(input())
a=[int(input()) for _ in range(n)]
buf=1
count=0
if 2 not in a:
print(-1)
else:
while count<n:
a_buf=a[buf-1]
if a_buf==2:
print(count+1)
break
buf=a_buf
count+=1
if count==n:
print(-1) |
p02785 | s734250329 | Accepted | n, k = map(int, input().split())
H = sorted(list(map(int, input().split())), reverse=True)
print(sum(H[k:]))
|
p03371 | s504573278 | Accepted | a, b, c, x, y = [int(i) for i in input().split()]
z = min(x, y)
money = 0
if a + b > c * 2:
money += z * c * 2
if x > y:
if a > c * 2:
money += (x - z) * c * 2
else:
money += (x - z) * a
else:
if b > c * 2:
money += (y - z) * c * 2
else:
money += (y - z) * b
else:
money += x * a + y * b
print(money) |
p02618 | s377053738 | Accepted | def solve():
d = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(d)]
for i in s:
print(i.index(max(i))+1)
return 0
if __name__ == "__main__":
solve() |
p03719 | s330674720 | Wrong Answer | a,b,c = map(int, input().split())
print(['No', 'Yes'][a<c<b]) |
p02784 | s943106110 | Accepted | inp1 =input().split(" ")
HP,N= int(inp1[0]),int(inp1[1])
inp2 = input().split(" ")
ATK = 0
for x in range(N):
ATK += int(inp2[x])
if HP <= ATK:
print("Yes")
else:
print("No") |
p03479 | s515430055 | Accepted | X,Y = map(int,input().split())
ans = 1
Z = X
while Z <= Y//2:
Z *= 2
ans += 1
print(ans) |
p02697 | s325214385 | Accepted | # -*- coding: utf-8 -*-
N,M = map(int, input().split())
if N%2==1:
for i in range(M):
print(M-i,M+1+i)
else:
for i in range(M):
if 4*(i+1)>N:
print(M-i,M+2+i)
else:
print(M-i,M+1+i) |
p03556 | s521646938 | Accepted | n = int(input())
print((int(n**0.5))**2)
|
p02831 | s926152614 | Accepted | import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
A, B = rl()
from fractions import gcd
from functools import reduce
def get_gcd(A):
return reduce(gcd, A)
def get_lcm(A):
def lcm_base(a, b):
return a*b//gcd(a,b)
return reduce(lcm_base, A, 1)
print(get_lcm([A, B]))
|
p02572 | s633216572 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
MOD = 1000000007
ans = 0
powsum = 0
sumpow = 0
for i in range(N):
powsum += A[i]
sumpow += (A[i]*A[i])
powsum = (powsum*powsum)
ans = (powsum-sumpow)/2.0
print(int(ans)%MOD) |
p02547 | s287810989 | Accepted | #coding:utf-8
N = int(input())
D = []
for i in range(N):
d1,d2 = map(int,input().split())
D.append(d1==d2)
for i in range(N-2):
if D[i] and D[i+1] and D[i+2]:
print("Yes")
break
if i == N-3:
print("No") |
p03605 | s799432747 | Accepted | n=input()
if n[0]=="9" or n[1]=="9":
print("Yes")
else:
print("No") |
p02973 | s994221079 | Accepted | import bisect
n = int(input())
colors = [-int(input())]
for _ in range(n-1):
a = int(input())
i = bisect.bisect_right(colors, -a)
if i == len(colors):
colors.append(-a)
else:
colors[i] = -a
print(len(colors)) |
p02684 | s546404097 | Wrong Answer | def main():
N , K = list(map(int,input().split()))
A = list(map(int,input().split()))
A.insert(0,0)
local = 1
tmp = []
tmp.append(local)
for k in range(N):
local = A[local]
if local in tmp:
result = len(tmp) - tmp.index(local)
break
else:
tmp.append(local)
for k in range((K-tmp.index(local)) % result):
local = A[local]
print(local)
if __name__ == '__main__':
main() |
p02791 | s617805797 | Accepted | N = int(input())
P = [int(s) for s in input().split()]
count = 1
minval = P[0]
for i in [idx+1 for idx in range(N-1)]:
if minval > P[i]:
count += 1
minval = P[i]
print(count) |
p03838 | s458902463 | Wrong Answer | x,y = map(int,input().split())
ans = 0
if x*y < 0:
ans += 1
elif y < x:
ans += 2
ans += abs(abs(x)-abs(y))
print(ans) |
p02996 | s082784206 | Accepted | import heapq
import sys
input = sys.stdin.readline
def main():
n = int(input())
abs = [tuple(map(int, input().split())) for _ in range(n)]
pq = []
for ab in abs:
a,b = ab[0],ab[1]
heapq.heappush(pq, tuple([b,a]))
dl = 0
tc = 0
ans = "Yes"
for i in range(n):
ba = heapq.heappop(pq)
dl = ba[0]
tc += ba[1]
if dl < tc:
ans = "No"
break
print(ans)
if __name__ == "__main__":
main() |
p03814 | s088011395 | Wrong Answer | s=input()
ans=0
x=0
y=len(s)-1
for i in range(len(s)):
if s[i]=='A':
x=i
break
for i in range(len(s)-1,0,-1):
if s[-i]=='Z':
y=i
break
print(y-x+1) |
p03817 | s424542824 | Wrong Answer | from math import ceil
x = int(input())
n = (x//11)
x = x%10
r = 0
if 0 < x <= 6:
r = 1
else:
r = 2
print(2*n+r) |
p03408 | s247586914 | Accepted | n = [input() for _ in range(int(input()))]
m = [input() for _ in range(int(input()))]
l = list(set(n))
print(max(0,max(n.count(l[i]) - m.count(l[i]) for i in range(len(l))))) |
p02693 | s090141911 | Accepted | K = int(input())
A, B = map(int, input().split())
r = 'NG'
for x in range(A, B + 1):
if x % K == 0:
r = 'OK'
print(r) |
p02888 | s946847208 | Wrong Answer | N = int(input())
L = list(map(int, input().split()))
cnt = 0
for i in range(N):
for j in range(i + 1, N):
for k in range(j + 1, N):
cnt += (L[k] < L[i] + L[j])
print(cnt) |
p03137 | s763469968 | Accepted | def solve():
N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
diff = []
for i in range(M-1):
diff.append(X[i+1] - X[i])
diff.sort(reverse=True)
print(X[-1] - X[0] - sum(diff[:min(N,M)-1]))
if __name__ == '__main__':
solve() |
p03345 | s386928463 | Wrong Answer |
def resolve():
import sys
input = sys.stdin.readline
# row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
# s = input().rstrip()
a, b, c, k = [int(x) for x in input().rstrip().split(" ")]
if abs(a - b) > 10^18:
print("Unfair")
return
if k % 2 == 0:
print(a - b)
else:
print(b - a)
if __name__ == "__main__":
resolve()
|
p03206 | s352968157 | Accepted | D = (int(input()) - 25)*(-1)
ans = "Christmas"
for i in range(D):
ans = ans + ' Eve'
print(ans)
|
p02791 | s034351573 | Accepted | n = int(input())
p = list(map(int, input().split()))
ret = 1
minp = p[0]
for i in range(1, n):
if p[i] <= minp:
ret += 1
minp = min(minp, p[i])
print(ret)
|
p03380 | s953174448 | Accepted | from bisect import bisect_left
N = int(input())
A = list(map(int,input().split()))
A.sort()
n = A.pop()
index = bisect_left(A, n//2)
if index == 0:
r = A[0]
elif index == N-1:
r = A[N-2]
else:
if abs(n//2-A[index]) <= abs(n//2-A[index-1]):
r = A[index]
else:
r = A[index - 1]
print(*[n,r]) |
p03665 | s269800891 | Accepted | from collections import Counter, defaultdict
import numpy as np
N, P = map(int, input().split())
A = list(map(int, input().split()))
A = [i % 2 for i in A]
d = defaultdict(int)
d.update(Counter(A).items())
if d[1] == 0:
if P == 0:
print(2**N)
else:
print(0)
else:
print(2**(N-1)) |
p02546 | s961813414 | Accepted | a = input()
if(a[-1] == 's'):
print(a+'es')
else:
print(a+'s') |
p03612 | s941602683 | Accepted | N = int(input())
P = list(map(int, input().split()))
marks = [0]*N
for i in range(N):
if P[i]==i+1:
marks[i]=1
b = 0
check = 0
for i in range(1, N):
if marks[i-1]==1 and marks[i]==1:
marks[i]=0
print(sum(marks)) |
p02714 | s620954513 | Wrong Answer | from math import gcd
from functools import reduce
s = 0
n = int(input())
for i in range(1, n+1):
for j in range(1, n+1):
for k in range(1, n+1):
s = s + int(reduce(gcd, (i, j, k)))
print(s)
|
p04005 | s019243610 | Wrong Answer | import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))
if __name__ == "__main__":
a,b,c = I2()
print(0 if a%2 == 0 or b%2 == 0 or c%2 == 0 else min(a*b,b*c)) |
p03544 | s676888623 | Accepted | n = int(input())
L = [0] * (n+1)
L[0] = 2
L[1] = 1
for i in range(2,n+1):
L[i] = L[i-1] + L[i-2]
print(L[-1])
|
p03243 | s932521695 | Accepted | l = list(map(int,input()))
#print(l)
if l[0] <l[1]:
a= str(l[0]+1)
print(a*3)
elif l[0]>l[1]:
print(str(l[0])*3)
else:
if l[1] >= l[2]:
print(str(l[0])*3)
else:
b= str(l[0]+1)
print(b*3)
|
p03478 | s063437728 | Wrong Answer | N,A,B = map(int,input().split())
count = 0
for i in range(1,N+1):
tot = 0
num = i
for j in range(4):
tot = tot + num%10
num = int(num/10)
if tot >= A and tot <= B:
count += i
print(count) |
p03385 | s044406482 | Accepted | s=input()
if s=="abc" or s=="acb" or s=="bac" or s=="bca" or s=="cab" or s=="cba":
print("Yes")
else:
print("No") |
p02817 | s893242646 | Accepted | if __name__=="__main__":
s,t=input().split()
print(t+s) |
p02633 | s852711119 | Accepted | import math
x = int(input())
print(360//math.gcd(x, 360))
|
p03721 | s302446432 | Accepted | n, k = map(int, input().split())
ab = [tuple(map(int, input().split())) for _ in range(n)]
ab.sort()
for a, b in ab:
k -= b
if k <= 0:
print(a)
exit()
|
p03785 | s309733346 | Accepted | N, C, K = map(int, input().split())
p = 0
bus = 0
time = 0
b = sorted([int(input()) for i in range(N)])
for i in range(N):
a = b[i]
if a - time > K or p == C:
p = 0
if p == 0:
time = a
bus += 1
p += 1
print(bus) |
p03317 | s884353473 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
if n==k:
print(1)
exit()
i=n-k
ans=1
while i>0:
i=i-k+1
ans+=1
print(ans) |
p03379 | s137246329 | Wrong Answer | from statistics import median
N=int(input())
X=list(map(int,input().split()))
Y=[0]*N
for i in range(N):
Y[i]=X[i]
X.sort()
for i in range(N):
if X.index(Y[i])<=N//2 :
print(Y[N//2])
else :
print(Y[N//2-1]) |
p03838 | s633856976 | Accepted | x, y = map(int, input().split())
res = 99999999999999
# そのまま
c = y - x
if c >= 0:
res = min(res, c)
# 最初に1かい押す
c = y - (-x)
if c >= 0:
res = min(res, c + 1)
# 最後に1かい押す
c = (-y) - (x)
if c >= 0:
res = min(res, c + 1)
# 2回押す
c = (-y) - (-x)
if c >= 0:
res = min(res, c + 2)
print(res) |
p03163 | s127829854 | Accepted | import sys
# import numpy as np
def IL():
return list(map(int, sys.stdin.readline().rstrip().split()))
N, W = IL()
v_list = [0] * N
w_list = [0] * N
v = 0
w_total = 0
for i in range(N):
w_list[i], v_list[i] = IL()
# dp = np.zeros((N+1, W+1))
dp = [[0] * (W+1) for _ in range(N+1)]
for i in range(N):
for j in range(W+1):
if j >= w_list[i]:
dp[i+1][j] = max(dp[i][j-w_list[i]] + v_list[i], dp[i][j])
else:
dp[i+1][j] = dp[i][j]
print(dp[N][W]) |
p03062 | s196319032 | Accepted | import heapq
import sys
input = lambda: sys.stdin.readline().rstrip()
n = int(input())
a = list(map(int,input().split()))
cal = []
heapq.heapify(cal)
minus = 0
zero = False
for i in a:
if i == 0:
zero = True
if i < 0:
minus += 1
heapq.heappush(cal,abs(i))
if minus % 2 == 0 or zero:
print(sum(cal))
else:
adjust = heapq.heappop(cal)
print(sum(cal)-adjust)
|
p02912 | s537660818 | Accepted | import heapq
def main():
n,m=map(int, input().split())
a = list(map(lambda x: int(x)*(-1), input().split()))
heapq.heapify(a)
for i in range(m):
tmp_min = heapq.heappop(a)
heapq.heappush(a, -1*(-tmp_min//2))
print(-sum(a))
if __name__ == '__main__':
main() |
p03795 | s241139111 | Accepted | a=int(input())
print(a*800-200*(a//15)) |
p03437 | s974117153 | Wrong Answer | x,y=map(int,input().split())
if x==y:
print(-1)
else:
for i in range(1,1000000):
s=x*i
if s>10**18:
print(-1)
exit()
if s%y!=0:
print(s)
exit()
|
p02948 | s859311225 | Wrong Answer | import heapq
n, m = map(int, input().split())
num = sorted([list(map(int, input().split())) for i in range(n)], key = lambda x: x[0])
s = []
heapq.heapify(s)
for i in range(1, m + 1):
for j in num:
if(j[0] <= i):
heapq.heappush(s, j[1])
else:
break
print(sum(s))
|
p04029 | s422107556 | Accepted | N = int(input())
print(N*(N+1)//2) |
p02823 | s949937034 | Accepted | import sys
input = sys.stdin.readline
def main():
N, A, B = map(int, input().split())
tmp = B - A
if tmp&1:
ans = min(A - 1, N - B)
ans += (tmp + 1) // 2
else:
ans = tmp // 2
print(ans)
if __name__ == "__main__":
main() |
p03086 | s631947896 | Wrong Answer | S=input()
start=1
end=0
ans=[]
for _ in range(len(S)):
for i in range(len(S))[end:]:
if S[i] in {"A","C","G","T"}:
start=i
break
for j in range(len(S))[start:len(S)]:
end=len(S)
if S[j] not in {"A","C","G","T"}:
end=j
break
ans.append(end-start)
if max(ans)<0:print(1)
else:print(max(ans)) |
p03254 | s360333557 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, x = map(int, input().split())
A = sorted(list(map(int, input().split())))
res = 0
for i in range(n):
if i == n - 1 and A[i] < x:
continue
if A[i] <= x:
x -= A[i]
res += 1
print(res)
if __name__ == '__main__':
resolve()
|
p03795 | s192983213 | Accepted | N = int(input())
ans = int(800*N - 200*int((N//15)))
print(ans) |
p03160 | s904441000 | Accepted |
INF = 10e5
n = int(input())
h = list(map(int,input().split()))
dp = [INF for _ in range(n)]
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,n):
cost1 = abs(h[i]-h[i-1])
cost2 = abs(h[i]-h[i-2])
dp[i] = min(dp[i-1] + cost1, dp[i-2] + cost2)
print(dp[n-1]) |
p03331 | s985508859 | Accepted | N = int(input())
anslist=[]
for i in range(1,N):
a = str(i)
b = str(N-i)
asum = sum(list(map(int,a)))
bsum = sum(list(map(int,b)))
SUM = asum + bsum
anslist.append(SUM)
print(min(anslist)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.