problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03861 | s039114949 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
a,b,x=map(int, input().split())
if a!=0:
amade=(a-1)//x
bmade=b//x
print(bmade-amade)
else:
print(b//x+1)
resolve() |
p02778 | s903246904 | Accepted | S=input()
print('x'*len(S)) |
p03479 | s726116414 | Wrong Answer | x,y = map(int,input().split())
ans = 0
while True:
if x < y:
ans += 1
x *= 2
else:
break
print(ans) |
p02882 | s344414261 | Wrong Answer | import math
a,b,x=map(int,input().split())
if a*b**2>=2*x:
print(math.degrees(math.atan(a*b**2/(2*x))))
elif x==0:
print(90)
else:
print(math.degrees(math.atan((2*b/a)-(2*x/(a**3))))) |
p03632 | s314252694 | Wrong Answer | A,B,C,D = map (int, input ().split ())
if A < C:
X = C
else:
X = A
if B < D:
Y = B
else:
Y = D
print (Y-X) |
p02973 | s089842928 | Accepted | import bisect
from collections import deque
n = int(input())
A = []
dq_A = deque(A)
count = 0
for _ in range(n):
a = int(input())
if len(dq_A) == 0:
dq_A.appendleft(a)
count += 1
continue
i = bisect.bisect_left(dq_A, a)
if i == 0:
dq_A.appendleft(a)
count += 1
else:
dq_A[i-1] = a
ans = count
print(ans) |
p02963 | s856089353 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[16]:
S = int(input())
# In[17]:
x1 = 0; y1 = 0
if S <= 10**9:
x2 = S; y2 = 0
x3 = 0; y3 = 1
else:
x2 = 10**9; y2 = 1
mod = 10**9
x3 = (mod - S%mod)%mod
y3 = (S+x3)//mod
print(x1,y1,x2,y2,x3,y3)
# In[ ]:
|
p02718 | s934051497 | Wrong Answer | N, M = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
b = 0
for i in range(M):
if a[i] >= sum(a)//(M*4)+1:
b += 1
if b == M:
print('Yes')
elif b < M:
print('No') |
p02621 | s663413735 | Accepted | n=int(input())
print(n+(n*n)+(n*n*n)) |
p03387 | s533232171 | Accepted | a,b,c=map(int,sorted(list(map(int,input().split()))))
cnt=0
while True:
if a==b==c:break
elif a==b:
cnt+=c-a
break
else:
a,b,c=map(int,sorted([a+2,b,c]))
cnt+=1
print(cnt) |
p02963 | s551256423 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
def resolve():
s = int(input())
x0, y0 = 0, 0
if s % (10 ** 9) == 0:
x1, y1 = 10 ** 9, 0
else:
x1, y1 = 10 ** 9, 1
y2 = (s + x1 - 1) // x1
x2 = 10 ** 9 - s % x1
print(x0, y0, x1, y1, x2, y2)
# print(s - abs(x1 * y2 - x2 * y1))
if __name__ == '__main__':
resolve()
|
p02910 | s646787508 | Accepted | #!/usr/bin/env python3
def main():
S = input()
S_o = [S[i] for i in range(0, len(S)) if i % 2 == 0]
S_e = [S[i] for i in range(0, len(S)) if not i % 2 == 0]
if S_o.count('L') > 0:
print('No')
elif S_e.count('R') > 0:
print('No')
else:
print('Yes')
main() |
p03495 | s746762141 | Accepted | url = "https://atcoder.jp/contests/abc081/tasks/arc086_a"
import copy
def main():
n, m = list(map(int, input().split()))
li = list(map(int, input().split()))
dic = {}
for v in li:
dic.setdefault(v, 0)
dic[v] += 1
if len(dic) <= m:
print(0)
exit()
count = 0
vals = sorted(list(dic.values()), reverse=True)
for i in range(len(dic) - m):
count += vals.pop(-1)
print(count)
if __name__ == '__main__':
main()
|
p02761 | s582426154 | Accepted |
n, m = map(int, input().split())
num = [0] * n
flag = 1
if m == 0:
if n == 1:
print(0)
exit()
num[0] = 1
for i in range(m):
s, c = map(int, input().split())
if num[s - 1] == 0 or (s - 1 == 0 and num[0] == 1):
num[s - 1] = c
else:
if num[s - 1] != c:
flag = 0
if flag == 0 or (n != 1 and num[0] == 0):
print(-1)
else:
for i in range(n):
print(num[i], end="") |
p02843 | s728110227 | Accepted | x = int(input())
n = x // 100
if 100 * n <= x <= 105 * n:
print('1')
else:
print('0') |
p02689 | s102166016 | Accepted | N, M = map(int, input().split())
H = list(map(int, input().split()))
dai = [list(map(int, input().split())) for i in range(M)]
plus = [i for i in range(N)]
for a, b in dai:
if H[a - 1] > H[b - 1]:
plus[b-1] = -1
continue
else:
plus[a-1] = -1
if H[b - 1] > H[a - 1]:
plus[a-1] = -1
continue
else:
plus[b-1] = -1
print(len(set(plus))-1)
|
p03282 | s048583515 | Accepted | S=input()
K=int(input())
ans=0
for i in range(len(S)):
a=int(S[i])
if a==1:
ans+=1
else:
print(a)
break
if ans>=K:
print(a)
break |
p02708 | s182274429 | Wrong Answer | N,K=map(int,input().split())
b=0
c=0
ans=0
for i in range(0,K):
b+=i
c+=(N-1-i)
ans=c-b
for i in range(K,N+1):
ans+=(c+i)-(b+(N-i))
print(ans%(10**9+7))
|
p03339 | s658371314 | Wrong Answer | n = int(input())
s = list(map(str,input()))
count = 0
for i in range(n):
if s[i] == "E":
count += 1
box = [0]*n
if s[0] == "E":
box[0] = count - 1
else:
box[0] = count
for j in range(1,n):
if s[j] == "E":
count -= 1
if s[j - 1] == "W":
count += 1
box[j] = count
print(min(box))
|
p02899 | s886618617 | Accepted | n = int(input())
an = list(map(int,input().split()))
zyunban = [0]*n
t = 1
for x in an:
zyunban[x-1] = t
t += 1
zyunban = list(map(str,zyunban))
print(" ".join(zyunban))
|
p03785 | s609967272 | Accepted | import bisect
N, C, K = map(int,input().split())
T = [0]*N
for i in range(N):
T[i] = int(input())
T.sort()
#print(T)
ans = 0
left = 0
while True:
if left >= N:
break
#print("T[left]",T[left])
ind = bisect.bisect_right(T, T[left]+K)
#print("ind",ind)
left = min(ind, left+C)
ans += 1
#print("left",left)
#print('&&&&&&&&&&&&&&&&&&')
print(ans) |
p02817 | s254413312 | Accepted | a, b = map(str, input().split())
print(b + a) |
p03387 | s137233364 | Accepted | A = sorted(map(int, input().split()))
x = 0
while A[0] < A[2] - 1:
A[0] += 2
x += 1
while A[1] < A[2] - 1:
A[1] += 2
x += 1
if A[0] == A[1] == A[2]:
x = x
elif A[0] == A[1]:
x = x + 1
else:
x = x + 2
print(x) |
p03285 | s950025128 | Wrong Answer | n = int(input())
for i in range(n//4):
for j in range(n//7):
if (4*(i+1))+(7*(j+1)) == n:
print("Yes")
exit()
print("No") |
p03264 | s584257879 | Wrong Answer | k=int(input())
print((k+1)//2*k//2) |
p02606 | s724176216 | Accepted | # 初期入力
import sys
input = sys.stdin.readline
L,R,d = (int(i) for i in input().split())
count_L =0
count_R =0
for i in range(1,101):
if i*d <L:
count_L +=1
if i*d <=R:
count_R +=1
ans =count_R -count_L
print(ans) |
p02787 | s687488767 | Accepted | #input
H, N = map(int, input().split())
A = [0]*N
B = [0]*N
for i in range(N):
A[i], B[i] = map(int, input().split())
#output
M = max(A)
inf = 10**10
dp = [inf]*(H+(M+1))
dp[0] = 0
for i in range(N):
for j in range(A[i], H+M):
dp[j] = min(dp[j], dp[j-A[i]] + B[i])
answer = min(dp[H:(H+M+1)])
print(answer) |
p03012 | s161165101 | Wrong Answer | a=int(input())
b=list(map(int,input().split()))
c=sum(b)
d=0
e=0
f=0
for i in range(a):
d=d+b[i]
if d>=c/2:
e=i
break
for i in range(e):
f=f+b[e]
if d-(c-d)<f-(c-f):
print(d-(c-d))
else:
print(f-(c-f)) |
p02911 | s228888523 | Accepted | n, k, q = map(int, input().split())
a = [0] * n
for i in range(q):
a[int(input()) - 1] += 1
for i in range(n):
if a[i] > q - k:
print("Yes")
else:
print("No") |
p03854 | s240008746 | Accepted | import re
print("YES" if re.match("^(dream|dreamer|erase|eraser)+$",input()) else "NO") |
p03836 | s245585934 | Wrong Answer | sx, sy, tx, ty = map(int, input().split())
len_x = tx - sx
len_y = ty - sy
ans = []
for _ in range(len_x):
ans.append("R")
for _ in range(len_y):
ans.append("U")
for _ in range(len_x):
ans.append("L")
for _ in range(len_y):
ans.append("D")
ans.append("D")
for _ in range(len_x + 1):
ans.append("R")
for _ in range(len_y + 2):
ans.append("U")
for _ in range(len_x + 2):
ans.append("L")
for _ in range(len_y + 1):
ans.append("D")
ans.append("R")
print("".join(ans)) |
p02555 | s898772145 | Wrong Answer | import math
s = int(input())
if s <= 2:
print(0)
exit()
ans = 1
def c(_n, _r):
return math.factorial(_n) / (math.factorial(_r) * math.factorial(_n - _r))
for i in range(2, (s//3)+1):
n = s-i*3
r = i
if n < r:
for j in range(1, n+1):
ans += c(r, j)
else:
ans += c(n+1, r-1)
ans %= 10**9+7
print(int(ans))
|
p02933 | s106204228 | Accepted | a = int(input())
s = input()
if (a >= 3200):
print(s)
else:
print("red") |
p02657 | s171425129 | Wrong Answer | print(sum(map(int, input().split(' ')))) |
p03835 | s679611683 | Accepted | K, S = map(int, input().split())
ans = 0
for i in range(K + 1):
for j in range(K + 1):
if i + j == S:
ans += 1
elif 0 <= S - (i + j) <= K:
ans += 1
print(ans) |
p02879 | s373746416 | Wrong Answer | a, b = map(int, input().split())
if a<10 & b<10:
print(a*b)
else:
print("-1")
|
p02818 | s439631667 | Wrong Answer | a, b, k = map(int, input().split())
if (a, b) == (0, 0):
print(0, 0)
exit(0)
if a - k < 0:
print(0, b - (k-a))
else:
print(a-k, b) |
p02765 | s821744969 | Wrong Answer | N, R = list(map(int, input().split()))
if(N>=10):
print(R)
else:
print(R - 100*(10-N))
|
p03854 | s053038048 | Accepted | s = input()[::-1]
word = ["dream", "dreamer", "erase", "eraser"]
dream = "dream"[::-1]
dreamer = "dreamer"[::-1]
erase = "erase"[::-1]
eraser = "eraser"[::-1]
while True:
if s[:5] == dream or s[:5] == erase:
s = s[5:]
continue
elif s[:6] == eraser:
s = s[6:]
continue
elif s[:7] == dreamer:
s = s[7:]
continue
break
if len(s) == 0:
print("YES")
else:
print("NO") |
p04012 | s684338214 | Wrong Answer | w = list(input())
count_w = list(set(w))
n = 0
for i in range(len(count_w)):
n += w.count(count_w[i])
print("Yes" if n % 2 == 0 else "No") |
p03359 | s075509885 | Accepted | a,b=map(int,input().split())
if a<=b:
print(a)
else:
print(a-1)
|
p03469 | s661762728 | Accepted | print(input().replace("2017","2018")) |
p03623 | s827499545 | Wrong Answer | x,a,b = map(int,input().split())
if abs(x-a) >= abs(x-b):
print('A')
else:
print('B') |
p03761 | s921249081 | Accepted | import numpy as np
n = int(input())
S = [input() for i in range(n)]
mat = [[0 for i in range(26)] for j in range(n)]
mat = np.array(mat)
for i in range(n):
Sp = S[i]
for j in range(len(Sp)):
mat[i][ord(Sp[j])-97] += 1
result = ''
for i in range(26):
Cnt = min(mat[:,i])
for j in range(Cnt):
result += chr(i+97)
print(result) |
p03352 | s314000141 | Accepted | #abc097 b bekijousu
import math
def large_num(n):
xx=x/n
p=1
while xx-n**p>=0:
p+=1
if p==1:
return 0
else:
return n**p
x=int(input())
b_last=int(math.sqrt(1000))
num=[i for i in range(2,b_last+1)]
ans=0
if 4>x:
ans=1
else:
for i in num:
ans=max(large_num(i),ans)
print(ans)
|
p03407 | s782166507 | Wrong Answer | a,b,c=map(int,input().split())
if (a+2*b)>=c:
print("Yes")
else:
print("No") |
p02731 | s918166237 | Accepted | print((int(input())/3)**3) |
p02780 | s032100881 | Wrong Answer | n,k=map(int,input().split())
p=list(map(int,input().split()))
maxim=0
for i in range(n-k):
if p[i]<=p[i+k]:
maxim=i+1
ans=(sum(p[maxim:maxim+k])+k)/2
print(ans) |
p02860 | s929734663 | Accepted | n=int(input())
s=input()
if s[0:n//2] == s[n//2:n]:
print("Yes")
else:
print("No") |
p02702 | s438812132 | Wrong Answer | S = list(input())
l = len(S)
slist = [int(''.join(S[i:j])) for i in range(l-3) for j in range(i+4,l)]
cnt = sum([1 for s in slist if s%2019==0])
print(cnt) |
p03438 | s054463846 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
SA = sum(A)
SB = sum(B)
cnt_a, cnt_b = 0, 0
for i in range(N):
if A[i] <= B[i]:
cnt_a += (B[i] - A[i] + 1)//2
else:
cnt_b += A[i] - B[i]
if SB - SA >= max(cnt_a, cnt_b):
print("Yes")
else:
print("No") |
p02792 | s565533117 | Accepted | r = range(1, 10)
n = int(input())
a = [None] + [[0] * 10 for _ in r]
for i in r:
if i <= n:
a[i][i] += 1
for i in r:
for j in r:
k = 1
while 10 * k * i + j <= n:
a[i][j] += min(k, (n - j) // 10 - k * i + 1)
k *= 10
print(sum(a[i][j] * a[j][i] for i in r for j in r))
|
p03076 | s833574714 | Accepted | import sys
import math
import numpy as np
stdin = sys.stdin
mod = 10**9 + 7
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]
a = []
for _ in range(5):
a.append(ni())
a = np.array(a)
m = np.min((a-1)%10+1)
d = (a - 1) // 10 + 1
print(sum(d)*10 + m - 10)
|
p03456 | s206696504 | Accepted | a, b = input().rstrip().split()
v = int(a + b)
li = [i**2 for i in range(v//2)]
if v in li:
print('Yes')
else:
print('No') |
p02676 | s053236699 | Accepted | n = [input() for i in range(2)]
k = int(n[0])
s = n[1]
if len(s) <= k:
print(s)
else:
s = s[0:k] + "..."
print(s)
|
p03862 | s106727627 | Accepted | N, x = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
for index, a in enumerate(A):
if index == 0:
if a > x:
ans += abs(x - a)
A[index] = x
continue
if a + A[index-1] > x:
ans += abs(x - (a + A[index-1]))
A[index] = x - A[index-1]
print(ans) |
p03494 | s747885891 | Wrong Answer | def division(li):
for i in range(len(li)):
if i % 2 == True:
continue
else:
print(i)
division([8, 12, 40]) |
p02660 | s802820599 | Accepted | n = int(input())
d = 2
ans = 0
while d * d <= n:
if n % d != 0:
d += 1
continue
z = d
while n % z == 0:
n //= z
z *= d
ans += 1
while n % d == 0:
n //= d
if n != 1:
ans += 1
print(ans) |
p02646 | s964732896 | Accepted | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (v - w) * t >= abs(a - b):
print("YES")
else:
print("NO")
|
p02779 | s320335603 | Accepted | import sys
N = int(input())
A = list(map(int,input().split()))
A.sort()
for i in range (0,N-1):
if A[i] == A[i+1]:
print("NO")
sys.exit()
print("YES") |
p03254 | s700531364 | Accepted | N, x = input().split(' ')
N = int(N)
x = int(x)
a = input().split(' ')
a = [int(a[i]) for i in range(N)]
a = sorted(a)
count = 0
for i in range(N):
if x - a[i] < 0:
x -= a[i]
break
else:
x -= a[i]
count += 1
if x > 0:
count -= 1
print(count) |
p02787 | s886051812 | Wrong Answer | import numpy as np
h,n=map(int,input().split())
a=np.empty((3,n))
for i in range(n):
aa,bb=map(int,input().split())
a[0,i]=aa
a[1,i]=bb
a[2,i]=aa/bb
a=a[:,np.argsort(a[2,:])[::-1]]
c=0
while h>0:
for i in range(n):
if a[0,i]<h or a[0,i]==a[0].min():
h-=a[0,i]
c+=a[1,i]
break
print(int(c)) |
p02772 | s191956080 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = "APPROVED"
for n in range(N):
if A[n] % 2 == 1:
pass
elif A[n] % 3 == 0:
pass
elif A[n] % 5 == 0:
pass
else:
ans = "DENIED"
break
print(ans) |
p03759 | s709679597 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
a, b, c = map(int, readline().split())
if b - a == c - b:
print("YES")
else:
print("NO")
if __name__ == '__main__':
main()
|
p02646 | s654257049 | Accepted | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A < B:
A += V*T
B += W*T
print("YES" if A >= B else "NO")
else:
A -= V*T
B -= W*T
print("YES" if A <= B else "NO") |
p03456 | s387423072 | Wrong Answer | a,b = input().split()
c = a+b
c = int(c)
for i in range (1,101):
if i**2 == c:
print("Yes")
exit()
print("No") |
p02678 | s983722738 | Accepted | from collections import deque
N, M = map(int, input().split())
AB = [map(int, input().split()) for _ in range(M)]
links = [[] for _ in range(N + 1)]
for a, b in AB:
links[a].append(b)
links[b].append(a)
result = [-1] * (N + 1)
q = deque([1])
while q:
i = q.popleft()
for j in links[i]:
if result[j] == -1:
result[j] = i
q.append(j)
print('Yes')
print('\n'.join(str(i) for i in result[2:])) |
p04030 | s349073876 | Accepted | # -*- coding: utf-8 -*-
s = list(input())
ans = []
for i in s:
if len(ans) > 0 and i == 'B':
ans.pop()
if i == '0':
ans.append('0')
if i == '1':
ans.append('1')
print(''.join(ans))
|
p02556 | s301429183 | Accepted | n=int(input())
ans=[]
a=[]
b=[]
c=[]
d=[]
for i in range(n):
x,y=map(int,input().split())
a.append(x-y)
b.append(x+y)
a=sorted(a)
b=sorted(b)
ans=[a[-1]-a[0],b[-1]-b[0]]
print(max(ans))
|
p03387 | s009902514 | Accepted | A,B,C = sorted(map(int,input().split()))
D = 2*C-A-B
if D%2==0:
print(D//2)
else:
print((D+3)//2) |
p02838 | s247226983 | Accepted | import numpy as np
N = int(input())
A = np.array([int(x) for x in input().split()])
ans=0
for i in range(61):
B = (A >> i) & 1
x = np.count_nonzero(B == 0)
y = N - x
ans += (x*y*(2**i))%(10**9+7)
print(ans%(10**9+7)) |
p02601 | s572935316 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
A, B, C = map(int, input().split())
K = int(input())
for i in range(K):
if A < B:
break
B *= 2
K -= i
for i in range(K):
if B < C:
break
C *= 2
if A < B and B < C:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() |
p02628 | s932345784 | Wrong Answer | prices = []
total_fruits = 0
max_numb = 0
total_fruits, max_numb = input().split(' ')
tmp_prices = input().split(' ')
tmp_prices.sort()
ans = 0
for i in range(int(max_numb)):
ans += int(tmp_prices[i])
print(ans)
|
p02682 | s505369415 | Accepted | a,b,c,k = (int(x) for x in input().split())
import sys
if a >= k:
print(k * 1)
sys.exit()
elif k > a:
if a + b >= k:
print(a * 1)
sys.exit()
elif k > a + b:
print(a * 1 + (k - a - b)* -1)
sys.exit()
|
p02888 | s182931765 | Wrong Answer | n = int( input() )
l = list( map( int, input().split() ) )
l = sorted( l )
cnt = 0
for i in range( len( l ) - 2 ):
for j in range( i + 1, len( l ) - 1 ):
for k in range( j + 1, len( l ) ):
if l[ i ] + l[ j ] <= l[ k ]:
break
else:
print( l[ i ], l[ j ], l[ k ] )
cnt += 1
print( cnt ) |
p02602 | s779231098 | Accepted | N, K = input().split()
N = int(N)
K = int(K)
a = input().split()
A = [int(u) for u in a]
for i in range(0, N):
if i >= K:
if A[i] > A[i - K]:
print("Yes")
else:
print("No")
|
p03485 | s759175456 | Accepted | a, b = map(int, input().split())
print((a + b + 1) // 2)
|
p03852 | s806211457 | Accepted | vowel = 'aeiou'
c = input()
if c in vowel:
print('vowel')
else:
print('consonant') |
p03161 | s615787883 | Wrong Answer | import sys
INF = 1e9 + 5
def solve(n, k, ls):
dp=[10**5 for i in range(n)]
dp[0]=0
for i in range(n):
for j in range(1,k+1):
if (i+j<n):
dp[i+j]=min(dp[i+j],dp[i]+abs(ls[i+j]-ls[i]))
return(dp[n-1])
if __name__ == "__main__":
f = sys.stdin
fo = sys.stdout
n, k = map(int, f.readline().split())
arr = list(map(int, f.readline().split()))
result = solve(n, k, arr)
print(result) |
p02995 | s450077123 | Wrong Answer | a, b ,c ,d = map(int, input().split())
print((b - a) - (b / c - a / c) + (b / d - a / d) - (b / (c * d) - a / (c * d))) |
p03698 | s017695475 | Accepted | S = input()
ls = []
check = True
for i in range(len(S)):
if S[i] in ls:
check = False
break
ls.append(S[i])
print("yes" if check else "no") |
p03524 | s495382191 | Wrong Answer | s=input()
n=len(s)
from collections import Counter
c =Counter(s).values()
zero_flg =0
for i in c:
if i==0:
zero_flg+=1
if zero_flg!=0:
print('NO')
exit(0)
else:
print('YES')
|
p02688 | s356679713 | Accepted | n, k = map(int, input().split())
d = []
A = [A for A in range(1, n+1)]
ans = []
for i in range(k):
d.append(int(input()))
al = list(map(int, input().split()))
for j in range(len(al)):
if not(al[j] in ans):
ans.append(al[j])
print(len(list(set(A)-set(ans))))
|
p03745 | s379853621 | Accepted | n=int(input())
a=list(map(int,input().split()))
f=''
ans=1
for i in range(1,n):
if a[i-1]==a[i]:
continue
if a[i-1] < a[i]:
if f=='>':
ans+=1
f=''
else:
f='<'
else:
if f=='<':
ans+=1
f=''
else:
f='>'
print(ans)
|
p02675 | s284643616 | Accepted | def main():
n = input()
if n[-1] in '24579':
print('hon')
elif n[-1] in '0168':
print('pon')
elif n[-1] in '3':
print('bon')
if __name__ == "__main__":
main() |
p02778 | s645999486 | Accepted | s = input()
print(''.join(['x' for _ in range(len(s))]))
|
p03013 | s043834646 | Wrong Answer | n,m = map(int,input().split())
a = [int(input()) for i in range(m)]
mod = 1000000007
lis = []
if m == 0:
print(0)
exit()
if 1 not in a:
lis.append(1)
if 2 in a:
lis.append(0)
else:
lis.append(2)
elif 1 in a:
lis.append(0)
if 2 in a:
lis.append(0)
else:
lis.append(1)
for i in range(3,n+1):
if i in a:
lis.append(0)
else:
lis.append((lis[i-2] + lis[i-3])%mod)
print(lis[-1]) |
p03680 | s828388581 | Accepted | import sys
N = list(map(int, sys.stdin))
bot = N[1]
for i in range(N[0]):
if bot == 2:
print(i+1)
break
bot = N[bot]
else:
print(-1)
|
p03416 | s219763960 | Wrong Answer | from math import log2
def mi():
return map(int, input().split())
def ii():
return int(input())
def main():
X, Y = mi()
print(int(log2(Y)-log2(X))+1)
if __name__ == '__main__':
main()
|
p02775 | s321502795 | Accepted | n = list(map(int, reversed(list(input()))))
a , b = 0, 9999
for x in n:
a, b = min(a+x, b+x), min(a+10-x+1, b+10-x-1)
print(min(a, b)) |
p03069 | s769030364 | Accepted | n = int(input())
s = input()
res = 1 << 40
num_black = 0
num_white = s.count('.')
for i in range(n):
res = min(res, num_black + num_white)
if s[i] == '.':
num_white -= 1
else:
num_black += 1
res = min(res, num_black + num_white)
print(res) |
p02665 | s324770163 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans, cnt, node = 0, sum(a), 1
for i in range(n + 1):
ans += node
cnt -= a[i]
node = min(cnt, (node - a[i]) * 2)
if node < 0:
print(-1)
break
else:
print(ans)
|
p03795 | s620070546 | Wrong Answer | n = int(input())
print(n*800-n/15*200) |
p02660 | s866224373 | Wrong Answer | def divisor(x):
ret = []
for i in range(1, int(x ** 0.5) + 1):
if x % i == 0:
ret.append(i)
ret.append(x // i)
return list(set(ret))
n = int(input())
div = divisor(n)[1:]
ans=0
for i in div:
if n % i == 0:
ans += 1
n //= i
print(ans) |
p02699 | s316726136 | Accepted | s, w = list(map(int, input().split()))
if s > w:
print("safe")
else:
print("unsafe") |
p03448 | s366391901 | 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 f in range(c+1):
if i*500 + j*100 + f*50 == x:
ans +=1
print(ans) |
p02631 | s871503608 | Wrong Answer | #N = int(input())
a = list(map(int,input().split()))
#xor_a = [bin(x) for x in a]
#print(xor_a)
#sum_xor = bin(sum(a))
b = [sum(a) ^ a[x] for x in range(len(a))]
print(b) |
p03261 | s770874652 | Accepted | n = int(input())
L = []
last_letter = 0
for i in range(n):
w = str(input())
L.append(w)
if (i != 0 and w[0] != last_letter) or L.count(w) != 1:
print('No')
exit()
last_letter = w[-1]
print('Yes')
|
p03380 | s171811826 | Accepted | from bisect import bisect_left
N = int(input())
a = list(map(int,input().split()))
a.sort()
x = a[-1]
i = bisect_left(a, x/2, hi=N-2)
for j in [i-1, i, i+1]:
if 0 <= j < N and abs(a[j]-x/2) < abs(a[i]-x/2):
i = j
print(x, a[i]) |
p03073 | s009682921 | Wrong Answer | # input
S = list(input())
# check
length = len(S)
if len == 1:
print(0)
else:
bwb = ["0", "1"]
wbw = ["1", "0"]
cnt = [0] * 2
for i in range(length):
if S[i] == bwb[i % 2]:
cnt[0] += 1
if S[i] == wbw[i % 2]:
cnt[1] += 1
print(min([cnt])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.