problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02952 | s932474175 | Accepted | n=int(input())
c=0
for i in range(1,n+1):
if len(str(i))%2==1:
c+=1
print(c) |
p03385 | s855071603 | Accepted | s = sorted([_ for _ in input()])
if s == ['a', 'b', 'c']:
print('Yes')
else:
print('No') |
p02631 | s083496095 | Accepted | n = int(input())
*A, = map(int, input().split())
s = 0
for a in A:
s = s ^ a
X = [s ^ a for a in A]
print(*X)
|
p03038 | s650883070 | Wrong Answer | n,m = map(int,input().split())
ls = list(map(int,input().split()))
for i in range(m):
b,c = map(int,input().split())
ls.sort()
for j in range(b):
if ls[j] < c:
ls[j] = c
if ls[j] >= c:
break
print(sum(ls)) |
p03061 | s361446415 | Accepted | def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
def lcm(a,b):
return a*b // gcd(a,b)
n = int(input())
a = list(map(int,input().split()))
b = a[::-1]
l = [0]
r = [0]
for i in range(n):
l.append(gcd(a[i],l[-1]))
r.append(gcd(b[i],r[-1]))
r = r[::-1]
ans = 0
for i in range(n):
ans = max(ans,gcd(l[i],r[i+1]))
print(ans) |
p03437 | s085100437 | Accepted | def divisors(n):
d=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
d.append(i)
if i!=n//i:
d.append(n//i)
d.sort()
return d
x,y=map(int,input().split())
print(-1 if y in divisors(x) else x) |
p02958 | s553512781 | Wrong Answer | n = int(input())
s = []
t = 0
for i in range(n):
s.append(i)
for i in range(n):
if(s[i] != i + 1):
t += 1
if(t == 0 or 2):
print('YES')
else:
print('NO')
|
p02777 | s659456895 | Wrong Answer | a, b=map(str,input().split())
c, d=map(int,input().split())
e=input()
f=str(e)
if e==f:
print(c-1,d)
else:
print(c,d-1)
|
p03962 | s774341233 | Accepted | penki = [i for i in map(int, input().split())]
count = 3
if penki[0] == penki[1]:
count -= 1
if penki[0] == penki[2]:
count -= 1
if penki[1] == penki[2]:
count -= 1
if penki[1] == penki[2] == penki[0]:
count += 1
print(count) |
p03416 | s997626783 | Accepted | a,b=map(int,input().split())
print(sum(i==i[::-1] for i in map(str, range(a, b+1)))) |
p02711 | s830845050 | Accepted | n = input()
if '7' in n:
print('Yes')
else:
print('No')
|
p03862 | s605784104 | Accepted | n,x=map(int,input().split())
a=[0]+list(map(int,input().split()))
cnt=0
for i in range(n):
t=max(a[i]+a[i+1]-x,0)
cnt+=t
a[i+1]-=t
print(cnt) |
p02988 | s698882731 | Accepted | n = int(input())
p = list(map(int, input().split()))
count = 0
for i in range(1, n - 1):
s = [p[i-1], p[i], p[i+1]]
s = sorted(s)
if s[1] == p[i]:
count += 1
print(count)
|
p02843 | s598209865 | Wrong Answer | x = int(input())
l = -(-x//105)
h = x//100
for i in range(l,h+1):
for b in range(0,i):
for c in range(0,i):
for d in range(0,i):
for e in range(0,i):
if x - (i*100 + 1*b+2*c+3*d+4*e+5*(i-b-c-d-e)) == 0:
print('1')
exit()
else:
print('0') |
p03285 | s660496633 | Accepted | N = int(input())
jdg = False
for i in range(26):
price4 = N - i * 4
if price4 >= 0 and price4 % 7 == 0:
jdg = True
break
print('Yes' if jdg else 'No') |
p02719 | s801313075 | Accepted | import sys
N, K = map(int, sys.stdin.readline().strip().split())
r = N // K
print(min((N, N - r*K, (r+1)*K - N))) |
p02793 | s837951420 | Wrong Answer | from fractions import gcd
P = 10**9 + 7
n = int(input())
def lcm(p,q):
return p*q//gcd(p,q)
a = list(map(int, input().split()))
x = a[0]
for i in range(1,n):
x = lcm(x,a[i])
ans = 0
for i in range(n):
ans += x//a[i]
if i%5==0:
ans = ans%P
print(ans) |
p02766 | s251876150 | Accepted | N,R=map(int,input().split())
num=0
while N>=R:
N=N/R
num+=1
print(num if N==0 else num+1) |
p02754 | s884818773 | Accepted | n,a,b=map(int, input().split())
d = a+b
c = n%d
e = n//d
if c <= a:
print(e*a+c)
if c > a:
print((e+1)*a) |
p03797 | s343010504 | Accepted | N,M = map(int,input().split())
if N > M:
ans = (min(N,M//2))
elif M ==N:
ans = (M//2)
else:
tmp = M-2*N
ans =N+(tmp//4)
print(ans) |
p03000 | s329785548 | Accepted | import sys
input = sys.stdin.readline
N, X = map(int, input().split())
A = list(map(int, input().split()))
B = [0]
cnt = 0
for i in range(N):
B.append(B[i]+A[i])
for i in range(len(B)):
if B[i] <= X:
cnt += 1
print(cnt) |
p03407 | s021968979 | Accepted | # 数字の横並び入力（複数入力）
a, b, c = map(int, input().split())
total = a + b # 高橋くんの所持金合計
if total >= c: ## 高橋くんの所持金合計がc以上
print("Yes")
else:
print("No") |
p03478 | s824467523 | Wrong Answer | n, a, b = map(int, input().split())
ans = 0
for i in range(1,n+1):
mod = 0
while i > 0:
mod += (i % 10)
i //= 10
if mod >= a and mod <= b:
ans += mod
print(ans)
|
p03013 | s922903215 | Accepted | N, M = map(int, input().split())
a = set([int(input()) for _ in range(M)])
INF = 1000000007
dp = [0] * (N + 1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2, N + 1):
if i in a:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= INF
print(dp[N]) |
p03679 | s634302630 | Accepted | x,a,b=map(int,input().split())
n=a-b
if n >= 0:
print("delicious")
elif x+n >=0:
print("safe")
else:
print("dangerous") |
p03548 | s828506169 | Wrong Answer | X, Y, Z = map(int, input().split())
X -= Z
print(X//Y)
|
p03407 | s905434183 | Wrong Answer | a,b,c = map(int,input().split())
if a + b <= c:
print("Yes")
else:
print("No") |
p02720 | s012270510 | Accepted | import sys
k = int(input())
count = 1
num = 1
l = [str(i+1) for i in range(9)]
if k < 10:
print(l[k-1])
sys.exit()
c = 0
while True:
num = l[c]
num = int(num[-1])
if num != 0:
l.append(l[c]+str(num-1))
l.append(l[c]+str(num))
if num != 9:
l.append(l[c]+str(num+1))
c += 1
if len(l) >= k:
break
print(l[k-1])
|
p03759 | s750645261 | Wrong Answer | # A
a, b, c = map(int, input().split())
if abs(a-b) == abs(b-c):
print('YES')
else:
print('NO') |
p03803 | s003401850 | Accepted | a, b = map(int,input().split())
if a == b:
print('Draw')
elif a == 1:
print('Alice')
elif b == 1:
print('Bob')
elif a < b:
print('Bob')
elif a > b:
print('Alice') |
p03673 | s250831252 | Accepted | import collections
def f(myList):
ans = ''
if len(myList)%2==0:
for i in range(len(myList)):
ans += str(myList[i]) + ' '
else:
for i in range(len(myList)):
ans += str(myList[-(i+1)]) + ' '
return ans[:-1]
n = int(input())
a = list(map(int,input().split()))
b = collections.deque()
for i in range(n):
if i%2==0:
b.append(a[i])
else:
b.appendleft(a[i])
print(f(b))
|
p02577 | s556155042 | Accepted | n = input()
res = sum((ord(x) - ord("0")) for x in n)
print("Yes" if res % 9 == 0 else "No") |
p02994 | s728819335 | Accepted | n,l=map(int,input().split())
aji=list(range(l,l+n))
ans=0
sa=abs(sum(aji))
for i in range(n):
pie=sum(aji)-aji[i]
if sa>abs(sum(aji)-pie):
sa=abs(sum(aji)-pie)
ans=pie
print(ans) |
p02833 | s097738667 | Accepted | N=int(input())
if N%2:
print(0)
else:
ans=0
tmp=10
while tmp<=N:
ans+=N//tmp
tmp*=5
print(ans) |
p03331 | s656232279 | Wrong Answer | N = int(input())
ans = 0
while(N > 0):
ans += N % 10
N //= 10
print(ans) |
p02695 | s072734129 | Wrong Answer | from itertools import product
n, m, q = map(int, input().split())
ABCD = [list(map(int, input().split())) for _ in range(q)]
kumiawase = list(product(range(1, m + 1), repeat=n))
ans = 0
for kumi in kumiawase:
A = [0] + list(kumi)
temp = 0
for abcd in ABCD:
a, b, c, d = abcd
if A[b] - A[a] == c:
temp += d
ans = max(ans, temp)
print(ans)
|
p02615 | s891878286 | Wrong Answer | def main():
input() # n
friendliness = [int(x) for x in input().split()]
print(sum(friendliness) - 1)
if __name__ == '__main__':
main()
|
p03017 | s320605446 | Accepted | N, A, B, C, D = map(int, input().split())
S = input()
if S[A-1:C].find('##') != -1 or S[B-1:D].find('##') != -1:
print('No')
exit()
ans = 'Yes'
if C > D and S[B-2:D+1].find('...') == -1:
ans = 'No'
print(ans)
|
p03797 | s126343621 | Wrong Answer | n, m = map(int, input().split())
ans = (n*2 + m)//4
print(ans) |
p03136 | s386278916 | Accepted | n = int(input())
l = [int(i) for i in input().split()]
L = max(l)
if L < sum(l)-L:
print('Yes')
else:
print('No') |
p03075 | s864350531 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
li = [I() for _ in range(6)] #n行に１つずつ入力される整数
if (li[4] - li[0]) <= li[5]:
print('Yay!')
else:
print(':(') |
p03457 | s669544063 | Wrong Answer | N = int(input())
t = 0
x = 0
y = 0
for ti, xi, yi in [map(int, input().split(' ')) for n in range(N)]:
if not (xi-x+yi-y <= ti-t and (ti-t)%2 == (xi-x+yi-y)%2):
print('No')
exit()
else:
t = ti
x = xi
y = yi
print('Yes') |
p03254 | s586126724 | Accepted | N, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
if sum(a) < x:
print(N - 1)
elif sum(a) > x:
ans = 0
ans_ = 0
for a in a:
ans_ += a
if ans_ > x:
break
ans += 1
print(ans)
elif sum(a) == x:
print(N)
|
p03407 | s739964584 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print('Yes')
else:
print('No') |
p03815 | s305570241 | Accepted | #coding: utf-8
x = int(input())
ans = 2*(x//11)+(((x%11)+5)//6)
print(ans) |
p02789 | s840909141 | Accepted | n,m=map(int,input().split())
if n==m:
print('Yes')
else:
print('No') |
p02657 | s570893873 | Accepted | a,b = map(int, input().split())
print(a*b) |
p02608 | s352506417 | Wrong Answer | n = int(input())
fn = [0] * (10**5)
def f(x, y, z):
return x**2 + y**2 + z**2 + x*y + y*z + z*x
for x in range(1, 35):
for y in range(1, 35):
for z in range(1, 35):
idx = f(x, y, z)
if idx <= n:
fn[idx] += 1
for i in range(1, n+1):
print(fn[i])
|
p02633 | s901368034 | Accepted | import sys
input=sys.stdin.readline
x=int(input())
import math
y=math.gcd(360,x)
z=x*360//y
ans=z//x
print(ans)
|
p03284 | s851320982 | Accepted | N, K = map(int, input().split())
if N % K == 0:
print(0)
else:
print(1) |
p03487 | s142923326 | Wrong Answer | from collections import Counter
n = int(input())
a = list(map(int,input().split()))
cnt = Counter(a)
ans = 0
for i in cnt.items():
dif = abs(i[0] - i[1])
delete = i[1]
ans += min(dif ,delete)
print(ans) |
p04033 | s545107412 | Accepted | a, b = map(int, input().split())
if a <= 0 and b >= 0:
print("Zero")
elif a < 0 and b < 0:
if (abs(a)-abs(b+1))%2:
print("Negative")
else:
print("Positive")
else:
print("Positive") |
p02600 | s225354991 | Wrong Answer | X = int(input())
if X in range(400,600):
print(8)
elif X in range(600,800):
print(7)
elif X in range(800,1000):
print(6)
elif X in range(1000,1200):
print(5)
elif X in range(1200,1400):
print(4)
elif X in range(1400,1600):
print(3)
elif X in range(1600,1800):
print(2)
elif X in range(1800,1900):
print(1) |
p02694 | s462259346 | Accepted | import numpy as np
x = int(input())
base = 100
year = 0
while base < x:
base = int(base * 1.01)
year += 1
print(year)
|
p02688 | s426701990 | Accepted | N, K = map(int, input().split())
sunuke_list = [1] * N
for j in range(K):
D = int(input())
D_list = list(map(int, input().split()))
for i in D_list:
sunuke_list[i - 1] = 0
print(sum(sunuke_list)) |
p02784 | s786054363 | Wrong Answer | H, N = map(int, input().split())
A = list(map(int, input().split()))
SUM_A = sum(A)
if SUM_A < H :
print("NO")
else :
print("YES") |
p02613 | s658233922 | Accepted | n = int(input())
s = [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")) |
p03612 | s034152560 | Accepted | n = int(input())
data = list(map(int, input().split()))
ans = 0
prev = False
for idx, d in enumerate(data):
if d == idx + 1 and prev is False:
ans += 1
prev = True
else:
prev = False
print(ans) |
p02768 | s372012870 | Accepted | from math import factorial
n,a,b=map(int,input().split())
mod=10**9+7
nCa=1
nCb=1
tmp=n
for i in range(a):
nCa*=tmp
tmp-=1
nCa%=mod
nCa=nCa*pow(factorial(a),mod-2,mod)%mod
tmp=n
for i in range(b):
nCb*=tmp
tmp-=1
nCb%=mod
nCb=nCb*pow(factorial(b),mod-2,mod)%mod
print(((pow(2,n,mod))-nCa-nCb-1)%mod) |
p03351 | s712669385 | Accepted | #097_A
a,b,c,d=map(int,input().split())
flg=abs(c-a)<=d or (abs(b-a)<=d and abs(c-b)<=d)
print('Yes' if flg else 'No') |
p02683 | s533076825 | Accepted | import sys
from itertools import product
import numpy as np
n, m, x = map(int, input().split())
a = np.array([list(map(int, input().split())) for _ in range(n)], dtype = np.int32)
ans = sys.maxsize
for bit in product((False, True), repeat = n):
row_sum = np.sum(a[np.where(bit)], axis = 0)
if m == np.count_nonzero(row_sum[1:] >= x):
ans = min(ans, row_sum[0])
print(-1 if ans == sys.maxsize else ans) |
p02933 | s192728557 | Accepted | a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print("red") |
p03944 | s819493288 | Accepted | w, h, n = map(int,input().split())
a_1 = 0
a_2 = w
a_3 = 0
a_4 = h
for i in range(n):
x, y, a = map(int,input().split())
if a == 1:
a_1 = max(a_1,x)
elif a == 2:
a_2 = min(a_2,x)
elif a == 3:
a_3 = max(a_3,y)
else:
a_4 = min(a_4,y)
if a_1 > a_2:
print(0)
elif a_3 > a_4:
print(0)
else:
print((a_2-a_1)*(a_4-a_3))
|
p02862 | s028785478 | Wrong Answer | print(0) |
p03665 | s688284940 | Accepted | n, p = map(int, input().split())
A = list(map(int, input().split()))
for a in A:
if a % 2 != 0:
break
else:
if p == 1:
print(0)
exit()
if p == 0:
print(2**n)
exit()
ans = 2**(n-1)
print(ans)
|
p02813 | s507441791 | Accepted | from itertools import permutations
from bisect import bisect_left
n = int(input())
p = int(input().replace(" ", ""))
q = int(input().replace(" ", ""))
temp_list = [int("".join(temp)) for temp in permutations([str(x) for x in range(1, n + 1)])]
temp_list.sort()
ans = abs(bisect_left(temp_list, p) - bisect_left(temp_list, q))
print(ans) |
p02570 | s178854253 | Accepted | requestMap = list(map(float, input().split()))
D = requestMap[0]
T = requestMap[1]
S = requestMap[2]
dist = S * T
if dist >= D:
print("Yes")
else:
print("No") |
p02952 | s579087754 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1):
if len(str(i))%2 == 1:
ans += 1
print(ans) |
p03773 | s745980075 | Accepted | A, B = map(int, input().split())
print((A+B)%24)
|
p03698 | s809182040 | Wrong Answer | s = input()
letters = []
ans = 'no'
for i in s:
if i in letters:
ans = 'yes'
break
else:
letters.append(i)
print(ans) |
p03013 | s742934435 | Accepted | n, m = map(int, input().split())
a = set(map(int, [input() for _ in range(m)]))
dp = [0] * (n+1)
# 0段目と1段目は1通り（但し、１段目が壊れていない場合）（0 段目は「なにもしない」という から1 通り）
dp[:2] = 1, 1 if 1 not in a else 0
for i in range(2, n+1):
if i not in a:
dp[i] = (dp[i-1] + dp[i-2])
print(dp[-1] % (10**9+7))
|
p03427 | s611019857 | Accepted | def resolve():
N = int(input())
NList = list(str(N))
maxA = eval("+".join(NList))
maxA = max(maxA, eval(
"+".join(list(str(int(NList[0]) - 1) + "9" * (len(NList) - 1)))))
print(maxA)
resolve()
|
p03479 | s415500798 | Wrong Answer | import math
x, y = map(int, input().split())
print(math.floor(math.log2(y) - math.log2(x)) + 1)
|
p03475 | s136507428 | Accepted | N = int(input())
lst_c = []
lst_s = []
lst_f = []
for _ in range(N - 1):
c, s, f = map(int, input().split())
lst_c.append(c)
lst_s.append(s)
lst_f.append(f)
for i in range(N):
t = 0
for j in range(i, N - 1):
if t <= lst_s[j]:
t = lst_s[j]
else:
t = (t + lst_f[j] - 1) // lst_f[j] * lst_f[j]
t += lst_c[j]
print(t) |
p03286 | s234267146 | Accepted | N = int(input())
ans = ""
i = 0
if N == 0:
print(0)
exit()
while N != 0:
if N % 2 == 0:
ans = "0" + ans
N = N // 2
else:
ans = "1" + ans
if i == 1:
N = (N + 1) // 2
else:
N = (N - 1) // 2
i = 1 - i
print(ans) |
p02608 | s189867977 | Accepted | N = int(input())
limit = 100
memo = {}
for a in range(1, limit):
for b in range(1, limit):
for c in range(1, limit):
t = a**2 + b**2 + c**2 + a*b + b*c + c*a
if not t in memo:
memo[t] = 1
else:
memo[t] += 1
for i in range(1, N+1):
if not i in memo:
print(0)
else:
print(memo[i]) |
p03438 | s249903676 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
n = 0
for j in range(N):
if B[j] < A[j]:
n += A[j] - B[j]
B[j] = A[j]
elif (B[j] - A[j]) % 2 == 1:
n += 1
B[j] += 1
s = sum([b - a for a, b in zip(A, B)])
print("Yes" if s % 2 == 0 and s >= 2 * n else "No") |
p02951 | s605516621 | Wrong Answer | def mapt(fn, *args):
return tuple(map(fn, *args))
def Input():
return mapt(int, input().split(" "))
def main():
a, b, c = Input()
ans = c - (a - b)
print(ans if c >= 0 else 0)
print(main()) |
p02641 | s900904782 | Wrong Answer | X, N = input().split()
p = list(map(int, input().split()))
Z = list(range(0, 101))
q = [i for i in Z if i not in p]
t = []
for i in range(0, len(q)):
t.append(abs(int(X)-q[i]))
print(q[(t.index(min(t)))]) |
p02678 | s256016759 | Accepted | from collections import deque
N,M = map(int,input().split())
g = [[] for _ in range(N+1)]
for i in range(M):
a,b = map(int,input().split())
g[a].append(b)
g[b].append(a)
q = deque([(1,0)])
ans = [-1]*(N+1)
while q:
u,v = q.popleft()
if ans[u] == -1:
ans[u] = v
for w in g[u]:
if w==v:
continue
q.append((w,u))
print('Yes')
for i in range(N-1):
print(ans[i+2]) |
p02773 | s681035662 | Accepted | N = int(input())
S = [input() for _ in range(N)]
S_ = {}
for a in S:
if a not in S_:
S_[a] = 1
else:
S_[a] += 1
S_ = sorted(S_.items(), key=lambda x:-x[1])
#print(S_)
max_ = 0
a = []
for i in range(len(S_)):
#print(S_[i][1], )
if S_[i][1] >= max_:
max_ = S_[i][1]
#print(a)
a.append(S_[i][0])
else:
break
a =sorted(a)
print(*a) |
p03632 | s590791407 | Accepted | A,B,C,D = map(int,input().split())
start = max(A,C)
end = min(B,D)
print(max(0,end-start)) |
p03206 | s064355998 | Accepted | D = int(input())
if D == 22:
print('Christmas Eve Eve Eve')
if D == 23:
print('Christmas Eve Eve')
if D == 24:
print('Christmas Eve')
if D == 25:
print('Christmas') |
p02597 | s071369948 | Accepted | from sys import stdin
input = stdin.readline
n = int(input())
s = input()
i, j = 0, n - 1
ans = 0
while i < j:
while i < j and s[i] == 'R':
i += 1
while i < j and s[j] == 'W':
j -= 1
if i < j:
ans += 1
i += 1
j -= 1
print(ans)
|
p03696 | s380534721 | Accepted | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
N = int(input())
S = str(input())
pointer = 0
need_left = 0
for i in range(N):
if S[i] == '(':
pointer += 1
else:
if pointer == 0:
need_left += 1
else:
pointer -= 1
need_right = pointer
print('('*need_left+S+')'*need_right)
resolve() |
p03862 | s682493073 | Accepted | N, x = map(int, input().split())
alist = list(map(int, input().split()))
gokei = 0
if alist[0] > x:
reduceBox = alist[0] - x
gokei += reduceBox
alist[0] = alist[0] - (reduceBox)
for i in range(N - 1):
eat = alist[i] + alist[i+1] - x
if eat > 0:
gokei += eat
alist[i+1] = alist[i+1] - eat
print(gokei) |
p02953 | s257497341 | Accepted | N = int(input())
H = list(map(int,input().split()))
mx = H[0]
for h in H[1:]:
if h < mx-1:
print('No')
exit()
mx = max(mx, h)
print('Yes') |
p02727 | s999111965 | Wrong Answer | X, Y, A, B, C = list(map(int,input().split()))
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
Z = 0
while Z < C:
if min(p[X - 1], q[Y - 1], r[Z]) < r[Z]:
if p[X - 1] < q[Y - 1]:
X -= 1
Z += 1
else:
Y -= 1
Z += 1
continue
break
print(sum(p[:X]) + sum(q[:Y]) + sum(r[:Z])) |
p03944 | s135882702 | Accepted | W,H,N=map(int, input().split())
X_min = 0
X_max = W
Y_min = 0
Y_max = H
for i in range(N):
x,y,a=map(int, input().split())
if a==1: X_min = max(X_min, x)
if a==2: X_max = min(X_max, x)
if a==3: Y_min = max(Y_min, y)
if a==4: Y_max = min(Y_max, y)
print(max([(X_max-X_min),0])*max([(Y_max-Y_min),0])) |
p02621 | s007878396 | Wrong Answer | a = int(input())
print(a+a^2+a^3) |
p02748 | s609897424 | Accepted | #標準入力
A,B,M = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
m = [list(map(int,input().split())) for i in range(M)]
n = list()
#割引券なしの最小値
min_a = min(a)
min_b = min(b)
sa = min_a + min_b
n.append(sa)
#割引券使用時の最小値
for i in range(M):
su = a[m[i][0]-1] + b[m[i][1]-1] - m[i][2]
n.append(su)
#比較＆出力
ans = min(n)
print(ans) |
p03087 | s822076298 | Wrong Answer | n, q = map(int, input().split())
s = input()
ls = [[int(_) for _ in input().split()] for _ in range(q)]
csm = [0]
cnt = 0
for i in range(n - 1):
if s[i:i+2] == 'AC':
cnt += 1
csm.append(cnt)
print(csm)
for j in range(q):
print(csm[ls[j][1] - 1] - csm[ls[j][0] - 1]) |
p02970 | s511418084 | Accepted | a,b=map(int,input().split())
ans = a//(2*b+1)
if a%(2*b+1) == 0: pass
else: ans += 1
print(ans)
|
p03162 | s142078614 | Accepted | import sys
import numpy as np
n = int(input())
dp = list(map(int, input().split()))
for i in range(n-1):
a, b, c = list(map(int, input().split()))
dp0, dp1, dp2 = dp
dp[0] = max(dp1+a,dp2+a)
dp[1] = max(dp0+b,dp2+b)
dp[2] = max(dp0+c,dp1+c)
print(max(dp)) |
p02935 | s068744493 | Wrong Answer | N=int(input())
*v,=sorted(map(int,input().split()))
from bisect import insort
c=1
while c<N:
#print(c,v)
insort(v,(v.pop(0) + v.pop(0)) / 2)
#print(c,v)
c+=1
print(v) |
p02700 | s208137472 | Accepted | A, B, C, D = list(map(int, input().split()))
while(A > 0 or C > 0):
C -= B
if(C<=0):
print("Yes")
break
A -= D
if(A<=0):
print("No")
break |
p02724 | s913618926 | Wrong Answer | x = int(input())
t = x//500
print(t * 1000 + ((x - 500 * t) % 5) * 5) |
p03219 | s548704586 | Accepted | x,y = map(int,input().split())
print(x+y//2) |
p03657 | s006256258 | Accepted | N,M=list(map(int,input().split()))
if any([N%3==0,(N+M)%3==0,M%3==0]):
print("Possible")
else:
print("Impossible") |
p02633 | s208310670 | Accepted | X = int(input())
sum = 0
ans = 0
while(True):
sum += X
ans += 1
if(sum % 360 == 0):
print(ans)
break
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.