problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03219 | s230194416 | Accepted | X, Y = map(int, input().split())
y = Y // 2
a = X + y
print(a) |
p03617 | s746718776 | Accepted | q,h,s,d=map(int,input().split())
n=int(input())
print((n//2)*min(8*q,4*h,2*s,d)+(n%2)*min(4*q,2*h,s)) |
p03611 | s188449682 | Accepted | N=int(input())
A=list(map(int,input().split()))
A_={}
for _ in range(-1,10**5+10):
A_[_]=0
for a in A:
a_b = a-1
a_a = a+1
A_[a] +=1
A_[a_b] +=1
A_[a_a] +=1
ans = 0
ans_idx = 0
for k in A_.keys():
a = A_[k]
if ans < a:
ans = a
ans_idx = k
# print(ans_idx,ans)
print(ans) |
p02797 | s081184983 | Accepted | n,k,s = map(int,input().split())
ans = []
if s==10**9:
for i in range(n):
if i < k:
ans.append(s)
else:
ans.append(1)
else:
for i in range(n):
if i < k:
ans.append(s)
else:
ans.append(s+1)
print(*ans) |
p03699 | s663341193 | Accepted | n = int(input())
s = sorted([int(input()) for _ in range(n)])
grade = 0 if sum(s) % 10 == 0 else (sum(s))
if grade == 0:
for i in s:
if i % 10 != 0:
print(sum(s) - i)
exit()
print(grade)
|
p03555 | s321861292 | Accepted | n = input()
l = input()
ans = True
#print(n[0])
#print(n[])
for i in range(len(n)):
if i ==0:
if n[0] == l[-1]:
continue
else :
ans = False
break
elif n[i] == l[-i-1]:
continue
else :
ans = False
break
if ans:
print("YES")
else:
print("NO")
|
p03592 | s906805947 | Accepted | def main():
n, m, k = map(int, input().split())
f = False
for i in range(n+1):
for j in range(m+1):
if i*j + (n-i)*(m-j) == k:
f = True
if f:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
p02677 | s493344313 | Wrong Answer | import math
a, b, h, m = map(int, input().split())
d_a = h * 30 + m * 0.5
d_b = m * 6
if d_a > d_b:
d_a, d_b = d_b, d_a
d = d_b - d_a
if d > 180:
d -= 180
# print(d)
if d == 180:
print(a + b)
else:
print(math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(math.radians(d)))) |
p02811 | s140106324 | Accepted | n = 500
x, y = map(int, input().split())
if x*n >= y:
print("Yes")
else:
print("No") |
p02691 | s694373011 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=[a.index(i)+1-i for i in a]
c=[a.index(i)+1+i for i in a]
from collections import defaultdict
B=defaultdict(int)
C=defaultdict(int)
for i in range(len(a)):
B[b[i]]+=1
C[c[i]]+=1
ans=0
for i in B:
ans+=B[i]*C[i]
print(ans) |
p02811 | s341212386 | Accepted | k,x = map(int,input().split())
if 500*k>=x:
print('Yes')
else:
print('No') |
p03804 | s194328976 | Accepted | n,m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
ans = 'No'
for di,dj in [(pi,pj) for pi in range(n-m+1) for pj in range(n-m+1)]:
for i,j in [(pi,pj) for pi in range(m) for pj in range(m)]:
if a[di+i][dj+j] != b[i][j]:
break
else:
ans = 'Yes'
break
print(ans)
|
p03351 | s041120288 | Accepted | a,b,c,d=map(int,input().split())
if abs(a-b)<=d and abs(b-c)<=d or abs(a-c)<=d:
print('Yes')
else:
print('No')
|
p02948 | s524338146 | Accepted | n,m=map(int,input().split())
d=[[]for i in range(m+1)]
from heapq import heappush,heappop,heapify
q=[]
for i in range(n):
a,b=map(int,input().split())
if a<=m:
d[-a-1].append(b)
ans=0
for i in d[::-1]:
for j in i:
heappush(q,-j)
if q:
ans+=-heappop(q)
print(ans) |
p03797 | s614823095 | Wrong Answer | N,M=list(map(int, input().split()))
K=N-2*M
print(max(N+K//3,N))
|
p02697 | s196639060 | Accepted | n,m=map(int,input().split())
diffs=set()
idxs=set()
i=1
diff=n-1
cnt=0
while 1:
if i>m:
break
while (diff in diffs and n-diff in diffs) or (i+diff in idxs) or (diff==n-diff):
diff-=1
diffs.add(n-diff)
diffs.add(diff)
idxs.add(i+diff)
print(i,i+diff)
i+=1 |
p02970 | s397372143 | Wrong Answer | N, D = map(int, input().split(" "))
print(N//(2*(D+1)) + 1) |
p03069 | s208300769 | Wrong Answer | n=int(input())
s=list(input())
switch=0
count=0
for i in s:
if i=='#':
if switch==0:
switch=1
else:
if switch==1:
count += 1
print(count) |
p03351 | s637217933 | Accepted | a,b,c,d = map(int,input().split())
if (abs(a-b)<=d and abs(c-b)<=d) or abs(a-c)<=d:
print("Yes")
else:
print("No") |
p02718 | s448819244 | Wrong Answer | import math
n,m = map(int, input().split())
A = list(map(int, input().split()))
line = math.floor(sum(A) / (4 * m))
cnt = 0
for a in A:
if a >= line:
cnt += 1
if cnt >= m:
print('Yes')
break
else:
print('No') |
p02802 | s444623360 | Wrong Answer | n,m = map(int, input().split())
b = [0]*(n+1)
AC,WA = 0,0
for _ in range(m):
p,s = map(str, input().split())
if b[int(p)] == 0:
if s == "AC":
AC += 1
b[int(p)] = 1
else:
WA += 1
print(AC,WA) |
p03639 | s217956954 | Accepted | n = int(input())
a = list(map(int, input().split()))
c4 = 0
c2 = 0
for i in a:
if i % 4 == 0:
c4 += 1
elif i % 2 == 0:
c2 += 1
if n - c4 - c2 <= c4:
print('Yes')
elif n - c4 - c2 - 1 <= c4 and c2 == 0:
print('Yes')
else:
print('No') |
p03943 | s518201867 | Accepted | a = list(int(i) for i in input().split())
a.sort()
print("Yes" if a[0]+a[1]==a[2] else "No") |
p03711 | s523082785 | Wrong Answer | def resolve():
a = [1, 3, 5, 6, 8, 10, 12]
b = [4, 6, 9, 11]
c = [2]
x, y = map(int, input().split())
if x in a and y in a:
print("Yes")
elif x in b and y in b:
print("Yes")
elif x in c and y in c:
print("Yes")
else:
print("No")
resolve() |
p03061 | s624725024 | Accepted | from math import*
n=int(input())
a=list(map(int,input().split()))
b=[a[0]]
c=[a[-1]]
for i in range(1,n):
b+=[gcd(b[-1],a[i])]
c+=[gcd(c[-1],a[-i-1])]
ans=0
c=c[::-1]
for i in range(n):
if i==0:ans=max(ans,c[i+1])
elif i==n-1:ans=max(ans,b[i-1])
else:
ans=max(ans,gcd(c[i+1],b[i-1]))
print(ans) |
p03745 | s066620737 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = 0
if n == 1:
print (1)
exit()
c = 0
for i in range(n-1):
if c == 2 and a[i+1] < a[i]:
cnt += 1
c = -1
elif c == 1 and a[i+1] > a[i]:
cnt += 1
c = -1
else:
if a[i+1] > a[i]:
c = 2
elif a[i+1] == a[i]:
c = 0
else:
c = 1
print (cnt+1) |
p03803 | s338983920 | Accepted | a, b = map(lambda x: int(x), input().split())
if a == 1:
a = 1 + 13
if b == 1:
b = 1 + 13
if a < b:
print('Bob')
elif a > b:
print('Alice')
else:
print('Draw') |
p03698 | s018585374 | Wrong Answer | w = str(input())
for i in range(len(w)):
for j in range(len(w)):
if i != j:
w[i] == w[j]
f = True
break
else:
f = False
print('no' if f else 'yes') |
p03657 | s404500827 | Wrong Answer | A, B = map(int,input().split())
if A % 3 == 0 or B % 3 ==0 or (A + B) % 3 ==0:
print("possible")
else:
print("impossible") |
p02687 | s143564454 | Accepted | print('A%sC'%'BR'[input()<'AR']) |
p03126 | s962981245 | Accepted | N,M = map(int,input().split())
target = list()
for i in range(N):
target_list = list(map(int,input().split()))
target_list.pop(0)
target.append(target_list)
# print(target)
ans = dict()
for i in range(0,len(target)):
for j in range(len(target[i])):
if i == 0:
ans[target[i][j]] = 1
else:
if target[i][j] in ans:
ans[target[i][j]] += 1
ans_num = 0
for k in ans.keys():
if ans[k] == N:
ans_num += 1
print(ans_num)
|
p02765 | s928675202 | Accepted | N, R = map(int, input().split())
if N < 10:
n2=100*(10-N)
R2 = R+n2
elif N >= 10:
R2 = R
print(R2) |
p02847 | s407011297 | Accepted | s = input()
L = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
print(7 - L.index(s)) |
p03284 | s557531422 | Accepted | n, k = map(int, input().split())
print(min(n%k,1)) |
p02720 | s638413783 | Accepted | from itertools import chain
l = [[] for _ in range(11)]
l[0] = list(map(str, range(1, 10)))
for i in range(10):
for x in l[i]:
last = int(x[-1])
for m in {max(0, last-1), last, min(9 ,last+1)}:
m = str(m)
l[i+1].append(x+m)
q = list(map(int, chain(*l)))
q.sort()
# print(len(q))
K = int(input())
print(q[K-1]) |
p03317 | s921428061 | Wrong Answer | import math
def process_smaller_index(K, min_index):
if min_index == 0:
return 0
else:
return math.ceil(min_index / K)
def process_larger_index(last_index, K, min_index):
if min_index == last_index:
return 0
else:
return math.ceil((last_index - min_index) / K)
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
min_index = A.index(1)
print(process_smaller_index(K - 1, min_index) + process_larger_index(len(A)-1, K - 1, min_index)) |
p02661 | s393770941 | Wrong Answer | n = int(input())
ab = [list(map(int, input().split())) for _ in range(n)]
ab = sorted(ab, key=lambda x:int(x[1]))
c = [ab[i][1]-ab[i][0] for i in range(n)]
if n%2 == 1:
center = n//2
answer = ab[center][1]-ab[center][0]
else:
center = [n//2-1,n//2]
answer1 = ab[center[0]][1] - ab[center[0]][0]+1
answer2 = ab[center[1]][1] - ab[center[1]][0]+1
answer = answer1*answer2 - max(0,ab[center[0]][1]-min(ab[center[0]][0],ab[center[1]][1]))
print(answer) |
p02682 | s958495195 | Wrong Answer | A,B,C,K=map(int, input().split())
if A >= K:
maxnum = A
elif A<K and A+B>=K:
maxnum = A
else:
maxnum = A - (K-A-B)
print(maxnum) |
p02622 | s512273023 | Accepted | S = list(input())
T = list(input())
count = 0
for i in range(len(S)):
if S[i] == T[i]:
continue
else:
count += 1
print(count) |
p03086 | s690855479 | Accepted | s=input()
ans=0
for i in range(len(s)):
for j in range(len(s)):
new_s=list(s[i:(len(s)-j)])
if all((i in ["A","T","G","C"]) for i in new_s) and len(new_s)>ans:
ans=len(new_s)
print(ans) |
p02718 | s465032792 | Accepted | n,m = map(int,input().split())
a = list(map(int, input().split()))
popular = list(filter(lambda e: e>=(1/(4*m))*sum(a),a))
print("Yes" if len(popular) >= m else "No") |
p03261 | s997677741 | Wrong Answer | n = int(input())
l = []
ans = 'Yes'
ps = 'a'
for i in range(n):
s = input()
if s in l:
ans = 'No'
l.append(s)
if i != 0 and ps[-1] != s[0]:
ans = 'No'
print(ans) |
p02862 | s424186788 | Accepted | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
mod = 10**9+7
def comb(n, k):
c = 1
for i in range(k):
c *= n - i
c %= mod
d = 1
for i in range(1, k + 1):
d *= i
d %= mod
return (c * pow(d, mod - 2, mod)) % mod
x,y = map(int, input().split())
if (x + y) % 3 != 0:
print(0)
exit()
n = (x + y) // 3
x -= n
y -= n
if x < 0 or y < 0:
print(0)
exit()
print(comb(x + y, x))
|
p03434 | s316623970 | Accepted | n = int(input())
a = list(map(int, input().split()))
A = sorted(a, reverse = True)
ali = []
bob = []
for i in range(n):
if i % 2 == 0:
ali.append(A[i])
else:
bob.append(A[i])
print(sum(ali) - sum(bob)) |
p03861 | s824610394 | Accepted | a,b,x = map(int, input().split())
print(b//x - (a-1)//x) |
p03673 | s252529604 | Accepted | n = int(input())
a = list(map(int, input().split()))
a_even = [elm_a for i, elm_a in enumerate(a) if i % 2 == 0]
a_odd = [elm_a for i, elm_a in enumerate(a) if i % 2 == 1]
ans = a_even[::-1] + a_odd
if n % 2 == 0:
ans = ans[::-1]
print(' '.join(map(str, ans))) |
p03220 | s740028038 | Accepted | N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
ans = 0
min_height = 10**18
for i in range(N):
if abs(A - T + H[i]*0.006) < min_height:
ans = i+1
min_height = abs(A - T + H[i]*0.006)
print(ans) |
p03962 | s133290656 | Accepted | a,b,c=map(int,input().split())
if a==b and b==c:
print(1)
elif a==b or b==c or c==a:
print(2)
else:
print(3) |
p02645 | s859134830 | Wrong Answer | S = input()
print(S[0:2]) |
p02755 | s212000199 | Accepted | A, B = map(int, input().split())
for i in range(B*100):
if i*8//100 == A and i * 10 // 100 == B:
print(i)
exit()
print(-1)
|
p03998 | s129757439 | Wrong Answer | a = list(input())
b = list(input())
c = list(input())
ans = 'A'
d = {'a': a, 'b': b, 'c': c}
card = d['a'].pop()
while a and b and c:
card = d[card].pop()
if not d['b']:
ans = 'B'
if not d['c']:
ans = 'C'
print(ans)
|
p02688 | s134731576 | Accepted | import itertools
N,K=map(int,input().split())
A=[]
for i in range(K*2):
a=list(map(int,input().split()))
if i%2==1:
A.append(a)
x=list(itertools.chain.from_iterable(A))
print(N-len(set(x)))
|
p03557 | s486348879 | Wrong Answer | from bisect import bisect_left
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()
alters_count = 0
for a in A:
bidx = bisect_left(B, a)
if bidx == N:
continue
for b in B[bidx:]:
cidx = bisect_left(C, b)
if cidx == N:
continue
alters_count += N - cidx
print(alters_count) |
p02786 | s546032092 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[25]:
H = int(input())
# In[26]:
import math
# In[28]:
print(int(2**(math.log2(H)//1 + 1)-1))
# In[ ]:
|
p03145 | s004238176 | Accepted | L=list(map(int,input().split()))
print(L[0]*L[1]//2) |
p03854 | s185213941 | Wrong Answer | S = input()
sc = ["dreameraser", "dreamerase", "dreamer", "dream", "eraser", "erase"]
for i in sc:
S = S.replace(i, '')
if len(S) == 0:
print("YES")
else:
print("NO") |
p02924 | s664094583 | Wrong Answer | import math
n = int(input())
ans = 0.5 * (n-1)*n
print(int(ans))
|
p02624 | s391666495 | Accepted | N = int(input())
ans = 0
for j in range(1, N+1):
# ある数jのNまでの倍数をすべて足す。等差数列の和
n = N // j
tmp = n * (2 * j + (n-1) * j) // 2
ans += tmp
print(ans) |
p03107 | s355682482 | Wrong Answer | S = str(input())
x = len(S)
while '01' in S:
S = S.replace('01', '')
S = S.replace('10', '')
print (x-len(S)) |
p02759 | s741405816 | Accepted | N=int(input())
print((N+1)//2) |
p03632 | s309649750 | Wrong Answer | a,b,c,d = map(int,input().split())
if b<c:
print(0)
else:
print(min(b,d)-c)
|
p02963 | s890556039 | Accepted | # https://atcoder.jp/contests/agc036/tasks/agc036_a
s = int(input())
x1, y1 = 0, 0
x2 = 10 ** 9
y2 = 1
y3 = (s + x2 -1) // x2
x3 = x2 * y3 - s
print(x1, y1, x2, y2, x3, y3) |
p02836 | s813268758 | Wrong Answer | s = list(input())
s1 = s[::-1]
count = 0
for i in range(len(s)):
if s[i]!=s1[i]:
count += 1
print(count)
|
p02784 | s238154935 | Wrong Answer | """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
H, N,*A = map(int, read().split())
print('YES' if H<=sum(A) else 'No') |
p02767 | s148729312 | Accepted | n = int(input())
x = list(map(int,input().split()))
ans_list = []
for i in range(max(x)):
ans = 0
for j in x:
ans += (j-(i+1))**2
ans_list.append(ans)
print(min(ans_list)) |
p02982 | s534306067 | Wrong Answer | #133 b
import itertools
n,d=map(int,input().split())
N=[i for i in range(n)]
k=[i*i for i in range(1,100)]
x=[]
for i in range(n):
a=list(map(int,input().split()))
x.append(a)
ans=0
kumi=itertools.combinations(N,2)
for a,b in kumi:
s=0
for j in range(d):
s+=(x[a][j]-x[b][j])**2
if s in k:
ans+=1
print(ans)
|
p03435 | s169312152 | Accepted | import numpy as np
c = [[0]*3] * 3
for i in range(3):
c[i] = list(map(int, input().split()))
c = np.array(c)
if len(set(c[0] - c[1])) == 1 and len(set(c[1] - c[2])) == 1 and len(set(c[:,0] - c[:,1])) == 1 and len(set(c[:,1] - c[:,2])) == 1:
print("Yes")
else:
print("No")
|
p02795 | s073498684 | Accepted | H=int(input())
W=int(input())
N=int(input())
if W>=H:
cnt=(N-1+W)//W
else:
cnt=(N-1+H)//H
print(cnt) |
p03323 | s724965849 | Accepted | a, b = map(int, input().split())
if max(a,b) <= 8:
print('Yay!')
else:
print(':(') |
p03067 | s981580960 | Accepted | a,b,c=map(int,input().split())
print("Yes" if a<c<b or b<c<a else "No") |
p03274 | s872196429 | Accepted | n,k=map(int,input().split())
x=sorted(list(map(int,input().split())))
a=[]
for i in range(n-k+1):
l=x[i]
r=x[i+k-1]
a.append(min(abs(l)+abs(r-l),abs(r)+abs(l-r)))
print(min(a)) |
p02994 | s908976280 | Wrong Answer | N, L = map(int, input().split())
if abs(L-1) <= N:
i = abs(L - 1)
else:
i = N
A = (N-1)*(L-1) + sum([n for n in range(1, N+1)]) - i
print(A) |
p03284 | s128866139 | Accepted | N,K = map(int,input().split())
if N % K != 0:
print(1)
else:
print(0) |
p03150 | s991351130 | Accepted | S = input()
c = "keyence"
if S[-7:] == c or S[:7] == c:
print("YES")
else:
for i in range(1, 7):
c_, _c = c[:i], c[i:]
if S[:i] == c_ and S[-(7-i):] == _c:
print("YES")
break
else:
print("NO") |
p02622 | s337524396 | Accepted | S = input()
T = input()
L = 0
for i in range(len(S)):
if S[i] != T[i]:
L += 1
else:
continue
print(L)
|
p02994 | s826685941 | Wrong Answer | n, l = map(int, input().split())
pie = 0
comp = 300
for i in range(1, n+1):
pie = pie + l + i - 1
if abs(l + i -1) < comp:
comp = l + i -1
print(comp)
print(pie - comp)
|
p03481 | s195970652 | Accepted | X,Y = map(int,input().split())
con = 0
while X <= Y:
con += 1
X = X * 2
print(con) |
p02971 | s302286791 | Accepted | n = int(input())
a = list(int(input()) for _ in range(n))
aa = sorted(a.copy())
mx, sd = aa[n - 1], aa[n - 2]
for i in a:
print(mx if i < mx else sd) |
p02778 | s994482111 | Accepted | s = len(str(input()))
print('x'*s) |
p02995 | s223339286 | Accepted | from fractions import gcd
A, B, C, D = map(int,input().split())
total = B - A + 1
divC = B//C - (A-1)//C
divD = B//D - (A-1)//D
lcm = int(C * D / gcd(C, D))
divCD = B//lcm - (A-1)//lcm
print(total - divC - divD + divCD) |
p03323 | s355369816 | Accepted | import sys
sys.setrecursionlimit(10**6)
a,b=map(int,input().split())
if a<=8 and b<=8:
print("Yay!")
else:
print(":(")
|
p03037 | s241722331 | Accepted | n, m = map(int, input().split())
l = 0
r = n
for i in range(m):
lt, rt = map(int, input().split())
l = max(l, lt)
r = min(r, rt)
if(l<=r):
print(r - l + 1)
else:
print(0)
|
p03239 | s459732737 | Accepted | n,t = map(int, input().split())
cl = []
tl = []
for i in range(n):
cw,tw = map(int, input().split())
if tw <= t:
cl.append(cw)
tl.append(tw)
if len(cl) == 0:
print('TLE')
else:
print(min(cl)) |
p02687 | s249138134 | Accepted | def resolve():
s = input()
if s == 'ABC':
print('ARC')
else:
print('ABC')
resolve() |
p03103 | s776889139 | Wrong Answer | def resolve():
n, m = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]
l.sort()
ans = 0
drink = 0
for i in range(n):
cost = l[i][0]
num = l[i][1]
if drink + num >=m:
ans += cost*(m-drink)
print(ans)
else:
drink += num
ans += num*cost
resolve() |
p02613 | s274602358 | Accepted | #!python3
# input
N = int(input())
S = [input() for _ in range(N)]
def main():
l = ["AC", "WA", "TLE", "RE"]
d = {x: 0 for x in l}
for s in S:
d[s] += 1
for x in l:
ans = "{} x {}".format(x, d[x])
print(ans)
if __name__ == "__main__":
main()
|
p02623 | s611247537 | Wrong Answer | n,m,k = map(int,input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ac = 0
bc = 0
ans = 0
t = 0
while t<k:
if bc<=m-1 and ac <=n-1:
if a[ac] > b[bc]:
t += b[bc]
bc +=1
else:
t+= a[ac]
ac+=1
elif ac >= n and bc<=m-1:
t += b[bc]
bc +=1
print(t)
elif bc == m and ac<=n-1:
t+= a[ac]
ac+=1
else:
break
ans+=1
print(ans) |
p02696 | s718606858 | Accepted | import math
A,B,N=map(int,input().split())
if B >N:
print(math.floor((A*N)/B))
else:
print(math.floor((A*(B-1)/B)))
|
p02910 | s433840131 | Accepted | import sys
S = input()
odd = ['R', 'U', 'D']
even = ['L', 'U', 'D']
for i, j in enumerate(S):
if i % 2 == 0:
if not j in odd:
print('No')
sys.exit()
else:
if not j in even:
print('No')
sys.exit()
print('Yes')
|
p02759 | s731661990 | Wrong Answer | n = int(input())
if n % 2 == 0:
print(n/2)
else:
print(n//2+1) |
p03827 | s458340399 | Wrong Answer | N = int(input())
S = list(input())
x = [0]
for i in range(N):
if S[i] == 'I':
x.append(x[-1]+1)
print(x)
elif S[i] == 'D':
x.append(x[-1]-1)
print(x)
print(max(x)) |
p02696 | s398164374 | Accepted | a,b,n=map(int,input().split())
def f(x):
return int(a*x//b)-a*int(x//b)
if n<b:
print(f(n))
elif n==b:
print(f(n-1))
elif n>b:
t = n
u = n - (n%b+1)
print(max(f(t),f(u))) |
p03416 | s350396037 | Accepted | a, b = map(int, input().split())
ans = 0
for i in range(a, b+1):
s = str(i)
if s == s[::-1]:
ans += 1
print(ans) |
p03779 | s566112056 | Wrong Answer | X = int(input())
Sum = 0
t = 0
while Sum + (t + 1) <= X:
t += 1
Sum += t
print(t + (X - Sum)) |
p03319 | s739773060 | Accepted | import math
N,K,*A=map(int,open(0).read().split())
print(int(math.ceil((N-1)/(K-1)))) |
p02900 | s959062103 | Wrong Answer | from math import gcd
A, B = map(int, input().split())
d = gcd(A, B)
ans = 1
i = 2
while i <= pow(d, 1/2)+1:
if d%i == 0:
ans += 1
while d%i == 0:
d //= i
i += 1
print(ans) |
p03109 | s600077880 | Accepted | if int(input()[5:7])<5:
print("Heisei")
else:
print("TBD") |
p02596 | s603911983 | Accepted | k = int(input())
ans = -1
seq = [0]
seq.append(7%k)
for i in range(2,k+1):
seq.append((seq[i-1]*10+7)%k)
for j in range(1,k+1):
if seq[j] == 0:
ans = j
break
print(ans)
|
p03862 | s124059900 | Accepted | N,x = map(int,input().split())
a=list(map(int,input().split()))
cnt=0
b=[0]*N
#0,2
b[0]=a[0] if a[0]<=x else x
cnt+= a[0]-b[0]
for i in range(1,N):
b[i] = a[i] if b[i-1]+a[i]<=x else max(0,x-b[i-1])
cnt += a[i]-b[i]
#print(b)
print(cnt) |
p03680 | s519887724 | Wrong Answer | n = int(input())
a = [int(input()) for _ in range(n)]
now = a[0]
c = 1
if now == 2:
print(1)
exit()
for i in range(n):
now = a[now-1]
c += 1
if now == 2:
print(c)
break
print(-1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.