problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03221 | s731231698 | Accepted |
from bisect import bisect_right
import sys
readline = sys.stdin.readline
n, m = map(int, readline().split())
ken = [list() for _ in range(n)]
PY = []
for _ in range(m):
p, y = map(int, readline().split())
PY.append((p, y))
ken[p-1].append(y)
for i in range(n):
ken[i].sort()
for p, y in PY:
print(str(p).zfill(6) + str(bisect_right(ken[p-1],y)).zfill(6))
|
p03627 | s212847805 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
import collections
c=collections.Counter(a)
t=list(c.items())
t.sort(reverse=True)
if t[0][1]>=4:
print(t[0][0]**2)
elif t[1][1]>=2:
print(t[0][0]*t[1][0])
else:
print(0) |
p03323 | s091060694 | Wrong Answer | a,b = map(int,(input().split()))
if a + b > 16 or (a > 9 or b > 9):
print(":( ")
else:
print("Yay!") |
p03038 | s198089065 | Accepted | n,m = map(int,input().split())
a = list(map(int,input().split()))
x = []
for i in range(m):
x.append(list(map(int,input().split())))
x = sorted(x, key=lambda s:s[1], reverse=True)
y = []
for i in range(m):
b,c = x[i][0],x[i][1]
y += [c]*b
if len(y) >= n:
break
z = a+y
print(sum(sorted(z,reverse=True)[:n])) |
p03592 | s033537792 | Wrong Answer | N,M,K = map(int, input().split())
for n in range(N+1):
for m in range(M+1):
if M*(N-n) + N*(M-m) == K:
print('Yes')
exit()
else:
print('No') |
p03760 | s755267511 | Accepted | o = input()
e = input()
for i in range(len(e)):
print(o[i], end = '')
print(e[i], end = '')
if len(o) != len(e):
print(o[len(o)-1]) |
p03359 | s821101039 | Accepted | a,b = map(int,input().split())
if a > b:
print(a-1)
else:
print(a) |
p03545 | s254193562 | Wrong Answer | n=[int(x) for x in input()]
for i in range((len(n)-1)**2):
result=n[0]
a=["-"]*len(n)
for j in range(len(n)-1):
if (i>>j &1)==1:
result+=n[1]
a[j]="+"
else:
result-=0
if result==7:
print(n[0],a[0],n[1],a[1],n[2],a[2],n[3],"=7")
break |
p02935 | s984413295 | Accepted | #なるべく小さいものから合成した方が良い
from functools import reduce
n = int(input())
v = sorted(list(map(int, input().split())))
def flat(x,y):
return (x+y)/2
print(reduce(flat, v)) |
p02572 | s699158245 | Wrong Answer | N=int(input())
A=list(map(int, input().split()))
p=10**9+7
S=sum(A)
S2=S**2
T=0
for i in range(N):
T+=A[i]**2
ans=((S2-T)//2)%p
print(ans,S2) |
p03814 | s598568361 | Accepted | from sys import stdin
s = stdin.readline().rstrip()
pos_a = s.find('A')
pos_z = s.rfind('Z')
print(pos_z - pos_a + 1)
|
p02555 | s924653173 | Accepted | N = int(input())
if N <= 5:
print(N//3)
exit()
A = [1,1,1]
for i in range(N - 5):
A += A[i] + A[i+2],
print(A.pop()%(10**9+7)) |
p03241 | s970082122 | Wrong Answer | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N, M = map(int, input().split())
i = 1
ans = 0
while i * i <= M:
if M % i == 0 and M // i >= N:
ans = max(ans, i)
if M % i == 0 and M // (M // i) >= N:
ans = max(ans, i)
i += 1
print(ans)
|
p03827 | s551204244 | Accepted | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
n = int(input())
s = input()
x = 0
ans = 0
for i in range(n):
if (s[i] == "I"):
x += 1
else:
x -= 1
ans = max(ans, x)
print(ans)
|
p02695 | s752445724 | Accepted | import itertools
N, M, Q = map(int, input().split())
query = []
for i in range(Q):
query.append(list(map(int, input().split())))
As = list(itertools.combinations_with_replacement(range(1, M+1), N))
ans = 0
for a in As:
point = 0
for q in query:
if a[q[1]-1] - a[q[0]-1] == q[2]:
#print(a, " + ", q)
point += q[3]
ans = max(ans, point)
#print(point)
#print(As)
#print(query)
print(ans) |
p03994 | s022207417 | Accepted | s = [ord(alph)-97 for alph in input()]
K = int(input())
i = 0
while K > 0 and i < len(s)-1:
if s[i] != 0 and 26-s[i] <= K:
K -= 26-s[i]
s[i] = 0
else:
i += 1
s[-1] = (s[-1]+K)%26
print(*[chr(x+97) for x in s], sep = '') |
p02911 | s557736099 | Accepted | import sys
readline = sys.stdin.buffer.readline
N, K, Q = list(map(int, readline().split()))
A = []
for a in range(Q):
A.append(int(readline()))
points = [0] * N
for i in range(Q):
points[A[i] - 1] += 1
for p in points:
score = K - Q + p
print("Yes" if score > 0 else "No") |
p03043 | s003188970 | Accepted | N, K = map(int, input().split())
ans = 0
for tmp in range(1, N+1):
i = 0
while tmp < K:
tmp *= 2
i += 1
ans += (1/N)*(0.5**i)
print(ans)
|
p03632 | s918820044 | Wrong Answer | a, b, c, d = map(int, input().split())
if b < c :
print(0)
exit()
if a == 0 and b > c and b < d:
print(b - c)
exit()
if a < c and d < b:
print(d - c)
exit()
if a == c :
print(b - a)
exit()
|
p02833 | s807125476 | Wrong Answer | n = int(input())
result = 0
if n % 2 == 0:
n = n // 2
a = 5
while (n // a) > 0:
result += n // a
a *= 5
result += n // a
print(result) |
p02661 | s662151615 | Accepted | n = int(input())
A = [0]*n
B = [0]*n
for i in range(n):
A[i],B[i]=map(int,input().split())
A.sort()
B.sort()
def median(li):
if n%2==1:
return li[n//2]
else:
return sum(li[n//2-1:n//2+1])
print(median(B)-median(A)+1) |
p02578 | s583801960 | Wrong Answer | total = int(input())
tall = list(map(int, input().split()))
dif = 0
for i in range(total - 1):
if tall[i+1] > tall[i]:
var = tall[i+1] - tall[i]
tall[i] += var
dif += var
else:
pass
print(dif)
|
p02772 | s020000288 | Wrong Answer | time=int(input())
nums=[int(i) for i in input().split()]
odd=0
even=0
even35=0
for j in range(time):
if nums[j]%2==0:
even+=1
if nums[j]%3!=0 and nums[j]%5!=0:
continue
else:
even35+=1
else:
odd+=1
if even35==even==0:
print("DENIED")
elif even35==even:
print("APPROVED")
else:
print("DENIED")
|
p02712 | s823811086 | Accepted | N = int(input())
ans = 0
for i in range(1, N+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans) |
p02996 | s271584275 | Wrong Answer | n = int(raw_input())
es = [map(int, raw_input().split(' ')) for _ in range(n)]
es.sort(key = lambda x:x[1])
res = []
t = 0
while(es):
delta = abs(t - es[0][1])
bag = []
for j in range(len(es)):
if es[j][0] <= delta:
#duration, deadline
bag.append([es[j][1], es[j][0],j])
if bag:
a,b,i = min(bag)
res.append([b])
t += a
es = es[:i] + es[i+1:]
es.sort(key = lambda x:x[1])
else:
break
print 'Yes' if not(es) else 'No' |
p03705 | s657899817 | Accepted | n, a, b = map(int, input().split())
M = b*(n-1)+a
m = b+a*(n-1)
print(max(M-m+1, 0))
|
p02678 | s572805136 | Accepted | import networkx as nx
n,m=map(int,input().split())
s=[list(map(int,input().split())) for i in range(m)]
g=nx.Graph()
g.add_nodes_from([i for i in range(1,n+1)])
for x in s:
g.add_edge(x[0],x[1])
di=nx.predecessor(g,source=1)
if len(di)!=n:
print("No")
exit()
print("Yes")
for x in range(2,n+1):
print(di[x][0]) |
p02627 | s704371661 | Accepted | a=input()
if a.isupper():
print("A")
else:
print("a") |
p03469 | s754119141 | Wrong Answer | import sys
S = input()
if len(S) != 10:
sys.exit()
if S[0:8] != '2017/01/':
sys.exit()
if 1 <= int(S[-2]) <= 31:
sys.exit()
print(S.replace('2017','2018'))
|
p03137 | s326576689 | Wrong Answer | n, m = map(int, input().split())
xx = sorted(list(map(int, input().split())))
yy = [abs(xx[i]-xx[i+1]) for i in range(m-1)]
sy = sorted(yy)
print(sum(sy[:-n+1])) |
p02873 | s427890010 | Accepted | s = input()
d = [[0]*2 for _ in range(len(s)+1)]
count_r = 0
count_l = 0
ans = 0
for i in range(len(s)):
if s[i] == "<":
d[i+1][0] = d[i][0]+1
else:
d[i+1][0] = 0
for i in range(len(s)-1, -1, -1):
if s[i] == ">":
d[i][1] = d[i+1][1]+1
else:
d[i][1] = 0
for i in range(len(s)+1):
ans += max(d[i])
print(ans) |
p02742 | s345969649 | Accepted | h,w=map(int,input().split())
if h==1 or w==1:
print(1)
else:
print((h*w)//2+(h*w)%2) |
p03386 | s219925946 | Accepted | a,b,k=map(int,input().split())
num=set([])
for i in range(a,min(a+k,b+1)):
num.add(i)
for j in range(max(a,b-k+1),b+1):
num.add(j)
for ans in sorted(list(num)):
print(ans) |
p02678 | s489352578 | Accepted | from collections import deque
n, m = map(int, input().split())
g = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
g[a-1].append(b-1)
g[b-1].append(a-1)
q = deque([0])
pre = [-1 for _ in range(n)]
while q:
v = q.popleft()
for t in g[v]:
if pre[t] == -1:
pre[t] = v
q.append(t)
print('Yes')
for i in range(1, n):
print(pre[i]+1) |
p02729 | s657365658 | Wrong Answer | N, M = map(int, input().split())
print(N*(N-1)+M*(M-1)) |
p02572 | s261519811 | Wrong Answer | mod=(10**9)+7
n=int(input())
a=list(map(int,input().strip().split(' ')))
s=0
for x in a:
s= (s+x)%mod
s=(s**2)%mod
t=0
for x in a:
t= (t+ x**2)%mod
ans=((((s-t)%mod+mod)%mod)//2)
print(ans%mod)
|
p03150 | s749933532 | Accepted | s = input()
l = len(s) - 7
print("YES" if any(s[:i] + s[i+l:] == "keyence" for i in range(8)) else "NO") |
p03030 | s363566295 | Wrong Answer | N = int(input())
lst = list()
for i in range(1, N+1):
s, p = input().split()
lst.append({"id":i, "s":s, "p":p})
lst.sort(key=lambda x:x["p"], reverse=True)
lst.sort(key=lambda x:x["s"])
for i in range(0, len(lst)):
print(lst[i]["id"]) |
p02754 | s711818358 | Wrong Answer | if __name__ == '__main__':
(n, a, b) = [int(e) for e in input().split()]
ans = (int(n/(a+b)))*a
if n%(a+b) == 0:
print(ans)
elif n%(a+b) > a:
print(ans + a)
else:
print(ans + a - n%(a+b) - 1)
|
p03329 | s198757958 | Wrong Answer | NUM=[59049, 46656, 7776, 6561, 1296, 729, 216, 81, 36, 9, 6, 1]
N = int(input())
count=0
for val in NUM:
if N>=val:
#print(val, N//val)
count+=N//val
N=N%val
print(count)
|
p02861 | s775570819 | Accepted | n = int(input())
xy = []
for _ in range(n):
xy.append([int(x) for x in input().split()])
dis = 0
for x1, y1 in xy:
for x2, y2 in xy:
#print(x1,y1,x2,y2)
dis += ((x1 - x2)**2 + (y1 - y2)**2)**0.5
print(dis/n) |
p02924 | s994615498 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def solve(inp):
N = int(inp.readline().strip())
r = 0
for i in range(N - 1):
r += (i + 1)
return r
def main():
import sys
result = solve(sys.stdin)
if result:
print(result)
if __name__ == '__main__':
main()
|
p03994 | s359046490 | Accepted | A = {i-97:chr(i) for i in range(97,123)}
B = {v:k for k,v in A.items()}
s = list(input().strip())
K = int(input())
for i in range(len(s)-1):
if s[i]!="a" and K>=26-B[s[i]]:
K -= (26-B[s[i]])
s[i]="a"
k = K%26
ind = (B[s[-1]]+k)%26
s[-1] = A[ind]
print("".join(s)) |
p02792 | s625861518 | Wrong Answer | n = int(input())
cou = 0
for i in range(1,n+1):
i = str(i)
if i[0]!="0" and i[-1]!="0":
if int(i[0])>int(i[-1]):
cou += (9**(len(i)-1)-1)//8
elif int(i[0])<int(i[-1]):
cou += (9**(len(i)-2)-1)//8
#print(i,cou)
cou *= 2
l = [0 for i in range(9)]
for i in range(1,n+1):
i = str(i)
if i[0]==i[-1]:
l[int(i[0])-1] += 1
l1 = [i*i for i in l]
print(sum(l1)+cou) |
p03605 | s336711533 | Accepted | def resolve():
n=input()
if '9' in n:
print('Yes')
else:
print('No')
resolve() |
p02899 | s295589646 | Accepted | n = int(input())
a = list(map(int, input().split()))
roster = {}
for i in range(n):
roster[a[i]] = i+1
ans = ""
for i in range(1, n+1):
ans += str(roster[i]) + " "
print(ans.rstrip())
|
p02594 | s863726560 | Wrong Answer | print("Yes" if int(input())<=30 else "No") |
p03835 | s048823331 | Wrong Answer | K,S=map(int,input().split())
ans=0
t=S//3
for x in range(K+1):
if 0<=S-x and S-x<=2*K:
ans+=1
print(ans*(ans+1)//2) |
p03449 | s932466449 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
if n==1:
print(a[0]+b[0])
quit()
for i in range(n):
if ans<sum(a[:i])+sum(b[i:])+b[i-1]:
ans=sum(a[:i])+sum(b[i:])+b[i-1]
print(ans) |
p03017 | s658846803 | Wrong Answer | from itertools import groupby
n, a, b, c, d = map(int, input().split())
s = input()
g = groupby(s[a:c])
h = groupby(s[b:d])
for i, j in g:
if i == "#" and len(list(j)) > 1:
print("No")
exit()
for i, j in h:
if i == "#" and len(list(j)) > 1:
print("No")
exit()
if c < d:
print("Yes")
exit()
e = groupby(s[b:d])
for i, j in e:
if i == "." and len(list(j)) > 2:
print("Yes")
exit()
print("No") |
p03345 | s021124397 | Accepted | A,B,C,k = map(int,input().split())
s1 = A-B
s2 = B-A
if k%2 == 0:
print(s1)
elif k%2 == 1:
print(s2)
|
p03457 | s538733056 | Accepted | n=int(input())
txy=[]
txy.append([0,0,0])
for _ in range(n):
txy.append(list(map(int,input().split())))
ans = 'Yes'
for i in range(1,len(txy)):
t_=txy[i][0]-txy[i-1][0]
d_=abs(txy[i][1]-txy[i-1][1])+abs(txy[i][2]-txy[i-1][2])
if t_ >= d_ and (t_ - d_) % 2 == 0:
pass
else:
ans='No'
break
print(ans)
|
p03038 | s234548187 | Accepted | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
from collections import Counter
D = dict(Counter(A))
for i in range(M):
B,C = list(map(int,input().split()))
D[C]=D.get(C,0)+B
K = sorted(list(D.keys()),reverse=True)
out = 0
cnt = 0
now = 0
while cnt<=N-1:
if D[K[now]]>0:
out += K[now]
D[K[now]] += -1
cnt+=1
else:
now+=1
print(out) |
p03328 | s062348729 | Wrong Answer | a,b=map(int,input().split())
n=999
l=[1]*n
for i in range(1,n):
l[i]=l[i-1]+(i+1)
for j in range(n):
if l[j-1]<=a<=l[j]:
print(l[j]-a)
break |
p02742 | s745704857 | Accepted | H,W = map(int,input().split())
if H==1 or W==1:
print(1)
else:
print((H*W+1)//2) |
p03605 | s930662976 | Wrong Answer | s = input()
if s[0] != 9 and s[1] != 9:
print('No')
else:
print('Yes') |
p03286 | s855619611 | Wrong Answer | n = int(input())
ans = ""
while n != 0:
rest = n % 2
if rest == 1:
ans += "1"
else:
ans += "0"
n = (n - rest) // -2
if ans == "":
ans += "0"
print(reversed(ans)) |
p03433 | s253994982 | Accepted | if (int(input())%500)<=int(input()):
print('Yes')
else:
print('No') |
p02711 | s341038136 | Accepted | data = input()
if data.find("7") != -1:
print("Yes")
else:
print("No") |
p03719 | s213348318 | Accepted | A,B,C = map(int, input().split())
print('No' if C < A or B < C else 'Yes') |
p02780 | s372804261 | Accepted |
n,k=map(int,input().split())
p=list(map(int,input().split()))
rui=[]
rui.append(p[0]/2+0.5)
for i in range(1,n):
rui.append(rui[i-1]+(p[i]/2+0.5))
#print(rui)
ans=[]
ans.append(rui[k-1])
for i in range(n-k):
ans.append(rui[k+i]-rui[i])
#print(ans)
print(max(ans)) |
p02882 | s687246675 | Accepted | from math import atan,degrees
a,b,x = map(int,input().split())
if x >= a**2*b/2:
print(degrees(atan(2*(a**2*b-x)/a**3) ))
elif x < a**2*b/2:
print(degrees(atan(b**2*a/(2*x))))
|
p03289 | s443459280 | Accepted | s=input()
x=0
if s[0]=="A" and s[1]!="C" and s[-1]!="C":
for i in range(len(s)):
if s.count("C")==1:
if s[i].isupper():
x+=1
else:
print("WA")
exit()
if x==2:
print("AC")
else:
print("WA")
else:
print("WA") |
p02642 | s323408788 | Accepted | def abc170_d():
N = int(input())
A = list(map(int, input().split()))
A.sort()
Amax = A[-1]
check = [False] * (Amax + 1)
ans = 0
for i in range(N):
if check[A[i]]: continue
if not(i < N-1 and A[i] == A[i+1]): ans += 1
k = 1
while k*A[i] <= Amax:
check[k*A[i]] = True
k += 1
print(ans)
abc170_d() |
p02814 | s054507269 | Accepted | N, M = map(int, input().split())
A = set(i//2 for i in map(int, input().split()))
B = []
for i in A:
B = B + [0]
while i % 2 == 0:
i //= 2
B[-1] += 1
if len(set(B)) == 1:
m = max(A)
A.remove(m)
base = 0
for i in range(m,M+1,2*m):
semi = True
for j in A:
if i % j != 0 or (i // j) % 2 == 0:
semi = False
break
if semi:
base = i
break
if base == 0:
print(0)
else:
print(((M // base) + 1)//2)
else:
print(0) |
p02756 | s344170688 | Wrong Answer | S = input()
Q = int(input())
rev = 0
for _ in range(Q):
TFC = input()
if len(TFC) == 1: # T == 1
rev ^= 1
else:
T, F, C = (i for i in TFC.split())
if F == '1' and rev:
S = S + C
else:
S = C + S
if rev:
print(S[::-1])
else:
print(S) |
p02618 | s767267640 | Wrong Answer | d=int(input())
c=list(map(int,input().split()))
d=0
f=0
for i in range(26):
g=sum(list(map(int,input().split())))
if g>d:
d=g;f=i
for i in range(d):print(f) |
p02639 | s593590368 | Wrong Answer | A=list(map(int,input().split()))
for i in range(4):
if A[i]==0:
print(i+1)
|
p02819 | s675744090 | Accepted | x=int(input())
while True:
i=2
flag=True
while i*i<=x:
if x%i==0:
flag=False
break
i+=1
if flag:
print(x)
break
x+=1 |
p03427 | s074197765 | Accepted | n = list(input())
s = 0
for a in n:
s += int(a)
if len(n) >= 2:
if int(n[0]) >= 2:
print(max(s, (len(n)-1)*9+int(n[0])-1))
else:
print(max(s, (len(n)-1)*9))
else:
print(int(n[0])) |
p03013 | s377174572 | Wrong Answer | #!/usr/bin/env python3
n, m = map(int, input().split())
a = [int(input()) for _ in range(m)]
f = lambda j: j not in a
mod = 10**9+7
dp = [0] * -~n
dp[0] = 1
dp[1] = f(1)
for i in range(2, -~n):
dp[i] += (dp[i - 1] + dp[i - 2]) * f(i) % mod
print(dp[n]) |
p02613 | s895919293 | Accepted | n = int(input());
s = [input() for i in range(n)]
ac = wa = tle = re = 0
for s_kind in s:
if s_kind == "AC":
ac += 1
elif s_kind == "WA":
wa += 1
elif s_kind == "TLE":
tle += 1
elif s_kind == "RE":
re += 1
print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re) |
p02623 | s614050269 | Accepted | from sys import stdin
input = lambda: stdin.readline().rstrip("\r\n")
from collections import defaultdict as vector, deque as que
read = lambda: list(map(int,input().split()))
from bisect import bisect
from heapq import heappush as hpush,heappop as hpop
n,m,k=read()
A=read()
B=read()
a,b=[0],[0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
ans=0;j=m
for i in range(0,n+1):
curr=a[i]
if curr>k:
break
while(b[j]>k-curr):
j-=1
ans=max(ans,i+j)
print(ans)
|
p03317 | s890156711 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
N=N-1
K=K-1
if N==K:
print(1)
exit()
if N%K==0:
print(N//K)
else:
print(N//K+1) |
p03262 | s824931867 | Wrong Answer | import math
N,X=map(int,input().split())
x=[abs(i-X) for i in list(map(int,input().split()))]
print(min(x)) |
p02993 | s487506126 | Accepted | s = input()
print("Good" if s[0] != s[1] and s[1] != s[2] and s[2] != s[3] else "Bad") |
p03761 | s582026865 | Accepted | N = int(input())
s = [input() for i in range(N)]
alpha = "abcdefghijklmnopqrstuvwxyz"
ans = ''
for i in alpha:
min_ = float('Inf')
for sj in s:
cnt = 0
for elem in sj:
if elem == i:
cnt += 1
min_ = min(min_, cnt)
ans += i * min_
print(ans) |
p03778 | s874061330 | Accepted | W,a,b = map(int, input().split())
if a+W <= b :
print(b-(a+W))
elif b+W<= a :
print(a-(b+W))
else :
print( 0)
|
p02548 | s706610082 | Wrong Answer | N = int(input())
NR = int(N**0.5)
count = 0
for i in range(1,int(N/2)):
if int(N/i)-N/i == 0:
count += int(N/i)-1
else:
count += int(N/i)
count += int(N/2)
print(count) |
p02554 | s692219055 | Wrong Answer | n=int(input(''))
A=10**9+7
if n==1:
print(0)
elif n==2:
print(2)
elif n>=3:
e=1
for i in range(n):
e=e*10
if e>=A:
e=e%A
d=1
for i in range(n):
d=d*8
if e>=A:
e=e%A
r=e-d
if r<A:
r=r+A
print((r)%(10**9+7))
|
p03644 | s074993643 | Wrong Answer | N = int(input())
res = 1
max = 1
for i in range(1, N+1):
cnt = 0
n = i
while True:
if n%2 != 0:
break
else:
n = n//2
cnt += 1
if cnt > max:
res = i
max = cnt
print(res) |
p02717 | s993440654 | Accepted | x, y, z = map(int, input().split())
x, y = y, x
x, z = z, x
print(x, y, z) |
p03799 | s494120105 | Wrong Answer | n,m=map(int,input().split())
print((m//2+n)//2) |
p02923 | s493651830 | Wrong Answer | N = int(input())
H = list(map(int,input().split()))
length = [0]
i = 0
while i != N-1:
if H[i+1] <= H[i]:
i += 1
else:
length.append(i+1)
i += 1
length.append(N-1)
res = 0
for j in range(len(length)-1):
res = max(res,length[j+1]-length[j])
print(res) |
p03162 | s851965046 | Accepted | import sys
import numpy as np
n = int(input())
dp = list(map(int, sys.stdin.readline().split()))
for i in range(n-1):
a, b, c = list(map(int, sys.stdin.readline().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)) |
p03071 | s390936158 | Accepted | a,b = map(int,input().split())
if a == b:
print(a+b)
elif a > b:
print(a+(a-1))
else:
print(b+(b-1)) |
p03407 | s925698092 | Accepted | a,b,c = map(int, input().split())
d = a + b
if d >= c:
print("Yes")
else:
print("No") |
p02756 | s536186832 | Wrong Answer | print(1) |
p02594 | s721351659 | Wrong Answer | temp=int(input())
if(temp<=30):
print("Yes")
else:
print("No") |
p02760 | s237652751 | Wrong Answer | import itertools
a = []
cnt_list = []
for _ in range(3):
a += map(int, input().split())
n = int(input())
for _ in range(n):
b = int(input())
for i, j in enumerate(a):
if b == j:
cnt_list.append(i)
ans = 'No'
if len(cnt_list) > 2:
cnt_list = set(cnt_list)
for k in list(itertools.permutations(cnt_list, 3)):
if sum(k) % 3 == 0:
ans = 'Yes'
print(ans) |
p02627 | s707972887 | Accepted | α=input()
if α.isupper()==True:
print('A')
else:
print('a') |
p03145 | s821295521 | Accepted | ab, bc, ca = map(int, input().split())
print(int(ab*bc/2)) |
p03814 | s018126642 | Wrong Answer | S = input()
f=0
l=0
for i in range(len(S)):
if(S[i] =="A"):
f = i+1
for j in range(len(S)-1,0,-1):
if(S[j] == "Z"):
l = j+1
print(l-f+1) |
p03160 | s729870130 | Accepted | import sys
sys.setrecursionlimit(200000) #追加
S = [-1]*(101010)
def opt_S(h,n):
if(n == 0):return 0
elif(n == 1):return abs(h[1]-h[0])
else :
if(S[n] != -1):return S[n]
s1 = opt_S(h,n-1) + abs(h[n-1]-h[n])
s2 = opt_S(h,n-2) + abs(h[n-2]-h[n])
S[n] = min(s1,s2)
return S[n]
N = int(input())
h = list(map(int,input().split()))
print(opt_S(h,N-1))
|
p02712 | s250707346 | Accepted | #!/usr/bin/env python3
import sys
def solve(N: int):
answer = 0
for i in range(1,N+1):
if i%3 == 0 or i%5 == 0:
continue
else:
answer += i
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
solve(N)
if __name__ == '__main__':
main()
|
p02820 | s371397775 | Wrong Answer | n,k = map(int,input().split())
r,s,p = map(int,input().split())
t = input()
score = {'r':p, 's':r, 'p':s}
from collections import deque
past = deque([])
ans = 0
for i in range(n):
past.append(t[i])
if i < k:
ans += score[t[i]]
else:
if past.popleft() != t[i]:
ans += score[t[i]]
print(ans)
|
p02797 | s012066516 | Wrong Answer | n, k, s = map(int, input().split())
A = [s+1]*n
for i in range(k):
A[i] = s
print(*A) |
p02832 | s412348631 | Accepted | N = int(input())
a = list(map(int, input().split()))
now = 1
for ai in a:
if ai == now:
now += 1
if now == 1:
print(-1)
else:
print(N - now + 1)
|
p03380 | s568313275 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A.sort()
n = A.pop()
A.sort(key=lambda a: abs(a - n // 2))
r = A[0]
print(n, r)
|
p03281 | s858608429 | Accepted | N= int(input())
if N%2==0:
cand = list(range(1,N,2))
else:
cand = list(range(1,N+1,2))
ans = 0
num = 0
for n in range(1,N+1):
num = 0
for c in cand:
if n%c==0:
num+=1
if num ==8:
ans+=1
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.