problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03627 | s552382019 | Wrong Answer | N = int(input())
A = [int(i) for i in input().split()]
from collections import Counter
Acnt = Counter(A)
ans = [-1] * 2
for key,cnt in Acnt.items():
if cnt >= 2:
tmp = min(ans)
if key > tmp:
ans[ans.index(tmp)] = key
if -1 in ans:
print(0)
else:
print(ans[0] * ans[1]) |
p02628 | s592929971 | Accepted | N, K = [int(x) for x in input().split(' ')]
p = [int(x) for x in input().split(' ')]
p = sorted(p)
print(sum(p[:K])) |
p02881 | s517380877 | Accepted | N = int(input())
ans = []
for i in range(1,int(N**0.5)+1):
if N%i == 0:
j = int(N/i)
ans.append(i+j)
print(min(ans)-2) |
p03087 | s087389995 | Wrong Answer | n,q = map(int,input().split())
s=input()
a=[0]*n
for i in range(n-1):
a[i+1]=a[i]+(1 if s[i:i+2]=="AC" else 0)
print(a)
for i in range(q):
l,r=map(int,input().split())
print(a[r-1]-a[l-1])
|
p03627 | s644524129 | Wrong Answer | from collections import Counter
N = int(input())
a = list(map(int,input().split()))
d = Counter(a)
l = []
flag = False
for k,v in list(sorted(d.items()))[::-1]:
if v >= 4:
l.append(k)
l.append(k)
elif v >= 2:
l.append(k)
if len(l) == 2:
flag = True
break
if flag:
ans = l[0]*l[1]
else:
ans = 0
print(ans) |
p02598 | s742694944 | Wrong Answer | N, K = map(int, input().split())
*A, = map(int, input().split())
l, r = 10**19, 1
while abs(r-l) > 1:
m = (l+r)//2
k = 0
for a in A:
if a > m:
k += a//m
if k <= K:
l = m
else:
r = m
print(l)
|
p02640 | s190046988 | Wrong Answer | x,y=map(int, input().split())
crain = (4 * x - y) / 2
if crain.is_integer() and crain > 0:
crain = int(crain)
print('Yes')
elif x == 1 and y ==4:
print('Yes')
else:
print('No')
|
p03645 | s451393698 | Wrong Answer | n,m=map(int,input().split())
cu=[0]*200001
for i in range(m):
x,y=map(int,input().split())
cu[x]=y
f=cu[cu[1]]
print('POSSIBLE' if f==n else 'IMPOSSIBLE')
|
p02718 | s228276832 | Wrong Answer | N, M = map(int, input().split())
A = list(map(int, input().split()))
line = sum(A) // (4 * M)
ans = [i for i in A if i > line]
print("Yes") if len(ans) >= M else print("No")
|
p03495 | s934462639 | Accepted | N, K = [int(x) for x in input().split()]
A_lst = [int(x) for x in input().split()]
dict = {}
for i in A_lst:
if not i in dict:
dict[i] = 1
else:
dict[i] += 1
lst = []
for i in dict.keys():
lst.append(dict[i])
lst.sort()
k = len(lst)
cnt = 0
i = 0
while k > K:
k -= 1
cnt += lst[i]
i += 1
print(cnt)
|
p03785 | s590275229 | Accepted | import sys
input = sys.stdin.readline
N, C, K = map(int, input().split())
T = [int(input()) for i in range(N)]
T.sort()
ans = 0
cnt = 1
mn = T[0]
for i in range(1,N):
if cnt == C or mn+K < T[i]:
ans += 1
cnt = 1
mn = T[i]
else:
cnt += 1
if cnt > 0:
ans += 1
print(ans)
|
p03309 | s066595922 | Accepted | import statistics
N = int(input())
A = list(map(int, input().split()))
for i, a in enumerate(A):
A[i] = a - (i+1)
tmp = int(statistics.median(A))
ans = 0
for i, a in enumerate(A):
ans += abs(a - tmp)
print(ans)
|
p02924 | s568776607 | Accepted | def main():
n = int(input())
print((n - 1) * n // 2)
if __name__ == '__main__':
main()
|
p02817 | s835315394 | Wrong Answer | s, t = input().split()
print(s+t) |
p03073 | s892712910 | Wrong Answer | s = list(input())
a1 = [0, 1] * (len(s) // 2)
a2 = [1, 0] * (len(s) // 2)
if len(s) % 2 == 1:
a1.append(0)
a2.append(1)
count = 0
l = [0] * 2
for i in range(len(s)):
if s[i] != a1[i]:
l[0] += 1
if s[i] != a2[i]:
l[1] += 1
print(min(l)) |
p03239 | s247384719 | Accepted | N, T = map(int, input().split())
INF = 10**9
res = INF
for _ in range(N):
c, t = map(int, input().split())
if t <= T and c < res:
res = c
print(res if res != INF else 'TLE')
|
p02742 | s183031728 | Accepted | value = input().split()
rows = int(value[0])
colmuns = int(value[1])
#valid
if colmuns == 1:
rows = 1
elif rows == 1:
colmuns = 1
OddColNum = colmuns // 2
EvenColNum = OddColNum
if (colmuns % 2) != 0:
OddColNum = OddColNum + 1
if (colmuns == 1):
OddColNum = 1
OddRowCount = 0
EvenRowCount = rows // 2
if (rows % 2) == 0:
OddRowCount = rows // 2
else:
OddRowCount = (rows // 2) + 1
if (rows == 1):
OddRowCount = 1
counts = OddRowCount * OddColNum + EvenColNum * EvenRowCount
print(counts) |
p03163 | s783214924 | Wrong Answer | import sys
def input():
return sys.stdin.readline().rstrip()
def main():
N, W = map(int, input().split())
dp = [[0] * (N + 1) for _ in range(W + 1)]
for i in range(1, N + 1):
w, v = map(int, input().split())
for j in range(w,W + 1):
dp[j][i] = max(dp[j][i - 1], dp[j - w][i-1] + v)
print(dp[W][N])
if __name__ == "__main__":
main()
|
p03495 | s568973174 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
c = [0] * n
for i in a:
c[i - 1] += 1
print(sum(c[k:]))
|
p02623 | s455111346 | Wrong Answer | from itertools import accumulate
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
As = list(accumulate(A))
Bs = list(accumulate(B))
ans = 0
if Bs[M-1] <= K:
ans = max(ans, M)
idx = M-1
for i in range(N):
while idx != -1 and As[i] + Bs[idx] > K:
idx -= 1
num = i + idx + 2
if As[i] > K:
num = 0
ans = max(ans, num)
print(ans) |
p03352 | s543192411 | Wrong Answer | x = int(input())
ans = 1
for i in range(2, x+1):
n = 2
while i ** n < x:
ans = i ** n
n += 1
print(ans) |
p03545 | s759502668 | Wrong Answer | s = input()
opl = ['+', '-']
flag = [0,0,0]
for i in range(0, 0b111+1):
for j in range(3):
#print(i)
flag[j] = (i>>(j+1) & 1)
ans = s[0] + opl[flag[0]] + s[1] + opl[flag[1]] + s[2] + opl[flag[2]] + s[3]
if(eval(ans) == 7):
print(ans + '=7')
break
else:
continue
break
|
p02836 | s917861580 | Accepted | s=input()
count=0
for i in range(len(s)//2):
if s[i]==s[len(s)-1-i]:
count+=1
print(len(s)//2-count) |
p03042 | s178225445 | Accepted | s = input()
bit_pre = 0
bit_post = 0
if 1 <= int(s[:2]) and int(s[:2]) <= 12:
bit_pre = 1
if 1 <= int(s[2:]) and int(s[2:]) <= 12:
bit_post = 1
if bit_pre and bit_post:
print("AMBIGUOUS")
elif bit_pre:
print("MMYY")
elif bit_post:
print("YYMM")
else:
print("NA")
|
p02957 | s202988191 | Accepted | import sys
sys.setrecursionlimit(10**6)
a, b = map(int, input().split())
if (a-b)%2 == 0:
print((a+b)//2)
else:
print('IMPOSSIBLE') |
p02657 | s516692014 | Accepted | A,B=map(int,input().split())
print(A*B) |
p02571 | s057281536 | Accepted | s = input()
t = input()
n = len(s)
m = len(t)
ans = 0
for i in range(n):
if n < i+m:
continue
x = s[i:i+m]
cnt = 0
for a, b in zip(x, t):
if a == b:
cnt += 1
if ans < cnt:
ans = cnt
print(m-ans)
|
p03797 | s988740376 | Wrong Answer | def resolve():
N, M = list(map(int, input().split()))
totalc = N*2 + M
print(totalc // 4)
if '__main__' == __name__:
resolve() |
p02963 | s404564799 | Accepted | s = int(input())
xl = int(s ** 0.5) + 1
if (xl - 1) * (xl - 1) >= s:
xl -= 1
yl = xl
elif (xl - 1) * xl >= s:
yl = xl - 1
else:
yl = xl
diff = xl * yl - s
print(*[0, 0, xl, diff, 1, yl]) |
p02995 | s096121721 | Accepted | A, B, C, D = map(int, input().split())
import fractions
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
def f(x, c, d):
cd = lcm(c, d)
divisible = x//c + x//d - x//cd
return x - divisible
print(f(B, C, D) - f(A-1, C, D))
|
p02982 | s180690779 | Wrong Answer | sq_nums = {i * i for i in range(1, 101)}
N, D = map(int, input().split())
coords = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N):
for j in range(i, N):
if sum((y - z) ** 2 for y, z in zip(coords[i], coords[j])) in sq_nums:
ans += 1
print(ans)
|
p03061 | s560157439 | Accepted | from fractions import gcd
n=int(input())
a=list(map(int,input().split()))
r=[a[-1]]
l=[a[0]]
for i in range(1,n-1):
l.append(gcd(l[i-1],a[i]))
r.append(gcd(r[i-1],a[-1-i]))
ans=r[-1]
for i in range(n-2):
ans=max(ans,gcd(l[i],r[-2-i]))
ans=max(ans,l[-1])
print(ans) |
p02767 | s313925371 | Wrong Answer | N = int(input())
X = list(map(int, input().split()))
Max = max(X)
p_min = 10000
for i in range(1, Max+1):
p = 0
for j in range(len(X)):
p += (X[j] - i)**2
if p < p_min:
p_min = p
else:
p_min = p_min
print(p_min) |
p03289 | s196878305 | Accepted | from re import match
if match("^A[a-z]+C[a-z]+$", input()):
print('AC')
else:
print('WA') |
p02725 | s429702060 | Wrong Answer | N , M = (map(int , input().split()))
A = list(map(int , input().split()))
A.append(N)
a_lis = []
for i in range(len(A)-1):
a_lis.append(A[i+1]-A[i])
print(N - max(a_lis)) |
p02796 | s964150517 | Wrong Answer | N = int(input())
ppair = [[0,0]]*N
for i in range(N):
ppair[i] = list(map(int,input().split()))
ppair.sort()
ans = 0
pf = False
for i in range(N-1):
if (pf):
pf = False
continue
else:
if (sum(ppair[i]) > ppair[i+1][0] - ppair[i+1][1]):
ans += 1
pf = True
print(N-ans) |
p03281 | s801296526 | Accepted | N = int(input())
ans = 0
for n in range(N+1):
if n%2==1:
Y = 0
for m in range(1,N+1):
if n%m==0:
Y+=1
if Y==8:
ans+=1
print(ans) |
p02900 | s524590402 | Accepted | def prime_factors(n):
res = set()
while n % 2 == 0:
res.add(2)
n //= 2
i = 3
while i * i <= n:
if n % i == 0:
res.add(i)
n //= i
else:
i += 2
if n != 1:
res.add(n)
return res
a, b = map(int, input().split())
a = prime_factors(a)
b = prime_factors(b)
print(len(a & b) + 1)
|
p02953 | s240720600 | Accepted | def main():
N = int(input())
A = list(map(int,input().split()))
pre = A[0]
for i in A:
if pre > i:
print("No")
return
elif pre < i:
pre = i -1
print("Yes")
if __name__ == "__main__":
main() |
p02608 | s868328500 | Accepted | import math
import collections
n=int(input())
c = []
m = int(math.sqrt(n))
for x in range(1,m+1):
for y in range(1,m+1):
for z in range(1,m+1):
tmp = x*x + y*y + z*z + x*y + y*z + z*x
c.append(tmp)
cc = collections.Counter(c)
#print(cc)
for i in range(1,n+1):
if i in cc:
print(cc[i])
else:
print(0) |
p02973 | s939147691 | Accepted | from collections import deque
from bisect import bisect_left
N=int(input())
li=[]
ans=0
for i in range(N):
a=-int(input())
b=bisect_left(li,a+1)
if b==len(li):
li.append(a)
ans+=1
else:
li[b]=a
print(ans) |
p02718 | s479009093 | Accepted | def f(M,A):
c=0
s=sum(A)
for a in A:
if a>=s/4/M:c+=1
if c>=M:return("Yes")
return("No")
N,M=map(int,input().split())
A=[int(x) for x in input().split()]
s=sum(A)
print(f(M,A)) |
p02817 | s372600139 | Accepted | S, T = input().split()
print(T+S) |
p02910 | s462294943 | Wrong Answer | import numpy as np
S = input()
count = True
for i in np.arange(0, len(S), 2):
if S[i] == "L":
count = False
for i in np.arange(1, len(S), 2):
if S[i] == "R":
count += False
if count:
print("Yes")
else:
print("No") |
p02720 | s842957982 | Wrong Answer | K = int(input())
cnt = 0
i = 1
while cnt < K:
s = str(i)
if len(s) == 1:
cnt += 1
else:
flg = True
for j in range(1, len(s)):
if abs(int(s[j]) - int(s[j-1])) > 1:
flg = False
break
if flg:
cnt += 1
i += 1
print(i-1)
|
p02583 | s979825557 | Accepted | n = int(input())
arr = list(map(int, input().split()))
arr.sort()
length = len(arr)
ans = 0
for x in range(length):
for y in range(x + 1, length):
for z in range(y + 1, length):
if arr[x] != arr[y] and arr[y] != arr[z] and arr[z] != arr[x]:
if arr[x] + arr[y] > arr[z]:
ans += 1
print(ans) |
p02918 | s770216427 | Accepted | n,k=map(int,input().split())
s=input()
x=1
for i in range(n-1):
if s[i]!=s[i+1]:
x+=1
print(min(n-1,n-x+2*k))
|
p03633 | s948579200 | Wrong Answer | def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x%y)
def lcm(x, y):
return (x * y) // gcd(x, y)
n=int(input())
ans=1
tmp1=int(input())
for i in range(n-1):
tmp2=int(input())
ans=lcm(tmp1,tmp2)
tmp1=ans
print(ans) |
p02953 | s562598651 | Wrong Answer | import sys
n=int(input())
h=list(map(int,input().split()))
h[0]-=1
for i in range(1,n-1):
if h[i-1]<=h[i]<=h[i+1]:
pass
else:
h[i]-=1
if h[i-1]<=h[i]<=h[i+1]:
pass
else:
print("No")
sys.exit()
print("Yes")
|
p02633 | s317509457 | Accepted | N = int(input())
pi = 360
while True:
if pi % N == 0:
print(pi//N)
exit()
else:
pi+=360 |
p02732 | s986232131 | Wrong Answer | def main():
N = int(input())
A = [int(i) for i in input().split()]
from collections import Counter
c = Counter(A)
ans = 0
for v in c.values():
ans += v*(v-1)//2
for k in range(N):
if 2 <= c[A[k]]:
print(ans - (c[A[k]] - 1))
else:
print(0)
if __name__ == '__main__':
main()
|
p03319 | s862159265 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
ind = A.index(1)
n = ind//(K-1)
if ind%(K-1):
n += 1
m = (N-1-ind)//(K-1)
if (N-1-ind)%(K-1):
m += 1
print(n+m) |
p02836 | s180426814 | Accepted | def main():
S = input()
S1 = S[:len(S)//2]
S2 = S[len(S)//2:][::-1]
num_hug = 0
for s1, s2 in zip(S1, S2):
if s1 != s2:
num_hug += 1
print(num_hug)
if __name__ == "__main__":
main()
|
p03545 | s879125583 | Accepted | import itertools
moji = str(input())
A,B,C,D = int(moji[0]),int(moji[1]),int(moji[2]),int(moji[3])
Bn = [B,B*-1]
Cn = [C,C*-1]
Dn = [D,D*-1]
flg = 0
for i,j,k in itertools.product(Bn, Cn,Dn):
X = A + i + j + k
if X == 7:
break
print(str(A) + (str(i),"+"+str(i))[i >= 0]+ (str(j),"+"+str(j))[j >= 0]+ (str(k),"+"+str(k))[k >= 0]+"=7")
|
p03471 | s912787014 | Wrong Answer | N,Y=map(int,input().split())
for x in range(N+1):
for y in range(N+1):
if 10000*x+5000*y+1000*(N-x-y)==Y:
print(x,y,N-x-y)
exit()
else:
print(-1,-1,-1) |
p03037 | s745692212 | Accepted | N, M = map(int, input().split())
lstL = list()
lstR = list()
for i in range(0, M):
L, R = map(int, input().split())
lstL.append(L)
lstR.append(R)
minVal = max(lstL)
maxVal = min(lstR)
res = (maxVal - minVal + 1) if minVal <= maxVal else 0
print(res) |
p03545 | s615521386 | Wrong Answer | a=input()
op=list("+-")
flag = False
for i in op:
for j in op:
for k in op:
s = a[0]+i+a[1]+j+a[2]+k+a[3]
flag = True
if eval(s) == 7:
break
if flag:
break
if flag:
break
print(s+"=7")
|
p03137 | s911534390 | Accepted | N,M=map(int,input().split())
X=list(map(int,input().split()))
X.sort()
if N>=M:
ans=0
else:
D=X[M-1]-X[0]
xm=[]
for i in range(M-1):
xm.append(X[i+1]-X[i])
xm.sort()
ans=sum(xm[:M-N])
print(ans) |
p02831 | s261405936 | Wrong Answer | def GCD(x,y):
if y == 0:
return 1
return GCD(y, x%y)
print(GCD(1,5)) |
p02759 | s814585125 | Accepted | n = int(input())
if n%2 == 1:
print((n+1)//2)
else:
print(n//2)
|
p02900 | s877749015 | Wrong Answer | A, B = map(int, input().split())
A_k, B_k = A, B
AB_max = max(A, B)
yakusu = {1}
for i in range(2, int(AB_max**0.5+1)):
while A_k % i == 0 and B_k % i == 0:
A_k = A_k // i
B_k = B_k // i
yakusu.add(i)
print(len(yakusu)) |
p02688 | s910754011 | Wrong Answer | N, K = list(map(int, input().split()))
people = [False for i in range(0, N)]
for k in range(K):
d = int(input())
A = list(map(int, input().split()))
for a in A:
people[a-1] = True
print(len(list(filter(lambda x : x, people))))
|
p02859 | s532244990 | Accepted | def main():
r = int(input())
print(r**2)
if __name__ == "__main__":
main() |
p02767 | s913221643 | Accepted | n=int(input())
x=[int(i) for i in input().split()]
ans=10**9
for i in range(1,101):
res=0
for j in x:
res+=(j-i)**2
ans=min(ans,res)
print(ans) |
p02713 | s664319869 | Wrong Answer | import math
n = int(input())
res = 0
for i in range(1,n):
for j in range(1,n):
for k in range(1,n):
res += math.gcd(math.gcd(i,j),k)
print(res) |
p03632 | s408852272 | Wrong Answer | a, b, c, d = map(int, input().split())
if b < c or d < a:
print(0)
elif a <= c and d <= b:
print(d-c)
elif c <= a and b <= d:
print(a-b)
elif a <= c and b <= d:
print(b-c)
elif c <= a and d <= b:
print(d-a) |
p03160 | s073227402 | Wrong Answer | n = int(input())
H = list(map(int, input().split()))
DP = [10 ** 5] * n
DP[0] = 0
for i in range(1, n):
DP[i] = min(DP[i], DP[i - 1] + abs(H[i] - H[i - 1]))
if i > 1:
DP[i] = min(DP[i], DP[i - 2] + abs(H[i] - H[i - 2]))
print(DP[-1]) |
p02554 | s472181054 | Accepted | N = int(input())
TEN = 1
NINE = 1
EIGHT = 1
a = 10
b = 9
c = 8
mod = 10 ** 9 + 7
for i in range(64):
if N % 2:
TEN *= a
TEN %= mod
NINE *= b
NINE %= mod
EIGHT *= c
EIGHT %= mod
N //= 2
a *= a
a %= mod
b *= b
b %= mod
c *= c
c %= mod
print((TEN - 2 * NINE + EIGHT + mod * 2)%mod) |
p03838 | s588273816 | Accepted | x, y = map(int, input().split())
diff = abs(abs(x)-abs(y))
if abs(x) < abs(y):
if x < 0:
diff += 1
if y < 0:
diff += 1
else:
if x > 0:
diff += 1
if y > 0:
diff += 1
print(diff) |
p02606 | s239105681 | Accepted | l, r, d = map(int, input().split())
print(r//d - (l-1)//d) |
p02601 | s626749291 | Accepted | a,b,c=map(int,input().split())
k=int(input())
cnt=0
while a>=b:
b*=2
cnt+=1
while b>=c:
c*=2
cnt+=1
if cnt<=k:
print('Yes')
else:
print('No') |
p02677 | s031269021 | Accepted | A,B,H,M=(int(x) for x in input().split())
import math
time = H*60 + M
dist = (5.5 * time)%360
if 0 < dist < 180:
dist = 360 - dist
ans = math.sqrt(A*A + B*B - 2*A*B*math.cos(math.radians(dist)))
print(ans) |
p03795 | s986819661 | Accepted | n=int(input())
print(800*n-200*(n//15)) |
p02973 | s539606492 | Accepted |
from bisect import bisect_right
N = int(input())
X = [int(input()) for _ in range(N)]
INF = 10 ** 9 + 7
dp = [INF] * (N + 1)
for i in range(N):
dp[bisect_right(dp, -X[i])] = -X[i]
print(sum(v < INF for v in dp))
|
p03407 | s914135465 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print("Yes")
else:
print("No") |
p03695 | s275937556 | Accepted | N=int(input())
a=list(map(int,input().split()))
o=0
m=0
u=[0]*8
for i in a:
if 3199<i:
o+=1
else:
if u[i//400]==0:
u[i//400]+=1
m+=1
print(max(m,1),m+o) |
p03243 | s664830841 | Wrong Answer | N = list(input())
l = [int(x) for x in N]
if 0 in l:
l.remove(0)
ma = max(l)
mi = min(l)
m = str(max(l))
n = str(min(l))
o = int(''.join(N))
if int(n*3) > o:
print(int(n*3))
else:
print(int(m*3)) |
p02706 | s855904035 | Wrong Answer | N,M = map(int,input().split())
a = list(map(int, input().split()))
for i in range(M):
N -= a[i]
print(N if N>1 else '-1')
|
p03352 | s496283541 | Accepted | def main():
X = int(input())
ans = 1
for i in range(2, X+1):
for j in range(2, 11):
if i**j > X:
break
else:
ans = max(ans, i**j)
print(ans)
if __name__ == "__main__":
main()
|
p03377 | s874276938 | Accepted | A,B,X=map(int,input().split())
if A+B>=X:
if X<A :
print('NO')
else :
print('YES')
else :
print('NO') |
p02786 | s906536417 | Accepted | H = int(input())
output = 0
t = 1
while H>0:
output += t
H = int(H/2)
t *= 2
print(output) |
p03723 | s439708697 | Accepted | a, b, c = map(int, input().split())
if a%2 == 0 and a==b==c:
print(-1)
exit()
i = 0
a_, b_, c_ = a, b, c
while a%2 == 0 and b%2 == 0 and c%2 == 0:
i += 1
a = b_//2 + c_//2
b = a_//2 + c_//2
c = a_//2 + b_//2
a_, b_, c_ = a, b, c
print(i) |
p03680 | s265890231 | Accepted | a=[input() for _ in range(int(input()))]
now=1
cnt=0
while cnt<=len(a):
now=int(a[now-1])
cnt+=1
if now==2: break
print(cnt if now==2 else '-1') |
p04031 | s505296097 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=10000000
for i in range(-101,102):
tmp=0
for j in range(n):
tmp+=(a[j]-i)**2
if tmp<ans:
ans=tmp
print(ans) |
p03319 | s394943183 | Accepted | N, K = map(int, input().split())
if (N - 1) % (K - 1) == 0:
print((N - 1) // (K - 1))
else:
print((N - 1) // (K - 1) + 1) |
p04031 | s510849695 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
t = (0, 0)
for y in range(min(a), max(a)):
sum = 0
for x in a:
sum += (x - y) ** 2
if t[0] == 0 or t[1] > sum:
t = (y, sum)
print(t[1])
|
p03293 | s686450727 | Accepted | S = input()
T = input()
for _ in range(len(S)):
S_lst = list(S)
tmp = S[0]
for i in range(len(S) - 1):
S_lst[i] = S_lst[i+1]
S_lst[-1] = tmp
S = ''.join(S_lst)
if S == T:
print("Yes")
exit()
else:
print("No") |
p03317 | s405255373 | Wrong Answer | N,K = map(int,input().split())
A = list(map(int,input().split()))
index = A.index(1)
cnt = 1
right = 0
left = 0
if (N-1)//2 < index:
right = N-1-index
left = index-(K-1)
else:
left = index
right = N-1-index-(K-1)
if left%(K-1) == 0:
cnt += left//(K-1)
else:
cnt += left//(K-1)+1
if right%(K-1) == 0:
cnt += right//(K-1)
else:
cnt += right//(K-1)+1
print(cnt) |
p02700 | s088816017 | Accepted | a,b,c,d = map(int, input().split())
i = 0
while a > 0 and c > 0:
if i%2 == 0:
c -= b
else:
a -= d
i += 1
if a > c:
print('Yes')
else:
print('No') |
p02701 | s681204718 | Accepted | n = int(input())
s = []
for i in range(n):
s.append(input())
print(len(set(s))) |
p03557 | s888642983 | Accepted | from bisect import bisect_left as bl,bisect_right as br
n=int(input())
a,b,c=[sorted(list(map(int,input().split()))) for i in range(3)]
ans=0
for v in b:
if v<=a[0] or v>=c[-1]:continue
ans+=bl(a,v)*(n-br(c,v))
print(ans) |
p02613 | s974076564 | Wrong Answer | N = int(input())
S = [i for i in str(input())]
print("AC x " + str(S.count('AC')))
print("WA x " + str(S.count('WA')))
print("TLE x " + str(S.count('TLE')))
print("RE x " + str(S.count('RE')))
|
p02897 | s089958838 | Accepted | n = int(input().rstrip())
r = int(n / 2) + (n % 2)
print(r / n)
|
p02847 | s075449328 | Accepted |
# Can't Wait for Holiday
S = input()
if S == 'SUN':
a = 0
elif S == 'MON':
a = 1
elif S == 'TUE':
a = 2
elif S == 'WED':
a = 3
elif S == 'THU':
a = 4
elif S == 'FRI':
a = 5
elif S == 'SAT':
a = 6
answer = 7 - a
print(answer) |
p02899 | s854688157 | Accepted | #
# 172C Go to school
#
a = []
n = input()
nums = [int(e) for e in input().split()]
for i in range(int(n)):
a.append([i, nums[i]])
a_sorted = sorted(a, key=lambda x: x[1])
for i in range(int(n)):
print(str(a_sorted[i][0]+1), end=' ') |
p03001 | s757660702 | Accepted | W, H, x, y = map(int, input().split())
R = 0
if W == 2*x and H == 2*y:
R = 1
print(W*H / 2,R) |
p03611 | s553749716 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
B = [0] * len(A)
C = [0] * len(A)
for i in range(len(A)):
B[i] = A[i] + 1
C[i] = A[i] - 1
t= 0
m = 0
for X in range(1 , max(A) + 1):
t = A.count(X) + B.count(X) + C.count(X)
m = max(m,t)
print(m) |
p03352 | s724143303 | Accepted | x = int(input())
li = [1]
for i in range(100):
n = 2
while x >= (i+2)**n:
li.append((i+2)**n)
n += 1
print(max(li)) |
p03146 | s704698258 | Wrong Answer | s = int(input())
a = [s]
used = [0] * (10**6+1)
for i in range(2, 10**6+2):
if a[-1] % 2 == 0:
a.append(val := a[-1]//2)
else:
a.append(val := 3*a[-1]+1)
if used[val]:
print(i)
break
else:
used[val] = 1
|
p03657 | s017100332 | Wrong Answer | a,b = map(int,input().split())
print("Possible" if a%3==0 or b%3==0 or (a+b)%3==0 else "Impossilbe") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.