problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02552 | s706950833 | Accepted | n=int(input())
if n==1:
print(0)
elif n==0:
print(1) |
p03243 | s258177402 | Accepted | n=int(input())
for i in range(n,1000):
s=str(i)
if s[0] == s[1] == s[2]:
print(i)
exit() |
p02639 | s649818019 | Accepted | l = list(map(int, input().split()))
print(l.index(0)+1) |
p03696 | s623135669 | Accepted | from collections import deque
n = int(input())
s = input()
l, que = 0, deque([])
for i in s:
que.append(i)
if i == '(':
l += 1
if i == ')':
if l == 0:
que.appendleft('(')
else:
l -= 1
print(*que, ')' * l, sep='')
|
p03495 | s863673395 | Accepted | import collections
N,K = map(int,input().split())
N_List = list(map(int,input().split()))
Chou_List = collections.Counter(N_List)
if len(Chou_List) <= K:
print(0)
else:
Chou_List = sorted(list(Chou_List.values()),reverse=True)
print(sum(Chou_List[K:]))
|
p03543 | s176601820 | Accepted | n=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') |
p03339 | s519407534 | Accepted | n=int(input())
s=input()
ans=s[1:].count("E")
c=ans
for i in range(1,n):
if s[i]=="E":
c-=1
if s[i-1]=="W":
c+=1
ans=min(ans,c)
print(ans) |
p03481 | s791889869 | Accepted | x,y=map(int,input().split())
n=1
while int(x*2**n)<=y:
n+=1
print(n) |
p02547 | s904168178 | Accepted | N = int(input())
D = [list(map(int,input().split())) for _ in range(N)]
ans = 0
for i in range(N-2):
if D[i][0] == D[i][1] and D[i+1][0] == D[i+1][1] and D[i+2][0] == D[i+2][1]:
ans += 1
else:
ans += 0
if ans >= 1:
print("Yes")
else:
print("No")
|
p02994 | s131931077 | Accepted | n,l=map(int,input().split())
ans=n*(l-1)+(n*(n+1))//2
if l>0:
ans-=l
elif l+n-1<0:
ans-=l+n-1
print(ans) |
p03317 | s141585555 | Wrong Answer | n,k = map(int,input().split())
a = list(map(int,input().split()))
idx = a.index(1)
print(-(-idx // (k-1)) - (-(n - idx - 1) // (k-1)))
|
p03281 | s276840983 | Accepted | N = int(input())
ans = 0
for i in range(1, N + 1, 2):
count = 0
n = 1
while n * n <= i:
if not i % n:
if n * n == i:
count += 1
else:
count += 2
n += 2
if count == 8:
ans += 1
print(ans) |
p03408 | s546483675 | Accepted | n = int(input())
s = [input() for _ in range(n)]
m = int(input())
t = [input() for _ in range(m)]
s_set = list(set(s))
win = max(s.count(s_set[i]) - t.count(s_set[i]) for i in range(len(s_set)))
print(max(0,win)) |
p03693 | s044371366 | Wrong Answer | n = int(input().replace(" ",""))
if n%4 == 0:
print("Yes")
else:
print("No") |
p03011 | s740559972 | Accepted | P, Q, R = map(int,input().split())
PQ = P + Q
QR = Q + R
RP = R + P
temp1 = min(PQ, QR)
temp2 = min(temp1, RP)
print(temp2)
|
p03211 | s861061428 | Wrong Answer | S = input()
print(min([753 - int(S[i:i+3]) for i in range(len(S)-3 + 1)]))
|
p02818 | s596329841 | Accepted | a, b, k = list(map(int, input().split()))
if 0 <= a - k:
print(a - k, b)
elif 0 < b - (k - a):
print(0, b - (k - a))
else:
print(0, 0)
|
p03339 | s746607049 | Accepted | from itertools import accumulate
n = int(input())
s = input()
aa = {'E':1, 'W':0}
e = list(map(aa.get, s))
aa = {'E':0, 'W':1}
w = list(map(aa.get, s))
ae = list(accumulate(e[::-1]))[::-1]
aw = list(accumulate(w))
ans = float('INF')
for i in range(1, n-1):
if ans > ae[i+1] + aw[i-1]:
ans = ae[i+1] + aw[i-1]
print(min([ans, ae[1], aw[-2]]))
# print(ae, aw)
|
p03951 | s216539592 | Accepted | n = int(input())
s = input()
t = input()
min_len = 2 * n
for i in range(n):
if s[-1 - i:] == t[:i+1]:
min_len = min(min_len, 2 * n - i - 1)
print(min_len)
|
p02577 | s137353309 | Wrong Answer | n = input()
s = str(n)
l = len(s)
ans = 0
for i in range(l+1):
ans += int(s[-i])
p = ans-(int(s[-l]))
if p%9 == 0:
print("Yes")
exit() |
p03281 | s338723727 | Accepted | N=int(input())
#https://qiita.com/LorseKudos/items/9eb560494862c8b4eb56
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
count=0
for i in range(1, N+1):
if i%2==1 and len(make_divisors(i))==8:
count+=1
print(count) |
p02879 | s632649287 | Wrong Answer | a,b = map(int,input().split())
if(a*b <= 81):
print(a*b)
else:
print(-1) |
p03160 | s364719778 | Accepted | N = int(input())
H = list(map(int,input().split()))
dp = [0]*N
dp[1] = abs(H[0]-H[1])
for i in range(2,N):
dp[i] = min(abs(H[i]-H[i-1]) + dp[i-1], abs(H[i]-H[i-2]) + dp[i-2])
print(dp[-1]) |
p03160 | s410122330 | Accepted | # A - Frog1
import numpy as np
N = int(input())
h = list(map(int, input().split()))
dp = [10**9]*(N+2)
dp[0] = 0
for i in range(N):
if i+1<N:
dp[i+1] = min(dp[i+1], dp[i]+abs(h[i+1]-h[i]))
if i+2<N:
dp[i+2] = min(dp[i+2], dp[i]+abs(h[i+2]-h[i]))
print(dp[N-1]) |
p02909 | s800067581 | Accepted | s = input()
if s == 'Sunny':
print('Cloudy')
elif s == 'Cloudy':
print('Rainy')
else:
print('Sunny')
|
p03329 | s518129711 | Wrong Answer | n = int(input())
ar = [1,6,9,36,81,729,1296,6561,7776,46656,59049]
dp = [float('inf')]*101000
dp[0] = 0
for i in range(1, n+1):
mins = float('inf')
for a in ar:
if i >= a:
# i円の最小操作回数 = min(i-1円の最小操作回数+1, i-ar[j]円の最小操作回数+1
mins = min(mins, min(dp[i-1] + 1, dp[i-a]+1))
dp[i] = mins
print(dp[n]) |
p03352 | s042256469 | Accepted | X = int(input())
ans = 1
for i in range(2, X + 1):
p = 2
while i ** p <= X:
ans = max(ans, i ** p)
p += 1
#ans = max(ans, i ** p)
print(ans)
|
p03720 | s602041517 | Accepted | N,M=map(int,input().split())
jud=[]
for _ in range(M):
a,b=map(str,input().split())
jud.append(a)
jud.append(b)
for j in range(1,N+1):
print(jud.count(str(j))) |
p04020 | s039145149 | Accepted | N = int(input())
A = []
for _ in range(N):
A.append(int(input()))
ans = 0
for i in range(N):
ans += A[i] // 2
A[i] = A[i] % 2
if A[i] == 1 and i + 1 < N and A[i + 1] > 0:
ans += 1
A[i] -= 1
A[i + 1] -= 1
print(ans) |
p02772 | s898612235 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
fl = True
for i in A:
if i&1:
continue
else:
if i%3!=0 or i%5!=0:
fl = False
break
print('APPROVED') if fl else print('DENIED') |
p03211 | s095961317 | Accepted | n=input()
ans=753
for i in range(len(n)-2):
a=int(n[i:i+3])
if a==753:
print(0)
exit()
b=abs(753-a)
ans=min(b,ans)
print(ans)
|
p03543 | s202009954 | Accepted | N = input()
if N[0] == N[1] == N[2] or N[1] == N[2] == N[3]:
print("Yes")
else:
print("No") |
p03478 | s954277319 | Accepted | def digit_sum(x):
y = str(x)
y_len = len(y)
ans = 0
for j in range(y_len):
ans += int(y[j])
return ans
answer=0
n,a,b = map(int,input().split())
for i in range(1, n+1):
if a<= digit_sum(i) <= b:
answer+=i
print(answer) |
p03071 | s450930584 | Wrong Answer | a,b=[int(x) for x in input().split()]
ans=max(a,b)*2
if a==b:
ans+=1
print(ans) |
p03150 | s415792156 | Wrong Answer | l = list(input())
ans = list("keyence")
count = 0
check = 0
check2 = 0
for i in range(len(l)):
if l[i] == ans[count]:
check2 = 0
count += 1
else:
if check2 == 1:
continue
else:
check += 1
check2 = 1
if count == 7:
print("YES")
exit()
print("NO")
|
p03479 | s703217812 | Wrong Answer | x, y = map(int, input().split())
ans = 1
while x <= y:
x *= 2
ans += 1
else:
print(ans) |
p02552 | s544401192 | Accepted | x = int(input())
if x == 1:
print(0)
else:
print(1) |
p04019 | s428365012 | Wrong Answer | s = input()
if 0 in [s.count("W"),s.count("E"),s.count("N"),s.count("S")]:
print("No")
else:
print("Yes") |
p03711 | s110659215 | Wrong Answer | a,b = map(int, input().split())
if a == 2 or b == 2:
print('No')
elif a == (4 or 6 or 9 or 11):
if b == (4 or 6 or 9 or 11):
print('Yes')
else:
print('No')
else:
if b == (4 or 6 or 9 or 11 or 2):
print('No')
else:
print('Yes')
|
p03998 | s085402733 | Accepted | from queue import deque
s = []
for _ in range(3):
s.append(deque(input()))
f = lambda x: ord(x)-ord('a')
nxt = 0
while len(s[nxt])>0:
now = nxt
nxt = f(s[now].popleft())
print(chr(nxt+ord('A'))) |
p03328 | s968202329 | Accepted | a,b=list(map(int,input().split()))
d=b-a
sum=0
l=[]
for i in range(1,d):
sum+=i
l.append(sum)
print(sum-a)
|
p03815 | s587797635 | Accepted | import sys
import math
x=int(input())
if not ( 1 <= x <= 10**15 ): sys.exit()
print(math.ceil(((x-6)/11)*2)+1) |
p03095 | s751390025 | Accepted | N=int(input())
s=list(input())
from collections import Counter
d=Counter(s)
ans=1
for v in d.values():
ans*=(v+1)
ans-=1
ans=ans%(10**9+7)
print(ans)
|
p03474 | s561248616 | Wrong Answer | a, b = map(int, input().split())
s = input()
print("Yes" if s[:a].isdecimal() and s[a:b] == "-" and s[b:].isdecimal() and len(s) == a+b+1 else "No")
|
p03478 | s816164648 | Accepted | N, A, B = map(int, input().split())
ans = 0
for i in range(1, N + 1):
if A <= sum(map(int, list(str(i)))) <= B:
ans += i
print(ans) |
p03000 | s458484847 | Accepted | n,x=map(int,input().split())
#ls=[0]+[int(x) for i in input().split()]
ls=list(map(int,input().split()))
#d=[]
#d.append(0)
ans=0
d=0
for i in ls:
d=d+i
if d>x:
break
ans +=1
print(ans+1) |
p02664 | s650972780 | Wrong Answer | T=input()
lis=[T[i] for i in range(len(T))]
for i in range(len(T)):
if lis[i]=="?":
if lis[min(i+1,len(T)-1)]!="P":
lis[i]="P"
else:
lis[i]="D"
k="".join(lis)
print(k) |
p03723 | s441086527 | Accepted | a,b,c=map(int,input().split())
if a==b and b==c and a%2==0 and b%2==0 and c%2==0:
print(-1)
else:
k=0
while a%2==0 and b%2==0 and c%2==0:
A=a
B=b
C=c
a=B//2+C//2
b=A//2+C//2
c=A//2+B//2
k+=1
print(k) |
p03455 | s454631334 | Accepted | arg = input()
a, b = arg.split()
if int(a)*int(b)%2 == 0 :
print("Even")
else :
print("Odd") |
p02786 | s590724682 | Accepted | def kill(life):
if life == 1:
return 1
elif life > 1:
return kill(life//2) * 2 + 1
h = int(input())
print(kill(h)) |
p02939 | s934735312 | Wrong Answer | S = input()
N = len(S)
ans = 1
i = 1
prev_two = 1
while i < N:
if prev_two:
i += 1
prev_two = 0
elif S[i] == S[i-1]:
i += 2
prev_two = 1
else:
i += 1
ans += 1
if i == N:
ans -= 1
print(ans) |
p02583 | s759409753 | Wrong Answer | def mulit(a):
a_copy = list(a)
return len(a) == len(set(a_copy))
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
a_len = len(A)
answer = []
for i in range(0, a_len-2):
for j in range(i+1, a_len-1):
for k in range(j+1, a_len):
answer.append([A[i], A[j], A[k]])
answer = [i for i in answer if mulit(i)]
answer_len = len(answer)
print(f"{answer_len}") |
p03659 | s318585896 | Accepted | N=int(input())
a=input().split()
a=[int(b) for b in a]
numbers=[]
number=0
for a_ in a:
number+=a_
numbers.append(number)
del numbers[-1]
if N==2:
print(abs(a[0]-a[1]))
else:
whole=sum(a)
answers=[]
for number in numbers:
answer=abs(number*2-whole)
answers.append(answer)
print(min(answers))
|
p03632 | s983650917 | Accepted | A, B, C, D = map(int, input().split())
start = max(A, C)
end = min(B, D)
print(end - start if start <= end else 0)
|
p03013 | s007087572 | Wrong Answer | n,m = list(map(int, input("").split()))
a=set([int(input()) for i in range(m)])
print(a)
mod = 10 ** 9 + 7
dp = [0] * (n+2)
dp[1] = 1
for i in range(2,n+2):
if i-1 not in a:
dp[i] = dp[i-1] % mod + dp[i-2] % mod
print(dp[n+1] % mod) |
p02836 | s415774159 | Wrong Answer | s =input()
cnt =0
for i in range(int(len(s)//2)-1):
if s[i]!=s[i-1]:
cnt +=1
print(cnt) |
p03323 | s428379396 | Wrong Answer | import numpy as np
d, n = list(map(int, input().split()))
print(pow(100, d)*n) |
p02959 | s854722937 | Accepted | def solve():
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += min(B[i], A[i] + A[i + 1])
A[i + 1] = min(A[i + 1], max(A[i] + A[i + 1] - B[i], 0))
print(ans)
solve()
|
p02959 | s035017640 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
num = 0
for i, b in enumerate(b):
if b > a[i]:
b -= a[i]
num += a[i]
if b > a[i+1]:
num += a[i+1]
a[i+1] = 0
else:
a[i+1] -= b
num += b
else:
num += b
print(num) |
p02627 | s663862654 | Wrong Answer | a = input()
if a.lower() == a:
print('A')
else:
print('a') |
p03076 | s362684536 | Accepted | # -*- coding: utf-8 -*-
import math
import itertools
import sys
import copy
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
A = []
for _ in range(5) :
A.append(int(input()))
pmax = 0
sumA = 0
for i in range(5) :
p = 0
while A[i]%10 != 0 :
A[i] += 1
p += 1
sumA += A[i]
pmax = max(pmax, p)
print (sumA - pmax)
|
p02714 | s262464060 | Wrong Answer | N=int(input())
S=input()
c = 0
for i in range(N-2):
for j in range(i+1,N-1):
if S[i] != S[j]:
RGB = 'RGB'.strip(S[i]).strip(S[j])
S_ = S[j+1:]
d = j - i - 1
S_ = S_[:d]+S_[d+1:]
c += S_.count(RGB)
print(c) |
p03472 | s540145444 | Accepted | import math
n,h=map(int,input().split())
a_l=[]
b_l=[]
c=0
for i in range(n):
a,b=map(int,input().split())
a_l.append(a)
b_l.append(b)
a_l.sort()
b_l.sort()
for i in range(1,n+1):
if a_l[-1]<=b_l[(-1)*i]:
h-=b_l[(-1)*i]
c+=1
if h<=0:
break
else:
break
if h>0:
c+=math.ceil(h/a_l[-1])
print(c) |
p03486 | s413466016 | Accepted | s=list(input())
t=list(input())
s.sort()
t.sort(reverse=True)
if s<t:
print('Yes')
else:
print('No') |
p02866 | s877887270 | Accepted | n = int(input())
d_list = list(map(int,input().split()))
p = 998244353
import collections
result = 0
check = True
for i in range(1,len(d_list)):
if d_list[i] == 0:
check = False
if d_list[0] != 0:
print(result)
elif check == False:
print(result)
else:
result = 0
c = collections.Counter(d_list)
for i in range(1,max(d_list) + 1):
if i == 1:
result += 1
elif c[i] == 0:
result = 0
else:
result = result * (c[i -1] ** c[i])
print(result % p)
|
p02612 | s427155414 | Accepted | m = int(input())
mod = m % 1000
if mod == 0:
print(0)
else:
print(1000 - mod) |
p02675 | s548344879 | Accepted | N = int(input())
a = N % 10
if a == 2 or a == 4 or a ==5 or a == 7 or a == 9:
print('hon')
elif a == 3:
print('bon')
else:
print('pon')
|
p02946 | s009139071 | Wrong Answer | import numpy as np
p,q= input().split()
a,b =(int(p), int(q))
list_np = np.arange(-1000000, 1000000,1)
ans_list = []
for i in range(a):
ans_list.append(b + i)
ans_list.append(b - i)
ans_list.pop(0)
ans_list.sort()
ans=''
print(ans_list)
for i in range(a*2 -1):
if i < a * 2 -1 :
ans += str(ans_list[i])
ans +=' '
else:
ans +=str(ans_list[i])
break
print(ans) |
p03486 | s396275883 | Wrong Answer | import sys
s = sorted(list(str(input())))
t = sorted(list(str(input())), reverse = True)
u = min(len(s), len(t))
for i in range(min(len(s), len(t))):
if s[i] < t[i]:
print('Yes')
sys.exit()
if s[i] > t[i]:
print('No')
sys.exit()
elif len(s) < len(t):
print('Yes')
sys.exit()
elif len(s) >= len(t):
print('No')
sys.exit() |
p02820 | s980379551 | Accepted | n,k = map(int,input().split())
r,s,p = map(int,input().split())
x=0
t = list(input())
for i in range(k):
temp=t[i::k]
for j in range(1,len(temp)):
if temp[j-1]==temp[j]:
temp[j]='x'
t[j*k+i]='x'
point=0
for i in t:
if i == 'r':
point+=p
if i == 's':
point+=r
if i == 'p':
point+=s
print(point) |
p02848 | s587667329 | Accepted | import math
N = int(input())
S = input()
alphabets = ['A']
for i in range(25):
alphabets.append(chr(ord(alphabets[-1]) + 1))
ans = ''
for s in S:
ans += alphabets[(alphabets.index(s)+N)%26]
print(ans) |
p02753 | s730787066 | Accepted | S = input()
if S == 'AAA' or S == 'BBB':
print('No')
else:
print('Yes')
|
p02970 | s321471328 | Accepted | def resolve():
N, D = list(map(int, input().split()))
print(N//(2*D+1) if N%(2*D+1)==0 else (N//(2*D+1))+1)
if '__main__' == __name__:
resolve() |
p03962 | s392005548 | Accepted | a = list(map(int, input().split()))
print(len(set(a))) |
p03478 | s208223915 | Accepted | N,A,B=map(int,input().split())
k=0
for i in range(0,N+1):
D=list(str(i))
C=sum(int(j) for j in D)
if A<=C<=B:
k += i
print(k) |
p03711 | s715248650 | Accepted | def search_group(a):
if a in zone_one:
ret = 1
elif a in zone_two:
ret = 2
else:
ret = 3
return ret
zone_one = {1,3,5,7,8,10,12}
zone_two = {4,6,9,11}
zone_three = {2}
x,y = map(int,input().split())
ret_x = search_group(x)
ret_y = search_group(y)
if ret_x == ret_y:
print("Yes")
else:
print("No") |
p02712 | s445972239 | Wrong Answer | n = int(input())
print(4*(n**2)//15) |
p03487 | s713295013 | Wrong Answer | n = int(input())
seq = [int(x) for x in input().split()]
if len(seq) == 1:
print("1")
else:
total = 0
counts = {}
for x in seq:
if x not in counts:
counts[x] = 1
else:
counts[x] += 1
for key,val in counts.items():
if val < key:
total += val
else:
total += abs(key-val)
print(total)
|
p04005 | s403587852 | Wrong Answer | a, b, c = map(int, input().split())
x = a // 2 * b * c
y = -(-a // 2) * b * c
print(y - x) |
p02832 | s710537505 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
def myindex(l, x, default=-1):
if x in l:
return l.index(x)
else:
return default
for i in range(1, n+1):
b = myindex(a, i, default=-1)
print(b)
if b == -1:
del a[(i-1):]
break
else:
del a[(i-1):b]
if len(a) == 0:
print('-1')
else:
print(n - len(a)) |
p03625 | s436636119 | Accepted | n=int(input())
a=list(map(int,input().split()))
from collections import Counter
a=Counter(a)
a=sorted(a.items(), reverse=True)
x=0
y=0
for p,q in a:
if q>=4:
if x==0:
x=y=p
break
else:
y=p
break
elif q>=2:
if x==0:
x=p
else:
y=p
break
print(x*y) |
p03481 | s433594557 | Accepted | X,Y=map(int, input().split())
tmp = X
n = 0
while tmp * 2 <= Y:
tmp = tmp * 2
n += 1
print(n+1) |
p03433 | s342834523 | Accepted | N=int(input())
A=int(input())
if N%500<=A:
print("Yes")
else:
print("No") |
p03331 | s609215640 | Wrong Answer | n = int(input())
ans = 1001001001
for i in range(1,n-1):
j = n-i
i_sum, j_sum = 0, 0
si, sj = list(str(i)), list(str(j))
for s1 in si:
i_sum += int(s1)
for s2 in sj:
j_sum += int(s2)
ans = min(ans, i_sum+j_sum)
print(ans) |
p02730 | s638793376 | Wrong Answer | #!/usr/bin/env python3
S = input()
n = len(S)
f = 0
if S == S[::-1]:
L = S[:int((n-1)/2)]
R = S[int((n+1)/2):]
if len(L) == 1:
print('Yes')
elif L == L[::-1] and R == R[::-1]:
print('Yes')
f = 1
if f ==0:
print('No')
|
p02706 | s737194335 | Accepted | a=input()
a=a.split()
N=int(a[0])
b=input()
b=b.split()
z=0
for x in b:
z=z+int(x)
w=N-z
if w<0:
print("-1")
else:
print(w) |
p03544 | s012834279 | Wrong Answer | n = int(input())
l = [0] * (n + 1)
l[0] = 2
l[1] = 1
if n == 1:
print(1)
else:
for i in range(2, n + 1):
l[i] = l[i - 1] + l[i - 2]
print(l[n]) |
p02730 | s095666518 | Wrong Answer | def is_kaibun(string):
isk = True
length = len(string)
for i in range(length // 2):
if string[i] != string[length - 1 - i]:
isk = False
break
return isk
s = input()
len_s = len(s)
if is_kaibun(s[0:(len_s // 2)]) and is_kaibun(s[(len_s // 2) + 1:len_s]):
print('Yes')
else:
print('No')
|
p04031 | s785156664 | Wrong Answer | sum1 = 0
tmp = 100
N = input()
lst = list(map(int, input().split()))
MAX = max(lst)
MIN = min(lst)
for i in range(MIN,MAX + 1):
for j in lst:
sum1 = sum1 + (i - j)**2
if tmp >= sum1:
tmp = sum1
sum1 = 0
print(tmp)
|
p02665 | s316973403 | Accepted | n=int(input())
a=list(map(int,input().split()))
tot=sum(a)
v=[1]
for q in a:
tot-=q
v.append(min(2*(v[-1]-q),tot))
if all([u>=0 for u in v]):
print(sum(v))
else:
print(-1) |
p03617 | s690733132 | Accepted | q,h,s,d = [int(x) for x in input().split()]
n = int(input())
print((n//2) * min(8*q, 4*h, 2*s, d) + (n%2) * min(4*q, 2*h, s)) |
p02700 | s348903538 | Accepted | T_h, T_s, A_h, A_s = map(int, input().split())
# Turns that each need to win
T_t = (A_h + T_s - 1) // T_s # Y
A_t = (T_h + A_s - 1) // A_s # X
if T_t <= A_t:
print("Yes")
else:
print("No")
|
p03862 | s830222602 | Accepted | # coding: utf-8
# Your code here!
N,x=map(int,input().split())
A=[0]+list(map(int,input().split()))
ans=0
for i in range(N):
temp=A[i+1]+A[i]
ans+=max(temp-x,0)
A[i+1]=A[i+1]-max(temp-x,0)
print(ans) |
p03817 | s550858438 | Accepted | def point(mid):
ans = 0
ans += (mid // 2) * 11
mid -= (mid // 2) * 2
ans += mid * 6
return ans >= x
x = int(input())
ok = 10 ** 18
ng = 0
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if point(mid):
ok = mid
else:
ng = mid
print(ok) |
p02900 | s189445068 | Wrong Answer | from math import gcd
A, B = map(int, input().split())
m = gcd(A, B)
#print(m)
num = int(m**0.5) + 1 #mに対する素因数分解は、int(√m)+1の場合を調べればよい
print(num)
ans = 1
for i in range(2,num+1):
if m%i:
continue
ans += 1
while not m%i:
m = m/i
print(ans)
|
p03250 | s344617114 | Accepted | def main():
lis = list(input().split())
anolis = sorted(lis, reverse=True)
anolis.insert(2,'+')
print(eval(''.join(anolis)))
main() |
p03448 | s417557568 | Accepted | a, b, c, x = map(int, [input() for i in range(4)])
ans = 0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
if i * 500 + j * 100 + k * 50 == x:
ans += 1
print(ans) |
p02676 | s619637701 | Accepted | k=int(input())
s= input()
if(len(s)<=k):
print(s)
else:
print(s[:k]+"...") |
p02603 | s905126807 | Accepted | N = int(input())
*A, = map(int, input().split())
dp = [0]*(N+1)
dp[0] = 1000
for i in range(1, N+1):
dp[i] = dp[i-1]
for j in range(1, i):
dp[i] = max(dp[i], (dp[j]//A[j-1])*A[i-1] + (dp[j]%A[j-1]))
print(dp[-1])
|
p02720 | s604238154 | Accepted | import queue
K = int(input())
L = queue.Queue()
for i in range(1,10):
L.put(i)
for i in range(K-1):
x = L.get()
p = 10*x
m = x%10
if m != 0:
L.put(p+m-1)
L.put(p+m)
if x%10 != 9:
L.put(p+m+1)
print(L.get())
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.