problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02988 | s132930459 | Accepted | n = int(input())
p_ls = list(map(int, input().split(' ')))
cnt = 0
for i in range(1, len(p_ls) - 1):
if (p_ls[i-1] < p_ls[i] < p_ls[i+1]) or (p_ls[i+1] < p_ls[i] < p_ls[i-1]):
cnt += 1
print(cnt) |
p02759 | s974204883 | Accepted | n = int(input())
ans = n//2 if n % 2 == 0 else n//2+1
print(ans)
|
p03161 | s563922770 | Wrong Answer | # EDPC A Frog 1
N, K = map(int, input().split())
H = list(map(int,input().split()))
cost = [float("inf")]*N
cost[0] = 0
cost[1] = abs(H[1]-H[0])
for i in range(2,N):
for k in range(K):
cost[i] = min(cost[i],cost[i-k]+abs(H[i]-H[i-k]))
print(cost[N-1]) |
p02598 | s368526491 | Accepted | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
l = 0
r = max(A)
while l + 1 < r:
m = (l+r)//2
n = sum([(x-1)//m for x in A])
if n > K:
l = m
else:
r = m
print(r) |
p03479 | s476353099 | Wrong Answer | from math import log2
x, y = map(int, input().split())
print(int(1 + log2(y / x))) |
p02780 | s997637961 | Accepted | n,k= map(int,input().split())
p= list(map(int,input().split()))
sp=[0]*(n-(k-1))
sp[0]=sum(p[0:k])
for i in range(1,n-(k-1)):sp[i]=sp[i-1]+p[i+k-1]-p[i-1]
print((max(sp)+k)/2) |
p03962 | s535773298 | Accepted | print(len(set(input().split()))) |
p04031 | s074171395 | Wrong Answer | N=int(input())
L=list(map(int,input().split()))
avg = sum(L)/len(L)
import math
avg_u = math.ceil(avg)
#avg_d = math.floor(avg)
ans_u = 0
ans_d = 0
for i in L:
ans_u += (i - avg_u)**2
print(ans_u) |
p03632 | s021546867 | Wrong Answer | #! env python
# -*- coding: utf-8 -*-
import os
import sys
# ac_py.main
# Date: 2020/06/14
# Filename: main
# Author: acto_mini
def main():
A, B, C, D = map(int, input().split())
if B > C:
if C > A:
if D > B:
print(B-C)
else:
print(D-C)
else:
print(B-A)
else:
print(0)
return
if __name__ == '__main__':
main()
|
p03910 | s176229937 | Accepted | n=int(input())
a=[1]
while sum(a) < n:
a.append(a[-1]+1)
if sum(a) != n:
b=sum(a)-n
a[b-1:b]=[]
print(*a,sep="\n") |
p02797 | s015985514 | Accepted | N, K, S = [int(i) for i in input().split()]
a = S
val = a
ans = []
count = 0
dummy = S+1
if S==1000000000:
dummy = S - 1
for i in range(N):
if(count >= K):
val = dummy
if val > 1000000000:
val = 1000000000
else:
count += 1
val = a
ans += [val]
if count ==K:
val = dummy
count += 1
print(*ans)
|
p03061 | s215521686 | Accepted | from math import gcd
n = int(input())
alst = list(map(int, input().split()))
l_gcd = []
r_gcd = []
tmp = alst[0]
for num in alst[:-1]:
tmp = gcd(tmp, num)
l_gcd.append(tmp)
tmp = alst[-1]
for num in alst[1:][::-1]:
tmp = gcd(tmp, num)
r_gcd.append(tmp)
ans = max(r_gcd[-1], l_gcd[-1])
for r, l in zip(r_gcd[:-1], l_gcd[:-1][::-1]):
tmp = gcd(r, l)
ans = max(ans, tmp)
print(ans)
|
p02688 | s228697697 | Wrong Answer | N, K = map(int, input().split())
d = [0] * K
y = [0] * N
for i in range(K):
d[i]=int(input())
A= list(map(int, input().split()))
for x in A:
y[x-1]+=1
for ans in y:
if ans==0:
print(y.index(ans)+1) |
p03680 | s668857737 | Accepted | n = int(input())
A = [int(input()) for _ in range(n)]
count, current = 0, 1
while current != 2:
current = A[current - 1]
count += 1
if count > n:
count = -1
break
print(count) |
p03211 | s696150246 | Accepted | s = input()
n = len(s)
ans = 999
for i in range(n-2):
d = abs(753 - int(s[i:i+3]))
if d < ans:
ans = d
print(ans) |
p03109 | s218836653 | Wrong Answer | import datetime as d
def main():
s = d.datetime.strptime(input(), "%Y/%m/%d")
s = d.date(s.year, s.month, s.day)
if s <= d.date(2019,4,30):
print("Heisei")
else:
print("TDB")
if __name__ == "__main__":
main() |
p03274 | s255978825 | Accepted | n,k = map(int,input().split())
X = list(map(int,input().split()))
ans = float("inf")
for i in range(n-k+1):
ans = min(ans,abs(X[i])+abs(X[i]-X[i+k-1]),abs(X[i+k-1])+abs(X[i]-X[i+k-1]))
print(ans) |
p03281 | s757129212 | Accepted | n = int(input())
result = 0
for i in range(1,n+1,2):
total = 0
for j in range(1,i+1):
if (i%j == 0):
total += 1
if(total == 8):
result += 1
#print(i,j)
print(result)
|
p02917 | s346118430 | Accepted | N = int(input())
B = list(map(int,input().split()))
cnt=0
cnt+=B[0]
for i in range(len(B)-1):
if B[i]<= B[i+1]:
cnt+=B[i]
elif B[i]> B[i+1]:
cnt+=B[i+1]
cnt += B[-1]
print(cnt) |
p02546 | s918556038 | Accepted | s = input()
if s[-1] == "s":
print(s+"es")
else:
print(s+"s") |
p03239 | s360736851 | Wrong Answer | N,T=map(int,input().split())
nm=1000000
ans=0
for i in range(N):
c,t=map(int,input().split())
if nm>c*t:
ans=c
print(ans)
|
p03075 | s126538746 | Accepted | #copy
a = [int(input()) for i in range(5)]
k = int(input())
print("Yay!" if a[4] - a[0] <= k else ":(") |
p02647 | s827294837 | Accepted | N, K= map(int,input().split())
A = list(map(int,input().split()))
a=A[:]
for _ in range(K):
B=[0]*(N+1)
for i in range(N):
t = a[i]
B[max(i-t,0)] +=1
B[min(i+t+1,N)] -=1
for i in range(N):
B[i+1] += B[i]
a=B[:N]
if min(a)==N:
break
print(*a) |
p02772 | s690740650 | Accepted | N = int(input())
A = list(map(int, input().split()))
ret = 'APPROVED'
for a in A:
if a % 2 == 0:
if a % 3 == 0 or a % 5 == 0:
pass
else:
ret = 'DENIED'
print(ret)
|
p02766 | s431298161 | Accepted | # coding: utf-8
N, K = map(int, input().split())
i = 0
while N > 0:
N = N // K
i += 1
print(i) |
p02705 | s769118788 | Accepted | def resolve():
'''
code here
'''
import math
r = int(input())
print(2*r*math.pi)
if __name__ == "__main__":
resolve()
|
p03131 | s351430576 | Accepted | k,a,b=map(int,input().split())
if a+1<b:
ans=0
if k<=a:
ans=k+1
else:
ans=(a-1)+1
k-=(a-1)
if k%2==0:
#print("even")
ans+=(k//2)*(b-a)
else:
#print("odd")
ans+=(k//2)*(b-a)+1
print(ans)
else:
print(1+k)
|
p03835 | s638870809 | Accepted | def resolve():
K, S = map(int, input().split())
ans = 0
for i in range(K+1):
for j in range(K+1):
if 0 <= S-i-j <= K:
ans += 1
print(ans)
resolve() |
p02596 | s528689295 | Accepted | K = int(input())
if K%2 == 0 or K%5 == 0:
print(-1)
exit(0)
count = 0
an = 0
while True:
an = (10*an + 7) % K
count +=1
if an == 0:
break
print(count) |
p02718 | s517116195 | Accepted | N,M = map(int,input().split())
Alist = list(map(int,input().split()))
cond = sum(Alist) * (1 / (4 * M))
count = 0
for A in Alist:
if A >= cond:
count += 1
if count >= M:
print('Yes')
else:
print('No') |
p02933 | s037050457 | Accepted | a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print("red") |
p02859 | s886694774 | Accepted | def main():
num = int(input())
print(num*num)
main() |
p02780 | s295974849 | Accepted | n, k = map(int, input().split())
p = list(map(int, input().split()))
l = []
num = 0
for j in range(k):
num += p[j]
l.append(num)
for i in range(n-k):
l.append(l[i]-p[i]+p[i+k])
print((max(l)+k)/2) |
p02748 | s302336811 | Accepted | a,b,m=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))
ans=min(x)+min(y)
for i in range(m):
q,w,e=map(int,input().split())
ans=min(ans,x[q-1]+y[w-1]-e)
print(ans) |
p02697 | s203743032 | Accepted | N, M = map(int, input().split())
ans = []
if M % 2 != 0:
for i in range((M + 1)//2):
ans.append((1 + i, M + 1 - i))
for j in range((M - 1)//2):
ans.append((M + 2 + j, 2*M + 1 - j))
else:
for i in range(M//2):
ans.append((1 + i, M + 1 - i))
ans.append((M + 2 + i, 2*M + 1 - i))
for i in range(M):
print(*ans[i]) |
p02880 | s323876165 | Accepted | import itertools
def main():
N = int(input())
if N in [x * y for x, y in itertools.product(range(1, 10), repeat = 2)]:
print("Yes")
else:
print("No")
return
main()
|
p03693 | s868364049 | Accepted | r,g,b = input().split()
ans = int(r+g+b)
if ans % 4 == 0:
print("YES")
else:
print("NO") |
p02771 | s486031155 | Wrong Answer | n = list(map(int, input().split()))
if n[0] == n[1]:
print("No")
exit()
if n[0] == n[2]:
print("No")
exit()
print("Yes") |
p02767 | s155894012 | Accepted | def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0] * 100
m=10**8
for i in range(1,101):
for j,aa in enumerate(x):
ans[i-1] += (aa-i)**2
m=min(m,ans[i-1])
print(m)
if __name__=='__main__':
main()
|
p03385 | s876412485 | Accepted | s=list(input())
if sorted(s)==['a','b','c']:
print('Yes')
else:
print('No') |
p02951 | s996450282 | Wrong Answer | a, b, c = map(int, input().split())
print(c - (a - b)) |
p02983 | s404193496 | Accepted | L, R = map(int, input().split())
if R - L >= 2018:
print(0)
else:
ans = 2019
for i in range(L, R):
for j in range(i + 1, R + 1):
ans = min(ans, i * j % 2019)
print(ans) |
p02639 | s866004861 | Accepted | A = list(map(int, input().split()))
print(A.index(0)+1)
|
p03239 | s569616206 | Accepted | N,T = map(int,input().split())
t_l = []
for i in range(N):
c,t = map(int,input().split())
if t <= T:
t_l.append(c)
if t_l == []:
print('TLE')
else:
print(min(t_l)) |
p03359 | s975175764 | Accepted | a, b = map(int, input().split())
print(a if a <= b else a-1)
|
p03331 | s052830317 | Accepted | N = int(input())
ans = N
for i in range(1,N):
j = N-i
ist = str(i)
jst = str(j)
iarray = list(map(int ,ist))
jarray = list(map(int ,jst))
isum = sum(iarray)
jsum = sum(jarray)
if isum + jsum < ans:
ans = isum + jsum
print(ans)
|
p02613 | s044594896 | Wrong Answer | T = {"AC":0, "WA":0, "TLE":0, "RE":0}
N = int(input())
for i in range(N):
s = input()
T[s] += 1
for i, j in T.items():
print(i,end=" ")
print("×",end=" ")
print(j) |
p03795 | s862108380 | Accepted | n= int(input())
print(800*n - 200*(n//15)) |
p03624 | s119762969 | Accepted | S = input()
S = set(list(S))
alp = [chr(ord('a') + i) for i in range(26)]
for al in alp:
if al in S:
pass
else:
print(al)
exit()
print("None") |
p03778 | s413342338 | Accepted | W,a,b = map(int,input().split())
ans = max(b - (a + W),a - (b + W))
if ans <= 0:
print(0)
else:
print(ans)
|
p03696 | s711568133 | Accepted | N = int(input())
T = input()
S = list(T)
G = True
while G:
G = False
for i in range(1, len(S)):
if S[i - 1] == '(' and S[i] == ')':
S.pop(i)
S.pop(i - 1)
G = True
break
for s in S:
if s == '(':
T = T + ')'
else:
T = '(' + T
print(T) |
p02747 | s219453941 | Wrong Answer | #!/usr/bin/env python3
import re
def main():
S = input()
if re.match(r'(?:hi)+', S):
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
p03456 | s335929969 | Accepted | a,b = map(str, input().split())
num = int(a+b)
if (num ** 0.5).is_integer():
print('Yes')
else:
print('No')
|
p02726 | s642557800 | Accepted | n,x,y=[int(j) for j in input().split()]
l=[[0]*n for i in range(n)]
ans=[0]*n
x-=1
y-=1
s=y-x-1
for i in range(n):
for j in range(n):
if i<j:
ans[min(j-i,abs(i-x)+abs(j-y)+1,)]+=1
print('\n'.join(map(str,ans[1:])))
|
p02608 | s055048248 | Accepted | n = int(input())
ans = [0] * 10010
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
x = i * i + j * j + k * k + i * j + j * k + k * i
if x <= n:
ans[x] += 1
for i in range(1, n+1):
print(ans[i]) |
p02555 | s077624460 | Wrong Answer | s = int(input())
MOD = 10**9 + 7
ans = 0
for i in range(1, s // 3 + 1):
rest = s - 3 * i
ans += pow(rest + 1, i - 1, MOD)
print(ans % MOD) |
p03632 | s225038744 | Wrong Answer | A, B, C, D = map(int, input().split())
if A < C :
print(max(0, B - A - C))
else :
print(max(0, D - C - A))
|
p03352 | s762378530 | Wrong Answer | from collections import Counter
import sys
X = int(input())
num = []
if X == 1:
print(1)
sys.exit()
for j in range(1, X):
tmp = j + 1
lis = []
while tmp != 1:
for i in range(2, tmp+1):
if tmp % i == 0:
lis.append(i)
tmp = tmp // i
break
if len(Counter(lis)) == 1 and len(lis) != 1:
num.append(j+1)
print(max(num))
|
p03494 | s605989879 | Wrong Answer | time = int(input())
num = input().split()
count = 0
flg = True
while flg == True:
# print('a')
for i in range(time):
if int(num[i]) % 2 == 1:
# print('b')
flg = False
break
num[i] = int(num[i]) / 2
count += 1
# print(num)
print(count)
|
p03069 | s686692152 | Accepted | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(input())
S = input()
ans = S.count('.')
score = ans
for c in S:
if c == '.':
score -= 1
else:
score += 1
ans = min(ans, score)
print(ans)
resolve() |
p04033 | s656162370 | Accepted | a,b=map(int,input().split())
if 0<a:
print('Positive')
elif a==0:
print('Zero')
elif a<0 and b>=0:
print('Zero')
elif a<0 and b<0:
if len(range(a,b+1))%2==1:
print('Negative')
else:
print('Positive') |
p03797 | s343042224 | Wrong Answer | n,m= list(map(int, input().split()))
if n>=m*2:
print(m//2)
else:
print(1000000007) |
p02802 | s769662262 | Wrong Answer | N, M = [int(item) for item in input().split()]
ans_list = [input().split() for _ in range(M)]
# print(ans_list)
res_ac = 0
ans_stack = []
wa_stack = []
for q, ans in ans_list:
print(q, ans)
if ans == 'AC':
if q not in ans_stack:
res_ac += 1
ans_stack.append(q)
else:
if q not in ans_stack:
wa_stack.append(q)
res_list = []
for i in wa_stack:
if i in ans_stack:
res_list.append(i)
print(res_ac, len(res_list))
|
p02918 | s947260752 | Wrong Answer | N, K = map(int, input().split())
S = input()
unhappy = 0
if S[0] == "L":
unhappy += 1
if S[-1] == "R":
unhappy += 1
for i in range(1, N-1):
if S[i:i+2] == "RL":
unhappy += 2
if unhappy > 2:
if unhappy > 2*K:
print(N-(unhappy-2*K))
else:
print(N-1)
else:
print(N-1)
|
p03548 | s108841135 | Accepted | X, Y, Z = map(int, input().split())
print((X-Z) // (Y+Z)) |
p03274 | s821386992 | Wrong Answer | N, K = map(int, input().split())
X = list(map(int, input().split()))
ans = 10**19
for i in range(N-K+1):
num = X[K+i-1] + abs(X[i]*2)
if num < ans:
ans = num
print(ans)
|
p02695 | s421167321 | Accepted | from itertools import combinations_with_replacement
inputs = open(0).readlines()
n, m, q = map(int, inputs[0].split())
ABCD = [list(map(int, x.split())) for x in inputs[1:]]
ans = 0
for x in combinations_with_replacement(range(1, m+1), n):
e = 0
for a, b, c, d in ABCD:
if x[b-1] - x[a-1] == c:
e += d
ans = max(e, ans)
print(ans) |
p02594 | s598637678 | Accepted | if int(input()) < 30:
print("No")
else:
print("Yes")
|
p02771 | s775390410 | Accepted | A, B, C = map(int, input().split())
if A == B == C or A != B != C != A:
print("No")
else:
print("Yes") |
p02880 | s512446605 | Accepted | n = int(input())
l = [i*j for i in range(1,10) for j in range(1,10)]
if n in l:
print('Yes')
else:
print('No') |
p03565 | s116814486 | Accepted | S = input()
T = input()
len_S, len_T = len(S), len(T)
ans = []
for i in range(len_S-len_T+1):
f = True
for j in range(len_T):
if S[i+j] != T[j] and S[i+j] != '?':
f = False
break
if f:
s = S[:i] + T + S[i+j+1:]
ans.append(s.replace('?', 'a'))
if len(ans) == 0:
print('UNRESTORABLE')
else:
ans.sort()
print(ans[0]) |
p03161 | s221049971 | Wrong Answer | N,K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minToatalCostList = [100000 for i in range(N)]
minToatalCostList[0] = 0
for i in range(1,N) :
for j in range(1,K+1) :
if j > i or minToatalCostList[i] == 0 :
break
else :
minToatalCostList[i] = min(minToatalCostList[i], (abs(h[i] - h[i-j]) + minToatalCostList[i-j] ))
print(minToatalCostList[N-1])
|
p02659 | s809772142 | Accepted | a,b=map(int,input().replace(".", "").split())
print(a*b//100)
|
p03645 | s963479252 | Accepted | n, m = map(int, input().split())
c = [[] for _ in range(n+1)]
for i in range(m):
a, b = map(int, input().split())
c[a].append(b)
c[b].append(a)
for i in c[1]:
if n in c[i]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') |
p03474 | s315256595 | Wrong Answer | a, b = map(int, input().split())
s = input()
if s[a] == '-':
if s[:a].isdecimal() and s[-b:].isdecimal:
print('Yes')
else:
print('No')
else:
print('No') |
p02775 | s807851526 | Accepted | s = input()
ans = 0
carry = 0
for i in range(len(s) - 1, -1, -1):
c = int(s[i])
if c + carry < 5:
ans += c + carry
carry = 0
elif c + carry == 5:
if i > 0 and int(s[i - 1]) >= 5:
ans += 5
carry = 1
else:
ans += 5
carry = 0
else:
ans += 10 - c - carry
carry = 1
if carry:
ans += 1
print(ans)
|
p02988 | s923160379 | Wrong Answer | n = int(input())
p = list(map(int,input().split()))
count = 0
for i in range(1,n):
l = p[i-1:i+2]
ls = sorted(l)
if l[1] == ls[1]:
count += 1
print(count) |
p03126 | s544975645 | Accepted | n,m = map(int, input().split())
s = list(map(int, input().split()))
s.pop(0)
for i in range(n-1):
k = set(list(map(int, input().split()))[1:])
s = set(s) & k
print(len(s)) |
p02767 | s962850761 | Accepted | N = int(input())
X = list(map(int, input().split()))
P = round(sum(X) / N)
ans = 0
for x in X :
ans += (P - x) ** 2
print(ans) |
p03352 | s293494380 | Accepted | X = int(input())
dammy=[]
for b in range(1,101):
for p in range(2,10):
dammy.append(b**p)
dammy.sort()
for i in range(101):
if dammy[i]>X:
print(dammy[i-1])
break |
p02572 | s657123196 | Accepted | n=int(input())
c = list(map(int, input().rstrip().split()))
ans=0
b=10**9+7
sum1=0
for i in range(n):
ans=(ans+c[i]*sum1)%b
sum1=(sum1+c[i])%b
print(ans) |
p03592 | s394561167 | Accepted | N,M,K=map(int,input().split())
ans='No'
i=0
while i<=N:
j=0
while j<=M:
if M*i+N*j-2*i*j==K:
ans='Yes'
j+=1
i+=1
print(ans) |
p03012 | s486124066 | Accepted | n,ais = int(raw_input()),map(int, raw_input().split(' '))
total = sum(ais)
#ais.sort()
cumul = 0
i,j = 0,0
m = abs(total)
while(j< len(ais)):
while(j < len(ais) and ais[j] == ais[i]):
cumul += ais[j]
j+=1
i = j
m = min(m, abs(2 *cumul - total))
print m |
p03543 | s602013824 | Accepted | a,b,c,d = input()
if a == b ==c or b == c ==d:
print('Yes')
else:
print('No') |
p03481 | s397395494 | Wrong Answer | from math import log2
X, Y = map(int, input().split())
print(int(log2(Y/X)+1))
|
p03633 | s252300126 | Accepted | def gcd(x,y):
while y>0:
x,y = y,x%y
return x
N = int(input())
T = [int(input()) for _ in range(N)]
ans = T[0]
for i in range(1,N):
a = gcd(ans,T[i])
ans = (ans//a)*T[i]
print(ans) |
p02675 | s162629175 | Accepted |
def solve():
N = int(input()[-1])
if N in [2,4,5,7,9]:
print('hon')
elif N in [0,1,6,8]:
print('pon')
elif N in [3]:
print('bon')
if __name__ == '__main__':
solve()
|
p03838 | s280098386 | Wrong Answer | x, y = map(int, input().split())
if x*y < 0: print(abs(abs(x)-abs(y))+1)
elif x <= y: print(y-x)
else: print(x-y+2) |
p02688 | s049364022 | Accepted | N, K = map(int, input().split())
L = [0] * N
for i in range(K):
d = int(input())
A = list(map(int, input().split()))
for j in A:
L[j-1] += 1
print(len([i for i in L if i == 0])) |
p03495 | s068528255 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
a2=sorted(a)
kindnum=[]
kind=1
now=a2[0]
ren=1
for i in range(1,n):
if now!=a2[i]:
kindnum.append(ren)
kind+=1
now=a2[i]
ren=1
continue
ren+=1
kindnum.append(ren)
kindnum2=sorted(kindnum)
if kind<=k:
print(0)
else:
ans=0
for i in range(kind-k):
ans+=kindnum2[i]
print(ans) |
p02775 | s046555089 | Accepted | N = input()
L = len(N)
ans = 0
t = 0
for i in range(L-1,-1,-1):
n = int(N[i])+t
if n == 5:
if i > 0 and int(N[i-1]) >= 5:
ans += 10-n
t = 1
continue
if n <= 5:
ans += n
t = 0
else:
t = 1
ans += 10-n
if t==1:
ans += 1
print(ans) |
p03075 | s090037565 | Wrong Answer | x=[int(input()) for _ in range(6)]
print('Yay!' if bool((x[k]-x[i]<=x[5]) for i in range(5) for k in range(i+1, 5)) else ':(') |
p02755 | s958993826 | Accepted | import math
A, B = map(int, input().split())
b1 = B*10
b2 = b1 + 10
for i in range(b1, b2):
if math.floor(i*0.08) == A:
print(i)
break
if i == b2-1:
print(-1) |
p02600 | s039774010 | Accepted | a = int(input())
print(10-int(a/200)) |
p02923 | s933815786 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
def solve():
N = int(input())
H = list(map(int, input().split()))
ans = 0
count = 0
now = H[0]
for i in range(1, N):
if H[i] <= now:
count += 1
else:
ans = max(ans, count)
count = 0
now = H[i]
else:
ans = max(ans, count)
print(ans)
if __name__ == '__main__':
solve()
|
p02683 | s315816733 | Wrong Answer | n,m,x = map(int,input().split())
a = [list(map(int,input().split())) for i in range(n)]
b = [sum(j[1:])/a[k][0] for k,j in enumerate(a)]
c = sorted(b,reverse=True)
l = [0]*m
p = 0
for i in c:
if all([i>=x for i in l]):
break
f = a[b.index(i)]
p+=f[0]
for k,j in enumerate(f[1:]):
l[k]+=j
if all([i>=x for i in l]):
print(p)
else:
print(-1) |
p02627 | s938171318 | Accepted | a = input()
if a.islower():
print("a")
else:
print("A")
|
p03281 | s048859833 | Accepted | N = int(input())
res = 0
for n in range(1, N+1, 2):
cnt = 0
for i in range(1, n+1):
if n % i == 0:
cnt += 1
if cnt == 8:
res += 1
print(res) |
p03524 | s827798066 | Accepted | S = input()
n = [0] * 3
d = {'a':0, 'b':1, 'c':2}
for s in S:
n[d[s]] += 1
if max(n) - min(n) > 1:
print('NO')
else:
print('YES')
|
p02727 | s649118373 | Wrong Answer | x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())))[a-x:]
q = sorted(list(map(int, input().split())))[a-y:]
r = sorted(list(map(int, input().split()))+p+q)[::-1]
print(sum(r[:x+y]))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.