problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03293 | s711584430 | Wrong Answer | from collections import Counter
s = list(input())
t = list(input())
if Counter(s) == Counter(t):
print("Yes")
else:
print("No")
|
p02641 | s259082873 | Accepted | X, N = map(int, input().split())
p = list(map(int, input().split()))
d = {i: 1 for i in p}
idx = X
while True:
if d.get(idx) is None:
ans_plus = idx
break
else:
idx += 1
idx = X
while True:
if d.get(idx) is None:
ans_minus = idx
break
else:
idx -= 1
if abs(X - ans_plus) < abs(X - ans_minus):
print(ans_plus)
else:
print(ans_minus) |
p03971 | s096727790 | Accepted | vars = input().split()
n,a,b = int(vars[0]),int(vars[1]),int(vars[2])
passed = 0
os = 1
parts = input()
for c in parts:
if c=="c":
print("No")
elif c=="b" and passed<a+b and os<=b:
print("Yes")
passed += 1
os += 1
elif c=="a" and passed<a+b:
print("Yes")
passed += 1
else:
print("No") |
p02578 | s015380745 | Wrong Answer | N=int(input())
a_list = list(map(int,input().split()))
ans = 0
min = a_list[0]
for i in range(1,N):
if min > a_list[i]:
ans += a_list[i]-min
else:
min = a_list[i]
print(ans) |
p02833 | s187022274 | Accepted | import sys
import math
N = int(input())
if N % 2 == 1:
print(0)
sys.exit()
count_2 = 0
count_5 = 0
deno = 2
while deno <= N:
count_2 += N // deno
deno *= 2
deno = 10
while deno <= N:
count_5 += N // deno
deno *= 5
print(min(count_2, count_5))
|
p02786 | s020285368 | Accepted | H = int(input())
p = 0
for i in range(50):
if 2**i <= H and H < 2**(i + 1):
p = i
break
# print(p)
print(2**(p + 1) - 1)
|
p02959 | s694889626 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[i] <= b[i]:
if a[i+1] >= b[i] - a[i]:
ans += b[i]
a[i+1] -= b[i] - a[i]
else:
ans += a[i] + a[i+1]
a[i+1] = 0
else:
ans = b[i]
print(ans)
|
p02909 | s521380701 | Accepted | w=['Sunny', 'Cloudy', 'Rainy']
print(w[(w.index(input())+1)%3])
|
p03721 | s008594346 | Accepted | n,k=list(map(int,input().split()))
li=[]
for _ in range(n):
a,b=list(map(int,input().split()))
li.append([a,b])
li.sort()
for a,b in li:
k -= b
if k <= 0:
print(a)
break |
p02963 | s253888374 | Accepted | import math
def main():
S = int(input())
r = math.ceil(math.sqrt(S))
print(0, 0, r, 1, r * r - S, r)
main()
|
p03324 | s431394725 | Accepted | D,N=map(int,input().split())
print(100**D*N if N!=100 else 100**D*101) |
p02665 | s792090836 | Accepted | n=int(input())
a=list(map(int,input().split()))
if n==0 and a[0]!=1:
print(-1)
exit()
b=[a[0]==0]
for i in a[1:]:
b+=[2*b[-1]-i]
if b[-1]<0:
print(-1)
exit()
b.pop()
ans=root=a[-1]
a=a[::-1]
b=b[::-1]
for i,j in zip(a[1:],b):
root=min(root,j)+i
ans+=root
print(ans) |
p03042 | s044363475 | Accepted | s = input()
if (int(s[:2]) >= 13 or s[:2] == '00') and (int(s[2:4]) >= 13 or s[2:4] == '00'):
print('NA')
elif 0 < int(s[:2]) <= 12 and 0 < int(s[2:4]) <= 12:
print('AMBIGUOUS')
elif 0 < int(s[:2]) <= 12:
print('MMYY')
else:
print('YYMM')
|
p02600 | s801875783 | Accepted | X = int(input())
if X >=400 and X<600:
print(8)
elif X<800:
print(7)
elif X<1000:
print(6)
elif X<1200:
print(5)
elif X<1400:
print(4)
elif X<1600:
print(3)
elif X<1800:
print(2)
elif X<2000:
print(1) |
p02912 | s355876405 | Accepted | import itertools
import math
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
from functools import reduce
sys.setrecursionlimit(4100000)
from functools import lru_cache
INF = 1 << 60
#ここから書き始める
n, m = map(int, input().split())
a = [int(i) * -1 for i in input().split()]
# print(a)
heapq.heapify(a)
for i in range(m):
maximum = heapq.heappop(a) * -1
heapq.heappush(a, (maximum // 2) * -1)
print(sum(a) * -1)
|
p02618 | s998749544 | Wrong Answer | d = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(d)]
for i in range(d):
print(i % d + 1)
|
p02641 | s491791192 | Accepted | X,N = map(int, input().split())
P = list(map(int, input().split()))
maxP = 0 if P == [] else max(P)
le = 1000
for k in reversed(range(X+1)):
if k not in P:
le = X-k
ans = k
break
# for k in range(X,maxP+1):
for k in range(X,102):
if k not in P:
if le > k-X:
ans = k
break
print(ans) |
p02647 | s582995815 | Accepted | import sys
input = sys.stdin.readline
N, K = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(K):
imos = [0] * (N + 1)
for i in range(N):
l = max(0, i - a[i])
r = min(N - 1, i + a[i]) + 1
imos[l] += 1
imos[r] -= 1
for i in range(N): imos[i + 1] += imos[i]
a = imos[: -1]
if a.count(N) == N: break
print(*a) |
p02946 | s933732284 | Accepted | k,x = map(int,input().split())
ans = [str(i) for i in range(x-k+1,x+k)]
print(" ".join(ans)) |
p02848 | s175146609 | Wrong Answer | n=int(input())
ans = ""
for c in input():
print(ord(c),ord('A'))
ans+= chr((ord(c)-ord('A')+n)%26+ord('A'))
print(ans) |
p02756 | s488873661 | Wrong Answer | s = input()
q = int(input())
flag = 1
for i in range(q):
A = list(input().split())
if A[0] == '1':
flag *= -1
else:
if flag * int(A[1]) == 1 or -2:
s = A[2]+s
else:
s = A[2]+s
if flag == -1:
print(s[::-1])
else:
print(s) |
p03323 | s986477184 | Accepted | a , b = map(int , input().split())
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(")
|
p03679 | s332642244 | Accepted | x,a,b = map(int,input().split())
A= 1
syoumikigen = A + a
B = A + b
safe = syoumikigen + x
out = safe + 1
if B <= syoumikigen:
print("delicious")
elif syoumikigen < B <= safe:
print("safe")
else:
print("dangerous")
|
p03803 | s766025877 | Accepted | a,b=map(int,input().split())
if (a>b and b!=1) or (a==1 and b!=1):
print('Alice')
elif (a<b and a!=1) or (a!=1 and b==1):
print('Bob')
else:
print('Draw') |
p02879 | s745890373 | Accepted | a,b=map(int,input().split())
if 1<=a<=9 and 1<=b<=9:
print(a*b)
else:
print(-1) |
p02572 | s545153514 | Accepted | N = int(input())
A = list(map(int,input().split()))
MOD = 10**9+7
S = sum(A)
ans = 0
for i in range(N-1):
S -= A[i]
ans = (ans + S*A[i])%MOD
print(ans) |
p03657 | s099585892 | Accepted | def main():
a,b=map(int, input().split())
if(a%3==0 or b%3==0 or (a+b)%3==0):
print("Possible")
else:
print("Impossible")
if __name__ == '__main__':
main()
|
p02665 | s382673163 | Accepted | N = int(input())
*A, = map(int, input().split())
Pmax = [0 for _ in range(N+1)]
Pmax[0] = 1-A[0]
for i in range(1, N+1):
Pmax[i] = 2*Pmax[i-1] - A[i]
ans = 0
v = 0
for i in range(N, -1, -1):
if Pmax[i]*2 < v:
ans = -1
break
v = min(v, Pmax[i])+A[i]
ans += v
print(ans)
|
p03001 | s099458868 | Wrong Answer | w,h,x,y = map(int,input().split())
men1 = min(h*x,h*(w-x))
men2 = min(w*y,w*(h-y))
print(max(men1,men2),sep = " ",end = "")
if men1 == men2:
print(" 1")
else:
print(" 0")
|
p02684 | s865898897 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
pos = -1
seen = [False] * n
last = [-1] * n
hist = []
i = 0
cnt = 0
while(seen[i] == False):
seen[i] = True
last[i] = cnt
cnt += 1
hist.append(i)
ne = a[i]-1
i = ne
if (seen[i] == True):
pos = i
cycle = hist[last[pos]:]
preCircle = last[pos]
if (k <= preCircle):
print(hist[k] + 1)
else:
k -= preCircle
ans = k % len(cycle)
print(cycle[ans] + 1)
|
p02743 | s710019880 | Wrong Answer | from math import sqrt
a,b,c=map(int,input().split())
if sqrt(a)+sqrt(b)<sqrt(c):
print("Yes")
else:
print("No") |
p02957 | s878072709 | Accepted | a,b=map(int,input().split())
if (a+b)%2==0:
print(int((a+b)/2))
else:
print("IMPOSSIBLE") |
p02618 | s242455537 | Accepted | import numpy as np
D = int(input())
c = np.array( list(map(int, input().split())) )
#
s = [[] for i in range(D)]
for i in range(D):
s[i] = np.array( list(map(int, input().split())) )
#
v = 0
cc = np.array( [0]*26 )
last = np.array( [-1]*26 )
for d in range(D):
cc += c
av = s[d] - sum( cc ) + cc
av2 = av + cc*min((D-d-1),3)
m = max(av2)
for t in range(26):
if av2[t] == m:
cc[t] = 0
v += av[t]
print(t+1)
break
#
#print( v )
|
p02642 | s458029285 | Accepted | # -*- coding: utf-8 -*-
n = int(input())
a = list(map(int, input().split()))
m = 1000005
count = 0
cnt = [0] * m
for i in range(n):
if cnt[a[i]] == 0:
for j in range(a[i], m, a[i]):
cnt[j] += 1
else:
cnt[a[i]] = 2
for i in range(n):
if cnt[a[i]] == 1:
count += 1
print(count) |
p03815 | s632838324 | Accepted | x=int(input())
if x%11==0:
print((x//11)*2)
else:
if x%11<7:
print((x//11)*2+1)
else:
print((x//11)*2+2) |
p02641 | s405603333 | Wrong Answer | x,n = map(int,input().split())
if n == 0:
print(x)
else:
p = list(map(int,input().split()))
for i in range(n):
if x-i in p:
if x+i in p:
a =0
else:
print(x+i)
exit(0)
else:
print(x-i)
exit(0)
|
p03681 | s327170884 | Accepted | # C - Reconciled?
def main():
from math import factorial
n, m = map(int, input().split())
p = 10**9+7
if abs(n-m) < 2:
if n == m:
print(2*factorial(n)*factorial(m)%p)
else:
print(factorial(n)*factorial(m)%p)
else:
print(0)
if __name__ == "__main__":
main() |
p02873 | s540209289 | Wrong Answer | import sys
S = list(">")
lis = [0] * (len(S)+1)
if len(S) == 1:
print(1)
sys.exit()
#最初は < を処理する
for i in range(len(S)):
if S[i] == "<":
lis[i+1] = lis[i] + 1
for j in range(len(S)-1,-1,-1):
if S[j] == ">":
lis[j] = max(lis[j],lis[j+1] + 1)
print(sum(lis))
|
p03471 | s426227117 | Accepted | def resolve():
N, Y = map(int, input().split())
resx, resy, resz = (-1, -1, -1)
for x in range(N+1):
for y in range(N+1-x):
z = N - x - y
total = 10000*x + 5000*y + 1000*z
if total == Y:
resx, resy, resz = (x, y, z)
break
print(resx, resy, resz)
resolve() |
p03220 | s152035780 | Accepted | # palace
n = input()
T, target = [int(e) for e in input().split()]
H = list(map(int, input().split()))
average_temp = []
min_diff = float('inf')
index = -1
for index, value in enumerate(H):
average_temp = T - value*0.006
diff = abs(target - average_temp)
if min_diff > diff:
min_diff = diff
min_index = index+1
print(min_index) |
p03001 | s449553719 | Accepted | w,h,x,y = map(int,input().split())
s=0
ans=0
if w==2*x and h==2*y:
ans=1
s=(w*h)/2
print(s,ans)
|
p02888 | s268060573 | Accepted | import bisect
N=int(input())
L=sorted(map(int,input().split()))
count=0
for a in range(N-2):
for b in range(a+1,N-1):
count+=bisect.bisect_left(L,L[a]+L[b])-(b+1)
print(count) |
p02951 | s838265603 | Accepted | a, b, c = map(int, input().split())
print(max(c-(a-b), 0))
|
p03037 | s594213277 | Accepted | N,M = map(int,input().split())
mi = 0
ma = 10 ** 6
for i in range(M):
L,R = map(int,input().split())
mi = max(mi,L)
ma = min(ma,R)
if(ma - mi + 1 <= 0):
print("0")
else:
print(str(ma - mi + 1)) |
p02796 | s939649475 | Wrong Answer | N = int(input())
point = []
arm = {}
for n in range(N):
i, L = map(int, input().split())
point.append(i)
arm[i] = L
sorted_point = sorted(point)
count = 1
pre_point = sorted_point[0]
for n in range(1, len(sorted_point), 1):
if arm[sorted_point[n]] + arm[pre_point] <= sorted_point[n]-pre_point :
count += 1
pre_point = sorted_point[n]
print(count) |
p02755 | s482726463 | Wrong Answer | import math
flag = 0
a,b = map(int,input().split())
for i in range(1000):
if int(i*0.08) == a and int(i*0.1) == b:
print(i)
break
elif i*0.08 > a and i*0.1 > b:
print(-1)
break |
p03309 | s078679533 | Wrong Answer | import math
N = int(input())
A = list(map(int, input().split()))
# print(N, A)
for i in range(len(A)):
A[i] -= (i + 1)
# print(A)
average = math.floor(sum(A) / len(A))
for i in range(len(A)):
A[i] = abs(A[i] - average)
sadness = sum(A)
print(sadness)
|
p02731 | s165727050 | Accepted | L = int(input())
print ((L/3) ** 3) |
p03778 | s605357899 | Accepted | W, a, b = list(map(int,input().split()))
a, b = sorted([a,b])
print(max(b-(a+W),0)) |
p02829 | s919224364 | Wrong Answer | A = int(input())
B = int(input())
print(5-A-B) #和から誤答を引けば正答 |
p02987 | s230754051 | Accepted | s=sorted(input())
if s[0]==s[1] and s[2]==s[3] and s[1]!=s[2]:print("Yes")
else:print("No")
|
p03126 | s633531619 | Wrong Answer | n,m=map(int,input().split())
ka=[list(map(int,input().split())) for _ in range(n)]
flg = [0] * (m+1)
for i in range(n):
for j in range(ka[i][0]):
food = ka[i][j]
flg[food] += 1
result = 0
for i in range(m+1):
if flg[i] == n:
result += 1
print(result) |
p02982 | s254094103 | Wrong Answer | n,d=map(int, input().rstrip().split())
m=[]
for _ in range(n):
arr=list(map(int, input().rstrip().split()))
m.append(arr)
ans=0
for i in range(n-1):
for j in range(i+1,n):
a = 0
for k in range(d):
a += (m[i][k] - m[j][k])**2
x = int(a**(1/2))
if x*2 == a:
ans+=1
print(ans)
|
p03087 | s453308513 | Wrong Answer | N, Q = [int(i) for i in input().split()]
S = input()
lr = [[int(i) for i in input().split()] for _ in range(Q)]
ary = [0]
c = 0
f = bool(S[0] == "A")
for i in range(1, N):
if S[i] == 'C' and f:
c += 1
f = False
else:
f = bool(S[0] == "A")
ary.append(c)
for l, r in lr:
print(ary[r-1]-ary[max(0, l-1)])
|
p03136 | s779192729 | Wrong Answer | N = int(input())
L = sorted(list(map(int, input().split())))
max_length = L[-1]
sum_length = sum(L[0:len(L)-1])
print(sum_length)
print("Yes") if max_length > sum_length else print("No") |
p03951 | s280300084 | Accepted | N=int(input())
s=input()
t=input()
for i in range(N+1):
for j in range(N-i):
if s[i+j]!=t[j]:
break
else:
print(N+i)
break |
p02951 | s638296633 | Accepted | A,B,C = map(int,input().split())
print(max(0,C-(A-B))) |
p02600 | s576053617 | Wrong Answer | value = int(input())
kyu_rated = 8
lvalue = 400
rvalue = 599
if 400 <= value <= 1999:
for i in range(0, 7):
if lvalue <= value <= rvalue:
print(kyu_rated)
flag = 1
break
else:
lvalue += 200
rvalue += 200
kyu_rated -= 1
|
p03481 | s950593816 | Accepted | x, y = map(int, input().split())
i = 0
while x <= y:
x = x * 2
i += 1
print(i) |
p02661 | s730044598 | Wrong Answer | N = int(input())
ab = []
for i in range(N):
ab.append(tuple(map(int,input().split())))
up = sorted(ab,key=lambda a:a[0])
down = sorted(ab,key=lambda a:a[1])
if N%2 == 1:
print(up[N//2][1]-down[N//2][0]+1)
else:
r = (up[N//2-1][1]+up[N//2][1])
l = (down[N//2-1][0]+down[N//2][0])
print(r-l+1)
|
p02866 | s998617262 | Wrong Answer | from collections import Counter
n = int(input())
D = list(map(int,input().split()))
if D[0] != 0:
print(0)
exit()
C = Counter(D)
C = dict(sorted(C.items()))
memo = 1
ans = 1
for key in C:
ans = (ans * (pow(memo,C[key])))%998244353
memo = C[key]
print(ans) |
p02663 | s544372011 | Accepted | a, b, c, d, K = map(int,input().split())
print(max(0,(60*c+d - 60*a-b)-K))
|
p03486 | s119015263 | Wrong Answer | s = input()
t = input()
s = ''.join(sorted(s))
t = ''.join(list(reversed(t)))
if s<t:
print('Yes')
else:
print('No') |
p03681 | s148953391 | Accepted | n, m = map(int, input().split())
mod = 10**9+7
if abs(n-m)>1:
print(0)
else:
ans = 1
for i in range(2, max(n, m)):
ans *= i
ans %= mod
ans = pow(ans, 2, mod)
ans *= 2*max(n, m)**2 if n==m else max(n, m)
print(ans%mod) |
p02726 | s901955587 | Accepted | N,X,Y=map(int,input().split())
ans=[0]*(N)
for i in range(1,N):
for j in range(i+1,N+1):
res=min(abs(j-i),abs(X-i)+abs(Y-j)+1,abs(X-j)+abs(Y-i)+1)
ans[res]+=1
for a in ans[1:]:
print(a) |
p02785 | s993440085 | Wrong Answer | n,k=map(int,input().split())
h=sorted(list(map(int,input().split())))
l=h[:-k]
print(sum(l))
|
p02713 | s345171942 | Accepted | from functools import reduce
import itertools
import math
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(input())
sum = 0
# forループのネスト
for a, b, c in itertools.product(range(1, k+1), range(1, k+1), range(1, k+1)):
sum += gcd(a, b, c)
print(sum)
|
p02659 | s122405746 | Wrong Answer | import math
a, b = map(float, input().split())
print(math.floor(a*b)) |
p02659 | s964759063 | Wrong Answer | import sys
A,B=map(float, sys.stdin.readline().split())
print int(A*B) |
p03206 | s633850099 | Accepted | message = {25: 'Christmas',
24: 'Christmas Eve',
23: 'Christmas Eve Eve',
22: 'Christmas Eve Eve Eve'}
d = int(input())
print(message[d])
|
p02641 | s113731311 | Accepted | X,N = map(int, input().split())
P = list(map(int, input().split()))
table = [0] * 102
ans = X
dist = 102
for p in P:
table[p] = 1
for i in range(102):
if table[i] != 0:
continue
if abs(i - X) < dist:
ans = i
dist = abs(i - X)
elif abs(i - X) == dist:
ans = min(i, ans)
print(str(ans)) |
p03250 | s404757660 | Accepted | import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
A = list(map(int, sys.stdin.buffer.readline().split()))
A.sort(reverse=True)
ans = int(str(A[0]) + str(A[1])) + A[2]
print(ans)
|
p03282 | s022870495 | Wrong Answer | S = input()
K = int(input())
ans = ""
if int(S[0]) > 1:
ans = S[0]
elif K>=100:
for i in range(len(S)):
if int(S[i]) > 1:
ans = S[i]
break
else:
for i in range(len(S)):
if int(S[i]) > 1:
if i+1 <= K:
ans = S[i]
break
else:
ans = 1
print(ans) |
p02779 | s993201587 | Accepted | N=int(input())
Ai = list(map(int,input().split()))
Ai.sort()
flag = 0
for i in range(N-1):
if(Ai[i] == Ai[i+1]):
flag=1
break
if (flag):
print('NO')
else:
print('YES') |
p02748 | s974388568 | Accepted | def resolve():
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
grid=[list(map(int,input().split())) for i in range(M)]
res = min(a) + min(b)
for x, y, c in grid:
res = min(res, a[x-1]+b[y-1]-c)
print(res)
resolve() |
p03286 | s038798358 | Accepted | N = int(input())
if N == 0:
s = '0'
else:
s = ''
while N != 0:
m = N%2
s += str(m)
N = (N - m)*(-1)//2
print(s[::-1]) |
p03011 | s013010399 | Accepted | P = list(map(int, input().split()))
P.sort()
ans = P[0]+P[1]
print(ans)
|
p02916 | s475818741 | Wrong Answer | n=int(input())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
c=[int(i) for i in input().split()]
ans=0
for i in range(n):
eat=a[i]-1
ans+=b[eat]
if eat!=n-1 and i!=n-1:
ans+=c[eat]
print(ans) |
p03137 | s388089632 | Accepted | n, m = map(int, (input().split()))
x = list(map(int, input().split()))
x = sorted(x)
diff = []
for i in range(m-1):
diff.append(x[i+1] - x[i])
diff = sorted(diff, reverse=True)
dist = x[-1] - x[0]
if dist < n:
print(0)
exit()
if m < n:
print(0)
exit()
for i in range(n-1):
dist -= diff[i]
print(dist)
|
p03773 | s920984393 | Wrong Answer | def gcd(A,B):
print(A,B)
if B==0:
return A
elif B!=0:
return gcd(B,A%B)
#ただし、A>Bである
a,b=map(int,input().split())
a=gcd(a,b)
print(a)
|
p03778 | s586317082 | Wrong Answer | w,a,b = map(int,input().split())
if (a <= b <= a+w) or (a <= b <= a+w):
print(0)
elif a+w < b:
print(b-a-w) |
p02995 | s763599568 | Accepted | import math
a, b, c, d = map(int, input().split())
def lcm(x,y):
return (x*y) // math.gcd(x,y)
print((b- b//c - b//d + (b // lcm(c,d))) - ((a-1)- (a-1)//c - (a-1)//d +( (a-1) // lcm(c,d)))) |
p02818 | s387898851 | Accepted | a, b, c = map(int, input().split(' '))
if c >= a:
c -= a
b = max(0, b-c)
print(0, b)
else:
print(a-c, b) |
p02923 | s236323460 | Wrong Answer | N=int(input())
H=list(map(int,input().split()))
max=0
ans=0
for i in range(N-1):
if H[i]>=H[i+1]:
max+=1
print(i)
else:
max=0
if ans<max:
ans=max
print(ans) |
p03478 | s178072410 | Wrong Answer | n,a,b=map(int, input().split())
ans = 0
for i in range(n):
d = i
c = d
while d >0:
c += (d%10)
d = i // 10
if a <= c <= b:
ans += 1
print(ans)
|
p03699 | s048540486 | Accepted | n = int(input())
s = [int(input()) for _ in range(n)]
s.sort()
point = sum(s)
if point%10 == 0:
for i in s:
if i%10 != 0:
point -= i
break
if point%10 == 0:
print(0)
else:
print(point) |
p03994 | s886298575 | Wrong Answer | s = list(input())
k = int(input())
for i in range(len(s)):
c = ord(s[i]) - ord("a")
if k >= (26 - c):
k -= 26-c
s[i] = "a"
s[-1] = chr(((ord(s[-1]) - ord("a")) + k) % 26 + ord("a"))
print("".join(s))
|
p02633 | s605308665 | Wrong Answer | from sys import stdin
def main():
input = lambda: stdin.readline()[:-1]
X = int(input())
if X < 60:
X = 180 - X
for n in range(3, 100000):
s = 180 * (n - 2)
d, m = divmod(s, n)
if not m and d == X:
print(n)
break
main()
|
p03161 | s761751460 | Wrong Answer |
MAX = 10 ** 6
def solve(arr, n, k):
if n == 2:
return arr[1] - arr[0]
dp = [MAX] * n
dp[0] = 0
for i in range(n):
for j in range(i + 1, i + k + 1):
if j < n:
dp[j] = min(dp[j], dp[i] + abs(arr[i] - arr[j]))
return dp[-1]
n, k = map(int, input().split())
arr = list(map(int, input().split()))
print(solve(arr, n, k)) |
p03264 | s061778588 | Wrong Answer | k = int(input())
if k%2==0:
print((k//2)**2)
elif k%2==1:
print(((k-1)//2)*(k//2))
|
p02796 | s555804484 | Wrong Answer | length = int(input())
target = []
for i in range(length):
s, e = map(int, input().split(" "))
target.append([s, s + e])
target.sort(key = lambda x: x[0], reverse = True)
target.sort(key = lambda x: x[1])
answer = 0
before_s, before_e = -1, -1
# print(target)
for s, e in target:
if before_s <= s <= before_e or before_s <= e <= before_e:
answer += 1
else:
before_s = s
before_e = e
print(length - answer) |
p03633 | s356981558 | Wrong Answer | def gcd(a, b):
if(a == 0):
return b
return gcd(b % a, a)
def lcm(a, b):
return (a * b) / gcd(a, b)
t = int(input())
ans = 1
while(t != 0):
t -= 1
n = int(input())
if(ans < 1000000000000000000):
ans = lcm(ans, n)
if(ans > 1000000000000000000):
ans = 1000000000000000000
print(int(ans))
|
p02899 | s597287278 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = []
for i in range(1,N+1):
ans.append(A.index(i)+1)
print(ans) |
p02899 | s256079312 | Accepted | n=int(input())
a=list(map(int,input().split()))
nu={}
for i in range(len(a)):
nu[a[i]+1]=i+1
nu=sorted(nu.items())
b=[]
for i in nu:
b.append(str(i[1]))
mojiretu = ' '.join(b)
print(mojiretu) |
p02622 | s607940254 | Accepted | a = input()
b = input()
count = 0
for i in range(len(a)):
if (a[i]!= b[i]):
count += 1
print(count) |
p02854 | s403191291 | Accepted | n,*a=map(int,open(0).read().split())
sa = sum(a)
ha = sa/2
x = 0
for i in range(n):
x+=a[i]
if x>=ha:
break
y = sa-x
print(min(abs(x-y),abs((x-a[i])-(y+a[i])))) |
p02973 | s514654530 | Accepted | from collections import deque
import bisect
N = int(input())
A = [int(input()) for _ in range(N)]
d = deque()
for i in range(N):
p = bisect.bisect_left(d, A[i])
if p==0:
d.appendleft(A[i])
else:
d[p-1] = A[i]
ans = len(d)
print(ans)
|
p03437 | s398071038 | Wrong Answer | x,y=map(int,input().split())
print(x if x%y==0 else -1) |
p03815 | s194486893 | Accepted | x = int(input())
num = x//11
if x % 11 > 6:
print(num * 2 + 2)
elif x % 11 > 0:
print(num * 2 + 1)
else:
print(num * 2) |
p03481 | s420420171 | Accepted | a,b = map(int,input().split())
n = 0
while 2**n*a <= b:
n +=1
print(n) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.