problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02665 | s393818193 | Accepted | n = int(input())
a = [int(an) for an in input().split()]
remaining_leafs = sum(a)
layer_count = 1
vertex_count = 0
for i in range(len(a)):
vertex_count += layer_count
layer_count -= a[i]
remaining_leafs -= a[i]
if layer_count < 0:
vertex_count = -1
break
layer_count = min(layer_cou... |
p03417 | s107531462 | Accepted | n,m = map(int,input().split())
if(( n ==1) &( m == 1)):
print(1)
if( (n == 1) & (m != 1)):
print(m - 2)
if( (n != 1) & (m == 1)):
print(n - 2)
if ((n != 1) &( m != 1)):
print(n*m -(2*n + 2*m -4)) |
p02631 | s332592910 | Accepted | def main():
N = int(input())
A = [int(a) for a in input().split()]
xor_all = A[0]
for i in range(1, N):
xor_all ^= A[i]
for i in range(N):
if i != N - 1:
print(A[i]^xor_all, end=" ")
else:
print(A[i]^xor_all)
if __name__ == "__main__":
main(... |
p02712 | s397589051 | Accepted | n = int(input())
a = 0
for n in range(1,n+1):
if n % 3 != 0 and n % 5 != 0:
a += n
print(a) |
p03760 | s702999193 | Accepted | O = str(input())
E = str(input())
P = ''
for i in range(len(E)) :
P = P + O[i]
P = P + E[i]
if len(O) == len(E) :
print(P)
else :
print(P + O[-1])
|
p03479 | s031193806 | Accepted | x,y = map(int,input().split())
ans=0
while x*2**ans<=y: ans+=1
print(ans) |
p02657 | s526909237 | Accepted | A, B = map(int, input().split())
print(A * B) |
p02888 | s662857440 | Wrong Answer | import bisect
n = int(input())
l = [int(x) for x in input().split()]
l.sort()
ans = 0
for a in range(n - 1):
for b in range(a + 1, n):
c = bisect.bisect(l, l[a] + l[b])
if b < c:
ans += c - (b + 1)
print(ans) |
p03860 | s664391058 | Accepted | at,s,co=input().split()
print(at[0]+s[0]+co[0])
|
p03644 | s653828865 | Wrong Answer | S=[1,2,4,8,16,32,64]
a=int(input())
S.append(a)
S=sorted(S)
print(S[max(S.index(a)-1,0)]) |
p02731 | s614266780 | Accepted | l = int(input().strip())
l1 = l / 3
print(l1 ** 3)
|
p02594 | s976401572 | Wrong Answer | K = int(input())
x = 7
count = 1
if K % 2 ==0:
print("-1")
exit(0)
for i in range(100000000000):
if x % K == 0:
print(count)
exit(0)
else:
x = 10*x + 7
count += 1
print("-1") |
p03637 | s329984182 | Accepted | import numpy as np
N=int(input())
A=np.array(list(map(int,input().split())))
odd=np.count_nonzero(A%2!=0)
four=np.count_nonzero(A%4==0)
ans='No'
if odd==1 and four>=1:
ans='Yes'
elif odd==2 and four>=2:
ans='Yes'
else:
if odd+four==N and odd-1<=four:
ans='Yes'
elif odd<=four:
ans='Yes'
print(ans) |
p03387 | s345434939 | Accepted | a, b, c = list(map(int, input().split()))
m = max(a, b, c)
s = sum([a, b, c])
if (3 * m - s) % 2 == 0:
print((3 * m - s) // 2)
else:
print((3 * m + 3 - s) // 2) |
p03644 | s229633117 | Wrong Answer | N = int(input())
x = 0
while N > 2**x:
x += 1
else:
result = 2 **(x -1)
print(result) |
p03042 | s017999452 | Accepted | s=input()
s1=s[0]+s[1]
s2=s[2]+s[3]
if (s1[0]=='0' and s1!='00') or s1=='11' or s1=='12':
ans1='MM'
else:
ans1='YY'
if (s2[0]=='0' and s2!='00') or s2=='11' or s2=='12':
ans2='MM'
else:
ans2='YY'
if ans1==ans2=='MM':
print('AMBIGUOUS')
elif ans1==ans2=='YY':
print('NA')
else:
print(ans1+ans2) |
p02835 | s469883128 | Accepted | A = list(map(int, input().split()))
if sum(A) >= 22:
print('bust')
else:
print('win') |
p03011 | s302488226 | Accepted | p, q, r = map(int, input().split())
print(min([p + q, q + r, r + p])) |
p03327 | s692096869 | Accepted | n=int(input())
if n>=1000:
print("ABD")
else:
print("ABC")
|
p02697 | s676569776 | Accepted | n,m = map(int, input().split())
a = (n-1) // 2
d = 1
memo = set([])
for i in range(m):
if n-d in memo or 2*d == n:
d += 1
memo.add(d)
print(a, a+d)
a -= 1
d += 2
|
p02772 | s686781441 | Accepted | n = input()
_list = input().split(" ")
_list = [int(x) for x in _list]
even = [x for x in _list if x % 2==0]
answer = []
for x in even:
if x % 3 == 0 or x % 5 == 0:
answer.append(True)
if len(even) ==len(answer):
print("APPROVED")
else:
print("DENIED") |
p03449 | s316569036 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
for i in range(1,n-1):
if ans<sum(a[:i])+sum(b[i:])+b[i-1]:
ans=sum(a[:i])+sum(b[i:])+b[i-1]
print(ans) |
p02631 | s294843286 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
ans = []
tmp = a[0]
for i in range(1,n):
tmp = tmp^a[i]
for i in range(n):
ans.append(tmp^a[i])
print(ans) |
p02724 | s072761414 | Accepted | x = int(input())
ans = (x//500)*1000 +((x%500)//5)*5
print(ans) |
p03359 | s113311262 | Accepted | a,b=map(int,input().split())
print(a-1+(a<=b)) |
p03796 | s767336487 | Wrong Answer | # -*- coding: utf-8 -*-
def main():
N = int(input())
ans = 1
for i in range(N):
ans *= (i + 1)
ans % (10 ** 9 + 7)
print(ans)
if __name__ == "__main__":
main() |
p03711 | s543499340 | Accepted | x, y = map(int, input().split())
a = [1,3,5,7,8,10,12]
b = [4, 6, 9, 11]
c = [2]
r = 'No'
if x in a and y in a:
r = 'Yes'
if x in b and y in b:
r = 'Yes'
if x in c and y in c:
r = 'Yes'
print(r) |
p03262 | s326965835 | Wrong Answer | n,x=map(int,input().split()) #n都市xスタート座標
a=list(map(int,input().split()))
import fractions
if n==1:
print(a[0]-x)
quit()
p=[]
for i in range(1,n):
p.append(a[i]-a[i-1])
if len(p)==1:
ans=1
else:
ans=p[0]
for i in range(1,n-1):
ans=fractions.gcd(ans,p[i])
print(abs(ans)) |
p02755 | s232167324 | Accepted | # coding: utf-8
# Your code here!
import math
a, b = map(int,input().split())
Flg = True
for i in range(10**5+2):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
Flg = False
break
if Flg:
print(-1) |
p03773 | s596590216 | Wrong Answer | a, b = map(int,input().split())
ans = a + b
for i in range(100000):
if ans > 24:
ans -= 24
elif ans <= 24:
break
print(ans)
|
p03779 | s090315064 | Accepted | X = int(input())
tmp = 0
ans = 0
while tmp < X:
tmp += ans+1
ans += 1
print(ans) |
p03285 | s179865542 | Wrong Answer | n = int(input())
if (n % 7) % 4 == 0:
print('Yes')
else:
print('No') |
p02633 | s828762596 | Accepted | X = int(input())
tmp = X
count = 1
while 360 != tmp:
tmp += X
count += 1
if tmp > 360:
tmp -= 360
print(count) |
p02958 | s018172569 | Wrong Answer | N = int(input())
P = list(map(int, input().split()))
la = list(range(1,N+1))
cnt1 = 0
cnt2 = 0
while cnt1 < N-1:
if P[cnt1] == la[cnt1]:
cnt2 += 1
cnt1 += 1
if cnt2 >= N-2:
print('YES')
else:
print('NO') |
p03657 | s505858033 | Wrong Answer | A, B = map(int, raw_input().split())
if (A + B) % 3 == 0:
print "Possible"
elif (A or B) % 3 == 0:
print "Possible"
else:
print "Impossible"
|
p02754 | s759721509 | Wrong Answer | N, A, B = map(int, input().split())
x = A + B
num = 1
y = 0
while N <= y:
y = x * num
num += 1
if N - num * x < A:
print( A * num + ( N - num * x ) )
else:
print( A * ( num + 1 ) ) |
p02695 | s044000350 | Wrong Answer | import itertools
N, M, Q = list(map(int, input().split()))
a = []
b = []
c = []
d = []
for i in range(Q):
aa, bb, cc, dd = list(map(int, input().split()))
a.append(aa)
b.append(bb)
c.append(cc)
d.append(dd)
Ms = [i for i in range(1, M+1)]
res = 0
for s in itertools.combinations(Ms, N):
sum_ = 0
for j i... |
p03544 | s744106404 | Wrong Answer | n = int(input())
l = [2, 1]
for _ in range(n):
k = l[-1] + l[-2]
l.append(k)
print(l[n-1]) |
p03251 | s605354588 | Accepted | N,M,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
xmax = max(x)
ymin = min(y)
ans = 'War'
for z in range(X+1,Y+1):
if xmax < z <= ymin:
ans = 'No War'
break
print(ans) |
p03243 | s042581870 | Accepted | n=int(input())
l=[111,222,333,444,555,666,777,888,999]
for i in range(1000):
if n in l:
print(n)
exit()
n+=1
|
p02705 | s361608180 | Wrong Answer | N = int(input())
print(N*3.1415) |
p03627 | s556089783 | Wrong Answer | printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n = inn()
a = inl()
h = {}
for x in a:
... |
p02645 | s515676653 | Accepted | S = input()
print(S[0]+S[1]+S[2]) |
p02727 | s921529195 | Accepted | import sys
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
import math
MOD = 10 ** 9 + 7
# MOD = 998244353
# sys.setrecursionlimit(10**8)
x, y, a, b, c = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input()... |
p03261 | s852955730 | Accepted | N = int(input())
Word = []
tail = ""
for i in range(N):
W = list(input())
head = W[0]
W = ''.join(W)
if i != 0:
if tail != head or (W in Word):
print("No")
exit()
tail = W[-1]
Word.append(W)
print("Yes") |
p02970 | s927522764 | Accepted | import math
N, D = map(int, input().split())
print(math.ceil(N/(2*D+1))) |
p02983 | s634030188 | Accepted | L, R = map(int, input().split())
a=[]
if R-L>=2019:
ans=0
else:
l, r = L%2019, R%2019
ans=2018**2
for i in range(l,r):
for j in range(l+1,r+1):
k = (i*j) % 2019
ans = min(ans,k)
print(ans) |
p02854 | s148842826 | Wrong Answer | import sys
n = int(input())
a = list(map(int, input().split()))
postCenter=dif=0
tmp = sys.maxsize
for i in range(n):
if tmp < abs(sum(a[:i])-sum(a[i:])):
tmp = abs(sum(a[:i])-sum(a[i:]))
print(tmp) |
p02918 | s759781182 | Wrong Answer | n,k = map(int, input().split())
s = input()
rl_cnt = 0
for s1,s2 in zip(s[:-1],s[1:]):
if s1 == 'R' and s2 == 'L':
rl_cnt += 1
left_happy = 1 if s[0] == 'R' else 0
right_happy = 1 if s[-1] == 'L' else 0
first_happy = n - rl_cnt*2 -2 + left_happy + right_happy
if k <= rl_cnt:
print(first_happy + k*2)... |
p03474 | s505032516 | Accepted | a,b=map(int,input().split())
s=input()
num_list=["0","1","2","3","4","5","6","7","8","9"]
for i in range(a+b+1):
if i==a:
if s[i] != "-":
print("No")
exit()
else:
if s[i] not in num_list:
print("No")
exit()
print("Yes") |
p02935 | s153415619 | Accepted | N = int(input())
v = list(map(int, input().split()))
v = sorted(v)
total = v[0]
for i in range(1, N):
total = (total + v[i]) / 2
print(total)
|
p02628 | s283597780 | Wrong Answer | N, K = map(int, input().split())
p = list(map(int, input().split()))
print(sum(sorted(p)[:3]))
|
p02607 | s016066139 | Accepted | import sys
def main():
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
ans += a[i] % 2 == 1
print(ans)
if __name__ == "__main__":
main()
|
p02661 | s249588634 | Accepted | N = int(input())
XA = []
XB = []
for i in range(N):
A, B = (int(i) for i in input().split())
XA.append(A)
XB.append(B)
XA.sort()
XB.sort()
if N % 2 == 1:
aa = XA[ (N - 1) // 2]
bb = XB[ (N - 1) // 2]
print(bb - aa + 1)
else:
aa1 = XA[N // 2]
bb1 = XB[N // 2]
aa = XA[N // 2 - 1]
... |
p03524 | s148656798 | Accepted | s = input()
a = s.count("a")
b = s.count("b")
c = s.count("c")
if max(a,b,c) - min(a,b,c) <= 1:
print("YES")
else:
print("NO") |
p03241 | s250961101 | Wrong Answer | n,m = map(int,input().split())
if m%n==0:
print(int(m//n))
exit()
else:
a = m//n
l = []
for i in range(int(a**0.5)+1,1,-1):
if m%i==0:
print(i)
exit()
print(1)
|
p02553 | s905039189 | Accepted | a,b,c,d=map(int,input().split())
xy=[a*c,a*d,b*c,b*d]
print(max(xy)) |
p03127 | s279675308 | Accepted | from math import gcd
from functools import reduce
input()
a = list(map(int, input().split()))
print(reduce(gcd, a)) |
p02657 | s330309029 | Accepted | a, b = map(int, input().split())
print(a * b) |
p02608 | s872366066 | Accepted | n = int(input())
l = {}
for i in range(1, n+1):
l[i] = 0
for x in range(1, min(101, n)):
for y in range(1, min(101, n)):
for z in range(1, min(101, n)):
m = (x + y + z) ** 2 - (x*y + y*z + z*x)
if m <= n:
l[m] += 1
for i in range(1, n+1):
print(l[i]) |
p02918 | s452166463 | Accepted | N,K=map(int,input().split())
S=input()
#LとRが入れ替わる回数-2Kが、終わった後の入れ替わる数
#Total-入れ替わる数-1がこたえ
trans=0
for i in range(N-1):
if S[i]!=S[i+1]:
trans += 1
trans_new = max(trans - 2*K,0)
print(N-trans_new-1)
|
p04029 | s544871160 | Accepted | N = int(input())
sum = 0
for i in range(0,N+1):
sum += i
print(sum) |
p02639 | s177096593 | Wrong Answer | import numpy as np
A = np.array(list(map(int, input().split())))
print(np.where(A == 0)[0][0]) |
p03109 | s118735068 | Accepted | a,b,c = map(int,input().split("/"))
ans = "Heisei"
if b > 4:
ans = "TBD"
print(ans)
|
p04020 | s374392505 | Wrong Answer | N = int(input())
A = [int(input()) for _ in range(N)]
ans = 0
rest = 0
for a in A:
if rest == 0:
ans += a // 2
rest = a % 2
else:
if (ans + rest) % 2 == 0:
ans += (a + rest) // 2
rest = (a + rest) % 2
else:
ans += a % 2
rest = 0
p... |
p03723 | s687965900 | Wrong Answer | import copy
a,b,c = map(int,input().split())
cnt = 0
while 1:
cnt += 1
next_a = b // 2 + c // 2
next_b = a // 2 + c // 2
next_c = a // 2 + b // 2
if a == next_a and b == next_b and c == next_c:
print(-1)
break
elif (next_a % 2 == 1) or (next_b % 2 == 1) or (next_c % 2 == 1):
... |
p03944 | s937928355 | Accepted | W,H,N = map(int,input().split())
w = W*[1]
h = H*[1]
for n in range(N):
x,y,a = map(int,input().split())
if a == 1:
w[:x] = x*[0]
elif a == 2:
w[x:] = (W-x)*[0]
elif a == 3:
h[:y] = y*[0]
else:
h[y:] = (H-y)*[0]
print(w.count(1)*h.count(1))
|
p03644 | s382126325 | Wrong Answer | n = int(input())
ans = 0
while True:
if n < pow(2, ans + 1):
break
else:
ans += 1
print(ans)
|
p03835 | s559907200 | Wrong Answer | K,S=map(int,input().split())
ans=0
#a=max(0,S-2*K)
for i in range(K+1):
if i>S:
break
for j in range(K+1):
if S-i+j<=K :
ans+=1
print(ans) |
p02760 | s839100774 | Accepted | card = []
check = [False for i in range(9)]
for i in range(3):
card += list(map(int, input().split()))
N = int(input())
for i in range(N):
a = int(input())
if a in card:
check[card.index(a)] = True
ans = "No"
for i in range(3):
if check[i] and check[3+i] and check[6+i]:
ans = "Yes"
if check[i*3] and c... |
p02548 | s537441236 | Wrong Answer | import math
N = int(input())
sum = 0
for i in range(1, N):
count = 2
for j in range(2, int(math.floor(math.sqrt(i)))+1):
if i % j == 0:
if i/j == j:
count += 1
else:
count += 2
sum += count
print(sum) |
p02621 | s595453865 | Accepted | a = int(input())
ans = a + a**2 + a**3
print(int(ans)) |
p02793 | s071053124 | Accepted | from fractions import gcd
from functools import reduce
N, *A = map(int, open(0).read().split())
def lcm(x, y):
return x * y // gcd(x, y)
def lcm_list(numbers):
return reduce(lcm, numbers, 1)
MOD = 10 ** 9 + 7
num = lcm_list(A)
print(sum(num * pow(v, MOD - 2, MOD) for v in A) % MOD)
|
p02789 | s876652274 | Accepted | N,M= map(int, input().split())
if N==M:
print('Yes')
else:
print('No') |
p04011 | s050523936 | Accepted | arr = []
for _ in range(4):
arr.append(int(input()))
if arr[1] > arr[0]:
arr[1] = arr[0]
charge = arr[1]*arr[2] + (arr[0]-arr[1])*arr[3]
print(charge) |
p02555 | s017875274 | Accepted | s = int(input())
lst = [0 for i in range(s)]
def find(x):
if (x < 6):
return(1)
else:
ans = 0
for i in range(x - 3):
ans = ans + lst[i]
return (ans + 1)
for i in range(s):
if (i < 2):
pass
else:
j = i + 1
lst[i] = find(j)%(10**9 + 7)
... |
p02952 | s088281223 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1):
if len(str(i)) % 2 == 1:
ans += 1
print(ans)
|
p02707 | s621010654 | Accepted | import collections
N = int(input())
A = list(map(int, input().split()))
C = collections.Counter(A)
for i in range(1, N+1):
if i in C.keys():
print(C[i])
else:
print(0) |
p02640 | s632002941 | Accepted | x, y = map(int, input().split())
count = 0
for num in range(x + 1):
if num * 4 + (x - num) * 2 == y:
count += 1
print("Yes" if count > 0 else "No") |
p02994 | s255617388 | Accepted | def solve_131b(n, l):
sum = 0
min = 100000
for i in range(1, n+1):
sum += (l + i - 1)
if l >= 0:
min = l
elif l + n - 1 <= 0:
min = l + n - 1
else:
min = 0
return sum - min
n, l = map(int, input().split())
print(solve_131b(n, l)) |
p03435 | s372981548 | Wrong Answer | import numpy as np
c = np.ones([3,3])
for i in range(3):
c[i] = [int(j) for j in input().split()]
if ((((c[2]-c[1])/(c[2]-c[1])[0])).all() ==(((c[2]-c[0])/(c[2]-c[0])[0])).all()) & ((((c[:][2]-c[:][1])/((c[:][2]-c[:][1])[0])).all()) ==(((c[:][2]-c[:][0])/(c[:][2]-c[:][0])[0])).all()):
print("Yes")
else:
... |
p03161 | s008230293 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
INF = 10**12
dp = [INF] * n
dp[0] = 0
for i in range(n):
if i == 1:
dp[1] = abs(h[1] - h[0])
continue
for j in range(1, k + 1):
if i - j < 0:
continue
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i... |
p02570 | s710663467 | Accepted | d,t,s=map(int,input().split())
print('Yes' if d/s<=t else 'No') |
p03261 | s908077023 | Accepted | N = int(input())
a = [input()]
for i in range(N-1):
w = input()
if not w in a and a[-1][-1] == w[0]:
a.append(w)
else:
print("No")
break
else:
print("Yes") |
p02618 | s654342274 | Accepted | D=int(input())
C=list(map(int,input().split()))
S=[list(map(int,input().split())) for i in range(D)]
T=[]
result=0
last=[0 for i in range(26)]
#初期解の算出
for i in range(D):
change=[S[i][j]-(last[j]+1)*C[j] for j in range(26)]
t=change.index(max(change))
T.append(t+1)
result+=S[i][t]
last[t]=-1
for... |
p02823 | s547251454 | Wrong Answer | N, A, B = map(int, input().split())
D = B - A
if D % 2 == 0:
print(D // 2)
else:
print(min(B - 1, N - A))
|
p03617 | s367635486 | Wrong Answer | Q, H, S, D = map(int, input().split())
N = int(input())
# Q,H を 1Lあたりの費用に変換する
Q *= 4
H *= 2
one_litter = min(Q, H, S) # 1L はこれを使う
if 2 * one_litter < D: # 2Lをサイズのほうが高いときは1Lですべて買う
ans = N * one_litter
else: # 偶数を2Lサイズで買い、余りを1Lサイズで買う
ans = N // 2 * D + one_litter
print(ans)
|
p02742 | s700168617 | Wrong Answer | h,w = map(int,input().split())
if(h*w%2 ==0):
print(int(h*w/2))
else:
print(int(h*w/2)+1) |
p03799 | s754228993 | Accepted | #!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
#%%code
def resolve():
N,M=pin()
t=M//2
if t<N:
print(t)
return
M-=N*2
ans=N
... |
p02888 | s442588060 | Accepted | import bisect
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N):
for j in range(i+1, N):
ans += bisect.bisect_left(L, L[i]+L[j]) - 1 - j
print(ans)
|
p02789 | s101180687 | Wrong Answer | N, M = input().split()
if N==M :
print('YES')
else:
print('NO') |
p03319 | s782880733 | Accepted | def main():
N, K = (int(i) for i in input().split())
_ = [int(i) for i in input().split()]
print(0--(N-1)//(K-1))
if __name__ == '__main__':
main()
|
p03943 | s339523906 | Accepted | a, b, c = map(int, input().split())
if a + b == c or a + c == b or b + c == a:
print("Yes")
else:
print("No") |
p03013 | s050272672 | Accepted | N, M = map(int,input().split())
alist = list()
for _ in range(M):
alist.append(int(input()))
li = {}
li[0] = 1
for i in range(1,N+1):
if len(alist)>=1 and i == alist[0]:
li[i] = 0
alist.pop(0)
else:
if i == 1:
li[i] = 1
else:
li[i] = ((li[i-1] + li... |
p02854 | s466279484 | Wrong Answer | import sys
input = sys.stdin.readline
N=int(input())
A=list(map(int,input().split()))
total = sum(A)
mindif = 1e12
sub = 0
for i in range(N):
sub += A[i]
dif = abs(total-sub-sub)
if dif < mindif:
mindif = dif
else:
break
print(mindif)
|
p03011 | s362089867 | Accepted | print(sum(sorted(list(map(int,input().split())))[:2]))
|
p03345 | s558899673 | Wrong Answer | A, B, C, K = map(int, input().split())
m = A - B
if (K % 2 == 0):
print(m)
else:
if (abs(m) >= 10**18):
print('Unfair')
print(abs(m))
|
p03760 | s437528992 | Wrong Answer | O =input()
E = input()
for a,b in zip(O,E):
print(a+b, end="") |
p03555 | s652056467 | Accepted | a = list(input())
b = list(input())
if a == list(reversed(b)):
print("YES")
else:
print("NO") |
p02578 | s266152886 | Accepted | n = int(input())
al = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if al[i] >= al[i+1]:
ans += al[i]-al[i+1]
al[i+1] += (al[i]-al[i+1])
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.