problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02835 | s653996362 | Wrong Answer | a , b, c = map(int, input().split())
if a + b + c < 22:
print('win')
else:
print('burst') |
p03478 | s377836095 | Accepted | N, A, B = map(int, input().split())
ans = 0
for i in range(1, N+1):
j = list(str(i))
n = len(j)
a = 0
for l in range(n):
a += int(j[l])
if a >= A and a <= B:
ans += i
print(ans)
|
p02859 | s621679124 | Accepted | a=int(input())
print(a**2) |
p03000 | s614234953 | Accepted | import sys
import math
import bisect
def main():
n, m = map(int, input().split())
A = list(map(int, input().split()))
B = [0]
for a in A:
B.append(B[-1] + a)
ans = 0
for b in B:
if b <= m:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03150 | s011627909 | Wrong Answer | import math
import sys
import collections
import bisect
readline = sys.stdin.readline
def main():
keyence = "keyence"
s = readline().rstrip()
lenS = len(s)
for i in range(1, 7):
if s.count(keyence[0:i]) > 0:
idx = s.index(keyence[0:i]) + i
if s[idx-1:lenS].count(keyence... |
p03127 | s655137407 | Accepted | import math
from functools import reduce
def gcd(numbers):
return reduce(math.gcd, numbers)
def main():
N = int(input())
A = [int(x) for x in input().split()]
ans = gcd(sorted(A,reverse=True))
print(ans)
if __name__ == '__main__':
main() |
p02623 | s605665091 | Accepted | from bisect import bisect_right
N, M, K = map(int, input().split())
A = [0] + list(map(int, input().split()))
B = [0] + list(map(int, input().split()))
for i in range(1, N+1):
A[i] += A[i-1]
for i in range(1, M+1):
B[i] += B[i-1]
b_cnt = M
ans = 0
for a_cnt in range(N+1):
if A[a_cnt] > K:
conti... |
p03073 | s132451624 | Accepted | def main():
S = input()
L = len(S)
a, b = 0, 0
for i in range(L):
if i % 2 == 0:
if S[i] == '0':
a += 1
else:
b += 1
else:
if S[i] == '1':
a += 1
else:
b += 1
print(min(a, ... |
p02594 | s975192501 | Accepted | a = int(input())
if a >= 30:
print("Yes")
else:
print("No") |
p04034 | s300004460 | Accepted | N,M=map(int,input().split())
arr=[[0,1,0] for _ in range(N)]
arr[0]=[1,1,1]
for i in range(M):
a,b=map(int,input().split())
arr[a-1][1]-=1
arr[b-1][1]+=1
if arr[a-1][0]==1:
arr[b-1][0]=1
if arr[a-1][2]==1:
arr[a-1][2],arr[b-1][2]=0,1
if arr[a-1][1]==0:
arr[a-1][0]=0
ans=0
for i in range(N):
if... |
p03379 | s620353136 | Accepted | n = int(input())
x = list(map(int, input().split()))
a = sorted(x)
mid_n = len(a)//2
right = a[mid_n]
left = a[mid_n-1]
for i in range(n):
if right > x[i]:
print(right)
else:
print(left) |
p03107 | s095191446 | Accepted | from collections import Counter
S = list(input())
c = Counter(S)
c0 = c['0']
c1 = c['1']
print(2*min(c0, c1)) |
p02847 | s467491846 | Accepted | li = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
st = input()
print(7-li.index(st)) |
p03475 | s583273981 | Accepted | n = int(input())
l = [list(map(int,input().split())) for i in range(n-1)]
for i in range(n):
ans = 0
if i == n-1:
print(0)
exit()
for j in range(i,n-1):
ans = l[j][0]+l[j][1]+l[j][2]*(max(((ans-l[j][1]+l[j][2]-1)//l[j][2]),0))
print(ans)
|
p02623 | s533228659 | Accepted | from sys import stdin, stdout
input = stdin.readline
print = stdout.write
n, m, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
for i in range(1, n + 1):
a[i] += a[i - 1]
for i in range(1, m + 1):
b[i] += b[i - 1]
i, j, z = 0, m, 0
while i <= n a... |
p03437 | s909854599 | Wrong Answer | x,y=map(int,input().split())
if y%x==0:
print(-1)
else:
print(x) |
p03103 | s420142678 | Accepted | n,m = map(int,input().split())
a = [list(map(int, input().split())) for _ in range(n)]
ans = 0
cnt = 0
a = sorted(a, key=lambda x:x[0])
for i in range(n):
if cnt + a[i][1] <m:
ans += a[i][0]*a[i][1]
cnt +=a[i][1]
else:
ans += a[i][0]*(m-cnt)
break
print(ans) |
p02708 | s423544269 | Accepted | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
N, K = lr()
answer = 0
for i in range(K, N+2):
low = i * (i-1) // 2
high = i * (N+N-i+1) // 2
answer += high - low + 1
answer %= MOD
print(answer%MO... |
p04029 | s331506247 | Wrong Answer | n = int(input())
print(n*(n-1)/2) |
p03698 | s990937805 | Accepted | s = input()
lst1 = []
for i in s:
if i in lst1:
print("no")
exit()
else:
lst1.append(i)
print("yes") |
p02912 | s293291493 | Accepted | import math # factorical（階乗) # hypot(距離)
import heapq
# from fractions import gcd # Python3.5以前 # lcm（最小公倍数） = (a*b)//gcd(a,b)
# from fractions import Fraction
# from math import gcd # Python3.6以降
# --------------------------------------------------------------
n,m = map(int,input().split())
price = list(map(in... |
p02690 | s233709760 | Accepted | x = int(input())
n = 120
for i in range(n):
for j in range(i):
if x == i**5-j**5:
print(i,j)
exit(0)
if x == i**5+j**5:
print(i,-j)
exit(0) |
p04005 | s610940025 | Wrong Answer | A, B, C = map(int, input().split())
left = C // 2
right = C - left
ans = A * B * abs(left - right)
print(ans)
|
p03471 | s481375379 | Accepted | n,y=map(int,input().split())
for i in range(n+1):
for j in range(n-i+1):
if 10000*i+5000*j==y-1000*(n-i-j):
print(i,j,n-i-j)
exit()
print(-1,-1,-1)
|
p02546 | s908264343 | Accepted | s = input()
if s[-1] == 's':
print(s + 'es')
else:
print(s + 's') |
p03067 | s597213473 | Accepted | a,b,c = map(int,input().split())
if a < c < b or b < c < a:
print('Yes')
else:
print('No') |
p02659 | s118249905 | Wrong Answer | a,b=map(float,input().split())
print(int(a*(int(b*100))/100)) |
p02773 | s610831481 | Accepted | from collections import Counter
def main():
N = int(input())
A = [input() for _ in range(N)]
C = Counter(A)
most_c = C.most_common()
max_num = most_c[0][1]
ANS = []
for c in most_c:
if c[1] < max_num:
break
ANS.append(c[0])
for ans in sorted(ANS):
p... |
p02817 | s832516631 | Accepted | S, T = input().split()
print(T + S) |
p02713 | s271083575 | Accepted | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
s=0
K=int(input())
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
s=s+gcd(i,j,k)
print(s) |
p03814 | s685863837 | Accepted | s = input()
t =s[::-1]
a = s.index('A')
z = t.index('Z')
print(len(s)-a-z)
|
p03387 | s246117318 | Wrong Answer | # C - Same Integers
# https://atcoder.jp/contests/abc093/tasks/arc094_a
nums = list(map(int,input().split()))
abc= sum(nums)
X = max(nums)
if X%2 != abc%2:
X + 1
print((3*X - abc)//2)
# 増加させるかず -> 3X - abc
# 操作回数 -> (3X - abc) //2
|
p02833 | s057159226 | Accepted | n = int(input())
if n % 2 == 1:
print(0)
else:
n //= 2
ans = 0
while n >= 5:
n //= 5
ans += n
print(ans) |
p03071 | s255598140 | Accepted | a,b = map(int,input().split())
if a >b:
print(2*a-1)
elif a == b:
print(a+b)
else:
print(2*b-1)
|
p03657 | s320595136 | Accepted | a,b = map(int,input().split())
if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
print("Possible")
else:
print("Impossible") |
p02595 | s563508464 | Accepted | import sys
import math
count = 0
N, D = map(int, input().split())
for _ in range(N):
x, y = map(int, input().split())
dis = math.sqrt(x ** 2 + y ** 2)
if dis <= D:
count += 1
print(count)
|
p02693 | s957434390 | Accepted | # coding: utf-8
# Your code here!
K = int(input())
A, B = map(int, input().split())
for i in range(A, B + 1):
if i % K == 0:
print('OK')
exit()
else:
print('NG') |
p03131 | s667581697 | Wrong Answer | K,A,B=map(int,input().split())
bis=1
if K==1:
bis+=1
elif A>=B-1 or K-A+1<=0:
bis+=K
else:
if (K-(A-1))%2==0:
bis=A+int((B-A)*(K-(A-1))//2)
else:
bis=A+(B-A)*(K-(A-1))//2+1
print(bis) |
p02606 | s011471451 | Accepted | import sys
L,R,d = map(int, sys.stdin.readline().split())
#N = int(sys.stdin.readline())
ans = 0
for i in range(1,int(R/d) + 1):
if d * i < L:
continue
if d * i > R:
break
ans += 1
print(ans)
|
p03012 | s311195976 | Accepted | n = int(input())
w = list(map(int,input().split()))
l = []
for i in range(n):
a = (abs(sum(w[:i+1]) - sum(w[i+1:])))
l.append(a)
print(min(l)) |
p03061 | s053564160 | Wrong Answer | import sys
import collections
INF = 10**18
ans = 0
import math
if __name__ == "__main__":
n = int(input())
a = sorted(list(map(int,input().split())))
l = 1
for i in range(1,n):
c = math.gcd(a[0],a[i])
ans = max(ans,c)
print(ans) |
p03474 | s555034824 | Accepted | a,b=map(int,input().split())
s=str(input())
f= s[a]=="-" and len(s)==a+b+1 and s.count("-")==1
print("Yes" if f is True else "No") |
p02959 | s707907501 | Accepted | N=int(input())
A=[int(s) for s in input().split(" ")]
B=[int(s) for s in input().split(" ")]
Ans1=0
Ans1=sum(A)
for i in range(N):
if B[i]-A[i]<0:
A[i]=A[i]-B[i]
else:
A[i+1]=max(A[i+1]-(B[i]-A[i]),0)
A[i]=0
Ans2=0
Ans2=sum(A)
print(Ans1-Ans2) |
p03073 | s148919855 | Wrong Answer | s = input()
ans0 = 0
ans1 = 0
for i, s_i in enumerate(s):
if i % 2 == 0:
if s_i == '0':
ans1 += 1
else:
ans0 += 1
else:
if s_i == '0':
ans0 += 1
else:
ans1 += 1
print(ans0, ans1)
print(min(ans0, ans1))
|
p03854 | s926189076 | Accepted | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
s = input()
word = ['eraser', 'erase', 'dreamer', 'dream']
for x in word:
s = s.replace(x, '')
if s == '':
print('YES')
else:
print('NO')
... |
p03095 | s356141956 | Wrong Answer | n = int(input())
s = list(input())
mod = 10**9+7
alp = [0] * 26
for i in range(n):
alp[ord(s[i]) - ord("a")] += 1
ans = 1
for c in alp:
if (c != 0):
ans *= (c+1) % mod
print(ans - 1)
|
p03471 | s607627704 | Accepted | n, y = map(int, input().split())
for i in range(n + 1):
for ii in range(n - i + 1):
if 10000 * i + 5000 * ii + 1000 * (n - i - ii) == y:
print('{} {} {}'.format(i, ii, n - i - ii))
exit()
print('-1 -1 -1')
|
p03774 | s806610230 | Wrong Answer | n,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)]
cd=[list(map(int,input().split())) for _ in range(m)]
for i in ab:
e=10**8
f=0
for p,j in enumerate(cd):
g=abs(i[0]-j[0])+abs(i[1]-j[1])
if e>g:
e,f=g,p
print(f+1) |
p02748 | s067921581 | Wrong Answer | import cmath
import sys
INF=10**18
MOD=10**9+7
MAX=10**5+7
def main():
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 i in range(M):
x,y,c=map(int, input().split())
x-=1
y-=1
ans=max(ans, a[x]+b[y]-c)
print(... |
p03680 | s052821729 | Accepted | N=int(input())
A=[0]*(N+1)
for k in range(1,N+1):
A[k]=int(input())
T=[False]*(N+1)
x=1
I=0
while not T[x] and x!=2:
T[x]=True
I+=1
x=A[x]
if x==2:
print(I)
else:
print(-1)
|
p03644 | s984267047 | Accepted | N = int(input())
k = 0
while True:
if 2**k > N:
break
ans = 2 ** k
k +=1
print(ans) |
p03705 | s455767375 | Accepted | n,a,b=map(int,input().split())
if a>b:
print(0)
elif a==b:
print(1)
elif n==1:
print(0)
elif n==2:
print(2)
else:
print((b-a)*(n-2)+1) |
p02719 | s446716591 | Accepted | N,K = map(int,input().split())
N = N % K
if K - N > N:
print(N)
exit()
print(K - N) |
p03339 | s495515788 | Accepted | n = int(input())
line = list(input())
# 各地点の人について，背を向けている人を数える。無駄が多い？
back = [0] * n
wester, easter = 0, 0
for i, p in enumerate(line):
back[i] = wester
if p == 'W':
wester += 1
i = n
for p in line[::-1]:
i -= 1
back[i] += easter
if p == 'E':
easter += 1
print(min(back))
|
p04031 | s073221506 | Accepted | n = int(input())
A = list(map(int,input().split()))
ans = float("inf")
for i in range(min(A),max(A)+1):
cost = 0
for j in A:
cost += (j-i)**2
ans = min(ans,cost)
print(ans) |
p02819 | s638648807 | Wrong Answer | x = int(input())
def is_prime(num):
for i in range(2, num):
if num % i == 0:
return False
return True
for i in range(x, 10 ** 5):
if is_prime(i):
print(i)
exit()
|
p02900 | s219595971 | Accepted | from fractions import gcd
A,B = map(int,input().split())
g = gcd(A,B)
from collections import Counter
def factorize(n):
d = Counter()
m = 2
while m*m <= n:
while n%m == 0:
n //= m
d[m] += 1
m += 1
if n > 1:
d[n] += 1
return d
fs = factorize(g)
print... |
p03861 | s447812591 | Accepted | a,b,x=map(int,input().split())
ap=a//x
bp=b//x
ans=bp-ap
if a%x==0:
ans+=1
print(ans) |
p02797 | s228200422 | Accepted | n, k, s = map(int, input().split())
#%%
billion = 1000000000
if s == billion:
front = [s] * k
back = [1] * (n - k)
else:
front = [s] * k
back = [s+1] * (n - k)
front.extend(back)
print(*front) |
p03351 | s628952031 | Wrong Answer | a, b, c, d = map(lambda x: int(x), input().split())
if abs(a - c) <= d:
print('Yes1')
elif abs(a - b) <= d and abs(b - c) <= d:
print('Yes2')
else:
print('No') |
p02899 | s536137056 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=[0]*n
for i in range(n):
ans[a[i]-1]+=(i+1)
ans[a[i]-1]=str(ans[a[i]-1])
print(" ".join(ans)) |
p02548 | s915915027 | Accepted | #pypyで通らないと思ったけど普通に通るやん
'''
Created on 2020/09/19
@author: harurun
'''
def main():
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N=int(pin())
ans=0
for i in range(1,N):
for j in range(1,N+1):
if N-i*j>0:ans+=1
else:break
print(ans)
return
main() |
p02665 | s649614622 | Accepted | from itertools import accumulate
N = int(input())
a = tuple(map(int,input().split()))
s = list(accumulate(a))
b = [0]*(N+1)
if N == 0 and a[0] > 1:
print(-1)
exit()
if a[0] == 0:
b[0] = 1
ans = 1
flag = 0
for d in range(1,N+1):
b[d] = b[d-1]-a[d]
tmp = min(s[-1]-s[d],2*b[d-1]-a[d])
if b[d] > tmp... |
p02783 | s265797317 | Wrong Answer | H, A = map(int, input().split())
ans = H // A + 1
print(ans)
|
p02682 | s898018648 | Wrong Answer | a,b,c,k = map(int,input().split())
if a >= k:
print(k)
elif a+b >=k:
print(k)
else:
print(a*1+b*0 +(k-a-b)*(-1))
|
p02675 | s013687503 | Accepted | var = (input())
end = var[-1]
end = int(end)
hon_list = [2, 4, 5, 7, 9]
pon_list = [0, 1, 6, 8]
bon_list = [3]
HON = "hon"
PON = "pon"
BON = "bon"
if end in hon_list:
print(HON)
elif end in pon_list:
print(PON)
elif end in bon_list:
print(BON)
|
p03071 | s084378362 | Wrong Answer | line = input()
a, b = [int(n) for n in line.split()]
soma0= a + b
soma1 = a
a = a-1
soma1 = soma1 + a
a = a-1
soma2 = b
b = a-1
soma2 = soma2 + b
b = b-1
if soma0>=soma1 and soma0>=soma2:
print(soma0)
elif soma1>=soma0 and soma1>=soma2:
print(soma1)
else:
print(soma2)
|
p03221 | s127334060 | Wrong Answer | N,M=[int(i) for i in input().split()]
PY=[[] for _ in range(N)]
py=[]
for i in range(M):
p,y=[int(i) for i in input().split()]
p-=1
py.append((p,y))
PY[p].append(y)
for i in range(N):
PY[i].sort()
for i in range(M):
p,y=py.pop(0)
#print(PY[p].index(y))
p_zero=6-len(str(p))
y_zero=... |
p02627 | s424053629 | Accepted | a = input()
if a.isupper():
print("A")
else:
print("a") |
p03107 | s457249949 | Accepted | import itertools
import sys
input = sys.stdin.readline
S = input().rstrip('\n')
N = len(S)
print(2*min(S.count('0'), S.count('1')))
# for i in itertools.count():
# # print(S)
# S = S.replace('01', '').replace('10', '')
# if not S:
# break
# if S.count('0') == 0 or S.count('1') == 0:
# ... |
p02772 | s608688050 | Wrong Answer | s = int(input())
arr = [int(i) for i in input().split(maxsplit=(s - 1))]
a = []
n = -1
for i in arr:
if i % 2 == 0:
a.append(i)
for i in a:
n = 0
if i % 3 != 0 and i % 5 != 0:
n = 1
print('DENIED')
break
if n != 0:
exit()
if n == 0:
print('APPROVED')
|
p03493 | s894555396 | Accepted | X = input()
print(X.count('1')) |
p03478 | s318197635 | Accepted | n, a, b = map(int, input().split())
ans = 0
for i in range(1, n+1):
seq = sum(int(j) for j in str(i))
if a <= seq <= b:
ans += i
print(ans) |
p03699 | s127061953 | Wrong Answer | N = int(input())
S = [int(input()) for i in range(N)]
max = sum(S)
i = 0
while True:
if max % 10 != 0:
print(max)
exit()
else:
S.sort()
max -= S[i]
i += 1
if max <= 0:
print(0)
exit() |
p02791 | s350436387 | Wrong Answer | N = input()
P = input().split(' ')
count = 0
PM = min(P)
for i, Pi in enumerate(P):
if i == 0:
count = count +1
Pmin = Pi
elif Pmin< P[i]:
pass
else:
count = count +1
Pmin = Pi
print(count) |
p03814 | s554035889 | Accepted | s=input()
Acnt = 0
Zcnt = len(s)-1
while 1:
if s[Acnt] == 'A':
Acnt += 1
break
else:
Acnt += 1
while 1:
if s[Zcnt] == 'Z':
Zcnt += 1
break
else:
Zcnt -= 1
print(Zcnt-Acnt+1) |
p02675 | s142016080 | Accepted | N = int(input())
ans = 0
if N > 10:
ans = N - (int(N / 10) * 10)
else:
ans = N
if ans == 3:
print('bon')
elif ans == 0 or ans == 1 or ans == 6 or ans == 8:
print('pon')
else:
print('hon') |
p02682 | s682006132 | Accepted | a,b,c,k = map(int,input().split())
ans = 0
ans += min(a, k)
k -= a
k -= b
ans -= max( k, 0)
print(ans)
|
p03062 | s764506936 | Accepted | n = int(input())
la = [int(w) for w in input().split()]
ans = sum([abs(w)for w in la])
if len([w for w in la if w < 0]) % 2 == 0:
print(ans)
exit()
sla = sorted([abs(w)for w in la])
ans -= sla[0]*2
print(ans)
|
p03611 | s169120262 | Accepted | from collections import Counter as C
_ = input()
a = C([int(x) for x in input().split()])
ans = 0
for k in a:
ans = max(ans, a[k-1] + a[k] + a[k+1])
else:
print(ans) |
p03495 | s719977352 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
dic = {}
B = []
for a in A:
if a in dic:
dic[a] += 1
else:
dic[a] = 1
for v in dic.values():
B.append(v)
B.sort()
if len(B) <= K:
print(0)
else:
print(sum(B[K:])) |
p03352 | s205192472 | Wrong Answer | import math
X=int(input())
max_num=0
for i in range(1,10):
tei=math.floor(X**(1/i))
if max_num<tei**i:
max_num=tei**i
print(max_num) |
p02959 | s661499211 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
cnt=0
for i in range(n):
if a[n-i]>=b[n-1-i]:
cnt+=b[n-1-i]
else:
if a[n-1-i]-(b[n-1-i]-a[n-i])>=0:
a[n-1-i]-=b[n-1-i]-a[n-i]
cnt+=b[n-1-i]
else:
cnt+=a[n-i]+a[n-1-i]
a[n-i]=0
print(cnt) |
p03449 | s563072469 | Accepted | N = int(input())
A = [list(map(int, input().split())) for _ in range(2)]
A = [[0] + [sum(A[i][:j+1]) for j in range(N)] for i in range(2)]
print(max([A[0][j] + A[1][-1] - A[1][j-1] for j in range(1, N + 1)]))
|
p03062 | s768715180 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
if 0 in A:
S=0
for a in A:
S+=abs(a)
print(S)
else:
X=0
S=0
for a in A:
X+=(a<0)
S+=abs(a)
if X%2==0:
print(S)
else:
b=min(A,key=lambda x:abs(x))
print(S-2*b) |
p03319 | s748558805 | Wrong Answer | N, K = map(int, input().split())
Alist = list(map(int, input().split()))
if K >= N:
print(1)
else:
from math import ceil
one = Alist.index(1)
left = N
right = N - one - 1
print(ceil(left % K) + ceil(right % K))
|
p02582 | s723602535 | Wrong Answer | s = str(input())
if s[1]== "R" and s[2]=="R" and s[0]== "R":
print(3)
elif s[1] == "S" and s[2] == "S" and s[0] == "S":
print(0)
elif s[1] == "S" and s[0]=="R":
print(1)
elif s[1] =="S" and s[2]=="R":
print(1)
elif s[1] == "S" and s[0]=="R":
print(1)
elif s[1] =="R":
if s[0] =="R" or s[2]=="R":
print(2... |
p03861 | s854975893 | Accepted | a,b,x=map(int, input().split())
print(b//x-(a-1)//x) |
p03062 | s080773921 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
D=0
for i in range(N-1):
a=A[i]
b=A[i+1]
if a>=0:
D+=a
else:
A[i]=a*(-1)
A[i+1]=b*(-1)
D+=a*(-1)
D+=A[N-1]
x=A[N-2]+A[N-1]
E=D-2*x
print(max(D,E)) |
p02916 | s027474030 | Accepted | n = int(input())
order = list(map(int, input().split()))
satisfaction = list(map(int, input().split()))
addition = list(map(int, input().split()))
index = order[0]
ans = 0
for i in order:
ans += satisfaction[i-1]
if i-1 == index:
ans += addition[i-2]
index = i
print(ans) |
p02775 | s986607651 | Accepted | s=input()
dp0=[0]*(len(s)+1)
dp1=[0]*(len(s)+1)
dp1[0]=1
for i in range(1,len(s)+1):
n=int(s[i-1:i])
dp0[i]=min(dp0[i-1]+n,dp1[i-1]+10-n)
dp1[i]=min(dp0[i-1]+(1 if n+1==10 else n+1),dp1[i-1]+10-n-1)
print(dp0[-1]) |
p03659 | s098291102 | Accepted | N = int(input())
A = list(map(int, input().split()))
T = 0
S = sum(A)
ans = 10**18
for a in A[:-1]:
T += a
S -= a
ans = min(ans, abs(T - S))
print(ans)
|
p03210 | s946485164 | Accepted | X = int(input())
if X == 3 or X == 5 or X == 7:
print("YES")
else:
print("NO") |
p02881 | s603825326 | Wrong Answer | import math
def main():
n = int(input())
m = math.sqrt(n)
ans = []
for i in range(1, int(m) + 1):
div = n / i
if not float.is_integer(div):
continue
ans.append((div+i)-2)
print(min(ans))
if __name__ == '__main__':
main() |
p03665 | s708882201 | Accepted | from math import comb
n, p = list(map(int, input().split()))
a = list(map(int, input().split()))
n0 = 0
n1 = 0
for i in range(n):
if a[i] % 2 == 0:
n0 += 1
else:
n1 += 1
x = 0
if p == 0:
for i in range(0, n1+1, 2):
x += comb(n1, i)
else:
for i in range(1, n1+1, 2):
x +... |
p04005 | s820021692 | Wrong Answer | a, b, c = list(map(int, input().split()))
if a % 2 == 1 and b % 2 == 1 and c % 2 == 1:
if a != 1:
print(b * c)
elif b != 1:
print(a * c)
else:
print(a * b)
else:
print(0)
|
p02664 | s329708116 | Accepted | t=str(input())
print(t.replace("?","D")) |
p02951 | s263441257 | Accepted | a, b, c = map(int, input().split())
ans = c + b - a
if ans >= 0:
print(ans)
else:
print(0) |
p03962 | s042977643 | Wrong Answer | A = input()
print(len(set(A))) |
p02900 | s774409967 | Wrong Answer | def main():
import fractions
import math
A, B = map(int, input().split())
gcd = fractions.gcd(A, B)
tmp = gcd
primes = set()
for i in range(2, math.ceil(gcd**(1/2)) + 1):
if tmp % i == 0:
while(tmp % i == 0):
tmp = tmp//i
primes.add(i)
if... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.