problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03592 | s299002708 | Accepted |
n,m,K=map(int,input().split());print("YNeos"[all(k*m-K+l*n-k*l*2for k in range(n+1)for l in range(m+1))::2])
|
p03261 | s128868483 | Wrong Answer | n=int(input())
temp=str(input())
templ=list(temp)
tempb=templ[len(templ)-1]
w=[0]*n
w[0]=temp
for i in range(0,n-1):
temp=str(input())
templ=list(temp)
if temp in w or tempb!=templ[len(templ)-1]:
print("No")
break
else:
print("Yes")
|
p02783 | s497307590 | Accepted | h,a=map(int,input().split())
print(-(-h//a))
|
p02744 | s637964486 | Accepted | # -*- coding: utf-8 -*-
import sys
import copy
def int2char(x):
return chr(ord('a')+x)
N = int(input())
dp = ['a']
for i in range(N-1):
nxt = []
for s in dp:
sets = set()
for t in s:
sets.add(t)
for i in range(len(list(sets))+1):
nxt.append(s+int2char(i))
... |
p02640 | s878793867 | Accepted | x, y =map(int, input().split())
if y % 2 == 1:
print("No")
else:
y = y / 2
if y > x*2 or y < x :
print("No")
else:
print("Yes") |
p02768 | s256829740 | Accepted | MOD = 10**9+7
n,a,b = map(int,input().split())
Sn = pow(2,n,MOD) - 1
if a > b:
a,b = b,a
Xa, Xb = 1,1
Ya, Yb = 1,1
for i in range(b):
if i < a:
Xa = ( Xa * (n-i) ) % MOD
Ya = ( Ya * pow((a-i),MOD-2, MOD)) % MOD
Xb = ( Xb * (n-i) ) % MOD
Yb = ( Yb * pow((b-i),MOD-2, MOD)) % MOD
ans = S... |
p03637 | s866562452 | Wrong Answer | N = int(input())
an = list(map(int, input().split()))
four = 0
odd = 0
for a in an:
if a % 2 == 1:
odd += 1
elif a % 4 == 0:
four += 1
print('Yes' if 2*odd-2 <= four or N//2 == four and -(-N//2) == odd else 'No')
|
p02675 | s544476945 | Wrong Answer | n = int(input())
a = n % 10
if (a == 3):
print("bon")
elif (a == 2 or 4 or 5 or 7 or 9 ) :
print("hon")
else:
print("pon")
|
p02766 | s285863515 | Wrong Answer | n , k = map(int,input().split())
ans = []
ans.append(n%k)
n = n//k
while n >= k:
ans.append(n%k)
n = n//k
ans.append(n)
print(len(ans)) |
p02696 | s181127546 | Accepted | a,b,n = list(map(int,input().split()))
if n<b:
x=n
print(int(a*x/b)-a*int(x/b))
else:
x=b-1
print(int(a*x/b)-a*int(x/b)) |
p02760 | s656371878 | Accepted | A = sum([list(map(int,input().split()))for _ in range(3)],[])
N = int(input())
b = [int(input()) for _ in range(N)]
f=sum(1<<i for i in range(9)if A[i]in b)
print('Yes'if[v for v in[7,56,73,84,146,273,292,448]if f&v==v]else'No')
|
p03211 | s739176755 | Accepted | S = input()
mini = 1000
for i in range(len(S)-2):
X = int(S[i] + S[i+1] + S[i+2])
mini = min(abs(X-753), mini)
print(mini) |
p02768 | s926479407 | Accepted | N,A,B=map(int,input().split())
p=10**9+7
def f(n,x):
a,b=1,1
for i in range(1,x+1):
a=a*n%p
b=b*i%p
n-=1
return a*pow(b,p-2,p)
print((pow(2,N,p)-1-f(N,A)-f(N,B))%p)
|
p03695 | s911887262 | Accepted | _ = input()
a = [int(x) for x in input().split()]
p = set()
q = 0
for i in a:
if i < 3200:
p.add(i//400)
else:
q += 1
else:
lenp = len(p)
print(max(lenp, 1), lenp + q) |
p02933 | s738037448 | Accepted | # https://atcoder.jp/contests/abc138/tasks/abc138_a
a = int(input())
s = input()
res = s if a >= 3200 else 'red'
print(res) |
p02972 | s607731657 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = [0]*n
for i in range(n-1, -1, -1):
count = 0
for j in range(i, n, i+1):
count += ans[j]
if count % 2 != a[i]:
ans[i] = 1
if sum(ans) == 0:
print(0)
exit()
print(sum(ans))
for i in range(n):
if ans[i] != 0:
print... |
p02713 | s935069204 | Accepted | import math
K = int(input())
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
x = math.gcd(i, j)
for k in range(1, K+1):
ans += math.gcd(x, k)
print(ans)
|
p03377 | s268541774 | Wrong Answer | a, b, x = map(int, input().split())
if x >= a and x < a+b:
print('Yes')
else:
print('No') |
p02797 | s195928151 | Wrong Answer | n,k,s=map(int,input().split())
a=[s]*k+[10**10]*(n-k)
print(*a) |
p02899 | s463406659 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = [0]*n
for i in range(n):
b[i] = a[a[i]-1]
print(b) |
p02729 | s254919913 | Wrong Answer | N, M = map(int, input().split())
# 偶偶 奇奇
if N != 0 and M != 0:
ans = int(N * (N - 1) / 2) + int(M * (M - 1) / 2)
elif N == 0:
ans = M * (M - 1)
elif M == 0:
ans = N * (N - 1)
print(int(ans)) |
p03250 | s654625283 | Wrong Answer | a,b,c = sorted(map(int,input().split()))
d=str(b)+str(c)
print(a+int(d))
|
p03695 | s132007070 | Accepted | from collections import Counter
n=int(input())
a=list(map(int,input().split()))
r=Counter([min(x//400,8) for x in a])
l=len(list(iter(r)))
if r[8]==0:
print(l,l)
else:
print(max(l-1,1),l-1+r[8])
|
p02583 | s719444994 | Accepted | from itertools import combinations
n = int(input())
l = list(map(int, input().split()))
combi = combinations(l, 3)
ans = 0
for a, b, c in combi:
if a != b and b != c and c != a:
if a + b > c and b + c > a and c + a > b:
ans += 1
print(ans)
|
p03680 | s426958630 | Accepted | n = int(input())
a_l=[]
for i in range(n):
a_l.append(int(input()))
record = set()
pos = 1
count = 0
while True:
count += 1
pos = a_l[pos-1]
if pos == 2:
print(count)
break
elif pos in record:
print(-1)
break
record.add(pos) |
p03479 | s690721280 | Accepted | x, y = map(int, input().split())
ans = 0
while x <= y:
x *= 2
ans += 1
print(ans) |
p02639 | s401199404 | Wrong Answer | a = input().split()
for i in range(0,5):
if (i + 1) == int(a[i]):
continue
else:
print(a[i])
|
p02835 | s592822154 | Accepted | L,M,N = map(int,input().split())
print("bust" if L+M+N >= 22 else "win")
|
p03555 | s831488859 | Wrong Answer | s1=input()
s2=input()
flag=0
x=s1[::-1]
if x==s1:
flag=1
if flag==0:
print("NO")
else:
print("YES") |
p03061 | s159660639 | Wrong Answer | from fractions import gcd
n=int(input())
A=list(map(int,input().split()))
DP=[[0,0] for _ in range(n)]
DP[0][0]=A[0]
DP[-1][1]=A[-1]
for i in range(1,n-1):
left,right=i,n-i-1
DP[left][0]=gcd(DP[left-1][0],A[i])
DP[right][1]=gcd(DP[right+1][1],A[i])
ans=max(DP[1][1],DP[-2][0])
for i in range(1,n-1):
a... |
p02972 | s066956254 | Accepted | n =int(input())
A = list(map(int,input().split()))
B = [0]*n
for i in range(n)[::-1]:
tmp = 0
j = i+1
while j<=n:
tmp += B[j-1]
j += i+1
if tmp%2 != A[i]:
B[i] = 1
print(sum(B))
print(*[i+1 for i in range(n) if B[i]]) |
p03371 | s467070957 | Wrong Answer | a,b,c,x,y = map(int,input().split())
ans = 0
if a + b >= c * 2:
ans = c * 2 * min(x,y)
if min(a,b) >= c * 2:
ans += (max(x,y) - min(x,y)) * (c * 2)
else:
ans += min((max(x,y) - min(x,y)) * a,(max(x,y) - min(x,y)) * b)
else:
ans = a * x + b * y
print(ans) |
p02618 | s946040532 | Accepted | D = int(input())
C = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(D)]
E = [0] * 26
for i in range(D):
ans = -1
max_v = -float("inf")
for j in range(26):
tmp = S[i][j] - (C[j] * (i-E[j]))
if tmp > max_v:
ans = j + 1
max_v = tmp
... |
p02676 | s380879188 | Accepted | K = int(input())
S = input()
len_S = len(S)
if len_S <= K:
print(S)
else:
print(S[:K] + '...') |
p03380 | s383814500 | Accepted | n = int(input())
A = sorted(list(map(int,input().split())))
for i in range(n):
if A[i]*2>A[-1]:
ind = i
break
ind -= 1
a = A[ind]
b = A[-1]-A[ind+1]
if a>=b:
print(A[-1],a)
else:
print(A[-1],A[ind+1])
|
p03471 | s147634265 | Accepted | n, t = map(int, input().split())
for x in range(n+1):
for y in range(n+1 -x):
z = n - x - y
if z < 0:
z = 0
if x*10000 + y*5000 + z*1000 == t:
print(x, y , z)
exit()
print("-1 -1 -1") |
p03284 | s413704626 | Wrong Answer | n,k=map(int,input().split())
if n%k==0:
print(0)
else:
print(n//k-n%k) |
p03435 | s957676523 | Accepted | c=[list(map(int,input().split())) for _ in range(3)]
a_a=set()
a_b=set()
a_c=set()
for i in range(3):
a_a.add(c[i][0]-c[i][1])
a_b.add(c[i][1]-c[i][2])
a_c.add(c[i][2]-c[i][0])
if len(a_a)==1 and len(a_b)==1 and len(a_c)==1:
print('Yes')
else:
print('No') |
p03836 | s012188755 | Accepted | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
sx,sy,tx,ty = map(int, input().split())
wx = tx-sx
wy = ty-sy
ans = "U"*wy + "R"*wx + "D"*wy + "L"*wx + ("L"*1 + "U"*(wy+1) + "R"*(wx+1) + "D"*1) + ("R"*1 + "D"*(wy+1) + "L"*(wx... |
p03760 | s072364035 | Wrong Answer | o = input()
e = input()
if len(o) == len(e):
for i in range(len(o)):
print(o[i]+e[i],end='')
else:
for i in range(len(e)):
print(o[i]+e[i],end='')
print(e[-1]) |
p02598 | s838534956 | Wrong Answer | # -*- coding: utf-8 -*-
import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
xlist = []
wa = sum(a)
for i in a:
xlist.append((k+n)*i/wa)
xlist_int = []
for i in xlist:
j = int(i)
if j == 0:
j = 1
xlist_int.append(j)
amari = n+k-sum(xlist_int)
xlist_hi = [xlist_int[i]/... |
p02843 | s709536335 | Wrong Answer | x = int(input())
q, r = divmod(x, 100)
if q < r//5:
print(0)
else:
print(1) |
p03377 | s911002387 | Accepted | A,B,X = map(int,input().split())
s = "YES"
if A > X or A+B < X:
s = "NO"
print(s) |
p03146 | s960321666 | Wrong Answer | def calc(n):
if n % 2 == 0:
return n // 2
else:
return 3 * n + 1
def main():
s = int(input())
ans = [s]
while True:
tmp = calc(ans[-1])
ans.append(tmp)
if ans.index(tmp) != len(ans)-1:
print(len(ans))
break |
p02659 | s889446509 | Wrong Answer | A,B = (float(x) for x in input().split())
ans = A * B
print(int(ans)) |
p02547 | s895197771 | Accepted | n = int(input())
d = [list(map(int,input().split())) for i in range(n)]
cnt = 0
for i in range(n):
if d[i][0] == d[i][1]:
cnt += 1
if cnt == 3:
print('Yes')
break
else:
cnt = 0
else:
print('No') |
p02756 | s470157405 | Accepted | S = input()
Q = int(input())
T1 = 0
S_left = ''
S_right = ''
for _ in range(Q):
a = list(map(str,input().split()))
if a[0] == '1':
T1 += 1
elif a[0] == '2':
if ((a[1]=='1')and(T1%2==0)) or ((a[1]=='2')and(T1%2!=0)):
S_left = a[2]+S_left
else:
S_right = S_right+a[2]
S = S_left+S+S_right
if ... |
p02994 | s632968618 | Wrong Answer | n, l = map(int, input().split())
taste = [l+i for i in range(n)]
ans = [abs(i) for i in taste]
del ans[ans.index(min(ans))]
print(sum(ans))
|
p02701 | s634076289 | Accepted | import math
import collections
import fractions
import itertools
def solve():
n = int(input())
s = [input() for i in range(n)]
print(len(set(s)))
return 0
if __name__ == '__main__':
solve() |
p02706 | s410407833 | Accepted | A,B = map(int,input().split())
s = list(map(int,input().split()))
if sum(s) <= A:
print(A-sum(s))
else:
print("-1") |
p02602 | s629806998 | Accepted | # -*- coding: utf-8 -*-
N,K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N-K):
if A[i] < A[i+K]:
print('Yes')
else:
print('No') |
p03838 | s429172093 | Accepted | X, Y = map(int, input().split())
if 0 <= X < Y or X < Y <= 0:
print(Y-X)
elif 0 < Y < X or Y < X < 0:
print(2+X-Y)
elif X < 0 < Y or Y < 0 < X:
print(1+abs(X+Y))
if X == 0 and Y < 0:
print(abs(Y)+1)
elif Y == 0 and X > 0:
print(abs(X)+1)
|
p02675 | s163425250 | Accepted | N=input()
if N[-1]=="3":
print("bon")
elif N[-1]=="0" or N[-1]=="1" or N[-1]=="6" or N[-1]=="8":
print("pon")
else:
print("hon") |
p03617 | s242774760 | Accepted | Q, H, S, D = map(int, input().split())
N = int(input())
S = min(min(Q * 2, H) * 2, S)
D = min(S * 2, D)
print(N//2*D + N%2*S) |
p03799 | s681615693 | Wrong Answer | N, M= map(float, input().split())
if N > round(M/2):
print(round(M/2))
else:
c=N+(M-N*2)//4
print(c)
|
p03284 | s738275677 | Wrong Answer | n,k = map(int,input().split())
print(n%k) |
p03241 | s275336003 | Accepted | N, M = map(int, input().split())
if M%N == 0:
print(M//N)
exit()
A = []
for i in range (1, M//N+1):
if M%i == 0:
A.append(i)
print(A[-1]) |
p03486 | s787705287 | Accepted | s = input()
t = input()
s = sorted(s)
s = str(''.join(s))
t = sorted(t, reverse=True)
t = str(''.join(t))
if s < t:
print("Yes")
else:
print("No") |
p03773 | s436389963 | Accepted | A, B = map(int, input().split())
print(A + B if A + B < 24 else (A + B) - 24) |
p03105 | s426865624 | Accepted | a,b,c = map(int,input().split())
if a*c<b:
print(c)
else:
print(int(b/a)) |
p03013 | s070448737 | Accepted | n, m = map(int, input().split())
stair = [1]*(n+1)
for i in range(m):
a = int(input())
stair[a] = 0
for i in range(2, n+1):
stair[i] *= (stair[i-1] + stair[i-2])
print(stair[n]%(10**9+7))
|
p03625 | s586122120 | Accepted | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
ca = Counter(A)
ca = sorted(ca.items(), key=lambda x:-x[0])
cnt = 0
m = []
for k, v in ca:
if 3 >= v >= 2:
cnt += 1
m += [k]
elif v >= 4:
cnt += 2
m += [k, k]
if cnt >= 2:
break
if len(m) <= 1:
print(0)
e... |
p02880 | s760859790 | Wrong Answer | a=int(input())
f=0
for i in range(1,10):
if a==0:
print("No")
break
elif a%i==0:
f=1
if f==1:
print("Yes")
else:
print("No")
|
p02675 | s622678616 | Accepted | N = input()
ans=int(N[-1])
if(ans==3):
print("bon")
elif(ans==0 or ans==1 or ans==6 or ans==8):
print("pon")
else:
print("hon")
|
p03281 | s758071291 | Accepted | 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
n = int(input())
ans = 0
for i in range(1,n+1):
if i % 2 == 1 and len(make_divisors(i)) == 8:
a... |
p03011 | s923270797 | Accepted | a,b,c = map(int,input().split())
print(min(a+b,a+c,b+a,b+c,c+a,c+b)) |
p03042 | s262451943 | Accepted | s = input()
if 1 <= int(s[0:2]) <= 12:
if 1 <= int(s[2:4]) <= 12:
print("AMBIGUOUS")
else:
print("MMYY")
else:
if 1 <= int(s[2:4]) <= 12:
print("YYMM")
else:
print("NA") |
p03309 | s832698639 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
# print(n)
# print(A)
B = [0]*n
for i in range(n):
B[i] = A[i] - (i+1)
# print('B',B)
b = sum(B)
bmin = sum(B)
# print('sumB',b)
b //= n
# print('b',b)
# print('bmin',bmin)
ans1 = 0
ans2 = 0
ans3 = 0
for i in range(n):
ans1 += abs( B[i] - b )
ans2 += ab... |
p02792 | s947441120 | Wrong Answer | n = int(input())
N = n + 1
totalcount = 0
for i in range(1,N):
a = str(i)
a_first = a[0]
a_end = a[len(str(i)) - 1]
for j in range(1,N):
b = str(j)
b_first = b[0]
b_end = b[len(str(j)) - 1]
if a_first == b_end and a_end == b_first:
totalcount += 1
print(a,j)
print(totalcount) |
p03457 | s875994379 | Accepted | n=int(input())
now=[0,0,0]#t,x,y
f=True
for i in range(n):
t,x,y=map(int,input().split())
k=abs(x-now[1])+abs(y-now[2])
l=abs(t-now[0])
if not(k<=l and abs(k-l)%2==0):
f=False
now=[t,x,y]
print("Yes" if f else "No") |
p03309 | s811780939 | Wrong Answer |
import statistics
N = int(input())
nums = list(map(int, input().split()))
nums = [num - (i + 1) for i, num in enumerate(nums)]
# print(nums)
def compute_sour(num, b):
return abs(num - b)
middle_num = statistics.median(nums)
# print(middle_num)
ans = 0
for num in nums:
ans += compute_sour(num, middle_num... |
p02688 | s907845819 | Accepted | n, k = map(int, input().split())
m = [0]*n
for i in range(k):
d = int(input())
a = list(map(int, input().split()))
for j in range(d):
m[a[j]-1] += 1
print(m.count(0))
|
p02711 | s561384316 | Wrong Answer | s=str(input())
if s[0] != 7 and s[1] != 7 and s[2] != 7:
print("No")
else:
print("Yes")
|
p02755 | s814153177 | Wrong Answer | A, B = map(int, input().split())
result = True
for a in range(1, 1001):
if int(a * 0.08) == A and int(a * 0.1) == B:
print(a)
break
result = False
exit()
if result:
print(-1) |
p03282 | s779635044 | Accepted | s = input()
k = int(input())
for i, x in enumerate(s):
if x == '1':
if k == i + 1:
print(1)
exit()
else:
print(x)
exit() |
p02753 | s238959880 | Wrong Answer | abc=str(input())
a=abc[0]
b=abc[1]
c=abc[2]
if a == b and b==c and c==a:
print("Yes")
else:
print("No") |
p02970 | s453291479 | Accepted | import math
N, D = map(int, input().split())
ans = math.ceil(N / (D * 2 + 1))
print(ans) |
p03543 | s811677506 | Accepted | N=str(input())
if (N[0]==N[1] and N[1]==N[2]) or (N[1]==N[2] and N[2]==N[3]):
print("Yes")
else:
print("No")
|
p03250 | s177630184 | Accepted | a,b,c = map(int,input().split())
n1,n2,n3 = sorted([a,b,c],reverse= True)
print(10*n1 + n2 + n3) |
p03324 | s729142327 | Accepted | D, N = map(int,input().split())
if D == 0 and N != 100:
print(N)
if D == 0 and N == 100:
print(101)
if D == 1 and N != 100:
print(N*100)
if D == 1 and N == 100:
print(10100)
if D == 2 and N != 100:
print(N*10000)
if D == 2 and N == 100:
print(1010000)
|
p03351 | s043883492 | Accepted | a,b,c,d=map(int,input().split())
if (abs(a-b)<=d and abs(b-c)<=d) or abs(a-c)<=d:
print('Yes')
else:
print('No') |
p03695 | s703453211 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
cnt = [0]*8
free = 0
for i in range(n):
if a[i] <= 3199:
cnt[a[i]//400] += 1
else:
free += 1
print(min(1,8-cnt.count(0)),8-cnt.count(0)+free) |
p02780 | s862512228 | Accepted | import itertools
n, k = (int(i) for i in input().split())
P = [int(i) for i in input().split()]
probs = list(itertools.accumulate([(1+p)/2 for p in P]))
probs.insert(0,0)
ans = 0
for i in range(n-k+1):
ans = max(ans, -probs[i]+probs[i+k])
print(ans)
|
p03150 | s921409266 | Wrong Answer | S=input()
T="keyence"
for i in range(len(S)-1):
for j in range(i,len(S)-1):
if S[:i]+S[j:]==T:
print("YES")
exit()
print("No") |
p02612 | s042226217 | Accepted | n=int(input())
ans=n%1000
if(ans==0):
print(ans)
else:
print(1000-ans)
|
p02873 | s796374271 | Wrong Answer | S = input()
a = [0]*(len(S)+1)
for i in range(len(S)):
if S[i] is '<':
a[i+1] = max(a[i+1], a[i]+1)
print(a)
for i in range(1, len(S)):
if S[-i] is '>':
a[-(i+1)] = max(a[-(i+1)], a[-i]+1)
print(a)
print(sum(a)) |
p03944 | s286310292 | Accepted | import numpy as np
W, H, N = map(int, input().split())
l = np.zeros((H,W))
for i in range(N):
x, y, a = map(int, input().split())
if a==1:
l[:,:x] = 1
elif a==2:
l[:,x:] = 1
elif a==3:
l[:y,:] = 1
elif a==4:
l[y:,:] = 1
print(H*W-int(l.sum().sum()))
|
p02624 | s079548418 | Accepted | n = int(input())
ans = 0
for i in range(1, n+1):
m = n//i
ans += (2*i*m + (m-1)*i*m) // 2
print(ans) |
p04005 | s977030454 | Accepted | A,B,C = map(int,input().split())
l = [A*B,B*C,A*C]
l[0] *= abs(C//2-(C-C//2))
l[1] *= abs(A//2-(A-A//2))
l[2] *= abs(B//2-(B-B//2))
print(min(l)) |
p02578 | s990969859 | Accepted | n = int(input())
a = list(map(int, input().split()))
count = 0
i = 1
while i < len(a):
if a[i] < a[i-1]:
count += a[i-1] - a[i]
a[i] = a[i-1]
i += 1
print(count) |
p02832 | s107796911 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
i=0
count=0
if 1 in a:
while len(a)>0:
if i+1 in a[i::]:
i+=1
else:
break
#print(i)
print(N-i)
else:
print(-1) |
p02836 | s985082185 | Wrong Answer |
s=input()
count=0
if s != s[::-1]:
count += 1
print(count//2) |
p03659 | s700752714 | Accepted | n = int(input())
*a, = map(int, input().split())
x = [0]*(n+1)
for i in range(n):
x[i+1] = x[i] + a[i]
y = [0]*(n+1)
for i in reversed(range(n)):
y[i] = y[i+1] + a[i]
ans = float("inf")
for i in range(1, n):
ans = min(ans, abs(x[i]-y[i]))
print(ans)
|
p02681 | s185418304 | Wrong Answer | from copy import copy, deepcopy
from collections import Counter
from math import sqrt, floor, factorial
from itertools import permutations, combinations, combinations_with_replacement
from operator import mul
from functools import reduce
import bisect
MOD = 10**9 + 7
INF = float('inf')
S = input()
T = input()
print(S... |
p03493 | s984177906 | Accepted | s = (int)(input())
s1 = s//100
s2 = (s%100)//10
s3 = (s%10)
print((str)(s1+s2+s3))
|
p02548 | s454319632 | Wrong Answer | N = int(input())
NR = int(N**0.5)
count = 0
if int(N/2)-N/2 == 0:
for i in range(1,int(N/2)):
if int(N/i)-N/i == 0:
count += int(N-1/i)-1
else:
count += int(N-1/i)
else:
for i in range(1,int(N/2)+1):
if int(N/i)-N/i == 0:
count += int(N-1/i)-1
... |
p03745 | s269511879 | Accepted | N=int(input())
A=list(map(int,input().split()))
ans=1
vec=0
for i in range(N-1):
now=A[i+1]-A[i]
if vec*now<0:
ans+=1
vec=0
elif vec==0:
vec=now
print(ans)
|
p02621 | s420121679 | Accepted |
a = int(input())
print (a + a**2 + a**3)
|
p02911 | s901590129 | Accepted | import numpy as np
n, k, q = map(int, input().split())
a = []
for _ in range(q):
a.append(int(input()))
nn = np.zeros(n)
kk = np.zeros(n) + k
qq = np.zeros(n) + q
for i in a:
nn[i-1] += 1
_list = (kk-qq+nn).tolist()
for ans in _list:
if ans > 0:
print('Yes')
else:
print('No') |
p02578 | s773963900 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(1,n):
dif = a[i] - a[i-1]
if dif<0:
a[i] -= dif
ans -= dif
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.