problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02791 | s415175231 | Accepted | N=int(input())
List=list(map(int,input().split()))
counter=0
mj=N
for i in range(N):
if mj>List[i]:
mj=List[i]
if List[i]==mj:
counter+=1
print(counter) |
p02714 | s147796334 | Accepted | N = int(input())
S = input()
r = 0
g = 0
b = 0
for s in S:
if s == "R":
r += 1
if s == "G":
g += 1
if s == "B":
b += 1
res = r * g * b
for i in range(N):
for j in range(i + 1, N):
if S[i] != S[j]:
if j * 2 - i < N:
if S[j * 2 - i] != S[i] and S[j * 2 - i] != S[j]:
res -= 1
print(res)
|
p03416 | s925371084 | Accepted | a, b = map(int, input().split())
cnt = 0
for i in range(a, b+1):
si = str(i)
if si[0] == si[4] and si[1] == si[3]:
cnt += 1
print(cnt)
|
p03835 | s138716217 | Accepted | k, s = map(int, input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
z = (s - i - j)
if 0<= z <= k:
ans += 1
print(ans)
|
p03137 | s516078481 | Accepted | N, M = map(int, input().split())
X = list(map(int, input().split()))
if N >= M:
print(0)
exit()
X = sorted(X)
# print(X)
d = [X[i + 1] - X[i] for i in range(len(X) - 1)]
d = sorted(d)
# print('d', d)
if N == 1:
print(sum(d))
else:
print(sum(d[:-N + 1]))
|
p03433 | s202956594 | Accepted | try:
N = int(input())
A = int(input())
if N%500!=0:
mod = N%500
print('Yes' if A>mod else 'No')
else:
print('Yes')
except EOFError:
pass |
p03759 | s629289968 | Wrong Answer | a, b, c = map(int,input().split())
print("YES" if abs(b-a) == abs(c-b) else "NO") |
p03998 | s085217940 | Accepted | A = input()
B = input()
C = input()
check = A[0]
A = A[1:]
while True:
if check == "a":
if len(A) == 0:
print("A")
exit()
check = A[0]
A = A[1:]
elif check == "b":
if len(B) == 0:
print("B")
exit()
check = B[0]
B = B[1:]
elif check == "c":
if len(C) == 0:
print("C")
exit()
check = C[0]
C = C[1:] |
p03254 | s165507117 | Accepted | n,x=map(int,input().split())
a=sorted(list(map(int,input().split())))
ans=0
for i in range(n):
if x>=a[i]:
ans+=1
x-=a[i]
else:
break
if ans == n:
if x!=0:
ans-=1
print(ans) |
p02744 | s520660429 | Wrong Answer | n = int(input())
arr= ['a','b','c','d','e','f','g','h','i','j']
def f(x, s):
if x == n:
print(s)
return
for i in range(n):
f(x+1, s+arr[i])
if s+arr[i] == "".join(arr[:i+1]):
break
f(0, "") |
p03417 | s266164828 | Accepted | n, m = map(int, input().split())
if n > 1 and m > 1:
ans = n * m - 2 * (n + m) + 4
elif n > 1:
ans = n - 2
elif m > 1:
ans = m - 2
else:
ans = 1
print(ans) |
p04012 | s067636602 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
w=list(input())
w.sort()
if len(w)%2!=0:
print('No')
else:
for i in range(0,len(w)-2,2):
if w[i]!=w[i+1]:
print('No')
break
print('Yes')
resolve() |
p03817 | s986726883 | Wrong Answer | x = int(input())
if x / 11 < 1:
ans = 1
if x / 5 >= 1:
ans = 2
else:
ans = x // 11 * 2 + 1
print(ans) |
p02661 | s704275819 | Accepted | n = int(input())
A, B = [0] * n, [0] * n
for i in range(n):
A[i],B[i] = map(int, input().split())
A.sort()
B.sort()
ans = 0
if n % 2 == 1:
ans = B[n // 2] - A[n // 2] + 1
else:
large = B[n // 2] + B[n // 2 - 1]
small = A[n // 2] + A[n // 2 - 1]
ans = large - small + 1
print(ans)
|
p02682 | s271993959 | Accepted | a, b, c, k = list(map(int, input().split()))
print(min(a, k) - max((k - (a + b), 0)))
|
p03611 | s173660746 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
n = int(input())
a = list(map(int, input().split()))
l = [0]*(10**5 + 10)
for i in set(a):
for j in a:
if j - 1 <= i <= j + 1:
l[j] += 1
print(max(l))
main() |
p03493 | s155968575 | Accepted | s = input()
cnt = 0
for i in range(3):
if(s[i] == "1"):
cnt += 1
print(cnt) |
p03760 | s451360276 | Accepted | def solve():
o = input()
e = input()
try:
for i in range(max(len(o), len(e))):
print(o[i], end='')
print(e[i], end='')
except:
pass
if __name__ == "__main__":
solve()
|
p02801 | s331128875 | Wrong Answer | # -*- coding: utf-8 -*-
import sys
def main():
alist = [
"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",
]
for s in sys.stdin:
i = 0
for a in alist:
if s == a:
print(alist[i+1])
i += 1
if __name__ == '__main__':
main()
|
p02647 | s895276221 | Wrong Answer | n,k=map(int,input().split())
d_ls=[int(z) for z in input().split()]
b=[0]*n
for kk in range(k):
for i,d in enumerate(d_ls):
i_front=i+d+0.5
i_back=i-d-0.5
for ii,dd in enumerate(d_ls):
if i_front>=ii>=i_back:
b[ii]+=1
for iii,bbb in enumerate(b):
d_ls[iii]=bbb
bl=[str(a) for a in b]
bl=" ".join(bl)
print(bl)
|
p03721 | s332925911 | Accepted | N,K = map(int,input().split())
List=[list(map(int,input().split())) for i in range(N)]
List.sort()
cnt = 0
for i in range(len(List)):
cnt = cnt + List[i][1]
if cnt >= K:
ans = List[i][0]
break
print(ans) |
p03607 | s415059507 | Wrong Answer | n = int(input())
ls = []
for i in range(n):
a = int(input())
ls.append(a)
ls.sort()
ans = 0
k = -1
count = 0
for i in range(n):
if ls[i] != k:
if count % 2 == 1:
ans += 1
count = 1
k = ls[i]
else:
count += 1
print(ans)
|
p02723 | s959315237 | Wrong Answer | s = str(input())
if s[2] == s[3]:
if s[4] == s[5]:
print("Yes")
else:
print("No")
|
p02702 | s532429350 | Accepted | import sys
input = sys.stdin.readline
from collections import *
S = input()[:-1]
cnt = defaultdict(int)
cnt[0] = 1
now = 0
ans = 0
for i in range(len(S)-1, -1, -1):
now = (int(S[i])*pow(10, len(S)-1-i, 2019)+now)%2019
ans += cnt[now]
cnt[now] += 1
print(ans) |
p02664 | s404204008 | Accepted | T = list(input())
if len(T) == 1:
if T[0] == "?":
print("D")
else:
print("".join(T))
else:
for i in range(len(T)):
if i > 0 and T[i] == "?" and T[i-1] == "P":
T[i] = "D"
elif i < len(T) -1 and T[i] == "?" and (T[i+1] == "D" or T[i+1] == "?"):
T[i] = "P"
elif T[i] == "?":
T[i] = "D"
print("".join(T)) |
p03211 | s666112685 | Accepted | S=input()
diff=[0]*(len(S)-2)
for i in range(len(S)-2):
diff[i]=abs(753-int(S[i:i+3]))
print(min(diff)) |
p02706 | s747930535 | Wrong Answer | n,m = list(map(int, input().split()))
hoge = list(map(int, input().split()))
wa = sum(hoge)
if wa >= n:
print(-1)
else:
print(n - wa) |
p02873 | s712660824 | Accepted | S = input()
ans = [0] * (len(S) + 1)
for i in range(len(S)):
if S[i] == '<':
ans[i + 1] = ans[i] + 1
for i in range(len(S)-1, -1, -1):
if S[i] == '>':
ans[i] = max(ans[i + 1] + 1, ans[i])
print(sum(ans))
|
p02554 | s734839946 | Accepted | N = int(input())
ans = 10 ** N - (9 ** N + 9 ** N - 8 ** N)
ans = ans % (10 ** 9 + 7)
print(ans)
|
p02922 | s783265940 | Accepted | A, B = map(int, input().split())
if (B - 1) % (A - 1) == 0:
ans = (B - 1) // (A - 1)
else:
ans = (B - 1) // (A - 1) + 1
print(ans) |
p03799 | s482098825 | Accepted | n,m = map(int, input().split())
if n > (m+n)/3:
print(m//2)
exit()
ans = n
m -= 2*n
ans += m//4
print(ans) |
p02570 | s322966683 | Wrong Answer | try:
D = int(input())
T = int(input())
S = int(input())
except:
print('Error')
else:
tmp = T * S
if D > tmp:
print('No')
else:
print('Yes') |
p02935 | s979334251 | Wrong Answer | import sys
import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, *H = map(int, read().split())
cnt = 1
H.sort()
ans = H[0]
print(H)
for i in H[1:]:
print(ans, cnt)
ans += cnt * i
cnt *= 2
print(ans, cnt)
print(ans / cnt)
|
p02677 | s665502781 | Wrong Answer | import math
a,b,h,m=map(int, input().split())
d = 30*(h+m/60)-6*m
e = 360-d
f = int(min(d,e))
y = math.cos(math.radians(f))
x = a**2+b**2-2*a*b*y
print(math.sqrt(x))
|
p02730 | s262983141 | Accepted | s = input()
a = s[:int((len(s) - 1) / 2)]
b = s[int(((len(s) + 3) / 2) - 1):]
if a == a[::-1] and b == b[::-1] and s == s[::-1]:
print('Yes')
else:
print('No') |
p02699 | s711765318 | Accepted | S,W = map(int,input().split())
if(S>W):
print("safe")
else:
print("unsafe") |
p02705 | s316195004 | Wrong Answer | import math
R=float(input())
L=2*math.pi*R |
p02694 | s651716712 | Accepted | X = int(input())
a = 100
i = 0
while a < X:
i += 1
a += a // 100
print(i) |
p02583 | s499386790 | Accepted | n = int(input())
l = list(map(int, input().split()))
l = sorted(l)
count = 0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1, n):
if l[i] != l[j] and l[j] != l[k] and l[i] != l[k] and l[k] < l[i] + l[j]:
count += 1
print(count) |
p02783 | s593279777 | Accepted | import math
H,A=map(int,input().split())
print(math.ceil(H/A)) |
p02578 | s887097476 | Accepted | n=int(input())
a=[int(i) for i in input().split()]
max_height=0
ans=0
for i in a:
if max_height>i:
ans+=max_height-i
else:
max_height=i
print(ans)
|
p03860 | s476465098 | Accepted | x=input()
print("A"+x[8]+"C")
|
p03437 | s150667668 | Accepted | x,y=map(int,input().split())
print(-(x%y==0) or x) |
p02881 | s650360580 | Wrong Answer | n = int(input())
#約数
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
list_n = make_divisors(n)
a = len(list_n)
ans = []
for i in range(0, a-1, 2):
ans.append(list_n[i]+list_n[i+1])
ans.sort()
print(ans[0]-2) |
p03379 | s766571179 | Accepted | n = int(input())
x = list(map(int, input().split()))
y = x
y = sorted(y)
a = y[n // 2 -1]
b = y[n // 2]
for i in range(n):
if x[i] <= a:
print(b)
elif x[i] >= b:
print(a) |
p02797 | s833290094 | Accepted | N,K,S=map(int,input().split())
if S==10**(9):
ans=[S-1]*N
else:
ans=[10**(9)]*N
for i in range(K):
ans[i]=S
print(*ans) |
p03252 | s115710083 | Accepted | s=input()
t=input()
S=sorted(map(s.count,set(s)))
T=sorted(map(t.count,set(t)))
print("Yes"if S==T else "No") |
p03289 | s745921729 | Accepted | s = input()
def has_A(x):
if x[0] == 'A': return True
return False
def has_C(x):
if x[2:-1].count('C') == 1: return True
return False
def is_lower_this_case(x):
i = x.index('C')
if x[1:i].islower() and x[i+1:].islower():
return True
return False
if has_A(s) and has_C(s) and is_lower_this_case(s):
print('AC')
else:
print('WA') |
p03797 | s326471760 | Wrong Answer | N,M = [int(i) for i in input().split()]
S = 0
M -= 2*N
S = N + M // 4
print(S)
|
p02948 | s272246091 | Wrong Answer | n,m=map(int,input().split())
X=[]
for i in range(n):
a,b=map(int,input().split())
X.append([a,b])
Y=sorted(X,key=lambda x:(x[1]), reverse=True)
ans=0
d=0
for i in range(n):
if d+Y[i][0]<=m:
ans+=Y[i][1]
d+=1
print(ans) |
p02683 | s243207935 | Accepted | import numpy as np
import itertools
N, M, X = map(int, input().split())
CA = []
cost = 12 * (10**5) + 1
for _ in range(N):
CA.append(list(map(int, input().split())))
for T in itertools.product([1,0], repeat = N):
Flag = True
ans = np.zeros(M+1)
for i in range(N):
if T[i] == 1:
ans += np.array(CA[i])
for j in range(1, M+1):
if ans[j] < X:
Flag = False
break
if Flag:
cost = min(cost, ans[0])
if cost == 12 * (10**5) + 1:
print(-1)
else:
print(int(cost)) |
p03759 | s055628588 | Accepted | a,b,c=[int(i) for i in input().split()]
if b-a==c-b:
print("YES")
else:
print("NO") |
p03962 | s894623745 | Accepted | print(len(set(input().split()))) |
p03605 | s632232677 | Accepted | s = str(input())
l = len(s)
if s[0]=='9' or s[-1]=='9':
print("Yes")
else:
print("No")
|
p03698 | s186741562 | Wrong Answer | S = input().strip()
print("Yes" if len(S) == len(set(list(S))) else "No")
|
p02899 | s934178583 | Accepted | num = int(input())
a_list = list(map(int, input().split(" ")))
ans_list = [0] * num
for i in range(num):
ans_list[a_list[i]-1] = i+1
for i in range(num-1):
print(ans_list[i], end=" ")
print(ans_list[num-1]) |
p02688 | s245821679 | Accepted | def main():
n,k = map(int,input().split(" "))
l =[True]*n
for i in range(k):
d = int(input())
As = list(map(int,input().split(" ")))
for A in As:
l[A-1] = False
print(l.count(True))
main() |
p03317 | s734135688 | Accepted | from math import ceil
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(ceil((N - 1) / (K - 1)))
|
p02743 | s666219785 | Wrong Answer | a,b,c = map(float,input().split())
if 4*a*b < (c-a-b)**2:
print('Yes')
else:
print('No') |
p02706 | s245481775 | Accepted | N, M = map(int, input().split())
List = list(map(int, input().split()))
if sum(List) <= N:
print(N-sum(List))
else:
print(-1) |
p02843 | s738902474 | Accepted | X=int(input())
Y=X%100
Z=X//100
if Y>(Z*5):
print(0)
else:
print(1)
|
p02628 | s019899094 | Wrong Answer | string = input()
if string.isupper() == True:
print("A")
else:
print("a")
|
p02861 | s923771162 | Wrong Answer | import math
n=int(input())
p=[]
for i in range(n):
p.append(list(map(int,input().split())))
#print(p)
ans=0
for i in range(n):
for j in range(n):
if i!=j:
print(i,j)
ans+=math.sqrt((p[j][0]-p[i][0])**2+(p[j][1]-p[i][1])**2)
ans/=n
print(ans)
|
p03254 | s746018009 | Wrong Answer | N, x = [int(z) for z in input().split()]
children = [int(z) for z in input().split()]
children.sort()
cnt = 0
for i in children:
if x - i < 0:
break
else:
x -= i
cnt += 1
print(cnt)
|
p02718 | s167899622 | Accepted | N, M = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
X = A[M-1]
Y = sum(A)
th = Y / (4*M)
if X >= th:
print('Yes')
else:
print('No') |
p02786 | s487662364 | Wrong Answer | # coding utf-8
import math
H = int(input())
max_h = 10**12
n = 1
while H > 1:
H //= 2
n += 1
print(H)
print((2**n)-1)
|
p02879 | s425695528 | Accepted | a,b = map(int,input().split())
print(a*b if a < 10 and b < 10 else -1) |
p03624 | s856701090 | Accepted | S = input()
s = set(S)
if len(s) == 26:
print('None')
else:
for i in 'abcdefghijklmnopqrstuvwxyz':
if i not in S:
print(i)
break
|
p02767 | s497742304 | Accepted | N = int(input())
X = list(map(int,input().split()))
X.sort()
m=10**18
for p in range(102):
s=0
for i in range(N):
s+= (X[i]-p)**2
if(m>s): m=s
print(m) |
p02947 | s312118509 | Accepted | def main():
N = int(input())
s = "".join(sorted(input()))
dic = {s:1}
ans = 0
for _ in range(N-1):
s = "".join(sorted(input()))
if s in dic:
dic[s] += 1
else:
dic[s] = 1
for i in dic.values():
ans += (i*(i-1))//2
return ans
if __name__ == '__main__':
print(main()) |
p02603 | s619114981 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cash = 1000
kabu = 0
for i,j in zip(a[:-1], a[1:]):
if i < j:
kabu = cash // i
cash = cash - i * kabu
else:
cash += kabu * i
kabu = 0
print(cash + kabu * a[-1]) |
p03163 | s029656162 | Accepted | n, w = map(int, input().split())
things = []
things.append([0,0])
things += [list(map(int, input().split())) for _ in range(n)]
dp = [[0 for _ in range(w + 1)] for _ in range(n + 1)]
def do_dp():
for i,thing in enumerate(things):
dp_1 = dp[i-1]
for j in range(1, w + 1):
dp[i][j] = dp_1[j-thing[0]] + thing[1] if (j - thing[0]) >= 0 else dp_1[j]
dp[i][j] = max(dp[i][j], dp_1[j])
do_dp()
print(dp[n][w])
|
p03633 | s701492472 | Accepted | import math
from functools import reduce
n = int(input())
t = list(int(input()) for _ in range(n))
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
print(lcm_list(t))
|
p02727 | s188070967 | Accepted | from sys import stdin
input = stdin.readline
x, y, a, b, c = list(map(int, input().split()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
a = p[:x] + q[:y] + r
a.sort(reverse=True)
print(sum(a[:x+y])) |
p02689 | s088389622 | Accepted | N,M = map(int,input().split())
H = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(M)]
load = [[] for _ in range(N)]
ans = 0
for a,b in AB:
a-=1
b-=1
load[a].append(b)
load[b].append(a)
for i,lis in enumerate(load):
if len(lis)==0:
ans+=1
else:
judge = True
for j in lis:
if H[i]<=H[j]:
judge = False
break
if judge:
ans+=1
print(ans) |
p02658 | s457505480 | Accepted | def main():
N=int(input())
A=[int(_) for _ in input().split()]
if 0 in A:
print(0)
exit()
ans = 1
for a in A:
ans *= a
if ans > 10**18:
print(-1)
exit()
print(ans)
main()
|
p02583 | s335327583 | Accepted | n = int(input())
l = list(map(int,input().split()))
count = 0
for i in range(n-2):
for j in range(i+1,n-1):
for k in range(j+1,n):
if l[i]!=l[j] and l[j]!=l[k] and l[k]!=l[i]:
if ((l[i]) + (l[j])) > (l[k]) and ((l[k]) + (l[j])) > (l[i]) and ((l[i]) + (l[k])) > (l[j]):
count += 1
print(count)
|
p02630 | s379172757 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
dp=[0]*(10**5+1)
for i in range(1,10**5+1):
dp[i]=a.count(i)
|
p02639 | s521973474 | Accepted | num = list(map(int, input().split(" ")))
x = 1
for i in num:
if i == 0:
print(x)
else:
x += 1 |
p02957 | s120965458 | Wrong Answer | a,b=map(int,input().split())
x=(a+b)/2
if x.is_integer()==1:print(x)
else:print("IMPOSSIBLE") |
p04020 | s454011378 | Wrong Answer | N=int(input())
A=[0]*N
for i in range(N):
A[i]=int(input())
B = [0]*N
B[0]= A[0] %2
ans= A[0]//2
for i in range(1,N):
#print(i,A[i],B[i-1], (B[i-1]+A[i])//2 )
pair= (B[i-1]+A[i])//2
ans += pair
if (A[i]+B[i-1]) %2==1 and A[i]%2==1:
B[i] = 1
else:
B[i] = 0
#print(ans,B)
print(ans) |
p03069 | s386856478 | Wrong Answer | n = int(input())
s = input()
flg = False
count = 0
for l in s:
if l=="#":
flg = True
else:
if flg:
count+=1
print(count) |
p02897 | s956455127 | Wrong Answer | a=int(input())
b=a//2+1
print(b/a) |
p02963 | s382798347 | Accepted | s = int(input())
x2 = 10**9
y2 = 1
x3 = s % (10**9)
y3 = s // (10**9)
if x3 > 0:
x3 = 10**9 - s % (10**9)
y3 = s // (10**9) + 1
print("0 0 " + str(10**9) + " 1 " + str(x3) + " " + str(y3)) |
p03352 | s543653303 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
x = int(readline())
s = set()
for i in range(1, 1001):
for j in range(2, 16):
if i ** j <= x:
s.add(i ** j)
else:
break
l = list(s)
l.sort(reverse=True)
print(l[0])
if __name__ == '__main__':
main()
|
p02724 | s723147008 | Accepted | import math
x = int(input())
gohyoku = math.floor(x/500)
goen = math.floor((x-500*gohyoku)/5)
print(gohyoku*1000+goen*5) |
p02862 | s489246016 | Wrong Answer | MOD = 10**9 + 7
def fac(n):
ans = 1
for i in range(1, n + 1):
ans = ans * i % MOD
return ans
X, Y = map(int, input().split())
if (2 * X - Y) % 3 != 0:
print(0)
else:
a, b = (2 * Y - X) // 3, (2 * X - Y) // 3
print((fac(a + b) * pow(fac(a), MOD-2, MOD) * pow(fac(b), MOD-2, MOD)) % (10**9 + 7)) |
p03861 | s465645420 | Accepted | a,b,x = map(int,input().split())
ans = b//x -(a-1)//x
print(ans) |
p03162 | s634387784 | Wrong Answer |
N = int(input())
x, y, z = 0, 0, 0
dp = [[0, 0, 0] for _ in range(N)]
for i in range(1, N):
a, b, c = map(int, input().split())
dp[i][0] = max(dp[i-1][0]+b, dp[i-1][0]+c)
dp[i][1] = max(dp[i-1][1]+a, dp[i-1][1]+c)
dp[i][2] = max(dp[i-1][2]+a, dp[i-1][2]+b)
print(max(dp[-1]))
|
p02598 | s316241713 | Accepted | from math import ceil, floor
n,k = map(int,input().split())
a = list(map(int,input().split()))
l = 0
r = 10**9
m = (l+r)//2+1
for i in range(100):
# print(l,m,r)
cnt = 0
for j in a:
cnt += (ceil(j/m)-1)
# print(cnt)
# print(l,m,r,cnt)
if cnt <= k:
r = m
m = ceil((l+r)/2)
else:
l = m
m = ceil((l+r)/2)
print(m)
|
p02842 | s403008257 | Wrong Answer | n = int(input())
for i in range(1,n):
if(int(i*1.08) == n):
print(i)
exit()
print(":(") |
p03076 | s637791849 | Wrong Answer | A = [int(input()) for i in range(5)]
d = 9
ans = 0
for a in A:
ans += 0--a//10*10
if a%10:
d = min(d,a%10)
print(ans - 10 + d) |
p03145 | s385114062 | Wrong Answer | a,b,c=[int(i) for i in input().split()]
print((a*b)/2) |
p02556 | s816924823 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
def main():
N = int(input())
d = []
e = []
for k in range(N):
x, y = map(int,input().split())
d.append(x+y)
e.append(x-y)
d.sort()
e.sort()
print(max(e[-1]-e[0],d[-1]-d[0]))
if __name__ == '__main__':
main()
|
p03785 | s990693387 | Accepted | import sys
input = sys.stdin.readline
N, C, K = map(int, input().split())
T = sorted([int(input()) for _ in range(N)])
tmp, cnt, ans = 0, 0, 0
for t in T:
if not tmp:
tmp = t + K
cnt += 1
ans += 1
elif tmp < t or cnt == C:
tmp = t + K
cnt = 1
ans += 1
else:
cnt += 1
print(ans)
|
p03695 | s595048672 | Accepted | from collections import defaultdict
import sys
input = sys.stdin.readline
def main():
n = int(input())
A = list(map(int, input().split()))
color = defaultdict(int)
g = 0
for a in A:
if a >= 3200:
g += 1
continue
for j in range(8):
if 400 * j <= a < 400 * (j + 1):
color[j] = 1
print(max(1, len(color)), len(color) + g)
if __name__ == '__main__':
main()
|
p02947 | s085315794 | Accepted | import math
import sys
input = sys.stdin.readline
N=int(input())
d={}
for i in [0]*N:
s = ''.join(sorted(input().strip()))
if s in d:
d[s]+=1
else:
d[s]=1
e=0
for v in d.values():
if v>=2:
e+=int(v*(v-1)/2)
print(e) |
p03379 | s010129901 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=sorted(a)
for i in a:
if i<=b[(n//2)-1]:
print(b[n//2])
else:
print(b[(n//2)-1]) |
p03827 | s774913258 | Wrong Answer | s=int(input())
t=str(input())
t=list(t)
ans=0
temp=-999
for i in range(0,s):
if t[i]=="I":
ans=ans+1
else:
ans=ans-1
temp=max(ans,temp)
print(temp) |
p02958 | s850937989 | Accepted | n = int(input())
p = list(map(int,input().split()))
count = 0
p_new = sorted(p)
for i in range(n):
if p_new[i] != p[i]:
count += 1
if count==2 or count==0:
print("YES")
else:
print("NO")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.