problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02742 | s247866804 | Accepted | H,W=map(int,input().split())
if H==1 or W==1:
print(1)
elif H%2==1 and W%2==1:
print((H*W)//2+1)
else:
print((H*W)//2) |
p02665 | s089631302 | Accepted | N=int(input())
A=list(map(int,input().split()))
if A[0]:
if N==0 and A[0]==1:
print(1)
else:
print(-1)
exit()
B=[0 for _ in range(N)]
B.append(A[-1])
for i in range(N)[::-1]:
B[i]=B[i+1]+A[i]
r=1
ans=1
for i in range(1,N+1):
t=min(r*2,B[i])
ans+=t
r=t-A[i]
if r<0:
print(-1)
exit()
print(ans) |
p03136 | s760643638 | Wrong Answer | # -*- coding: <encoding name> -*-
n = int(input())
l = list(map(int, input().split()))
s = sum(l)
print('Yes' if (n - 1) > s else 'No') |
p02552 | s359242134 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
x = int(input())
if x == 0:
print(1)
else:
print(0)
if __name__=='__main__':
main() |
p03860 | s092663088 | Wrong Answer | s = input()
print('A' + s[0] + 'B')
|
p02987 | s522990280 | Wrong Answer | def main():
s=sorted(input())
print("Yes" if s[0]==s[1] and s[2]==s[3] else "No")
if __name__ == "__main__":
main() |
p03150 | s211995579 | Wrong Answer | S = input();
str = 'keyence';
ans = 'NO'
if S[0:7] == str :
ans = 'YES';
elif S[-7:0] == str :
ans = 'YES';
else :
for i in range(1,8) :
if S[0:i] == str[0:i] and S[-7+i:0] == str[-7+i:0] :
ans = 'YES';
break;
print(ans);
|
p03796 | s331139499 | Wrong Answer | n = int(input())
ans = 1
for i in range(n):
ans *= i+1
ans = ans%10000007 |
p02973 | s499730388 | Wrong Answer | n = int(input())
a = []
for i in range(n):
a.append(int(input()))
stk = []
ret = 0
for item in a:
if not stk:
stk.append(item)
if len(stk) > ret:
ret = len(stk)
else:
while stk and stk[-1] < item:
stk.pop()
stk.append(item)
if len(stk) > ret:
ret = len(stk)
print(ret)
|
p03838 | s167864938 | Wrong Answer | x,y = map(int,input().split())
ax = abs(x)
ay = abs(y)
if ax == ay and x != y:
a = 1
elif x > y and 0 <= y:
a = ax - ay + 1
elif x > y and 0 > y:
if ay > ax and x >= 0:
a = ay - ax + 1
elif ay > ax and x < 0:
a = ay - ax + 2
elif ax > ay:
a = ax - ay + 1
elif y > x and x < 0 and ay > ax:
a = ay - ax + 1
elif y > x and x < 0 and y > 0 and ax > ay:
a = ax - ay + 1
else:
a = y-x
print(a) |
p02695 | s878357112 | Accepted | import itertools
n, m, q = map(int, input().split()) # x = 1, y = 2
abcd = list(list(map(int, input().split())) for _ in range(q))
# print(n, m, q, abcd)
combis = list(itertools.combinations_with_replacement(range(1, m + 1), n))
# print(combis)
max_sum = 0
for patt in combis:
sumv = 0
for abc in abcd:
[a, b, c, d] = abc
if c == (patt[b - 1] - patt[a - 1]):
sumv += d
if max_sum < sumv:
max_sum = sumv
print(max_sum)
|
p03252 | s967357358 | Wrong Answer | S = input()
T = input()
reg = [None]*26
reg_flag = [0]*26
for i in range(len(S)):
index = ord(S[i])-97
if reg_flag[index] == 0:
reg[index] = T[i]
reg_flag[index] = 1
index_T = ord(T[i])-97
if reg_flag[index_T] == 0:
reg[index_T] = S[i]
reg_flag[index_T] = 1
if reg[index] == T[i]:
pass
else:
print('No')
exit()
print('Yes') |
p02831 | s306863884 | Accepted | import fractions
a,b=map(int,input().split())
print(a*b//fractions.gcd(a, b)) |
p02633 | s065664774 | Accepted | x = int(input())
y = 0
k = 0
while True:
y += x
k += 1
if y % 360 == 0:
break
print(k) |
p02767 | s416454225 | Accepted | N = int(input())
X = list(map(int, input().split()))
P = round(sum(X)/N)
ans = sum(list(map(lambda x: (x-P)**2, X)))
print(ans) |
p02727 | s093117325 | Wrong Answer | X, Y, A, B, C = map(int, input().split())
p = sorted(map(int, input().split()), reverse=True)[: X]
q = sorted(map(int, input().split()), reverse=True)[: Y]
r = list(map(int, input().split()))
all = p + q + r
all.sort(reverse=True)
print((all[:X + Y])) |
p03073 | s431758877 | Accepted | s=list(input())
n=len(s)
p=[]
q=[]
cnt_p=0
cnt_q=0
if n%2!=0:
m=(n-1)//2
p.extend(['0','1']*m)
p.append('0')
q.extend(['1','0']*m)
q.append('1')
else:
m=n//2
p.extend(['0','1']*m)
q.extend(['1','0']*m)
for i in range(n):
if s[i]==p[i]:
cnt_p+=1
else:
cnt_q+=1
print(min(cnt_p,cnt_q))
|
p02775 | s464824026 | Wrong Answer | N=list(map(int,list(input())))
L=[0,1,2,3,4,5,5,4,3,2]
ans=0
mi=0
m=0
j=0
a=0
for i in N:
ans+=L[i]
if i>=6:
if j==1:
m+=1
else:
j=1
m=0
else:
if j==1:
mi+=m
if m!=0:
a+=1
j=0
print(ans-2*mi-a) |
p03109 | s498687189 | Accepted | y, m, d = map(int, input().split("/"))
if y <= 2018:
print("Heisei")
elif y == 2019 and m <= 4:
print("Heisei")
else:
print("TBD") |
p03852 | s289335772 | Wrong Answer | import sys
input = sys.stdin.readline
c = input()
v = ["a", "e", "i", "u", "o"]
if c in v:
print("vowel")
else:
print("consonant") |
p02754 | s513087682 | Wrong Answer | n, a, b = map(int, input().split())
num_of_t = n // (a + b)
if num_of_t == 0:
if a >= n:
print(n)
else:
print(a)
exit()
print(a * num_of_t + n - num_of_t * (a + b)) |
p02823 | s907667872 | Accepted | N,A,B = map(int, input().split(" "))
distance = abs(B - A)
res=0
if distance % 2 == 0:
res = distance//2
else:
res = distance//2 + min(min(A,B)-1, N-max(A,B))+1
print(res) |
p02766 | s175156155 | Wrong Answer | INT_MAX=10**18+7
x=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]
GETA=123
###############################################################################
import math as M
n,k=INPUT()
print(M.ceil(M.log(n,k)))
|
p02861 | s635567512 | Accepted | from itertools import permutations
from math import sqrt,factorial
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
def distance(point1, point2):
return sqrt((point1[0]-point2[0])**2 + (point1[1]-point2[1])**2)
ans = 0
per = permutations(xy, n)
persize = factorial(n)
cost = 0
for i in per:
cpoint = i[0]
for j in i[1:]:
cost += distance(cpoint, j)
cpoint = j
ans = cost/persize
print(ans) |
p03274 | s924033195 | Accepted | n,k = map(int,input().split())
x = [int(i) for i in input().split()]
a = [abs(i) for i in x]
ans = float("inf")
for i in range(n-k+1):
if x[i] * x[i+k-1] < 0:
t = min(a[i],a[i+k-1])*2 + max(a[i],a[i+k-1])
else:
t = max(a[i],a[i+k-1])
ans = min(t, ans)
print(ans) |
p03109 | s527965818 | Accepted | S = int(input().replace("/", ""))
print("Heisei" if S <= 20190430 else "TBD") |
p02603 | s795594169 | Wrong Answer | N=int(input())
A=list(map(int, input().split()))
mon=1000
kabu=0
for i in range(N-1):
if A[i] < A[i+1]:
kabu = mon//A[i]
mon = mon - (kabu*A[i])
else:
mon += kabu*A[i]
kabu = 0
#print(mon)
#print(kabu)
#print("----")
mon += kabu*A[N-1]
print(mon)
|
p03986 | s173036785 | Wrong Answer | X = input()
Sn = 0
Tn = 0
for ch in X:
if ch == "S":
Sn += 1
if ch == "T":
if Sn > 0:
Sn -= 1
else:
Tn += 0
print(Sn + Tn) |
p02689 | s876875488 | Accepted | n, m = map(int, input().split())
h = list(map(int, input().split()))
gon = [1]*n
for i in range(m):
a, b = map(int, input().split())
if h[a-1]==h[b-1]:
gon[a-1], gon[b-1] = 0, 0
else:
low = a if h[a-1]<h[b-1] else b
gon[low-1] = 0
print(gon.count(1)) |
p02771 | s906203470 | Wrong Answer | A, B, C = map(int,input().split())
if A == B == C:
print("No")
elif A != B != C:
print("No")
else:
print("Yes") |
p03494 | s564589803 | Accepted | from math import log2
n = int(input())
a = map(int, input().split())
res = 10**9
for v in a:
cnt = 0
while v % 2 == 0:
v /= 2
cnt += 1
res = min(cnt, res)
print(res)
|
p03495 | s017814096 | Accepted | from collections import Counter
N,K = map(int,input().split())
A = list(map(int,input().split()))
A = Counter(A)
values, counts = zip(*A.most_common())
counts = list(counts)
ans = 0
while K < len(counts):
ans += counts[-1]
counts.pop(-1)
print(ans) |
p03282 | s165927937 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
s = input()
k = int(input())
res = 1
idx = 0
for i in range(len(s)):
if s[i] != "1":
res = s[i]
idx = i + 1
break
if k < idx:
print(1)
else:
print(res)
if __name__ == '__main__':
resolve()
|
p02633 | s628183838 | Accepted | n = int(input())
now = 0
for i in range(1,10000):
now += n
if now % 360 == 0:
print(i)
exit()
|
p03607 | s105301019 | Accepted | from collections import defaultdict
N,*A = map(int,open(0).read().split())
d = defaultdict(int) #初期値１
for a in A:
d[a] ^= 1 #0と1を反転
print(sum(d.values())) |
p02983 | s119508092 | Wrong Answer | L, R = map(int, input().split())
l = L % 2019
if l + R - L >= 2019:
ans = 0
else:
ans = (l * (l + 1)) % 2019
print(ans) |
p03814 | s440732966 | Accepted | s = input()
print(s.rfind("Z") - s.find("A") + 1) |
p03433 | s564798971 | Accepted | n, a = [int(input()) for _ in range(2)]
if n % 500 <= a:
print("Yes")
else:
print("No") |
p02866 | s542834705 | Accepted | def main():
MOD = 998244353
N = int(input())
D = list(map(int, input().split(' ')))
max_d = max(D)
counter = [0] * (max_d + 1)
for d in D:
counter[d] += 1
if D[0] != 0 or counter[0] != 1:
print(0)
return
ans = 1
for d in range(1, max_d + 1):
ans *= pow(counter[d - 1], counter[d], MOD)
ans %= MOD
print(ans)
if __name__ == '__main__':
main() |
p03557 | s513573417 | Accepted | import bisect
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort()
b.sort()
c.sort()
result = 0
for i in range(n):
b_bisect_in_a = bisect.bisect_left(a, b[i])
b_bisect_in_c = bisect.bisect_right(c, b[i])
result += b_bisect_in_a * (n - b_bisect_in_c)
print(result) |
p02645 | s967567591 | Accepted | S=input()
print(S[:3])
|
p03087 | s783971688 | Accepted | n, q = map(int, input().split())
s = input()
a = [0 for i in range(n)]
ct = 0
for i in range(n-1):
if s[i] == "A" and s[i+1] == "C":
ct += 1
a[i] = ct
for i in range(q):
l, r = map(int, input().split())
if l == 1:
print(a[r-2])
else:
print(a[r-2]-a[l-2]) |
p03474 | s388020938 | Accepted | A, B = map(int, input().split())
S = input()
print('Yes' if len(S) == A + B + 1 and \
S.count('-') == 1 and \
S[A] == '-' else 'No') |
p02817 | s368734134 | Accepted | S, T = map(str, input().split())
print(T+S) |
p02882 | s753627759 | Wrong Answer | import math
a,b,x = map(int,input().split())
ku = math.degrees(math.atan(2*(b/a)-2*x/a**3))
if x >a*b/2:
print(ku)
else:
print(math.degrees(math.atan(a*b**2/(2*x))))
|
p03998 | s452519171 | Accepted | S={char:list(input()) for char in "abc"}
turn="a"
while S[turn]:
turn=S[turn].pop(0)
print(turn.upper()) |
p03481 | s941767324 | Wrong Answer | ## C - Multiple Gift
import math
X, Y = map(int, input().split())
print( int(math.log2(Y / X )) + 1 ) |
p02831 | s186105862 | Accepted | import math
A,B = map(int,input().split())
print(A*B//math.gcd(A,B)) |
p04031 | s624184168 | Accepted | n=int(input())
a=list(map(int,input().split()))
total=0
ans1=0
ans2=0
for i in a:
total+=i
tmp1=total//n
tmp2=-(-total//n)
for i in a:
ans1+=(i-tmp1)**2
for i in a:
ans2+=(i-tmp2)**2
print(min(ans1,ans2)) |
p02628 | s477764553 | Accepted | n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
cost=0
for t in range(k):
cost+=p[t]
print(cost) |
p02661 | s390903065 | Wrong Answer | from itertools import product
N = int(input())
A = []
B = []
for _ in range(N):
a, b = map(int, input().split())
A.append(a), B.append(b)
A.sort()
B.sort()
print(B[N // 2] - A[N // 2] + 1) |
p03838 | s502251176 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
x, y = map(int, readline().split())
if x <= y:
if (x >= 0 and y >= 0) or (x <= 0 and y <= 0):
ans = y - x
else:
ans = abs(abs(x) - y) + 1
else:
if (x >= 0 and y >= 0) or (x <= 0 and y <= 0):
ans = min(abs(x) + abs(y) + 1, abs(abs(y) - abs(x)) + 2)
else:
ans = abs(x - abs(y)) + 1
print(ans)
|
p02918 | s884852138 | Wrong Answer | (str_len,cng_cnt) = input().split(" ")
str_input = list(input())
cng_cnt= int(cng_cnt)
tmp1=""
cnt=0
cnt2=0
for st in str_input:
if(tmp1 == st ):
cnt = cnt+1
else:
cnt2= cnt2 + 1
tmp1=st
if (cng_cnt > cnt2 ):
c_up = cng_cnt * 2
else:
c_up= (cnt2 * 2) + (cng_cnt - cnt2)
ans =cnt + c_up
print(ans) |
p03698 | s686927407 | Accepted | s=list(input())
if len(s) == len(set(s)):
answer = "yes"
else:
answer = "no"
print(answer)
|
p02972 | s914599697 | Accepted | N, *A = map(int, open(0).read().split())
x = [0] * (N + 1)
ans = []
for i in reversed(range(1, N + 1)):
tmp = 0
for j in range(i, N + 1, i):
tmp += x[j]
if tmp % 2 != A[i - 1]:
x[i] += 1
ans.append(i)
print(len(ans))
if ans:
print(*ans)
|
p02831 | s712569681 | Wrong Answer | N = input()
L = N.split()
a = int(L[0])
b = int(L[1])
if a < b:
c = a
a = b
b = a
r = a % b
while r != 0:
a = b
b = r
r = a % b
# この時のbが最大公約数
print(int(L[0])*int(L[1])/b) |
p02583 | s852360179 | Accepted | N = int(input())
cnt = 0
L = input().split()
L = [int(s) for s in L]
L.sort(reverse=True)
for i in range(len(L)-2):
for j in range(i, len(L)-1):
for k in range(j, len(L)):
if L[i] < L[j] + L[k] and (L[i] != L[j] and L[i] != L[k] and L[j] != L[k]):
# print(L[i] , L[j] , L[k])
cnt += 1
print(cnt) |
p03745 | s176672916 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
p = 0
res = 0
while p < N:
while p + 1 < N and A[p] == A[p + 1]:
p += 1
if p + 1 < N and A[p] < A[p + 1]:
while p + 1 < N and A[p] < A[p + 1]:
p += 1
elif p + 1 < N and A[p] > A[p + 1]:
while p + 1 < N and A[p] > A[p + 1]:
p += 1
res += 1
p += 1
print(res)
|
p03565 | s606781870 | Accepted | import numpy as np
from copy import deepcopy
S = np.array([s for s in input()], str)
T = np.array([t for t in input()], str)
nS, nT = map(len, (S, T))
ans = ''
idx = []
if nS < nT:
ans = 'UNRESTORABLE'
else:
for i in range(nS - nT + 1):
s = S[i:i + nT]
if np.all((s == T) | (s == '?')):
idx.append(i)
if not idx:
ans = 'UNRESTORABLE'
else:
i = idx[-1]
S[i:i + nT] = T
ans = np.where(S == '?', 'a', S)
print(''.join(ans)) |
p03087 | s273362529 | Accepted | N,Q = map(int,input().split())
S = input()
t = [0]*(N+1)
for i in range(N):
t[i+1] = t[i] + (S[i:i+2] == "AC")
for i in range(Q):
l,r = map(int,input().split())
print(t[r-1]-t[l-1]) |
p02817 | s960015600 | Wrong Answer | A, B = (input().split())
print(B,A) |
p03778 | s259933489 | Accepted | #coding:utf-8
w, a, b = map(int, input().split())
if abs(a-b) <= w:
print(0)
else:
print(abs(a-b)-w) |
p03317 | s678772018 | Accepted | n, k = map(int, input().split())
print(1 + (n - 2) // (k - 1)) |
p02663 | s677184971 | Accepted | A, B, C, D, K = list(map(int,input().split()))
a = 60 * A + B
b = 60 * C + D
c = b - a
ans = c - K
print(ans) |
p03077 | s288322850 | Wrong Answer | # -*- coding: utf-8 -*-
N = int(input().strip())
pas_list = [int(input().strip()) for _ in range(5)]
count = (N // min(pas_list) + 1) -1+5
print(count) |
p03645 | s708730471 | Accepted | n, m = map(int, input().split())
c = [False for i in range(200000)]
d = [False for i in range(200000)]
for i in range(m):
a, b = map(int, input().split())
if a == 1:
c[b] = True
if b == n:
d[a] = True
for i in range(200000):
if c[i] and d[i]:
print ("POSSIBLE")
exit()
print ("IMPOSSIBLE") |
p02681 | s659391806 | Accepted | s = input()
t = input()
if t[:-1] == s:
print("Yes")
else:
print("No") |
p02723 | s324984016 | Wrong Answer | S=input()
Sbara=list(S)
if Sbara[2]==Sbara[3] and Sbara[4]==Sbara[5]:
print("yes")
else:
print("no") |
p02778 | s511294496 | Accepted | S = input()
print('x'*len(S))
|
p02775 | s415357946 | Accepted | N = list(input())
N = list(map(int, N))
N = [0] + N
n = len(N)
answer = 0
for i in range(n - 1, -1, -1):
if N[i] == 10:
N[i - 1] += 1
continue
if N[i] == 5 and N[i - 1] >= 5:
N[i - 1] += 1
answer += 5
elif N[i] <= 5:
answer += N[i]
else:
N[i - 1] += 1
answer += 10 - N[i]
print(answer)
|
p03759 | s407556944 | Wrong Answer | a, b, c = map(int, input().split())
if b - a == c - b:
print("Yes")
else:
print("No")
|
p03665 | s024855123 | Accepted | N, P = map(int, input().split())
A = list(map(int, input().split()))
odd = 0
for a in A:
if a % 2 != 0:
odd += 1
if odd == 0:
if P == 1:
res = 0
else:
res = 2 ** N
else:
res = 2 ** (N - 1)
print(res) |
p02677 | s339817641 | Accepted | import math
A, B, H, M = (int(x) for x in input().split())
H %= 12
deg = abs(H*30 - M*5.5)
if deg >= 180:
deg = 360 - deg
rad = deg*math.pi / 180
print((A**2 + B**2 - 2*(A*B*math.cos(rad)))**0.5) |
p03071 | s568280471 | Accepted | a,b=map(int,input().split())
print(max([2*a-1,2*b-1,a+b])) |
p02729 | s704341459 | Accepted | n,m = map(int,input().split())
a = (n*(n-1))//2
b = (m*(m-1))//2
print(a+b) |
p03286 | s665498211 | Accepted | from math import ceil
n = int(input())
res = []
while n != 0:
res.append(n % 2)
n = ceil(n / -2)
if res == []:
res.append(0)
print(''.join([str(i) for i in res[::-1]]))
|
p03795 | s160262508 | Accepted | n = int(input())
pay = 800 * n
get = (n // 15) * 200
ans = pay - get
print(ans) |
p02677 | s480012285 | Accepted | import numpy as np
a, b, h, m = map(int, input().split())
m_v = 6
h_v = 0.5
time = h * 60 + m
h_pos = time * h_v
m_pos = m * m_v
rad = abs(min((min(h_pos, m_pos)+360)-max(h_pos, m_pos), max(h_pos, m_pos)- min(h_pos, m_pos)))
rad = rad / 180 * np.pi
ans = (a**2 + b**2 - 2*a*b*np.cos(rad))**0.5
print(ans) |
p03698 | s085869300 | Wrong Answer | s = list(input())
a = len(s)
b = len(set(s))
print('Yes') if a == b else print('No')
|
p03493 | s850034372 | Accepted | s = list(input())
print(s.count('1')) |
p02582 | s872403596 | Accepted | X = input()
if X =='RRR':
print('3')
elif X =='RRS' or X =='SRR':
print('2')
elif X =='RSS' or X =='SRS' or X =='SSR' or X =='RSR':
print('1')
elif X =='SSS':
print('0') |
p03721 | s906007998 | Accepted | n,k=map(int,input().split())
cnt=0
lst=[]
for i in range(n):
a,b=map(int,input().split())
lst.append([a,b])
lst.sort(key=lambda x:x[0])
for j in range(n):
cnt+=lst[j][1]
if cnt>k-1:
print(lst[j][0])
break
|
p03487 | s191521858 | Wrong Answer | n = int(input())
arr = list(map(int, input().split()))
t = 0
for i in set(arr):
t += i
print(abs(n-t)) |
p03862 | s857945184 | Accepted | n, x = map(int, input().split())
a = list(map(int, input().split())) + [0]
ans = 0
for i in range(1, n + 1):
if a[i] + a[i - 1] > x:
ans += a[i] + a[i - 1] - x
a[i] -= a[i] + a[i - 1] - x
print(ans) |
p02661 | s384205890 | Accepted | n = int(input())
#a = [list(map(int, input().split())) for _ in range(n)]
start = []
end = []
for i in range(n):
a,b = map(int, input().split())
start.append(a)
end.append(b)
start.sort()
end.sort()
if (n%2==1):
print(end[n//2]-start[n//2]+1)
else:
s = start[n//2-1]+start[n//2]
e = end[n//2-1]+end[n//2]
print(e-s+1) |
p02628 | s840033988 | Wrong Answer | n,k = map(int,input().split())
p = list(map(int,input().split()))
p.sort()
print(sum(p[0:k+1])) |
p03910 | s704598349 | Wrong Answer | N = int(input())
cnt = 0
for i in range(1, N):
if i * (1 + i) // 2 >= N:
cnt = i
break
for i in range(cnt, 0, -1):
if i <= N:
print(i)
N -= i |
p03862 | s741367500 | Accepted | N,x=map(int,input().split())
a=list(map(int,input().split()))
ans=0
for i in range(N-1):
ex=sum(a[i:i+2])-x
if ex>0:
ans+=ex
if a[i+1]>=ex:
a[i+1]-=ex
else:
a[i+1]=0
a[i]-=ex-a[i+1]
print(ans) |
p02596 | s508561775 | Wrong Answer | import sys
input = sys.stdin.readline
K = int(input())
flag = 0
seven = 0
if K % 2 != 0:
for i in range(10000):
seven = seven * 10 + 7
if seven % K == 0:
ans = i + 1
flag = 1
break
else:
flag = 2
if flag == 2:
print(-1)
elif flag == 0:
print(K-1)
else:
print(ans)
|
p03061 | s555975183 | Accepted | from fractions import gcd
N = int(input())
A = list(map(int,input().split()))
lc = [0]
for a in A:
lc.append(gcd(lc[-1], a))
rc = [0]
for a in A[::-1]:
rc.append(gcd(rc[-1], a))
rc.reverse()
ans = 0
for l,r in zip(lc,rc[1:]):
g = gcd(l,r)
ans = max(ans, g)
print(ans) |
p02797 | s215546655 | Wrong Answer | from sys import stdin, setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)
INF = int(1e10)
MOD = int(1e9 + 7)
def main():
from builtins import int, map
N, K, S = map(int, input().split())
# al + ... ar = SがちょうどK個
# S S S S S 1 1 1 1 1 1みたいな感じでいい?
ans = [S] * K + [S + 1] * (N - K)
print(*ans)
if __name__ == '__main__':
main()
|
p03721 | s517858821 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,k=map(int, input().split())
l=[list(map(int,input().split())) for i in range(n)]
l.sort(key=lambda x:x[0])
kosu=0
for i in range(n):
kosu+=l[i][1]
if kosu>=k:
print(l[i][0])
break
resolve() |
p03852 | s739326512 | Accepted | c = input()
print('vowel' if c in ['a', 'e', 'i', 'o', 'u'] else 'consonant') |
p03438 | s290099368 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
allSousa = sum(B)-sum(A)
atob = 0
for a, b in zip(A, B):
if a < b:
atob += (b-a)//2+(b-a)%2
if allSousa < atob:
print("No")
else:
print("Yes")
|
p02556 | s525130319 | Accepted | N=int(input())
u=[]
v=[]
for i in range(N):
x,y=map(int,input().split())
u.append(x+y)
v.append(x-y)
print(max(max(u)-min(u),max(v)-min(v))) |
p03416 | s018434948 | Accepted | a, b = map(int, input().split())
ans = 0
for i in range(a, b+1):
s = str(i)
judge = True
for j in range(2):
if s[j] != s[4-j]:
judge = False
if judge:
ans += 1
print(ans) |
p03380 | s086646469 | Wrong Answer | from math import factorial
n=int(input())
A=list(map(int,input().split()))
a=max(A)
B=[]
for i in range(n):
B.append(factorial(a)//((factorial(A[i])*factorial(a-A[i]))))
print(a,A[B.index(max(B))]) |
p02993 | s738240766 | Wrong Answer | s=input()
flag=True
for i in range(1,len(s)-1):
if s[i-1]==s[i]:
flag=False
if flag:
print("Good")
else:
print("Bad")
|
p03544 | s869321570 | Accepted | n=int(input())
a,b,c=2,1,3
for i in range(n):
a,b,c=b,c,(b+c)
print(a) |
p03103 | s759101645 | Accepted | n,m =map(int, input().split())
ab =[]
for i in range(n):
a,b =map(int, input().split())
ab.append([a,b])
ab.sort()
sum =0
count =0
num =0
for i in range(n):
price =ab[i][0]*ab[i][1]
if ab[i][1] +count <= m:
count +=ab[i][1]
sum +=price
else:
num += m -count
sum +=num*ab[i][0]
break
print(sum) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.