problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03077
|
s371859591
|
Accepted
|
import math
n = [int(input()) for _ in range(6)]
print(math.ceil((n[0]/ min(n[1:]))) + 4)
|
p03041
|
s719807691
|
Wrong Answer
|
n,k = map(int,input().split())
s = input()
kb = ''
if k >= 2:
kb = s[:k-2]
kk = s[k-1]
ka = ''
if k < len(s):
ka = s[k:]
if kk == 'A':
print(kb + 'a' + ka)
exit()
if kk == 'B':
print(kb + 'b' + ka)
exit()
if kk == 'C':
print(kb + 'c' + ka)
exit()
|
p02995
|
s601717365
|
Wrong Answer
|
a,b,c,d=map(int, input().split())
tc = b//c-a//c
td = b//d-a//d
tcd = b//(c*d)-a//(c*d)
print(b-a+1-tc-tc+tcd)
|
p03449
|
s372445675
|
Accepted
|
from itertools import accumulate
N = int(input())
A1 = [0] + list(accumulate(map(int, input().split())))
A2 = [0] + list(accumulate(map(int, input().split())))
ans = 0
for i in range(1, N + 1):
cur = A1[i - 1]
if i < N:
cur += A2[N] - A2[i]
ans = max(ans, cur + A1[i] - A1[i - 1] + A2[i] - A2[i - 1])
print(ans)
|
p02582
|
s636641917
|
Accepted
|
s=str(input())
R=s.count('R')
if s=='RSR':
print(1)
else:
print(R)
|
p03910
|
s866818872
|
Wrong Answer
|
n = int(input())
wa = 0
if n == 1:
print(1)
else:
for i in range(1, n):
if 2 * i >= n - wa:
print(n - wa)
break
else:
wa += i
print(i)
|
p03150
|
s806682979
|
Accepted
|
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
S = input()
L = len(S)
ans = 'NO'
for i in range(0,8):
s = S[:i] + S[L-7+i:]
if s == 'keyence':
ans = 'YES'
print(ans)
if __name__ == '__main__':
main()
|
p02947
|
s954258733
|
Accepted
|
import collections
N = int(input())
S = [sorted(input()) for _ in range(N)]
Ssrt = []
for s in S:
s = ''.join(s)
Ssrt.append(s)
cnt = collections.Counter(Ssrt)
ans = 0
for i in cnt.keys():
if cnt[i] >= 2:
ans += cnt[i]*(cnt[i]-1)//2
print(ans)
|
p03345
|
s179144917
|
Accepted
|
a,b,_c,k=map(int,input().split())
if k%2==0:print(a-b)
else:print(b-a)
|
p03360
|
s261920564
|
Accepted
|
a=list(map(int,input().split()))
a=sorted(a)
k=int(input())
for i in range(1,k+1):
f=a[2]*2
a[2]=f
c=a[0]+a[1]+a[2]
print(c)
|
p02775
|
s195701302
|
Accepted
|
import sys
n = sys.stdin.readline().rstrip()
def main():
dp = [0, 1]
for d in n:
d = int(d)
dp[0], dp[1] = min(dp[0]+d, dp[1]+10-d), min(dp[0]+d+1, dp[1]+10-d-1)
return dp[0]
if __name__ == '__main__':
ans = main()
print(ans)
|
p02664
|
s979716988
|
Accepted
|
t = input()
ans = ''
for i in range(len(t)):
if t[i] == '?':
ans += 'D'
else:
ans += t[i]
print(ans)
|
p02600
|
s062378918
|
Accepted
|
X = int(input())
import math
X -= 400
X /= 200
X = math.floor(X)
print(8-X)
|
p03767
|
s641880233
|
Accepted
|
# For taking integer inputs.
def inp():
return(int(input()))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
s = input()
return(list(s[:len(s)]))
# For taking space seperated integer variable inputs.
def invr():
return(map(int, input().split()))
N = inp()
a = inlist()
a = sorted(a)
st = 3*N - 1
wk = 0
res = 0
for i in range(N):
chosen = st - 1
res += a[chosen]
wk += 1
st -= 2
print(res)
|
p02665
|
s184672152
|
Accepted
|
N = int(input())
A = list( map(int, input().split()) )
B = [i for i in A]
for i in range(N):
B[N-i-1] += B[N-i]
if(N == 0 and A[0] == 1):
print(1)
exit()
if(0 in B):
print(-1)
exit()
if(A[0] != 0):
print(-1)
exit()
a = 1
sum = a
for i in range(1, N):
a = min(2*(a-A[i-1]) , B[i])
if(a <= A[i]):
print(-1)
exit()
sum += a
if(2*(a-A[-2]) < A[-1]):
print(-1)
exit()
print(sum + A[-1])
|
p03241
|
s456027921
|
Accepted
|
n, m = map(int, input().split())
for i in range(m//n, 0, -1):
rem = m-i*n
if rem%i==0:
print(i)
break
|
p03852
|
s145924871
|
Accepted
|
S = input()
if S == 'a' or S == 'i' or S == 'u' or S == 'e' or S == 'o':
print('vowel')
else:
print('consonant')
|
p02597
|
s727712877
|
Wrong Answer
|
n=int(input())
s=input()
if s.count('R')==0 or s.count('W')==0:
print(0)
else:
a= s.count('W')
w=s.index('W')
b= s[w:].count('R')
if b==0:
print(0)
else:
c = s[(w+1):].count('W')
t=min(b,c)
print(min(t,a))
|
p02958
|
s990625581
|
Wrong Answer
|
"""
author : halo2halo
date : 9, Jan, 2020
"""
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, *P = read().decode('utf8').split()
P_N = sorted(P)
# print(list(x != y for x, y in zip(P, P_N)))
S = sum(x != y for x, y in zip(P, P_N))
# print(S)
print('YES' if S == 0 or S == 2 else 'NO')
|
p03107
|
s875384606
|
Accepted
|
S = [int(i) for i in list(input())]
s = ["", ""]
c = 0
for v in S:
s.append(v)
# print(s)
if (s[-1], s[-2])==(0, 1) or (s[-1], s[-2])==(1, 0):
s.pop()
s.pop()
c += 2
print(c)
|
p03345
|
s370093719
|
Accepted
|
a, b, c, k = map(int, input().split())
print(a-b) if k % 2 == 0 else print(b-a)
|
p02963
|
s404329904
|
Accepted
|
import math
s = int(input())
t = int(math.sqrt(s) // 1)
if s == t**2:
print(0, 0, 0, t, t, 0)
else:
t += 1
e = t * t - s
print(0, 0, t, e, 1, t)
|
p02777
|
s924286896
|
Accepted
|
from sys import stdin
A, B= stdin.readline().rstrip().split()
m = [A,B]
k = list(map(int, input().split()))
l = stdin.readline().rstrip().split()
k[m.index(l[0])] = k[m.index(l[0])] -1
print(k[0],k[1])
|
p02873
|
s520016571
|
Accepted
|
s = str(input())
n = len(s)
L = [0]*(n+1)
cnt = 0
for i in range(n):
if s[i] == '<':
cnt += 1
else:
cnt = 0
L[i+1] = cnt
R = [0]*(n+1)
cnt = 0
for i in reversed(range(n)):
if s[i] == '>':
cnt += 1
else:
cnt = 0
R[i] = cnt
A = [0]*(n+1)
for i in range(n+1):
A[i] = max(L[i], R[i])
print(sum(A))
|
p03469
|
s336599764
|
Wrong Answer
|
import sys
S = sys.stdin.readline().strip()
print("2018" + S[5:])
|
p02628
|
s126145281
|
Accepted
|
def main():
n, k = map(int, input().split(" "))
p = list(map(int, input().split(" ")))
p.sort()
ans = 0
for i in range(k):
ans += p[i]
print(ans)
if __name__ == "__main__":
main()
|
p02972
|
s817956967
|
Accepted
|
from sys import stdin
def main():
readline=stdin.readline
N=int(readline())
a=list(map(int,readline().split()))
b=[0]*N
for i in range(N):
n=N-i
count=0
for k in range(n,N+1,n):
if k==n:
pass
else:
count+=b[k-1]
if count%2!=a[n-1]:
b[n-1]=1
else:
b[n-1]=0
res=[]
M=0
for i in range(N):
if b[i]==1:
res.append(i+1)
M+=1
print(M)
print(*res)
if __name__=="__main__":
main()
|
p03210
|
s500870475
|
Accepted
|
x = int(input())
if x == 3 or x == 5 or x == 7:
print('YES')
else:
print('NO')
|
p02843
|
s512764107
|
Accepted
|
X = int(input())
C = 1000000
output = []
for c in range(C):
if (c*100) <= X <= (c*105):
output.append(1)
else:
output.append(0)
if max(output):
print("1")
else:
print("0")
|
p02848
|
s313784632
|
Accepted
|
A=["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"]
n=int(input())
s=str(input())
t=""
for i in range(len(s)):
for j in range(26):
if s[i]==A[j]:
if j+n<=25:
t+=A[j+n]
break
else:
t+=A[j+n-26]
break
print(t)
|
p02996
|
s816851916
|
Accepted
|
# 締切の早いものから順番に見ていくのが最適戦略
N = int(input())
X = [list(map(int, input().split())) for _ in range(N)]
X = sorted(X, key=lambda x: x[1]) # B (締切の早い順にソート)
res = 0
for i in range(N):
res += X[i][0]
if res > X[i][1]:
print("No")
exit()
print("Yes")
|
p03211
|
s370233461
|
Wrong Answer
|
def resolve():
S = list(input())
mindiff = float("inf")
for i in range(len(S)-2):
val = int(S[i]+S[i+1]+S[i+2])
print(val)
mindiff = min(mindiff, abs(753-val))
print(mindiff)
if '__main__' == __name__:
resolve()
|
p02726
|
s089264667
|
Accepted
|
# coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.buffer.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, X, Y = lr()
dist = []
for i in range(1, N+1):
z = np.arange(i+1, N+1)
d1 = z - i
d2 = np.abs(i - X) + np.abs(z - Y) + 1
d = np.minimum(d1, d2)
dist.append(d)
dist = np.concatenate(dist)
cnt = np.bincount(dist, minlength=N)
print('\n'.join(cnt[1:].astype(str)))
|
p03241
|
s708501324
|
Accepted
|
N, M = map(int, input().split())
ans = 1
for i in range(1, int(M**0.5)+1):
if M % i != 0:
continue
j = M // i
if i * N <= M:
ans = max(ans, i)
if j * N <= M:
ans = max(ans, j)
print(ans)
|
p02959
|
s200601721
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N):
ans += min(A[i] + A[i+1], B[i])
A[i+1] -= min(A[i] - B[i], 0)
print(ans)
|
p02699
|
s402713134
|
Accepted
|
def main():
import sys
input = sys.stdin.readline
n, w = map(int, input().split())
if n > w:
print("safe")
else:
print("unsafe")
if __name__ == "__main__":
main()
|
p02633
|
s532536357
|
Wrong Answer
|
X = int(input())
if 360%X == 0:
print(360//X)
else:
print(180)
|
p02888
|
s005582716
|
Accepted
|
import bisect
n = int(input())
li = list(map(int,input().split()))
ans = 0
li.sort()
for k in range(0,n-2):
for i in range(k+1,n-1):
ans += bisect.bisect_left(li,li[k]+li[i])-i-1
print(ans)
|
p03455
|
s642488864
|
Accepted
|
i = list(map(int, input().split()))
x = i[0] * i[1]
if x % 2 == 0:
print("Even")
else:
print("Odd")
|
p02697
|
s679606841
|
Accepted
|
N, M = map(int, input().split())
if N % 2 == 1:
for i in range(1, M + 1):
l = i
r = N - i
print(l, r)
else:
flag = False
l = 1
r = N - 1
cnt = 0
while cnt < M:
if not flag and r - l <= N // 2:
r -= 1
flag = True
print(l, r)
l += 1
r -= 1
cnt += 1
|
p02699
|
s627479874
|
Accepted
|
L = list(map(int,input().split()))
S=L[0]
W=L[1]
if W>=S:
print("unsafe")
else:
print("safe")
|
p03778
|
s647900441
|
Accepted
|
w,a,b=map(int,input().split())
if a<b:
if a+w>b:
print(0)
else:
print(b-a-w)
elif b<a:
if b+w>a:
print(0)
else:
print(a-b-w)
else:
print(0)
|
p03017
|
s228421935
|
Accepted
|
n,a,b,c,d = map(int, input().split())
s = list(input())
s.append(".")
a -= 1
b -= 1
c -= 1
d -= 1
if c > d:
if "##" not in "".join(s[a+1:c]) and "##" not in "".join(s[b+1:d]) and "..." in "".join(s[b-1:d+2]):
print("Yes")
else: print("No")
else:
if "##" not in "".join(s[a+1:c]) and "##" not in "".join(s[b+1:d]):
print("Yes")
else: print("No")
|
p03720
|
s510118868
|
Wrong Answer
|
N, M = map(int, input().split())
root_dic = {}
for i in range(M):
root = list(map(int, input().split()))
for i in range(2):
if root[i] in root_dic:
root_dic[root[i]] += 1
else:
root_dic[root[i]] = 1
for i, v in sorted(root_dic.items()):
print(v)
|
p02761
|
s281104400
|
Accepted
|
import sys
n, m = map(int, sys.stdin.readline().rstrip().split())
sc = [sys.stdin.readline().rstrip().split() for i in range(m)]
if n > 1:
ans = ['1'] + ['0'] * (n - 1)
else:
ans = ['0']
tmp = [0] * n
for sci in sc:
s, c = sci
if n > 1 and s == '1' and c == '0':
print(-1)
sys.exit()
if tmp[int(s) - 1] > 0 and ans[int(s)-1] != c:
print(-1)
sys.exit()
ans[int(s)-1] = c
tmp[int(s) - 1] += 1
# print(ans)
print(''.join(ans))
|
p02694
|
s010727242
|
Accepted
|
import math
X = int(input())
answer = 100
j = 0
while(answer <= X):
answer = math.floor(answer * 1.01)
j += 1
if answer >= X:
break
print(j)
|
p02681
|
s291785286
|
Wrong Answer
|
S = str(input())
T = str(input())
same_l = min(len(S), len(T))
# print(S[:same_l-1])
# print(T[:same_l-1])
if S[:same_l-1] == T[:same_l-1]:
# print("t")
if len(T)-len(S) == 1:
print("Yes")
else:
print("No")
else:
print("No")
|
p02732
|
s398621367
|
Wrong Answer
|
def nc2(n):
if n==0:
return 0
return n*(n-1)/2
n=int(input())
arr=[int(i) for i in input().strip().split(" ")]
ans=0
dic={}
for i in arr:
dic[i]=dic.get(i,0)+1
for i in dic:
if dic[i]==1 :
continue
ans+=nc2(dic[i])
print(dic)
for i in range(n):
curr_nc2=nc2(dic[arr[i]])
# print(curr_nc2)
print(int(ans-curr_nc2+nc2(dic[arr[i]]-1)))
|
p03061
|
s556184124
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
from fractions import gcd
L=[0]
R=[]
l=a[0]
r=a[-1]
for i in range(n-1):
l=gcd(a[i], l)
L.append(l)
r=gcd(a[-i-1], r)
R.append(r)
R=R[::-1]
R.append(0)
M=[]
#print(L,R)
for i in range(n):
m=gcd(L[i],R[i])
M.append(m)
print(max(M))
|
p02658
|
s964007747
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
result=1
if 0 in a:
print(0)
else:
for i in a:
result*=i
if result>10**18:
print(-1)
break
if result<=10**18:
print(result)
|
p02615
|
s299750374
|
Accepted
|
from collections import deque
N = int(input())
A = [int(e) for e in input().split()]
A.sort(reverse=True)
if N == 2:
print(A[0])
else:
ans = A[0]
friendly_deque = deque()
friendly_deque.append(A[1])
friendly_deque.append(A[1])
for i in range(2,N):
add = friendly_deque.popleft()
ans += add
friendly_deque.append(A[i])
friendly_deque.append(A[i])
print(ans)
|
p02777
|
s967883234
|
Accepted
|
a,b = input().split()
aa,bb = map(int, input().split())
c = input()
if (c == a):
aa = aa - 1
else:
bb = bb - 1
print(aa,bb)
|
p02678
|
s519716020
|
Wrong Answer
|
n, m = map(int,input().split())
ab = [list(map(int,input().split())) for _ in range(m)]
print('No')
|
p03162
|
s537089242
|
Wrong Answer
|
N = int(input())
plans = []
for _ in range(N):
a, b, c = map(int, input().split())
plans.append((a, b, c))
memo = [[0] * (N + 1) for _ in range(3)]
for day, plan in enumerate(plans, 1):
memo[0][day] = max(memo[1][day - 1], memo[2][day - 1]) + plan[0]
memo[1][day] = max(memo[0][day - 1], memo[2][day - 1]) + plan[1]
memo[2][day] = max(memo[0][day - 1], memo[1][day - 1]) + plan[2]
print(max(memo[0][N], memo[1][N], memo[1][N]))
|
p03137
|
s369935240
|
Wrong Answer
|
#!/usr/bin/env python3
n, m, *x = map(int, open(0).read().split())
x.sort()
d = sorted(x[i] - x[i - 1] for i in range(1, m))
print(sum(d[:m - n]))
|
p04033
|
s285099028
|
Accepted
|
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
a,b = map(int,input().split())
if a == 0 or b ==0 or (a<0 and b>0):
print("Zero")
exit()
else:
if a > 0 and b > 0:
print("Positive")
elif abs(a-b)%2!=0:
print("Positive")
else:
print("Negative")
if __name__=="__main__":
main()
|
p02600
|
s539791419
|
Accepted
|
a=[599,799,999,1199,1399,1599,1799,1999]
x=int(input())
for i,val in enumerate(a):
if x<=val:
print(8-i)
break
|
p03449
|
s935286031
|
Accepted
|
N=int(input())
a=list(map(int,input().strip().split()))
b=list(map(int,input().strip().split()))
#累積和
A=[]
B=[]
suma=0
sumb=0
for n in range(N):
suma+=a[n]
A.append(suma)
for n in reversed(range(N)):
sumb+=b[n]
B.append(sumb)
MAX=0
for n in range(N):
MAX=max(MAX,A[n]+B[N-n-1])
print(MAX)
|
p03698
|
s086576976
|
Wrong Answer
|
from collections import defaultdict
S = input()
d = defaultdict(int)
for i in range(len(S)):
d[S[i]] += 1
if max(d) == 1:
print("yes")
else:
print("no")
|
p02778
|
s243905627
|
Wrong Answer
|
string=input()
for s in string:
s='x'
print(string)
|
p02783
|
s120227246
|
Accepted
|
a,b = map(int, input().split())
if a%b == 0:
print(a//b)
else:
c = a//b
print(c+1)
|
p03327
|
s543359571
|
Accepted
|
N = int(input())
print('ABC' if 1 <= N <= 999 else 'ABD')
|
p03352
|
s082110103
|
Accepted
|
X=int(input())
x=0
ans=[]
if X == 1:
print(X)
exit()
else:
# p
for i in range(2, int(X**0.5)+1):
n=1
a=i
# b
while n < X : #超えたら中断
n *= a
ans.append(n)
if n // a > x:
x = (n//a)
#print(ans)
print(max(i for i in ans if i <= X))
|
p02647
|
s664489594
|
Accepted
|
#!/usr/bin/env python3
from itertools import*
n, k, *A = map(int, open(0).read().split())
def imos(l, r):
B[l] += 1
if r + 1 != n:
B[r + 1] -= 1
for _ in [0] * min(k, 41):
B = [0] * n
for i, a in enumerate(A):
imos(max(i - a, 0), min(i + a, n - 1))
*A, = accumulate(B)
print(*A)
|
p02694
|
s834877773
|
Accepted
|
n=int(input())
a=100
count=0
while a<n:
a=a+a//100
count+=1
print(count)
|
p02924
|
s515799563
|
Accepted
|
n = int(input())
n = n-1
print(n*(n+1)//2)
|
p02742
|
s890147613
|
Accepted
|
from decimal import Decimal
a,b = list(map(int,input().split()))
if a == 1 or b ==1:
d =1
elif a*b%2==0 and a >1 and b >1:
d = a*b/2
else:
d = (a*b+1)/2
print(Decimal(d))
|
p02724
|
s599160022
|
Wrong Answer
|
x = int(input())
HP = 0
if x < 5:
print(0)
while x >= 500:
x -= 500
HP += 1000
while x >= 5:
x -= 5
HP += 5
print(HP)
|
p03416
|
s131561413
|
Accepted
|
a, b = map(int, input().split())
n = 0
for i in range(a, b + 1):
if str(i) == str(i)[::-1]:
n += 1
print(n)
|
p03962
|
s461349943
|
Accepted
|
import sys
def v():
x=[x for x in sys.stdin.readline().split()]
print(len(set(x)))
if __name__=='__main__':v()
|
p02663
|
s657501277
|
Accepted
|
def main():
h1, m1, h2, m2, k = map(int, input().split())
x = 60 * h1 + m1
y = 60 * h2 + m2 - k
print(max(0, y - x))
if __name__ == '__main__':
main()
|
p03814
|
s448698412
|
Accepted
|
s=input()
leng=len(s)
a=s.index("A")+1
z=leng-list(reversed(s)).index("Z")+1
print(z-a)
|
p02628
|
s909566128
|
Wrong Answer
|
#B - Mix Juice
import math
from itertools import combinations
n,k=map(int,input().split())
ｌ=list(map(int,input().split()))
min1=min(list(combinations(l,k)))
sum1=int(math.fsum(min1))
print(sum1)
|
p02629
|
s836221456
|
Wrong Answer
|
import math
N = int(input())
a = [chr(i) for i in range(97, 97+26)]
data = ''
count = 1
data = f'{data}{a[N % 26-1]}'
if int(N/26) == 0:
print(data[0])
exit(0)
for i in range(int(math.log(N, 26))):
data = f'{a[round((N/26**count) % 26-1)]}{data}'
N -= 26**count
count += 1
print(data)
exit(0)
|
p02572
|
s375811952
|
Accepted
|
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]
M = 10**9+7
n = inp()
x = ip()
sm = sum(x)
sq = sm*sm
ans = 0
for i in x: ans += i*i
ans = (sq-ans)//2
print(ans%M)
|
p03455
|
s581157056
|
Wrong Answer
|
input = input().split(' ')
a = int(input[0])
b = int(input[0])
N = a*b
if N%2==0:
print('Even')
else:
print('Odd')
|
p02989
|
s653245418
|
Accepted
|
N = int(input())
d = list(map(int, input().split()))
d = sorted(d)
print(d[N//2] - d[N//2-1])
|
p03038
|
s812787740
|
Wrong Answer
|
n,m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
b = []
c = []
for i in range (m):
B,C = map(int, input().split())
b.append(B)
c.append(C)
t = True
cnt = 0
c1 = sorted(c[:])
while t == True and cnt < len(c):
cnt += 1
large = c1 [-cnt]
num = b[c.index(large)]
if large > min(a):
for i in a:
if i < large and a.index(i)+1 <= num:
a[a.index(i)] = large
else:
break
a.sort()
else:
t = False
print(sum(a))
|
p03997
|
s176089477
|
Accepted
|
a = int(input())
b =int(input())
h = int(input())
print(int(((a+b)*h)/2))
|
p02989
|
s996951620
|
Wrong Answer
|
n=int(input())
d=list(map(int,input().split()))
d.sort()
left=d[n//2-1]
right=d[n//2]
print(right-left+1)
|
p02910
|
s896721613
|
Wrong Answer
|
S = input()
flg = True
for s in range(0,len(S)-1):
if s%2 == 0 and S[s] == "L":
flg = False
elif s%2 != 0 and S[s] == "R":
flg = False
if flg:
print("Yes")
else:
print("No")
|
p03387
|
s606256763
|
Accepted
|
n = list(map(int,input().split()))
cnt = 0
while n.count(n[0]) != len(n):
n.sort()
if n[0] == n[1]:
n[0] += 1
n[1] += 1
else:
n[0] += 2
cnt += 1
print(cnt)
|
p03211
|
s588686819
|
Accepted
|
s = input()
d = 1001001
for i in range(len(s) - 1):
x = int(s[i : i + 3])
tmp = abs(x - 753)
if tmp < d:
d = tmp
print(d)
|
p04031
|
s754687490
|
Wrong Answer
|
N = int(input())
lst = list(map(int, input().split()))
avg = round(sum(lst) // N)
result = 0
for i in lst:
result += (i - avg)**2
print(result)
|
p03286
|
s638680989
|
Wrong Answer
|
N = int(input())
op_cnt = len(bin(abs(N)))-2
import numpy as np
two = [(-2)**i for i in reversed(range(op_cnt))]
for i in range(2 ** op_cnt):
op = [0] * op_cnt
for j in range(op_cnt):
if ((i >> j) & 1):
op[op_cnt - 1 - j] = 1
if sum(np.array(op)*two) == N:
op = [str(i) for i in op]
print("".join(op))
break
|
p03487
|
s984266420
|
Wrong Answer
|
from collections import Counter
n=int(input())
sc=Counter(list(map(int,input().split())))
sm=0
for k,v in sc.items():
sm+=min(v,(k-v if k-v>=0 else 10**9+1))
print(sm)
|
p02624
|
s418052173
|
Accepted
|
N = int(input())
sum = 0
for i in range(1,N+1):
sum+=i*(1+N//i)*(N//i)/2
print(int(sum))
|
p03160
|
s639045489
|
Wrong Answer
|
"""
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 ** 9
N, *H = map(int, read().split())
dp = [INF] * N
dp[0] = 0
for i in range(0, N-2):
print(i)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(H[i] - H[i + 1]))
dp[i + 2] = min(dp[i + 2], dp[i] + abs(H[i] - H[i + 2]))
print(*dp)
print(dp[N-1])
|
p03657
|
s219630341
|
Wrong Answer
|
a,b=map(int,input().split())
print('Possible' if (a+b)%3==0 else 'Impossible')
|
p02873
|
s136216557
|
Accepted
|
arr = input()
l = len(arr)
ans_arr = [0] * (l+1)
for i in range(l):
if arr[i] == '<':
ans_arr[i+1] = ans_arr[i] + 1
for i in range(l-1, -1, -1):
if arr[i] == '>':
ans_arr[i] = max(ans_arr[i], ans_arr[i+1] + 1)
# print(ans_arr)
print(sum(ans_arr))
|
p02963
|
s697872568
|
Accepted
|
S = int(input())
if S <= 10**9:
ans = [0, 0, S, 0, 0, 1]
print(*ans)
exit()
else:
if S == 10 ** 18:
ans = [0, 0, 10 ** 9, 0, 0, 10 ** 9]
print(*ans)
exit()
mod = S % (10 ** 9)
syou = S // (10 ** 9)
x3 = 10 ** 9 - mod
y3 = syou + 1
ans = [0, 0, 10 ** 9, 1, x3, y3]
print(*ans)
|
p03241
|
s544920861
|
Accepted
|
import sys
def input(): return sys.stdin.readline().rstrip()
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
import bisect
def main():
n,m=map(int,input().split())
div=make_divisors(m)
print(div[bisect.bisect(div,m//n)-1])
if __name__=='__main__':
main()
|
p03627
|
s865998096
|
Accepted
|
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
d = Counter(readInts())
d = [i for i in sorted(d.items(), reverse=True) if i[1]>=2]
if len(d)==0:
print(0)
exit()
elif len(d)==1:
if d[0][1]>=4:
pass
else:
print(0)
exit()
if d[0][1]>=4:
print(int(d[0][0])**2)
else:
print(int(d[0][0])*int(d[1][0]))
|
p02922
|
s290375102
|
Wrong Answer
|
a , b = map(int, input().split())
if b <=a:
print(b // a )
elif b > a and (b - 1)%(a - 1)== 0:
print((b - 1)// (a - 1))
elif b > a and (b - 1)%(a - 1)!= 0:
print((b - 1)//(a - 1)+ 1)
|
p03448
|
s359980852
|
Accepted
|
a = int(input())
b = int(input())
c = int(input())
x = int(input())
counter = 0
calc_x = 0
ans = 0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
if i * 500 + j * 100 + k * 50 == x:
ans += 1
print(ans)
|
p02600
|
s924011684
|
Accepted
|
n=int(input())
ans=0
if 400<=n<=599:
ans=8
if 600<=n<=799:
ans=7
if 800<=n<=999:
ans=6
if 1000<=n<=1199:
ans=5
if 1200<=n<=1399:
ans=4
if 1400<=n<=1599:
ans=3
if 1600<=n<=1799:
ans=2
if 1800<=n<=1999:
ans=1
print(ans)
|
p04012
|
s425483793
|
Accepted
|
import collections
a=input()
b=list(a)
b=collections.Counter(b)
c=0
d=0
for i in b:
if b[i]%2!=0:
c=c+1
if c==0:
print("Yes")
else:
print("No")
|
p02814
|
s254952852
|
Accepted
|
n,m,*a=map(int,open(0).read().split())
c=[bin(i)[::-1].index("1") for i in a]
if sum(c)!=c[0]*n:
print(0)
exit()
from fractions import *
b=a[0]
for i in a:
b=(i*b)//gcd(i,b)
if b>2*m:
print(0)
exit()
print((m-b//2)//b+1)
|
p03407
|
s775387286
|
Accepted
|
A, B, C = map(int, input().split())
if A + B >= C:
print("Yes")
else:
print("No")
|
p02983
|
s114814716
|
Accepted
|
l,r = map(int, input().split())
m = 2019
for i in range(l,min(r+1,l+2020)):
for j in range(i+1, min(r+1,l+2020)):
i %= 2019
j %= 2019
m = min(m, (i*j)%2019)
print(m%2019)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.