problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03472 | s759123909 | Wrong Answer | #!/usr/bin/env python3
import bisect
import sys
import math
sys.setrecursionlimit(10**6)
n, h = list(map(int, input().split()))
a = []
b = []
ab = []
for i in range(n):
a_tmp, b_tmp = list(map(int, input().split()))
a.append(a_tmp)
b.append(b_tmp)
# ab.append((b_tmp, a_tmp))
a_max = max(a)
b.sort()
index = bisect.bisect_right(b, a_max)
ans = 0
for i in reversed(range(index, n)):
h -= b[i]
ans += 1
if h <= 0:
break
if h > 0:
ans += math.floor(h/a_max)
print(ans)
|
p02959 | s115539068 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
right=0
left=0
for i in range(n):
left=min(a[i],b[i])
ans+=left
a[i]-=left
b[i]-=left
right=min(a[i+1],b[i])
ans+=right
a[i+1]-=right
b[i]-=right
print(ans) |
p03796 | s161635938 | Accepted | import math
n = int(input())
print(math.factorial(n) % (10**9 + 7))
|
p03455 | s318902590 | Accepted | a,b = map(int,input().split())
if (a*b%2 == 0):
print("Even")
else:
print("Odd") |
p02970 | s066070731 | Wrong Answer | n,d = map(int, input().split())
k = n%(2*d + 1)
if k == 0:
print(n//(2*d+1))
else:
print(n//(2*d+1)) |
p03338 | s681869140 | Accepted | n = int(input())
s = input()
s = list(s)
ans = 0
count = 0
for a in range(1, n):
l1 = list(set(s[:a]))
l2 = set(s[a:])
length1 = len(l1)
for x in range(length1):
if l1[x] in l2:
count += 1
ans = max(ans, count)
count = 0
print(ans)
|
p03043 | s498375935 | Accepted | N, K = map(int, input().split())
qs = 0
for i in range(1, N+1):
if i >= K:
qs += 1/N
elif i < K:
q = 1/N
while i < K:
q *= 1/2
i *= 2
qs += q
print(qs) |
p02706 | s547408063 | Wrong Answer | line_1 = input().split()
N = int(line_1[0])
line_2 = input().split()
M = list(map(int,line_2))
Ms = sum(M)
if Ms-N > 0 :
print(Ms-N)
else:
print(-1) |
p02797 | s552558945 | Wrong Answer | N,K,S=map(int,input().split())
for i in range(K):
print(S,"",end="")
for i in range(K,N):
print(S+1,"",end="")
print()
|
p02642 | s084912196 | Accepted | n = int(input())
a = list(map(int, input().split()))
a_sorted = sorted(a)
divisible_list = [0] * (max(a)+1)
for i in range(len(a)):
# 過去にすでに同じ数字への加算があったら飛ばす
if divisible_list[a[i]] > 2:
continue
for j in range(0, len(divisible_list), a[i]):
divisible_list[j] += 1
ans = 0
for i in range(len(a)):
if divisible_list[a[i]] == 1:
ans+=1
print(ans) |
p03524 | s291644744 | Accepted | s = input()
num_a = num_b = num_c = 0
for st in s:
if st == "a":
num_a += 1
elif st == "b":
num_b += 1
elif st == "c":
num_c += 1
if max(num_a, num_b, num_c) - min(num_a, num_b, num_c) <= 1:
print("YES")
else:
print("NO")
|
p03136 | s953550324 | Accepted | n=int(input())
lis=list(map(int,input().split()))
print("Yes" if max(lis)<(sum(lis)-max(lis)) else "No") |
p03352 | s921820645 | Accepted | X = int(input())
List = [0]*(X+1)
List[1] = 1
for i in range(2,X+1):
v = i**2
while(v<=X):
List[v]=1
v*=i
for i in range(1,X+1)[::-1]:
if List[i]==1:
print(i)
break |
p02917 | s160458823 | Accepted | N=int(input())
B=list(map(int,input().split()))
s=0
for i in range(0,N):
if i==0:
s=s+B[0]
elif i!=N-1:
s=s+min([B[i-1],B[i]])
else:
s=s+B[N-2]
print(s) |
p03617 | s852300777 | Accepted | q,h,s,d=map(int, input().split( ))
n=int(input())#ちょうど
n*=4
lst=[(q*4,q,1),(h*2,h,2),(s,s,4),(d/2,d,8)]
lst.sort()
ans=0
for _,t,x in lst:
ans+=(n//x)*t
n-=(n//x)*x
print(ans)
|
p03910 | s908603153 | Wrong Answer | n = int(input())
ans = []
cnt = 0
for i in range(1, int(n**(2/3))):
if n > cnt:
ans.append(i)
cnt += i
else:
if cnt - n in ans:
ans.remove(cnt - n)
break
for i in ans:
print(i) |
p02947 | s535920559 | Wrong Answer | N = int(input())
S = [sorted(list(input())) for _ in range(N)]
i = 0
A = []
for a in S:
A.append("".join(a))
print(len(A) - len(set(A))) |
p02594 | s100053022 | Wrong Answer | x = int(input())
if x == 30 or x > 30:
print('yes')
else:
print('no') |
p03852 | s863383589 | Accepted | s = input()
if s == "a" or s == "i" or s == "u" or s == "e" or s == "o":
print("vowel")
else:
print("consonant") |
p02555 | s854705642 | Accepted | S = int(input())
Mod = 10**9+7
a=[1]
for i in range(S):
i += 1
if i > 2:
a.append((a[-1] + a[-3])%Mod)
else:
a.append(0)
print(a[S])
|
p03252 | s921989180 | Accepted | from collections import Counter
s = list(input())
t = list(input())
sc = Counter(s).values()
tc = Counter(t).values()
sl = Counter(sc)
tl = Counter(tc)
if sl == tl:
print('Yes')
else:
print('No') |
p03379 | s655633470 | Accepted | import copy
N=int(input())
X=list(map(int,input().split()))
B=[]
P=copy.copy(X)
X.sort()
a=X[N//2-1]
b=X[N//2]
for i in range(N):
if P[i]<=a:
B.append(b)
else:
B.append(a)
for j in range(N):
print(B[j]) |
p03665 | s942221431 | Accepted | from collections import Counter
def main():
N, P = map( int, input().split())
A = Counter(list( map( lambda x: int(x)%2, input().split())))
zero = A[0]
one = A[1]
ans = 1
now = 1
for i in range(1,one+1):
now *= (one-i+1)
now //= i
if i%2 == 0:
ans += now
if P == 0:
print( ans*pow(2,zero))
else:
print(pow(2,N) - ans*pow(2,zero))
if __name__ == '__main__':
main()
|
p02786 | s904819739 | Wrong Answer | h = int(input())
n = 0
while 2**n < h:
n += 1
print(2**n-1) |
p03243 | s803990214 | Wrong Answer | n=list(input())
if int(n[0])>=int(n[1])>=int(n[2]):
ans = [n[0]]*3
else:
ans = [int(n[0])+1]*3
print(*ans,sep="") |
p02881 | s425754906 | Accepted | from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
def main():
N = int(input())
res = INF
for i in range(1, int(math.sqrt(N))+1):
if N%i==0:
res = min(res, i + N//i - 2)
print(res)
if __name__ == '__main__':
main() |
p02711 | s587533395 | Accepted | N = list(input())
if ('7' in N):
print('Yes')
else:
print('No') |
p03854 | s448699380 | Wrong Answer | S = input()
strs = list(reversed(S))
rev_S = ''.join(strs)
while True:
if len(rev_S)< 5:
break
elif rev_S[:6] == 'resare'or rev_S[:6] == 'remaerd':
rev_S = rev_S[6:]
continue
elif rev_S[:5] == 'esare' or rev_S[:5] == 'maerd':
rev_S = rev_S[5:]
continue
else:
break
if rev_S == '':
print('YES')
else:
print('NO') |
p03285 | s449469404 | Accepted | import sys
n = int(input())
cake = 0
for i in range(n//4 + 1):
don = 0
for j in range(n//7 + 1):
if cake + don == n:
print("Yes")
sys.exit()
don += 7
cake += 4
print("No") |
p03943 | s545264142 | Accepted | def main():
a,b,c = (int(x) for x in input().split())
if (a+b)==c or (a+c)==b or (b+c)==a:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() |
p03469 | s896284758 | Accepted | S = input()
c = "2018" + S[4:]
print(c) |
p03345 | s771950996 | Accepted | A, B, C, K = map(int, input().split())
print(A - B if K % 2 == 0 else B - A) |
p02695 | s773649158 | Accepted | N,M,Q=map(int,input().split())
SC=[list(map(int,input().split())) for i in range(Q)]
def nextlist(A):
for i in range(A[-1],M+1):
yield A+[i]
X=[[1]]
for rep in range(N-1):
NX=[]
for x in X:
NX.extend(nextlist(x))
X=NX
ANS=0
for x in X:
score=0
for a,b,c,d in SC:
if x[b-1]-x[a-1]==c:
score+=d
ANS=max(ANS,score)
print(ANS)
|
p02832 | s976907620 | Accepted | N = int(input())
lst = list(map(int, input().split()))
idx = 1
rem = 0
for i in range(N):
if lst[i] == idx:
idx += 1
else:
rem += 1
if rem == N:
print(-1)
else:
print(rem) |
p02912 | s029237795 | Wrong Answer | import math
N,M=map(int,input().split())
A=list(map(int,input().split()))
A.sort(reverse=True)
logof2=[0]*N
mi=0
#print(A)
for i in range(N):
logof2[i]=math.log(A[i],2)
#print(logof2)
for i in range(M):
if logof2[0]<0:
break
else:
logof2[0]=logof2[0]-1
logof2.sort(reverse=True)
#print(logof2)
for i in range(N):
mi=mi+math.floor(pow(2,logof2[i]))
print(mi)
|
p03998 | s768128471 | Wrong Answer | import collections
a=collections.deque(list(input()))
b=collections.deque(list(input()))
c=collections.deque(list(input()))
next_='a'
while len(a)>0 and len(b)>0 and len(c)>0:
if next_=='a':next_=a.popleft()
if next_=='b':next_=b.popleft()
if next_=='c':next_=c.popleft()
if len(a)==0 or len(b)==0 or len(c)==0: break
print(str(next_).upper()) |
p03211 | s784335070 | Accepted | s = list(input())
mi = 10 ** 10
for i in range(len(s) - 2):
mi = min(mi, abs(753 - int("".join(s[i:i + 3]))))
print(mi) |
p02947 | s407278922 | Accepted | from collections import Counter
N = int(input())
S = [list(input()) for _ in range(N)]
for i in range(N):
S[i].sort()
S[i] = ''.join(S[i])
C = Counter(S)
ans = 0
for i in C.values():
ans += i*(i-1)//2
print(ans) |
p03545 | s935542906 | Accepted | n = []
s = input()
def culc(cur, op_c,ans):
if op_c == 3:
if cur == 7:
print(ans + "=7")
exit()
else:
culc(cur+int(s[op_c+1]), op_c+1, ans + "+" + s[op_c+1])
culc(cur-int(s[op_c+1]), op_c+1, ans + "-" + s[op_c+1])
culc(int(s[0]), 0, s[0]) |
p03386 | s024823928 | Accepted | a, b, k = map(int, input().split())
ans = set()
k = min(k,b-a+1)
for i in range(a, a+k):
ans.add(i)
for i in range(b, b - k, -1):
ans.add(i)
ans=sorted(list(ans))
for i in (ans):
print(i)
|
p02621 | s706635190 | Wrong Answer | a =int(input())
print(a+pow(a,2),pow(a,3)) |
p02659 | s415823985 | Accepted | import math
a,b = map(str, input().split())
a = int(a)
b = b.replace(".","")
if len(b) == 2:
b = b + '0'
b = int(b)
ans = a*b
if len(str(ans)) <= 2:
print(math.floor(ans/100))
else:
print(int(str(ans)[:-2])) |
p03011 | s825652361 | Wrong Answer | PQR = list(map(int, input().split()))
PQR.sort
print(sum(PQR[:-1])) |
p03804 | s443334211 | Wrong Answer | n, m = map(int, input().split())
an = [input() for _ in range(n)]
bn = [input() for _ in range(m)]
lena = len(an[0])
lenb = len(bn[0])
diff = n-m+1
flag = False
for i in range(diff):
for j in range(diff):
if [a[j:diff+j] for a in an[i:diff+i]] == bn:
flag = True
break
else:
continue
break
print('Yes' if flag else 'No')
|
p03759 | s233354091 | Accepted | def ntukusi(a,b,c):
return "YES" if (b - a) == (c - b) else "NO"
def main():
a , b , c = map(int, input().split())
print(ntukusi(a , b , c))
if __name__ == '__main__':
main() |
p02779 | s058278020 | Accepted | N = int(input())
A_ls = input().split(' ')
A_set = { i for i in A_ls }
if len(A_set) == N:
print('YES')
else:
print('NO') |
p02784 | s550439886 | Accepted | h, n = map(int, input().split(' '))
commands = list(map(int, input().split(' ')))
if sum(commands) >= h:
print('Yes')
else:
print('No') |
p03408 | s957783471 | Accepted | N = int(input())
s = []
for i in range(N):
s.append(input())
M = int(input())
t = []
for i in range(M):
t.append(input())
s_set = list(set(s))
t_set = list(set(t))
ans = 0
for i in range(len(s_set)):
y = 0
for j in range(N):
if s_set[i] == s[j]:
y += 1
for k in range(M):
if s_set[i] == t[k]:
y -= 1
if y > ans:
ans = y
print(ans) |
p02705 | s354144929 | Wrong Answer | n=int(input())
print(n*3.141592) |
p03206 | s557595858 | Accepted | def aChristmas(d):
ans = "Christmas"
for i in range(abs(25-d)):
ans += " Eve"
return ans
def main():
d = int(input())
print(aChristmas(d))
if __name__ == '__main__':
main() |
p02862 | s027715702 | Accepted | mod = 10 ** 9 + 7
x, y = map(int, input().split())
if (x + y) % 3 != 0 or x * 2 < y or y * 2 < x:
print(0)
exit()
l = [1]
for i in range(1, (x + y) // 3 + 100):
l.append(l[-1] * i % mod)
def comb(n, r, m):
return l[n] * pow(l[r], m - 2, m) * pow(l[n - r], m - 2, m) % m
a, b = y - (x + y) // 3, x - (x + y) // 3
print(comb(a + b, a, mod) % mod) |
p03095 | s984329641 | Wrong Answer | from collections import Counter
N = int(input())
S = list(input())
C = Counter(S)
count = 1
mod = 10*9 + 7
for i in C.values():
count *= i+1
print((count-1)%mod) |
p03611 | s034100609 | Accepted | N = int(input())
a = [int(x) for x in input().split()]
M = max(a)
C = [0] * (M + 1)
for i in range(N):
C[a[i]] += 1
ans = 0
for i in range(1,M):
wa = C[i - 1] + C[i] + C[i + 1]
ans = max(ans, wa)
if M <= 1:
ans = N
print(ans) |
p03456 | s409232784 | Accepted | import math
a, b = input().split(" ")
c = a + b
c = int(c)
d = math.sqrt(c)
if d - int(d) >0:
print("No")
else:
print("Yes") |
p02859 | s114423319 | Wrong Answer | print('Yes') |
p02916 | s790001501 | Accepted | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = sum(b)
x=-1
for i in a:
if x+1==i:
ans+=c[x-1]
x = i
print(ans) |
p03485 | s237692622 | Accepted | # -*- coding: utf-8 -*-
from statistics import mean
from math import ceil
data = list(map(int, list(input().split())))
print(ceil(mean(data)))
|
p03417 | s140092963 | Accepted | n, m = map(int, input().split())
if n == 1 and m == 1:
print(1)
elif n == 1:
print(m - 2)
elif m == 1:
print(n - 2)
else:
print((n-2) * (m-2)) |
p02953 | s970736807 | Wrong Answer | n=int(input())
h=list(map(int,input().split()))
for i in range(n):
ans="Yes"
if i>0 and h[i-1]-h[i]>1:
ans="No"
print(ans) |
p02572 | s454423516 | Wrong Answer | def productSum(A,n) -> int:
MOD = 1000000007
sum_arr = 0
for i in range(n):
sum_arr += A[i]
sum_arr %= MOD
sum_arr_sq = (sum_arr*sum_arr)%MOD
indiv_sq_sum = 0
for i in range(n):
indiv_sq_sum += (A[i]*A[i])
indiv_sq_sum %= MOD
ans = ((sum_arr_sq - indiv_sq_sum))//2
ans %= MOD
return ans
n = int(input())
arr = [int(x) for x in input().split()]
print(productSum(arr,n)) |
p03359 | s417095910 | Wrong Answer | a, b = map(int, input().split())
print(max(0,a-1)+max(0,b-a+1)) |
p02813 | s580787975 | Wrong Answer | from itertools import permutations
n = int(input())
p = tuple(map(int,input().split()))
q = tuple(map(int,input().split()))
if p == q:
print(0)
exit()
base = sorted(p)
pi = 0
qi = 0
for i, v in enumerate(permutations(base, n)):
print(v)
if p == v:
pi = i + 1
elif q == v:
qi = i + 1
if pi * qi != 0:
break
print(abs(pi-qi))
|
p02888 | s402697535 | Wrong Answer | import bisect
N = int(input())
L = list(map(int, input().split()))
s = 0
L = sorted(L)
print(L)
for c in reversed(range(2, N)):
for b in reversed(range(1, c)):
a = bisect.bisect_left(L, L[c]-L[b])
if a<b:
s += b-a
print(s) |
p02546 | s076321169 | Accepted | n=input()
if n[-1] == "s":
print(n+"es")
else:
print(n+"s")
|
p03493 | s841733928 | Accepted | x=input()
X=list('{}'.format(x))
a=[]
for i in range(len(X)):
a.append(int(X[i]))
A=sum(a)
print(A)
|
p02879 | s924937535 | Wrong Answer | A, B = map(int, input().split())
print(A*B) |
p02859 | s158765486 | Accepted | # 初期入力
r = int(input())
#mennseki_r =3.14*r*r
#mennseki_1 =3.14*1*1
#kotae =int(mennseki_r / mennseki_1)
kotae=r*r
print(kotae) |
p02597 | s560446527 | Accepted | n=int(input())
c=input()
a=c.count('R')
print(a-c[:a].count('R')) |
p02684 | s071106685 | Accepted | # D - Teleporter
N,K = map(int,input().split())
A = [0]+list(map(int,input().split()))
s = {1:0}
l = [1]
i = 1
for j in range(1,10**10):
i = A[i]
if i in s:
sigma = j-s[i]
break
s[i] = j
l.append(i)
if K<s[i]:
print(l[K])
else:
K -= s[i]
mod = l[s[i]:]
print(mod[K%sigma]) |
p03862 | s672567399 | Wrong Answer | n,x=map(int,input().split())
a=list(map(int,input().split()))
ans=0
count=0
for i in range(0,n-1):
if a[i]+a[i+1]>x:
ans=ans+a[i]+a[i+1]-x
a[i+1]=a[i+1]-(a[i]+a[i+1]-x)
for i in range(n-1,0):
if a[i]+a[i+1]>x:
count=count+a[i]+a[i+1]-x
a[i]=a[i]-(a[i]+a[i+1]-x)
print(min(ans,count)) |
p02695 | s996656592 | Accepted | # coding: utf-8
import itertools
N, M, Q = map(int, input().split())
lst = [list(map(int, input().split())) for _ in range(Q)]
l = [i for i in range(1, M + 1)]
A = list(itertools.combinations_with_replacement(l, N))
maxans = 0
for j in A:
ans = 0
for i in lst:
if j[i[1]-1] - j[i[0]-1] == i[2]:
ans = ans + i[3]
maxans = max(maxans, ans)
print(maxans) |
p02713 | s992820344 | Accepted | # coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
K = ir()
A = np.arange(1, K+1, dtype=np.int32)
B = np.gcd.outer(np.gcd.outer(A, A), A)
answer = B.sum()
print(answer)
|
p03137 | s097028346 | Accepted | n, m, *a = map(int, open(0).read().split());a.sort()
print(sum(sorted([abs(a[i+1]-a[i])for i in range(m-1)])[:max(0,m-n)])) |
p02701 | s289588242 | Accepted | kaisu = int(input())
keihin = [input() for i in range(kaisu)]
shurui = set(keihin)
print(len(shurui)) |
p02881 | s901343842 | Wrong Answer | def main():
n = int(input())
i = int((n)**0.5) + 1
while i * i > n: i -= 1
while i >= 1:
if n % i == 0:
print(i+n//i)
return
i -= 1
main()
|
p03487 | s717126925 | Accepted | def resolve():
N = int(input())
A = list(map(int, input().split(" ")))
d = {0: 0}
for a in A:
if a in d:
d[a] += 1
else:
d[a] = 1
cnt = 0
for i in d.keys():
if d[i] >= i:
cnt += d[i] - i
else:
cnt += d[i]
print(cnt)
if '__main__' == __name__:
resolve() |
p02731 | s601415044 | Accepted | n = int(input())
print((n/3)**3) |
p02951 | s104202548 | Accepted | A,B,C=list(map(int,input().split()))
ans=C-(A-B)
if(ans<0):
ans=0
print(ans) |
p02613 | s705836535 | Wrong Answer | N = int(input())
for i in range(N):
S = input().split()
a = list(S)
a.append(S)
i += 1
print("AC" + " x " + str(a.count("AC")))
print("WA"+ " x "+ str(a.count("WA")))
print("TLE" + " x " + str(a.count("TLE")))
print("RE" + " x " + str(a.count("RE")))
|
p03612 | s000705658 | Accepted | import sys
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
n = I()
p = LI()
ans = 0
for i in range(1, n):
if p[i-1] == i:
temp = p[i-1]
p[i-1] = p[i]
p[i] = temp
ans += 1
if p[n-1] == n:
ans += 1
print(ans)
if __name__ == '__main__':
main() |
p03799 | s622713340 | Accepted | N, M = map(int, input().split())
if N >= M/2:
ans = M//2
else:
ans = int((2*N + M)//4)
print(ans) |
p02924 | s188016603 | Wrong Answer | n = int(input())
print(int(n*(0+n-1)/2)) |
p02829 | s886140002 | Accepted | A = int(input())
B = int(input())
print( 6-(A+B) ) |
p03862 | s443507609 | Accepted |
def resolve():
N, X = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
for i in range(1, N):
diff = max((A[i - 1] + A[i]) - X, 0)
ans += diff
A[i] = max(A[i] - diff, 0)
print(ans)
if __name__ == "__main__":
resolve() |
p03485 | s355047437 | Accepted | import math
a,b=map(int, input().split()) #複数数値入力 「A B」みたいなスペース空いた入力のとき
c = math.ceil((a+b)/2)
print(c) |
p02823 | s910137905 | Accepted | n,a,b = map(int,input().split())
diff = abs(a-b)
if diff%2==0:
print(diff//2)
else :
print(min(a - 1, n - b) + 1 + diff // 2) |
p02761 | s317604268 | Accepted | N, M = map(int, input().split())
r = list([None]*N)
for i in range(M):
s, c = map(int, input().split())
if r[s-1] is not None and r[s-1] != c:
print("-1")
exit()
r[s-1] = c
if N > 1 and r[0] == 0:
print("-1")
exit()
for i in range(len(r)):
if r[i] is None:
if N > 1 and i == 0:
r[i] = 1
else:
r[i] = 0
print("".join(map(str, r))) |
p02725 | s043349226 | Accepted | K,N = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
A.append(K+A[0])
max_distance = 0
for i in range(1,len(A)):
max_distance = max(max_distance,A[i] - A[i-1])
ans = K - max_distance
print(ans)
|
p03062 | s525039065 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
s = 0
b = [abs(x) for x in a]
if n % 2 == 0:
s = sum(b)
else:
s = sum(b) - 2 * min(b)
print(s) |
p02584 | s305785001 | Accepted | x, k, d = map(int, input().split())
if x >= 0:
if x//d >= k:
print(abs(x - k*d))
else:
if (k - x//d)%2 == 0:
print(abs(x%d))
else:
print(abs(x%d - d))
else:
if abs(x)//d >= k:
print(abs(x + k*d))
else:
if (k - abs(x)//d)%2 == 0:
print(abs(x)%d)
else:
print(d - abs(x)%d) |
p03720 | s071701104 | Wrong Answer | N, M = map(int, input().split())
for _ in range(M):
a, b = input().split()
for i in range(1, N+1):
print(a.count("i")+b.count("i")) |
p03136 | s146748627 | Accepted | n = int(input())
l = list(map(int, input().split()))
if max(l) * 2 < sum(l):
print('Yes')
else:
print('No') |
p03062 | s346534638 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(input())
A = list(map(int, input().split()))
neg_cnt = 0
minimum = 10**10
for num in A:
minimum = min(minimum, abs(num))
if num < 0:
neg_cnt += 1
ans = 0
for num in A:
if num < 0:
ans += -num
else:
ans += num
if neg_cnt % 2 == 0:
print(ans)
else:
print(ans - minimum * 2) |
p03797 | s489576873 | Accepted | N, M = map(int, input().split())
print(M//2 if 2*N > M else N + (M-2*N)//4) |
p02988 | s095145472 | Accepted | n=int(input())
P=list(map(int,input().split()))
cnt=0
for i in range(1, n-1):
r=P[i]
q=P[i-1:i+2]
q=sorted(q)
if q[1]==r:
cnt+=1
print(cnt) |
p02993 | s705456825 | Accepted | S = input()
ans = 'Good'
for i in range(3):
if (S[i] == S[i + 1]):
ans = 'Bad'
print(ans) |
p02546 | s956663221 | Wrong Answer | s = list(input())
if s[-1] == s:
for i in s:
print(i,end = "")
print("es")
else:
for i in s:
print(i,end = "")
print("s") |
p02647 | s525941473 | Accepted | import math
N, K = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
for i in range(min(41, K)):
B = [0] * N
for n, A_n in enumerate(A):
B_min = max(0, n-A_n)
b_max = min(N-1, n+A_n)
B[B_min] += 1
if b_max+1 < N:
B[b_max+1] -= 1
sum = 0
for n in range(len(A)):
sum += B[n]
A[n] = sum
print(" ".join(list(map(str, A)))) |
p02888 | s463986087 | Wrong Answer | n = int(input())
l = list(map(int,input().split()))
l.sort()
ans = 0
print(l)
for i in range(n):
for j in range(i+1,n):
val = l[i]+l[j]
ng = n
ok = j
while abs(ok - ng) > 1:
mid = (ok+ng)//2
if val > l[mid]:
ok = mid
else:
ng = mid
print(i,j,ok,ng)
ans += ok - j
print(ans) |
p04030 | s725282935 | Wrong Answer | # -*- coding : utf-8 -*-
S = str(input())
w = ""
if S[0] == "B":
w = ""
else :
w = w + S[0]
for i in range(1,len(S)):
if S[i] == "B":
if w == "":
w = ""
else :
w = w.rstrip(S[i-1])
else:
w = w + S[i]
print(w) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.