problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02596 | s067673313 | Wrong Answer | k = int(input())
t = 7
t %= k
for i in range(1, k):
if t == 0:
print(i)
exit()
t = (t * 10 + 7) % k
print(-1) |
p02787 | s252282176 | Accepted | import numpy as np
h, N = map(int,input().split())
VW = [[int(x) for x in input().split()] for _ in range(N)]
VW = np.array(sorted(VW, key=lambda x:(x[0]/x[1],x[0])))
a = VW[:, 0]
b = VW[:, 1]
dp = np.zeros(10**4+1, dtype=np.int)
for i in range(1, h+1):
dp[i] = (dp[i-a]+b).min()
print(dp[h])
|
p02933 | s030717590 | Accepted | a=int(input())
s=input()
if a>=3200:
print(s)
else:
print("red") |
p03624 | s703509525 | Accepted | S = list(input())
C = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
S.sort()
set(S)
for c in C:
if c in(S):
if c == "z":
print('None')
continue
else:
print(c)
break |
p02900 | s863359957 | Accepted | import math
A,B=map(int,input().split())
X=math.sqrt(min(A,B))
L=[]
for i in range(1,int(X)+1):
if A%i==0:
L.append(i)
L.append(A//i)
L=set(L)
L=sorted(L)
S=[]
for i in L:
if B%i==0:
S.append(i)
ans=1
for i in S:
if i==1:continue
count=0
for j in range(2,int(math.sqrt(i))+1):
if i%j==0:
count+=1
break
if count==0:
ans+=1
print(ans) |
p03719 | s645653528 | Wrong Answer | a = [int(i) for i in input().split()]
b = a[2]
a.sort()
if b == a[1]:
print("Yes")
else:
print("No") |
p03760 | s851545896 | Accepted | import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
import collections
def main():
O = input()
E = input()
ans = ''
for i in range(len(O)):
ans += O[i]
if i < len(E):
ans += E[i]
print(ans)
if __name__ == '__main__':
main()
|
p02760 | s900122188 | Accepted | a11, a12, a13 = map(int, input().split())
a21, a22, a23 = map(int, input().split())
a31, a32, a33 = map(int, input().split())
n = int(input())
b = []
for i in range(n):
b.append(int(input()))
ans = [[a11, a12, a13], [a21, a22, a23], [a31, a32, a33],
[a11, a21, a31], [a12, a22, a32], [a13, a23, a33],
[a11, a22, a33], [a13, a22, a31]]
for a in ans:
if (a[0] in b) and (a[1] in b) and (a[2] in b):
print("Yes")
exit()
print("No")
|
p04029 | s050130093 | Accepted | a = int(input())
print(a * (a + 1) / 2) |
p02631 | s388595332 | Accepted | n = int(input())
a = list(map(int,input().split()))
t=0
for i in a:
t = t ^ i
ans = []
for i in a:
ans.append(t ^ i)
print(" ".join(str(i) for i in ans)) |
p02760 | s348111301 | Wrong Answer | lis = []
for i in range(3):
a= list(map(int,input().split()))
lis.append(a)
n = int(input())
for j in range(n):
b = int(input())
for li in lis:
if b in li:
li[li.index(b)]=0
for k in range(3):
if sum(lis[k][:])==0:
print('Yes')
exit(0)
for k in range(3):
if sum(lis[:][k])==0:
print('Yes')
exit(0)
if (lis[0][0]+lis[1][1]+lis[2][2]==0)or(lis[2][0]+lis[1][1]+lis[0][2]==0):
print('Yes')
exit(0)
print('No') |
p03086 | s102618690 | Accepted | S = input()
ACGT = ["A", "C", "G", "T"]
s = ""
l = []
for i in S:
if i in ACGT:
s += i
l.append(s)
else:
l.append(s)
s = ""
l2 = map(len, l)
print(max(l2)) |
p02595 | s732576764 | Wrong Answer | n, d = map(int, input().split())
res = 0
for i in range(n):
x, y = map(int, input().split())
if x ** 2 + y ** 2 <= d:
res += 1
print(res) |
p02994 | s671190733 | Wrong Answer | n,l=map(int, input().split())
t=0
c=0
for i in range(n):
if i==0:
t=abs(l+(i+1)-1)
c=0
else:
t=min(t, abs(l+(i+1)-1))
if t==abs(l+(i+1)-1):
c=i+1
g=0
for i in range(n):
g+=(l+(i+1)-1)
print(g-l-c)
|
p03449 | s303489034 | Accepted | N = int(input())
A_1 = list(map(int, input().split()))
A_2 = list(map(int, input().split()))
ans = 0
for i in range(N):
S = sum(A_1[0:i+1]) + sum(A_2[i:N])
if S > ans:
ans = S
print(ans) |
p02882 | s094357136 | Accepted | import math
a, b, x = map(int, input().split(" "))
cap = a * a * b
h = (x / cap) * b
if h / b >= 0.5:
gap = b - h
print(math.degrees(math.atan((gap / (a / 2)))))
else:
vol = h * a
gap = (vol / b) * 2
print(math.degrees(math.atan(b / gap))) |
p03481 | s283427142 | Wrong Answer | x,y=map(int,input().split())
count=1
while x*2<y:
count+=1
x*=2
print(count) |
p02697 | s567379100 | Accepted | def main():
n,m=map(int,input().split())
if n%2==1:
x=[f"{i+1} {n-i}" for i in range(m)]
print(" ".join(x))
else:
x=[f"{i+1} {n-i}" if i<m/2 else f"{i+1} {n-i-1}" for i in range(m)]
print(" ".join(x))
if __name__ == "__main__":
main() |
p02690 | s248752633 | Wrong Answer | X = int(input())
A = 0
B = 0
answer = 0
while answer != X:
answer = A ** 5 - B ** 5
if answer < X:
A += 1
if answer > X:
B -= 1
A -= 1
print(A,B,answer)
|
p02842 | s193268978 | Accepted | import sys
import math
def S(): return sys.stdin.readline().rstrip()
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())
N = I()
flag = 0
for i in range(1,N+1):
if math.floor(i*1.08) == N:
print(i)
flag = 1
break
if flag == 0:
print(":(")
|
p03745 | s791129038 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 1
up = down = False
for i in range(n-1):
if a[i] < a[i+1]:
if up:continue
up = True
if down:
ans+=1
up = down = False
elif a[i] > a[i+1]:
if down:continue
down = True
if up:
ans+=1
up = down = False
print(ans) |
p02691 | s846450579 | Accepted | #coding:utf-8
n = int(input())
a = input().split()
count = 0
r = [(n - int(m)) for n,m in enumerate(a)]
l = [(n + int(m)) for n,m in enumerate(a)]
r.remove(r[0])
l.remove(l[-1])
mar = max(r)
mir = min(r)
mal = max(l)
mil = min(l)
R = {}
L = {}
for n,m in zip(r,l):
R[n] = 0
L[m] = 0
for n,m in zip(r,l):
R[n] += 1
L[m] += 1
for i in R.keys():
if i in L.keys():
count += R[i] * L[i]
print("{}".format(count)) |
p02547 | s221781361 | Wrong Answer | Count = 0
Array = []
for i in range(int(input())):
Dice_1, Dice_2 = map(int, input().split())
if Dice_1 == Dice_2:
Array.append(1)
else:
Array.append(0)
ans = []
j_1 = 0
for j in range(len(Array)):
if j_1 == 1 and Array[j] == 1:
Count = Count + 1
else:
Count = 0
j_1 = Array[j]
print(Count)
ans.append(Count)
print(max(ans))
if max(ans) >= 2:
print('Yes')
else:
print('No') |
p02820 | s744584558 | Wrong Answer | N, K = map(int, input().split())
R, S, P = list(map(int, input().split()))
T = list(input())
result = [0] * N
for i,t in enumerate(T):
if t == "r":
result[i] = P
elif t == "s":
result[i] = R
else:
result[i] = S
if N<K:
print(sum(result))
exit()
for i in range(K, N):
if result[i] == result[i-K]:
result[i] = 0
print(sum(result)) |
p02823 | s767071894 | Accepted | n, a, b = map(int,input().split())
if (max(a,b)- min(a,b))%2 ==0:
print(abs(a-b)//2)
exit()
distance = min(n-a + n -b, a-1+b-1)
print((distance +1)//2) |
p03377 | s837540522 | Accepted | A, B, X = map(int, input().split())
def main():
if A + B < X or A > X:
print("NO")
else:
print("YES")
if __name__ == "__main__":
main()
|
p03680 | s799593782 | Accepted | n = int(input())
a = []
for i in range(n):
a.append(int(input()) - 1)
hst = [0] * n
btn = 0
cnt = 0
while hst[btn] != 1:
hst[btn] = 1
btn = a[btn]
cnt += 1
if btn == 1:
print(cnt)
exit()
print(-1) |
p03250 | s695515098 | Wrong Answer | A,B,C=map(int,input().split())
n=10*A+B
m=10*B+C
print(max(n+C,A+m)) |
p03150 | s618277741 | Wrong Answer | s=input()
k="keyence"
for i in range(8):
print(k[:i],k[i:])
if k[:i] not in s or k[i:] not in s:
continue
else:
if s.find(k[:i])<s.find(k[i:]):
print("YES" )
exit()
print("NO")
|
p02699 | s407774164 | Accepted | S,W=map(int,input().split())
if S<=W:
print("unsafe")
else:
print("safe") |
p03673 | s968211363 | Accepted | N = int(input())
A = list(map(int,input().split()))
a = list(range(1,N+1,2))
b = list(range(2,N+1,2))
if N%2 == 0:
b.reverse()
ind = b + a
else:
a.reverse()
ind = a + b
ans = []
for i in ind:
ans.append(A[i-1])
print(*ans)
|
p02993 | s829135808 | Wrong Answer | s=input()
a=[]
for i in range(len(s)):
a.append(s[i])
if s[i] in a:
print("Bad")
exit()
print("Good")
|
p02600 | s866040599 | Accepted | X = int(input())
if X <= 599:
print('8')
elif X <= 799:
print('7')
elif X <= 999:
print('6')
elif X <= 1199:
print('5')
elif X <= 1399:
print('4')
elif X <= 1599:
print('3')
elif X <= 1799:
print('2')
else:
print('1') |
p02755 | s791543771 | Wrong Answer | A, B = map(int,input().split())
a = int(A / 0.08)
if A == int(a * 0.08) and B == int(a * 0.10) :
print(a)
else :
print('-1') |
p02793 | s135715891 | Wrong Answer | from fractions import Fraction
n=int(input())
a=[int(x) for x in input().split()]
y=a[0]
num,den=y,y
f=Fraction(0,1)
for i in range(1,len(a)):
f=(Fraction(num,den)+Fraction(y,a[i]))
num,den=f.numerator,f.denominator
print(f.numerator%(10**9+7))
|
p03943 | s412224578 | Accepted | a,b,c = map(int,input().split())
s = a+b+c
if 2*b==s or 2*a==s or 2*c==s:
print("Yes")
else:
print("No") |
p03261 | s024285170 | Accepted | n = int(input())
s = []
res = "Yes"
for i in range(n):
s.append(input())
for j in range(i):
if s[i] == s[j]:
res = "No"
if i != 0:
if s[i][0] != s[i-1][len(s[i-1])-1]:
res = "No"
print(res) |
p03107 | s861925031 | Accepted | S=input()
z=0
o=0
for i in range(len(S)):
if S[i]=="0":
z+=1
elif S[i]=="1":
o+=1
print(2*min(z,o)) |
p03759 | s972268394 | Accepted | a,b,c = map(int, input().split())
if (b - a) == (c - b):
print('YES')
else:
print('NO') |
p02831 | s124544385 | Accepted | import math
a,b = map(int,input().split())
if b>a:
a,b = b,a
l = (a*b)//(math.gcd(a,b))
print(l) |
p02922 | s645975457 | Wrong Answer | A, B = map(int, input().split())
print(-(-B//A)) |
p02789 | s937878611 | Accepted | N, M = map(int, input().split(' '))
if N == M:
print('Yes')
else:
print('No') |
p03836 | s877341294 | Wrong Answer | sx,sy,tx,ty=map(int,input().split())
dx,dy=tx-sx,ty-sy
route=["","","",""]
route[0]='U'*dx+'R'*dy
route[1]='D'*dx+'L'*dy
route[2]='L'+'U'*(dx+1)+'R'*(dy+1)+'D'
route[3]='R'+'U'*(dx+1)+'L'*(dy+1)+'U'
print("".join(route)) |
p03103 | s209124985 | Accepted | n,m = map(int,input().split())
ab = []
for i in range(n):
a,b = map(int,input().split())
ab.append([a,b])
ab.sort()
cnt = 0
ans = 0
for i in range(n):
a = ab[i][0]
b = ab[i][1]
if cnt +b >= m:
ans += (m-cnt)*a
break
else:
ans +=a*b
cnt +=b
print(ans) |
p02917 | s301965767 | Wrong Answer | n = int(input())
b = list(map(int, input().split()))
a = [b[0]]
for num, i in enumerate(b):
if num == 0:
a.append(i)
elif num == n-2:
a.append(i)
elif i <= b[num + 1]:
a.append(i)
elif i > b[num + 1]:
a.append(b[num + 1])
print(sum(a))
|
p03211 | s067457924 | Accepted | s=list(input())
m=1000
for x in range(len(s)-2):
m=min(m,abs(753-int("".join(s[x:x+3]))))
print(m) |
p02817 | s474625614 | Accepted | s,t = input().split()
print(t+s) |
p03645 | s847157614 | Accepted | N , M = map(int,input().split())
s = [list(map(int,input().split())) for _ in range(M)]
ans = "IMPOSSIBLE"
start_candidate = [X[1] for X in s if X[0]==1 ]
goal_candidate = [X[0] for X in s if X[1]==N]
ans = len(start_candidate)+len(goal_candidate)-len(set(start_candidate+goal_candidate))
if ans != 0:
print("POSSIBLE")
else:
print("IMPOSSIBLE") |
p02882 | s447670464 | Accepted | import math
a,b,x=map(int,input().split())
if x<a*a*b/2:
t=a*b*b/2/x
else:
t=2*b/a-2*x/(a**3)
print(math.atan(t)/math.pi*180) |
p04030 | s606284391 | Accepted | # B - バイナリハックイージー
s = input()
lst = []
for i in s:
if i == 'B' and len(lst) !=0:
lst.pop()
elif i == 'B':
continue
else:
lst.append(i)
print(''.join(lst)) |
p02959 | s661625915 | Wrong Answer | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
city = list(map(int, sys.stdin.readline().split()))
brave = list(map(int, sys.stdin.readline().split()))
ret = 0
tmp = 0
for n in range(N):
ret += min(city[n], brave[n])
ret += min(city[n + 1], brave[n] - min(city[n], brave[n]))
print(ret)
if __name__ == '__main__':
main()
|
p03038 | s331261841 | Accepted | n,m=map(int,input().split())
A=sorted(list(map(int,input().split())))
BC=[list(map(int,input().split())) for i in range(m)]
BC=sorted(BC,reverse=True,key=lambda x: x[1])
flag=0
t=0
for i in range(m):
if flag==1:
break
for j in range(t,n):
if BC[i][1]>A[j]:
A[j]=BC[i][1]
BC[i][0]-=1
t=j+1
if BC[i][0]==0:
break
else:
flag=1
break
print(sum(A)) |
p03861 | s022979913 | Wrong Answer | a,b,x = map(int, input().split())
c = b - a
d = c // x
print(d) |
p03433 | s490810038 | Accepted | N = int(input())
A = int(input())
r = N%500
if A >= r:
print("Yes")
else:
print("No") |
p02838 | s579799251 | Accepted | import numpy as np
n = int(input())
a = np.array(list((map(int, input().split()))))
mod = 10**9 + 7
ans = 0
two = 1
for i in range(61):
one = np.count_nonzero(a & 1)
a = a >> 1
ans = (ans + (one*(n-one))*two) % mod
two = (two * 2) % mod
print(ans) |
p02717 | s701486188 | Wrong Answer | data=input().split()
a=int(data[0])
b=int(data[1])
a=a%b
print(a)
|
p03481 | s437013725 | Accepted | x, y = map(int, input().split())
ans=0
while x<=y:
x*=2
ans+=1
print(ans)
|
p02684 | s424345478 | Accepted |
def main():
n, k = map(int, input().split())
A = tuple(map(lambda a: int(a) - 1, input().split()))
arrival = [None] * n
arrival[0] = 0
pos = 0
for i in range(1, k + 1):
next_pos = A[pos]
if arrival[next_pos]:
loop_len = i - arrival[next_pos]
remaining = k - i
kk = arrival[next_pos] + remaining % loop_len
print(arrival.index(kk) + 1)
return
arrival[next_pos] = i
pos = next_pos
print(pos + 1)
main()
|
p03994 | s327576974 | Accepted | alf = {c:i for i,c in enumerate('abcdefghijklmnopqrstuvwxyz')}
a = 'abcdefghijklmnopqrstuvwxyz'
s = input()
k = int(input())
diff = [26-alf[c] if c != 'a' else 0 for c in s]
ans = []
for i in range(len(s)):
if k >= diff[i]:
ans.append('a')
k -= diff[i]
else:
ans.append(s[i])
# print(ans,k)
if k > 0:
ans[-1] = a[(alf[ans[-1]] + k % 26)]
print(''.join(ans))
|
p04043 | s452286100 | Accepted | cand=[(5,5,7),(5,7,5),(7,5,5)]
X=tuple(map(int,input().split()))
print("YES") if X in cand else print("NO") |
p03673 | s220526567 | Accepted | N=int(input())
a=list(map(int, input().split()))
b=[0]*N
for i in range(N):
if i%2==0: # 前から
b[i//2]=str(a[N-1-i])
else:
b[N-1-i//2]=str(a[N-1-i])
print(" ".join(b))
|
p03644 | s256095369 | Accepted | N = int(input())
j = 0
while 1:
if 2**j > N:
print(2**(j-1))
break
else:
j += 1
|
p04005 | s141652691 | Wrong Answer | a,b,c = map(int,input().split())
x,y,z = a//2, b//2, c//2
p,q,r = a-x, b-y, c-z
print(min(abs(a*b*(z-r)), abs(b*c*(z-p)), abs(c*a*(y-q)))) |
p03208 | s776529489 | Accepted | #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,k = map(int,readline().split())
p = [int(input()) for i in range(n)]
p.sort()
ans = 10**9
for i in range(n-k+1):
if p[i+k-1]-p[i] < ans: ans = p[i+k-1]-p[i]
print(ans) |
p02756 | s550870928 | Accepted | S = input()
Q = int(input())
#query = [input().split() for _ in range(Q)]
rev = False
forw = ""
back = ""
for i in range(Q):
query = input().split()
if query[0] == "1":
rev = not rev
else:
if (not rev and query[1] == "1") or (rev and query[1] == "2"):
forw = query[2] + forw
else:
back += query[2]
#S = forw + S + back
if rev:
S = back[::-1] + S[::-1] + forw[::-1]
else:
S = forw + S + back
print(S)
|
p02719 | s587677450 | Accepted | N, K = map(int, input().split())
n = N%K
print(min(n, abs(n-K)))
|
p03951 | s296008215 | Accepted | N=int(input())
A=input()
B=input()
k=0
for i in range(N):
if A[N-i-1:N+1]==B[0:i+1]:
k=i+1
print(N*2-k)
|
p03319 | s673688134 | Accepted | n,k=map(int, input().split())
a=[int(i) for i in input().split()]
if n==k:
print(1)
else:
k-=1
print((n+k-2)//k) |
p04045 | s480001739 | Wrong Answer | n,k,*a=map(int,open(0).read().split())
for i in range(n,10**6):
if not set(str(i))&set(a):
print(i)
exit() |
p02595 | s623954036 | Wrong Answer | n,d = map(int,input().split())
i=0
num_list=[]
for k in range(n):
num_list.append(list(map(int,input().split())))
for j in range(n):
if num_list[j][0]**2 + num_list[j][1]**2 <= 5:
i = i + 1
print(i) |
p03331 | s729153602 | Wrong Answer | N = int(input())
ans = float("inf")
for i in range(N):
if sum(map(int, str(i))) + sum(map(int, str(N-i))) < ans:
ans = sum(map(int, str(i))) + sum(map(int, str(N-i)))
print(ans) |
p02572 | s759525760 | Wrong Answer | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9+7
N = int(readline())
A = list(map(int,readline().split()))
total = sum(A)
B = [0] * N
for i in range(N):
B[i] = total-A[i]
ans = 0
for i in range(N):
ans += A[i]*B[i]
if ans >= 2*MOD:
ans %= MOD
print(ans//2) |
p02820 | s482627300 | Wrong Answer | from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = [r if i == 's' else s if i == 'p' else p for i in list(input())]
ans = 0
for i in range(k):
j = i
prev = False
while j < n:
if prev and t[j] == t[j-k]:
prev = False
else:
ans += t[j]
prev = True
j += k
print(ans) |
p03146 | s344969520 | Accepted | s = int(input())
A = [s]
n = (s/2 if s%2==0 else 3*s+1)
ans = 1
while n not in A:
ans +=1
A.append(n)
n = (n/2 if n%2==0 else 3*n+1)
print(ans+1) |
p04044 | s888860350 | Accepted | N,L = [int(i) for i in input().split(" ") ]
S = []
for _ in range(N):
S.append( input() )
sd = sorted(S, key=lambda x: (str(x)[0], x))
print("".join(sd))
|
p03017 | s973460383 | Accepted | n, a, b, c, d = map(int, input().split())
S = input()
if c < d:
if "##" in S[a-1:d]:
print("No")
else:
print("Yes")
else:
f = S[b-2:d+1].find("...")
if f != -1 and ("##" not in S[a-1:c]):
print("Yes")
else:
print("No") |
p03042 | s543430295 | Wrong Answer | S = input()
ls = list(S)
lsa = [ls[0],ls[1]]
lsb = [ls[2],ls[3]]
a = int(''.join(lsa))
b = int(''.join(lsb))
if (a >= 1 and a <= 12):
if b >= 1 and b <= 12:
print('AMBIGIOUS')
else:
print('MMYY')
elif b >= 1 and b <= 12:
print('YYMM')
else:
print('NA') |
p02953 | s268352709 | Wrong Answer | n = int(input())
arr = list(map(int, input().split()))
for i in range(n-1, 0, -1):
if arr[i]>arr[i-1]:
arr[i-1]-=1
if arr[i]>arr[i-1]:
print('No')
break
else:
print('Yes') |
p03475 | s207415687 | Accepted | import math
N = int(input())
A = [list(map(int,input().split())) for _ in range(N-1)]
for i in range(N):
t = 0
for C,S,F in A[i:]:
if t < S:
t = S+C
else:
t = math.ceil((t-S)/F)*F+S+C
print(t) |
p04005 | s807908984 | Wrong Answer |
a,b,c = map(int,input().split())
if a % 2 == 0 and b % 2 == 0 and c % 2 == 0:
print(0)
else:
print(min(a*b,b*c,c*a))
|
p03457 | s564707380 | Accepted | n = int(input())
x,y,t=0,0,0
for i in range(n):
mt,mx,my= map(int,input().split())
ft = mt - t
fx = abs(x-mx)
fy = abs(y-my)
if fx + fy > ft:
print("No")
exit()
elif (ft - (fx + fy)) % 2 == 0:
pass
else:
print("No")
exit()
x,y,t=mx,my,mt
print("Yes") |
p02820 | s880616674 | Accepted | n,k = map(int, input().split())
r,s,p = map(int, input().split())
T = list(input())
# restore
for i in range(n):
if i >= k:
if T[i] == T[i - k]:
T[i] = '-'
# point sum
psum = 0
for i in range(n):
if T[i] == 'r':
psum = psum + p
elif T[i] == 'p':
psum = psum + s
elif T[i] == 's':
psum = psum + r
print(psum)
|
p02642 | s777820528 | Accepted | N=int(input())
A=sorted(map(int,input().split()))
m=max(A)
ans=0
dp=[True]*(m+1)
for i in range(N):
if not dp[A[i]]:
continue
if i==N-1:
ans+=1
elif i<N-1 and A[i+1]!=A[i]:
ans+=1
for j in range(1,m//A[i]+1):
dp[A[i]*j]=False
print(ans) |
p02720 | s997878024 | Accepted | K = int(input())
count = 9
lunlun = [1,2,3,4,5,6,7,8,9]
i = 0
while count < K:
if (lunlun[i]%10) != 0:
lunlun.append(lunlun[i]*10+lunlun[i]%10-1)
count = count + 1
lunlun.append(lunlun[i]*10+lunlun[i]%10)
count = count + 1
if (lunlun[i]%10) != 9:
lunlun.append(lunlun[i]*10+lunlun[i]%10+1)
count = count+1
i= i+1
print(lunlun[K-1]) |
p02971 | s712991434 | Accepted | n = int(input())
a = [int(input()) for _ in range(n)]
sa = sorted(a)
amx = sa[-1]
amx2 = sa[-2]
for ai in a:
print(amx if ai != amx else amx2)
|
p02546 | s657642518 | Accepted | S = input()
if S[-1] == 's':
S += 'e'
print(S + 's') |
p02546 | s579580446 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
def main(input, print):
s = input()
if(s[-1] == 's'):
print(s+'es')
else:
print(s+'s')
if __name__ == '__main__':
main(sys.stdin.readline, print)
|
p02701 | s419581870 | Wrong Answer | import sys
import math
N=int(input())
S = []
s=N
for i in range(N):
S.append(input())
for i in range(N):
for j in range(i+1,N):
if S[j]==S[i]:
S[j]=[]
s=s-1
print(s) |
p03145 | s974699120 | Wrong Answer | a,b,c=map(int, input().split())
print(a*b/2) |
p02570 | s458644934 | Wrong Answer | arr=[int(i) for i in input().split()]
if(arr[0]//arr[2]<=arr[1]):
print("Yes")
else:
print("No")
|
p02713 | s761231645 | Wrong Answer | import itertools
import math
k=int(input())
ans=0
for x,y,z in itertools.combinations_with_replacement(range(2,k+1),3):
ans+=math.gcd(math.gcd(x,y),z)
print(ans+3*((k-1)**2)+3*(k-1)+1) |
p02618 | s399068161 | Accepted | D=int(input())
c = list(map(int,input().split()))
s=[[0 for e in range(26)] for f in range(D)]
for i in range(D):
s[i]=list(map(int,input().split()))
last=[0]*26
ans=0
point=[0]*D
for i in range(D):
saidai=-(10**10)
kouho=1
for j in range(26):
if s[i][j]+c[j]*((i+1)-last[j])>=saidai:
kouho=j+1
saidai=s[i][j]+c[j]*((i+1)-last[j])
print(1) |
p03665 | s402771360 | Accepted | n, p = map(int, input().split())
A = list(map(int, input().split()))
if all(a % 2 == 0 for a in A):
if p:
print(0)
else:
print(pow(2, n))
else:
print(pow(2, n-1))
|
p03779 | s809494270 | Accepted | x = int(input())
for i in range(1,10**5):
curr_max = i*(i+1)//2
if curr_max >= x:
print(i)
break |
p03673 | s621876028 | Wrong Answer | n = int(input())
a = list(map(str,input().split()))
b = []
for i in range(len(a)):
if i%2 == 0:
b.append(a[i])
else:
b.insert(0,a[i])
print(' '.join(b)) |
p02754 | s578609308 | Accepted | N, A, B = map(int, input().split())
AB = A + B
ans = 0
ans += (N // AB) * A
if N % AB > A:
ans += A
else:
ans += N % AB
print(ans) |
p04044 | s472908804 | Accepted | def main():
n, l = map(int, input().split())
S = list(input() for _ in range(n))
print(''.join(sorted(S)))
if __name__ == '__main__':
main() |
p02773 | s193763946 | Wrong Answer | import collections
import itertools
N=int(input())
#P=list(map(int,input().split()))
st=[]
for i in range(N):
s=str(input())
st.append(s)
c = collections.Counter(st)
ret = [letter for letter,count in c.most_common() if count == c.most_common()[0][1]]
sorted(ret)
for r in ret:
print(r)
|
p02556 | s080713539 | Wrong Answer | N = int(input())
L = [list(map(int, input().split())) for _ in range(N)]
L.sort(key = lambda x: x[0]**2 + x[1]**2, reverse = True)
base_x = L[0][0]
base_y = L[0][1]
ans = 0
for l in L:
ans = max(ans, abs(l[0] - base_x) + abs(l[1] - base_y))
print(ans) |
p02754 | s522990567 | Accepted | N, A, B = map(int, input().split())
n_c = N // (A+B)
n = N - n_c*(A+B)
ans = n_c*A + min(n, A)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.