problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02797 | s140259905 | Accepted | N, K, S = map(int, input().split())
if S > 1:
ans = [S for _ in range(K)] + [S-1 for _ in range(N-K)]
else:
ans = [S for _ in range(K)] + [S+1 for _ in range(N-K)]
print(*ans)
|
p03493 | s693614273 | Wrong Answer | a = list(input())
cnt = 0
for b in a:
if b == 1:
cnt+=1
print(cnt) |
p03699 | s268454510 | Accepted | n = int(input())
S = [int(input()) for _ in range(n)]
S.sort()
score = sum(S)
if score % 10 == 0:
for s in S:
if s % 10 != 0:
score -= s
break
print(0 if score % 10 == 0 else score) |
p03693 | s886628639 | Wrong Answer | a = int(''.join(input().split()))
if a % 4 == 0:
print('Yes')
else:
print('No')
|
p03804 | s628988942 | Accepted | N, M = map(int, input().split())
A = list(input() for _ in range(N))
B = list(input() for _ in range(M))
b = len(B[0])
ans = "No"
for i in range(N-(M-1)):
n = -1
c = 0
for j in range(M):
if B[j] in A[i+j]:
if n < 0:
n = A[i + j].index(B[j])
c += 1
else:
if B[j] in A[i + j]... |
p03328 | s255810574 | Accepted | a,b = map(int,input().split())
T = 0
for n in range(1,b-a+1):
T+=n
print(T-b) |
p02765 | s292607698 | Accepted | def main(n, r):
if n >= 10:
print(r)
else:
print(r + 100 * (10 - n))
if __name__ == "__main__":
n, r = map(int, input().split())
main(n, r)
|
p03962 | s943082446 | Wrong Answer | a,b,c=map(int,input().split())
if a==b==c: print(1)
elif a==b or a==c: print(2)
else: print(3)
|
p03338 | s743785987 | Accepted | #abc098_b
def compare(str1,str2):
ans = 0
str1=''.join(set(str1))
str2=''.join(set(str2))
for c in str1:
ans += str2.count(c)
return ans
N = int(input())
S = input()
m = 0
for i in range(N):
# print(S[:i],S[i:])
tmp = compare(S[:i],S[i:])
if m < tmp:
m=tmp
print(m) |
p03041 | s962519520 | Accepted | n,k=map(int,input().split())
s=input()
print(s[:k-1]+s[k-1].lower()+s[k:]) |
p03438 | s029495667 | Accepted | def solve():
N = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
plus2_cnt = 0
neg_cnt = 0
for i in range(N):
diff = b[i] - a[i]
if diff >= 0:
plus2_cnt += diff // 2
else:
neg_cnt += abs(diff)
if plus2_c... |
p04020 | s011481880 | Accepted | n = int(input())
a = [int(input()) for _ in range(n)]
lsts = []
temp = []
for aa in a:
if aa == 0:
if temp:
lsts.append(temp)
temp = []
else:
temp.append(aa)
if temp: lsts.append(temp)
ans = 0
for lst in lsts:
for i, aa in enumerate(lst):
ans += aa // 2
... |
p03485 | s256755596 | Accepted | # import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:... |
p03862 | s769069862 | Accepted | n,x=map(int,input().split())
a=list(map(int,input().split()))
s=[0]*(n-1)
ans=0
if a[0]>x:
ans+=a[0]-x
a[0]=x
for i in range(n-1):
s[i]=a[i]+a[i+1]
for i in range(n-2):
if s[i]>x:
t=s[i]-x
s[i+1]-=t
s[i]=x
ans+=t
if s[n-2]>x:
ans+=s[n-2]-x
print(ans) |
p02786 | s463258289 | Accepted | h = int(input())
ans = 0
cnt = 1
while h >= 1:
ans += cnt
h = h // 2
cnt *= 2
print(ans) |
p02963 | s932955990 | Accepted | S = int(input())
x1 = 0
y1 = 0
x2 = 10**9
y2 = 1
x3 = (x2-S%x2)%x2
y3 = -(-S//x2)
print(x1,y1,x2,y2,x3,y3) |
p02578 | s611118435 | Accepted |
def main():
n = int(input())
ai = list(map(int, input().split()))
cnt = 0
for i in range(n):
if i != n-1:
if ai[i] > ai[i+1]:
cnt += ai[i]-ai[i+1]
ai[i+1] = ai[i]
print(cnt)
if __name__ == "__main__":
main() |
p03262 | s868677228 | Wrong Answer | N,X = map(int,input().split())
Alist = list(map(int,input().split()))
for i in range(len(Alist)):
Alist[i] = abs(Alist[i]-X)
Alist.sort()
p = 10**10
q = 1
for i in range(1,len(Alist)):
if Alist[i] % Alist[0] != 0:
p = min(p,Alist[i] % Alist[0])
q = q*0
if len(Alist) > 1:
if q == 0:
p... |
p02631 | s670246369 | Accepted | N = int(input())
A = list(map(int, input().split()))
check = 0
for a in A:
check ^= a
ans = []
for a in A:
ans.append(str(a ^ check))
print(" ".join(ans))
|
p02946 | s070115274 | Wrong Answer | K, X = map(int, input().split())
# 黒い石の可能性がある座標をリスト化
array = []
i = 1
for i in range((K-1)*2+1):
array.append(X-K+i)
i += 1
ans = sorted(array)
print(*ans, sep="") |
p03109 | s255667428 | Wrong Answer | s = input()
if s[5::6] >= "04" and s[8::9] >= "30":
print("Heisei")
else:
print("TBD") |
p02681 | s129072250 | Accepted | S = input()
T = input()
if S == T[:len(S)]:
print('Yes')
exit()
print('No') |
p02699 | s358824041 | Wrong Answer | from sys import stdin,stdout
s,w=stdin.readline().strip().split()
s=int(s)
w=int(w)
if(s>=w):
print("unsafe")
else:
print("safe")
|
p02576 | s954919334 | Accepted | n, x, t = map(int, input().split())
num = n // x
if n % x != 0:
num += 1
print(t * num) |
p03745 | s229586914 | Accepted | n,*a=map(int,open(0).read().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) |
p02775 | s504568034 | Accepted | n = input()[::-1]
dp = [[0, 0] for i in range(len(n) + 1)]
dp[0][1] = 1
for i in range(len(n)):
dp[i + 1][0] = min(dp[i][0] + int(n[i]), dp[i][1] - int(n[i]) + 10)
dp[i + 1][1] = min(dp[i][0] + int(n[i]) + 1, dp[i][1] - int(n[i]) + 9)
print(dp[len(n)][0]) |
p02598 | s707355135 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
if k >= sum(a)-n:
print(1)
else:
ok, ng = 10**9, 1
while ok-ng > 1:
mid = (ok+ng)//2
if sum((x-1)//mid for x in a) <= k:
ok = mid
else:
ng = mid
print(ok) |
p02765 | s101589238 | Accepted | N, R = map(int, input().split())
if N >= 10:
rate = R
else:
rate = R + 100 * (10 - N)
print(rate) |
p03659 | s492362751 | Accepted | n = int(input())
ns = list(map(int, input().split()))
min_x = float('inf')
sum_x = 0
total_sum = sum(ns)
for i in range(n-1):
sum_x += ns[i]
min_x = min(min_x, abs(total_sum-2*sum_x))
print(min_x) |
p03852 | s674860172 | Wrong Answer | s = input()
if s == 'a' or 'i' or 'u' or 'e' or 'o':
print('vowel')
else:
print('consonant') |
p02613 | s748356408 | Accepted | #B
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for _ in range(N):
judge = input()
if judge == 'AC':
AC += 1
elif judge == 'WA':
WA += 1
elif judge == 'TLE':
TLE += 1
elif judge == 'RE':
RE += 1
print(f'AC x {AC}')
print(f'WA x {WA}')
print(f'TLE x {TLE}')
print(f... |
p03673 | s055135976 | Wrong Answer | n = int(input())
a = list(map(str, input().split()))
b = []
for i in range(n):
if i%2 == 0:
b.append(a[i])
else:
b.insert(0, a[i])
for i in b:
print(i, end=' ') |
p03719 | s373495904 | Wrong Answer | a,b,c=input().split()
print("Yes" if a<=c and c<=b else "No") |
p02690 | s986460410 | Wrong Answer | import math
x = int(input())
for i in range(-10 ** 2 - 11, 10 ** 2 + 11):
for j in range(-10 ** 2 - 11, 10 ** 2 + 11):
if i <= j:
continue
if i ** 5 - j ** 5 == x:
print(i, j)
exit()
|
p03282 | s120845245 | Wrong Answer | S = input()
K = int(input())
if S[0] == 1:
print(S[1])
else:
print(S[0]) |
p02783 | s536509820 | Accepted | import math
H,A=map(int, input().split())
print(math.ceil (H/A))
|
p02754 | s574245551 | Accepted | N, A, B = map(int, input().split())
d = N // (A + B)
m = N % (A + B)
print(d * A + min(m, A)) |
p02727 | s230551361 | Accepted | X, Y, A, B, C = [int(_) for _ in input().split()]
P = [int(_) * 3 for _ in input().split()]
Q = [int(_) * 3 + 1 for _ in input().split()]
R = [int(_) * 3 + 2 for _ in input().split()]
S = sorted(P + Q + R)
cnt = [0, 0, 0]
ans = [0, 0, 0]
limit = [X, Y, 10**10]
while S:
s = S.pop()
q, r = divmod(s, 3)
if cnt... |
p02661 | s075862595 | Wrong Answer | n=int(input())
a,b=[0]*n,[0]*n
for i in range(n):
a[i],b[i]=map(int,input().split())
a.sort()
b.sort()
if n&1:
print(b[n//2]-a[n//2]+1)
else:
print(1+(b[n//2]+a[n//2])-(b[(n-1)//2]+a[(n-1)//2])) |
p02823 | s420158072 | Accepted | N, A, B = list(map(int, input().split()))
diff = B - A
if diff % 2 == 0:
ans = diff // 2
else:
# d1 = A - 1
# ans1 = d1 + (diff - 1) / 2 + 1
# d2 = N - B
# ans2 = d2 + (diff - 1) / 2 + 1
ans = min(A-1, N-B) + 1 + (B - A - 1) // 2
print(ans)
|
p03206 | s658135889 | Accepted | d = int(input())
base = 'Christmas'
print(base+' Eve'*(25-d)) |
p03109 | s549369021 | Wrong Answer | date = int(input().replace('/', ''))
print('Heisei' if date >= 20190430 else 'TBD')
|
p03011 | s405680321 | Accepted | time = list(map(int, input().split()))
time.sort()
print(time[0] + time[1])
|
p03799 | s952663431 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N, M = mapint()
if N>=M//2:
print(N)
else:
ans = N
M -= N*2
ans += M//4
print(ans) |
p02724 | s978367815 | Accepted | n = int(input())
t = n
s = 0
while t - 500 >= 0:
t = t - 500
s = s + 1000
while t - 5 >= 0:
t = t - 5
s = s + 5
print(s) |
p02759 | s075538369 | Accepted | a = int(input())
if a%2 == 0:
print(a//2)
else:
print(a//2+1) |
p03644 | s373876651 | Accepted | N=int(input())
ans=1
while 2*ans<=N:
ans*=2
print(ans)
|
p03161 | s765422931 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
#n,k=100000,100
#a=[i for i in range(100000)]
kl=[i for i in range(1,k+1)]
dp=[float("inf")]*(n)
dp[0]=0
for i in range(1,n):
dp[i] = min(dp[j] + abs(a[i] - a[j]) for j in range(max(0, i - k), i))
print(dp[n-1])
|
p02948 | s262976927 | Accepted | import heapq
N,M=map(int,input().split())
AB=[list(map(int,input().split())) for _ in range(N)]
AB.sort(reverse=True)
works=[]
heapq.heapify(works)
ans=0
AB=AB+[[0,0]]
for i in range(1,M+1):
day=M-i
latest=i
while len(AB)>=2 and AB[-2][0]<=latest:
a,b=AB.pop(-2)
heapq.heappush(works,-b)
if not works:
... |
p04044 | s322492928 | Accepted | n, l = map(int, input().split())
S = []
for i in range(n):
S.append(input())
S = sorted(S)
print("".join(S)) |
p02712 | s331818460 | Accepted | #設定
import sys
input = sys.stdin.buffer.readline
#ライブラリインポート
from collections import defaultdict
con = 10 ** 9 + 7
#入力受け取り
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
N = int(input())
ans = 0
for i in range(1, N + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
if __n... |
p03644 | s776984415 | Accepted | n=int(input())
if n>=64:
print(64)
elif n>=32:
print(32)
elif n>=16:
print(16)
elif n>=8:
print(8)
elif n>=4:
print(4)
elif n>=2:
print(2)
else:
print(1) |
p03481 | s373463542 | Wrong Answer | a,b= map(int,input().split())
c = b//a
ans = 0
for i in range(10000):
if 2**i <= c < 2**(i+1) :
ans += i
print(a,b,c,ans +1) |
p03456 | s738411121 | Accepted | a,b=input().split()
n=int(a+b)
flg=0
for i in range(int(n**0.5)+1):
if i**2==n:
flg=1
print("Yes" if flg else "No") |
p02723 | s680975874 | Wrong Answer | a = input()
if(len(a)==6):
if(a[2]==a[3]):
if(a[4]==a[5]):
print('Yes')
else:
print('No')
else:
print('No') |
p03745 | s428679566 | Accepted | n,*a=map(int,open(0).read().split())
ans=1
tmp=0
for i in range(1,n):
if (a[i]-a[i-1])*tmp<0:
ans+=1
tmp=0
elif not a[i]-a[i-1]==0:
tmp=a[i]-a[i-1]
print(ans) |
p02859 | s563191988 | Wrong Answer | import math
r=int(input())
area1=math.pi
arear=math.pi*r*r
ratio=int(arear/area1)
print(ratio) |
p03109 | s974213402 | Accepted | a = input()
b = a[: 4] + a[5 : 7] + a[8 :]
c = int(b)
if c <= 20190430:
print('Heisei')
else:
print('TBD') |
p02859 | s268993813 | Accepted | n=int(input())
print(n*n) |
p03043 | s877908230 | Accepted | from math import log2, ceil
N, K = map(int, input().split())
ans = 0
j = 1.0
for x in range(N, 0, -1):
if x >= K:
ans += 1.0 * (1 / N)
else:
while x * j < K:
j *= 2.0
ans += (1.0 / j) * (1 / N)
print(ans)
|
p03475 | s874466384 | Accepted | n = int(input())
a = [list(map(int, input().split(' '))) for _ in range(n - 1)]
for i in range(n):
# from i
# now = 1ループごとにnow
now = 0
for j in range(i, n - 1):
(c, s, f) = a[j]
if now <= s:
now = s + c
else:
# matsu
now = s + (now - s + f - 1... |
p03644 | s446294559 | Accepted | n = int(input())
a = [2**i for i in range(7)]
b = []
for i in a:
if i <= n:
b.append(i)
print(max(b)) |
p03699 | s092847271 | Wrong Answer | from itertools import product
N = int(input())
S = [int(input()) for _ in range(N)]
T = [s for s in S if s % 10 != 0]
mmax = 0
for pair in product(range(2), repeat=len(T)):
sum = 0
for i in range(len(pair)):
sum += S[i] * pair[i]
if sum % 10 == 0:
continue
mmax = max(mmax, sum)
for s in S:
if s %... |
p03971 | s487843249 | Accepted | N, A, B = map(int,input().split())
S = input()
p = 0
c = B
for e in S:
if e == "a":
if p < A+B:
print("Yes")
p += 1
else:
print("No")
elif e == "b":
if p < A+B and c > 0:
print("Yes")
p += 1
c -= 1
else:
... |
p02814 | s486310729 | Accepted | from fractions import gcd
from functools import reduce
def lcm(a, b):
return a * b // gcd(a, b)
def solve(string):
n, m, *a = map(int, string.split())
l = reduce(lcm, a)
c = 1
while a[0] % (2 * c) == 0:
c *= 2
for _a in a:
if _a % c > 0 or not (_a // c) % 2:
retur... |
p03548 | s019126502 | Accepted | x,y,z = map(int,input().split())
print((x-z)//(y+z)) |
p03760 | s496653327 | Accepted | o = input()
e = input()
for i in range(len(e)):
print(o[i] + e[i], end = "")
if len(e) < len(o):
print(o[i + 1])
else:
print() |
p02583 | s485601589 | Wrong Answer | import bisect
N = int(input())
L = list(map(int, input().split()))
L.sort(reverse=True)
if N < 3:
print(0)
ans = 0
for i in range(N-2):
for j in range(i+1, N-1):
if L[i] == L[j]:
continue
for k in range(j+1, N):
if L[i] == L[k] or L[j] == L[k]:
continue
... |
p02793 | s030036678 | Accepted | n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
def eucrid(a,b):
a,b=max(a,b),min(a,b)
while True:
if a%b==0:
return b
else:
a,b=b,a%b
m=a[0]
for i in range(n):
m=m//eucrid(m,a[i])*a[i]
b=0
m=m%mod
for i in a:
b+=m*pow(i,mod-2,mod)%mod
print(b%mod) |
p02995 | s820769430 | Accepted | A, B, C, D = map(int, input().split())
def gcd(x, y):
if x > y:
x, y = y, x
while y != 0:
tmp = x % y
x = y
y = tmp
return x
A = A - 1
lcm_CD = C * D // gcd(C, D)
cnt_B = B - (B//C + B//D) + (B//lcm_CD)
cnt_A = A - (A//C + A//D) + (A//lcm_CD)
ans = cnt_B - cnt_A
print... |
p02843 | s701917907 | Wrong Answer | X = int(input())
X_ = X % 101
N = int(X / 101)
ans = 0
for i in range(5):
X_ -= N
if X_ > 0:
print(0)
else:
print(1)
|
p03106 | s798826576 | Wrong Answer | def main():
from builtins import int, map, list, print
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
input_list = (lambda: input().rstrip().split())
input_number = (lambda: int(input()))
input_number_list = (lambda: list(map(int, input_list())))
A, B, K = input_n... |
p02838 | s492126267 | Accepted | #coding:utf-8
import numpy as np
n = int(input())
a = list(map(int, input().split()))
a = np.array(a)
mod = 10**9 + 7
ans = 0
for i in range(60):
# i桁目の1の数を数える
cnt_zero = np.count_nonzero(a >> i & 1)
cnt_one = n - cnt_zero
# すべての１と０をそれぞれ掛けあわせた総数を、桁ごとに計算
ans += 2**i * cnt_zero * cnt_one
ans %= mo... |
p02847 | s658852983 | Wrong Answer | s = input()
if s == "SUN":
print(7)
exit()
ls = {"MON": 0, "TUE": 1, "WED": 3, "THU": 4, "FRI": 5, "SAT": 6, "SUN": 7}
print(7-ls[s])
|
p04043 | s575600399 | Accepted | a=list(map(int, input().split()))
if a.count(5)==2 and a.count(7)==1:
print("YES")
else:
print("NO") |
p02923 | s635515734 | Accepted | n = int(input())
h = list(map(int, input().split()))
cnt = 0
l = []
for i in range(n - 1):
if h[i] < h[i + 1]:
l.append(cnt)
cnt = 0
else:
cnt += 1
l.append(cnt)
print(max(l)) |
p03705 | s237766492 | Accepted | n,a,b=map(int,input().split())
if a>b:
print(0)
elif a==b:
print(1)
elif n==1:
print(0)
else:
print(n*b-b+a-n*a+a-b+1) |
p02613 | s177877072 | Accepted | n=int(input())
s=list(input() for i in range(n))
print("AC x ",s.count("AC"))
print("WA x ",s.count("WA"))
print("TLE x ",s.count("TLE"))
print("RE x ",s.count("RE")) |
p02607 | s830500285 | Wrong Answer | def main():
N = int(input())
a = list(map(int,input().split()))
res = 0
for i in range(N):
if i % 2 == 1 and a[i] % 2 == 1:
res += 1
print(res)
if __name__ == "__main__":
main() |
p02761 | s952443549 | Accepted | N,M=map(int,input().split())
x=[-1]*N
ok=True
for _ in range(M):
s,c=map(int,input().split())
s-=1
if (s==0 and c==0 and N>1) or x[s]!=-1 and x[s]!=c:
ok=False
break
x[s]=c
if ok:
ans=0
for i in range(N):
if x[i]==-1:
x[i]=0 if (i>0 or N==1) else 1
a... |
p02690 | s885175843 | Wrong Answer | import math
x = int(input())
i = 1
print(i)
while True:
t = math.pow(i, 5)-x
if t >= 0:
b = math.pow(t, 1/5)
if b.is_integer():
print(str(i) + ' ' + str(int(b)))
break
else:
b = math.pow(-t, 1/5)
if b.is_integer():
print(str(i) + ' ' + str(int(-b)))
break
i += 1 |
p03210 | s727363757 | Accepted | X = int(input())
if X == 3 or X == 5 or X == 7:
print("YES")
else:
print("NO")
|
p03644 | s472368266 | Accepted | n = int(input())
i = []
for p in range(n):
i.append(0)
a = p + 1
while True:
if a % 2 != 0:
break
else:
i[p] += 1
a = a / 2
print(i.index(max(i)) + 1)
|
p03481 | s181864053 | Accepted | X, Y = map(int, input().split())
c = Y//X
tmp = 1
for i in range(100):
if tmp > c:
break
tmp *= 2
print(i)
|
p02640 | s588456860 | Accepted | def main():
f = False
x, y = map(int, input().split())
for i in range(x+1):
a, b = i, x-i
a *= 2
b *= 4
if a + b == y:
f = True
if f:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() |
p02708 | s661208086 | Accepted | n, k = map(int,input().split())
cnt = 0
for i in range(k, n+2):
cnt += (n + 1 - i) * i + 1
print(cnt % (10**9 + 7)) |
p02963 | s376938890 | Accepted | s = int(input())
mod = 10 ** 9
x = (mod - s % mod) % mod
y = (s+x) // mod
print(0, 0, mod, 1, x,y)
|
p03239 | s742905814 | Accepted | n, T = map(int,input().split())
list_c = []
list_t = []
for i in range(n):
c, t = map(int,input().split())
if t > T:
pass
else:
list_c.append(c)
list_t.append(t)
if len(list_t) == 0:
print('TLE')
else:
print(min(list_c)) |
p02683 | s889960027 | Accepted | import numpy as np
import sys
n,m,x = map(int,input().split())
arr = np.array([list(map(int,input().split())) for i in range(n)])
c = arr.T[0] # c[n-1]まで
a = arr.T[1:].T # a[n-1][m-1]まで
ans = np.inf
for i in range(2**n):
ability = np.zeros(m, np.int64)
cost = 0
for j in range(n):
if (i>>j)&1: ab... |
p02786 | s259631995 | Accepted | h=int(input())
num=1
cnt=0
while h!=1:
h=h//2
cnt+=num
num*=2
cnt+=num
print(cnt) |
p02676 | s491011121 | Accepted | K = int(input())
S = input()
t = ''
if len(S) > K:
t = '...'
print(S[:K] + t) |
p02946 | s585535169 | Accepted | a,b=map(int,input().split())
c=list(range(b-(a-1),b+(a-1)+1))
d=' '.join(map(str,c))
print(d) |
p03773 | s078278066 | Accepted | A, B = map(int, input().split())
print((A+B) % 24) |
p03548 | s496229736 | Wrong Answer | X,Y,Z = map(int,input().split())
X = X-Z
i = 0
while X > 0:
if X > Y:
X = X-Y
i += 1
X = X-Z
print(i) |
p02959 | s695790619 | Accepted | N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
M = sum(A)
for n in range(N):
if A[n]>=B[n]:
A[n]-=B[n]
else:
A[n+1] = max(0,A[n+1]+A[n]-B[n])
A[n] = 0
print(M-sum(A)) |
p02946 | s459324247 | Accepted | K, X = map(int, input().split(' '))
for i in range(X - K + 1, X + K - 1):
print('{} '.format(i), end='')
print(X + K - 1) |
p03607 | s208042249 | Accepted | from collections import defaultdict
n = int(input())
d = defaultdict(int)
for _ in range(n):
a = int(input())
d[a] += 1
ans = 0
for v in d.values():
if v % 2 == 1:
ans += 1
print(ans) |
p03250 | s819746061 | Wrong Answer | a,b,c = map(int,input().split())
list = [a,b,c]
list.sort()
print(10 * c + b + a) |
p02790 | s044787204 | Accepted | a,b=map(int,input().split())
if a>b:
c=[]
for i in range(a):
c.append(str(b))
d=''.join(c)
else:
c = []
for i in range(b):
c.append(str(a))
d = ''.join(c)
print(d)
|
p02714 | s844645967 | Accepted | N=int(input())
S=list(input())
count=[0]*3
for i in range(N-1,-1,-1):
if S[i]=="R":
count[0]+=1
elif S[i]=="G":
count[1]+=1
else:
count[2]+=1
cnt=0
for i in range(1,N//2+1):
for j in range(N-2*i):
a,b,c=S[j],S[j+i],S[j+2*i]
if a!=b and a!=c and c!=b:
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.