problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03449 | s657077954 | Wrong Answer | N = int(input())
List = []
for i in range (2):
List.append(list(map(int, input().split())))
sumList1 = [0]*N
sumList2 = [0]*N
for i in range(N):
if i == 0:
sumList1[i] = List[0][i]
sumList2[N-1-i] = List[1][N-1-i]
else:
sumList1[i] = List[0][i]+sumList1[i-1]
sumList2[N-1-i] = List[1][i]+sumList2[N-i]
res = 0
for i in range(N):
res = max(sumList1[i]+sumList2[i],res)
print(res) |
p03035 | s566245495 | Wrong Answer | a, b = map(int, input().split())
if a >= 13:
print(b)
elif 12 >= a and a>= 6:
print(b / 2)
else:
print(0) |
p02747 | s493976770 | Accepted | import collections
def main():
s = str(input())
if len(s) % 2 == 0:
for i in range(len(s)//2):
if s[0+2*i:2+2*i] != 'hi':
print('No')
break
else:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
p02899 | s427393542 | Accepted | N = int(input())
A = list(map(int,input().split()))
Q = [''] * N
for i in range(N):
Q[A[i] - 1] = str(i + 1)
print(' '.join(Q)) |
p03633 | s131054626 | Wrong Answer | def gcd(n,m):
if n < m:
t = n
n = m
m = t
r = n % m
while r > 0:
n, m = m, r
r = n % m
return m
from itertools import accumulate
def GCD(args):
return list(accumulate(args,gcd))[-1]
N = int(input())
T = [int(input()) for _ in range(N)]
g = GCD(T)
ans = g
for t in T:
ans *= t//g
print(ans) |
p03472 | s848289244 | Wrong Answer | import bisect
import math
n,h = map(int,input().split())
a,b = [0]*n,[0]*n
for i in range(n):
a[i],b[i] = map(int,input().split())
a.sort()
b.sort()
d = 0
for i in range(n-bisect.bisect_right(b,a[n-1])):
d += b[n-1-i]
if math.floor((h-d)/a[n-1])*a[n-1] + d >= h:
print(math.floor((h-d)/a[n-1]) + n-bisect.bisect_right(b,a[n-1]))
else:
print(math.ceil((h-d)/a[n-1]) + n-bisect.bisect_right(b,a[n-1])) |
p02691 | s997897883 | Accepted | from collections import defaultdict
N = int(input())
A = map(int, input().split())
d = defaultdict(int)
ans = 0
for i, a in enumerate(A):
ans += d[-i+a]
d[-i-a] += 1
print(ans)
|
p03796 | s897030400 | Accepted | N = int(input())
MOD = 1000000007
power = 1
for i in range(1, N + 1):
power *= i
power %= MOD
print(power) |
p03371 | s985361331 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ans = x * a + y * b
ans = min(ans, abs(x - y) * a + min(x, y) * c * 2)
ans = min(ans, max(x, y) * c * 2)
print(ans)
|
p02860 | s472942322 | Accepted | N = int(input())
S = input()
if N % 2 !=0:
print('No')
else:
n = int(N/2)
s1 = S[:n]
s2 = S[n:]
if s1 == s2:
print('Yes')
else:
print('No') |
p02970 | s807142127 | Wrong Answer | a,b = map(int,input().split())
r = b*2+1
if a%b == 0:
print(a//b)
else:
print(a//b+1)
|
p02627 | s561607426 | Accepted | s = str(input())
if s.isupper():
print("A")
else:
print("a") |
p03208 | s652800083 | Accepted | #!/usr/bin/env python3
def main():
*N, = map(int, open(0).read().split())
h = N[2:]
K = N[1]
N = N[0]
h.sort(reverse=True)
ans = max(h) - min(h)
for i in range(0, N - K + 1):
d = h[i] - h[i + K -1]
if d < ans:
ans = d
print(ans)
main() |
p03086 | s492763832 | Accepted | S = input()
List = list(S)
ans = 0
arr = []
for i in range(len(List)):
if List[i] == "A" or List[i] == "C" or List[i] == "G" or List[i] == "T":
ans += 1
else:
arr.append(ans)
ans = 0
arr.append(ans)
print(max(arr))
|
p02639 | s714891394 | Wrong Answer | li = list(map(int,input().split()))
for i in range(0,5):
if li[i] == 0:
print(i) |
p02577 | s341562265 | Wrong Answer | n=input()
a=len(n)
b=0
for i in range(a):
b=b+int(n[i])
print(b)
|
p02748 | s530996835 | Accepted | a,b,m=[int(i) for i in input().split(" ")]
a=[int(i) for i in input().split(" ")]
b=[int(i) for i in input().split(" ")]
min=min(a)+min(b)
for i in range(m):
x,y,c=[int(i) for i in input().split(" ")]
val=a[x-1]+b[y-1]-c
if val<min:
min=val
print(min)
|
p03352 | s255588006 | Accepted | x = int(input())
ans = 0
for i in range(1,32):
for p in range(2,10):
y = i**p
if y > 1000:
break
if ans < y <= x:
ans = y
print(ans) |
p03817 | s116550555 | Wrong Answer | x = int(input())
if x<11:
print(1 if x <= 6 else 2)
else:
t = x // 11
t += t
if t % 11 != 0:
t += 1
print(t) |
p03219 | s537406120 | Accepted | x, y = map(int, input().split())
print(x+y//2) |
p03605 | s297786147 | Wrong Answer | print("YES")if "9"in input()else print("No") |
p03043 | s324577682 | Accepted | import math
N,K = map(int,input().split())
print('{:.12f}'.format(sum([(1/N)*(0.5)**math.ceil(math.log2(math.ceil(K/i))) if i<K else 1/N for i in range(1,N+1)]))) |
p03548 | s137500468 | Accepted | x,y,z = map(int, input().split())
print((x-z) // (y+z))
|
p03632 | s938526970 | Wrong Answer | A,B,C,D = map(int,input().split(' '))
if B < C:
print(0)
else:
print(min(B-A,min(D-C,B-C))) |
p02553 | s666954902 | Accepted | n = list(map(int, input().split()))
n_max = n[0] * n[2]
for i in range(0, 2):
for j in range(2, 4):
if n_max < n[i] * n[j]:
n_max = n[i] * n[j]
print(n_max) |
p02948 | s980382658 | Accepted | #import bisect
import heapq
from collections import deque
n,m = map(int,input().split())
ab=[]
for i in range(n):
ab.append(list(map(int,input().split())))
lis = [[]for i in range(m)]
for i in range(n):
if ab[i][0]<=m:
lis[ab[i][0]-1].append(ab[i][1])
pys = []
heapq.heapify(pys)
sum = 0
for i in range(m):
tmp = lis[i]
if tmp:
for j in tmp:
heapq.heappush(pys,-j)
if pys:
sum-=heapq.heappop(pys)
print(sum)
|
p02953 | s974491964 | Wrong Answer | from collections import deque
N = int(input())
H = deque(map(float, input().split()))
j = []
count = 0
prev = H.popleft()
for i in range(N-1):
cor = H.popleft()
if cor - prev < -1:
print('No')
exit()
elif cor - prev == -1:
j.append(cor - prev)
count += 1
else:
j.append(cor - prev)
if count >= 2:
print('No')
exit()
prev = cor
print('Yes')
|
p03437 | s409232060 | Accepted | x,y=map(int,input().split())
if x%y==0:
print("-1")
else:
for i in range(1,x*y):
if x*i%y!=0:
print(x*i)
exit() |
p03632 | s519694506 | Wrong Answer | a,b,c,d=map(int,input().split())
if c<b<d:
print(b-max([a,c]))
elif a<d<b:
print(d-max([a,c]))
else:
print(0)
|
p03041 | s893382809 | Accepted | N,K = [int(x) for x in input().split()]
S =list(input())
S[K-1]=S[K-1].lower()
S = "".join(S)
print(S) |
p03407 | s042002000 | Accepted | A, B, C = map(int, input().split())
if A+B >= C:
print('Yes')
else:
print('No')
|
p03672 | s033212089 | Accepted | def resolve():
s = input()
len(s)
for i in range(len(s)):
s = s[0 : -1]
#print(f"{s} length is {len(s)}")
if len(s) % 2 == 0:
sa = s[0 : int(len(s)/2)]
sb = s[int(len(s)/2) : ]
#print(f"sa is {sa} \nsb is {sb}")
if sa == sb:
print(len(s))
break
resolve() |
p03639 | s506381841 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[32]:
N = int(input())
a = list(map(int, input().split()))
# In[33]:
mylist4 = [1 if x%4 == 0 else 0 for x in a]
mylist2 = [1 if x%2 == 0 else 0 for x in a]
b4 = sum(mylist4)
b2 = sum(mylist2)-b4
b1 = N-b2-b4
if b2 == 0:
if b1 <= b4+1:
print("Yes")
else:
print("No")
else:
if b1 <= b4:
print("Yes")
else:
print("No")
# In[ ]:
# In[ ]:
|
p02571 | s019819383 | Wrong Answer | s = input()
t = input()
ans = 0
for i in range(len(t)+1, 0, -1):
for j in range(0, len(t)-i+1):
if t[j:j+i] in s:
#print(t[j:j+i], s[j:len(t)-j+i])
ans = i
break
print(len(t)-ans)
|
p02780 | s442828707 | Accepted | N,K = map(int,input().split())
p = list(map(int,input().split()))
def kitaiti(n):
return 0.5*n + 0.5
ans = 0
s=[0]*(N+1)
for i in range(N):
s[i+1] = s[i] + p[i]
for i in range(N-K+1):
val = s[K+i] - s[i]
if ans<val:
ans = val
print(kitaiti(ans)+0.5*(K-1))
|
p02677 | s580735912 | Accepted | import numpy as np
a, b, h, m = map(int, input().split())
h_deg = (h*60+m)/720
m_deg = m/60
deg = max(h_deg-m_deg, m_deg-h_deg)
deg = 1.0-deg if deg > 0.5 else deg
if deg == 0.5:
print('{:.20f}'.format(a+b))
else:
print('{:.20f}'.format(np.sqrt(a**2+b**2-(2*a*b*np.cos(2*np.pi*deg))))) |
p02657 | s492555059 | Accepted | x, y = map(int, input().split())
result = x * y
print(result)
|
p03693 | s438025609 | Wrong Answer | r, g, b = map(int,input().split())
ans = 100*r + 10 *g + b
if ans % 4 == 0:
print('Yes')
else :
print('No') |
p03351 | s708871206 | Wrong Answer | a, b, c, d = map(int, input().split())
x=abs(b-a)
y=abs(c-b)
z=abs(c-a)
if z <= d:
print('Yes')
elif y <= d and z <= d:
print('Yes')
else:
print('No') |
p03095 | s863353181 | Accepted | from collections import Counter
n = int(input())
s = input()
mod = 1000000007
ans = 1
cnt = Counter(s)
for v in cnt.values(): ans = ans*(v+1)%mod
ans = (ans-1)%mod
print(ans) |
p02796 | s753446150 | Wrong Answer | def main():
N = int(input())
L = [list(map(int, input().split())) for _ in range(N)]
tmp = []
for a, b in L:
tmp.append([a-b, a+b])
tmp.sort()
t = tmp[0][0]- 1
c = 0
for i in range(N):
if t > tmp[i][0]:
c += 1
else:
t = tmp[i][1]
print(N-c)
if __name__ == '__main__':
main() |
p02701 | s496413795 | Wrong Answer | import collections
N=int(input())
L=[input() for i in range(N)]
C = collections.Counter(L)
D = list(C.values())
E=sum(D)
print(E) |
p03555 | s094802607 | Wrong Answer | x = str(input())
y = str(input())
conditions = x[0] == y[2] and x[1] == y[1] and x[2] == y[0]
if conditions:
print("Yes")
else:
print("No") |
p02548 | s313329096 | Wrong Answer | n = int(input()) # nは入力回数
a = n-1
count = 0
d = 0
for l in range(n):
d = int(a/(l+1))
if d > (l+1):
count += (d-l-1)*2+1
else:
break
print(count) |
p02742 | s474145355 | Wrong Answer | h,w = map(int, input().split())
area = h*w
ans = area // 2 +1
print(ans)
|
p03860 | s885531478 | Wrong Answer | a,s,c = input().split()
S = s[0]
print(a + S + c) |
p04034 | s035716600 | Wrong Answer | n,m=map(int,input().split())
s=set([1])
b=[1]*(n+1)
for i in range(m):
x,y=map(int,input().split())
if x in s:
s.add(y)
b[x]-=1
b[y]+=1
if b[x]==0:
s.remove(x)
print(len(s)) |
p03274 | s316111683 | Wrong Answer | n, k = map(int, input().split())
x = list(map(int, input().split()))
min_time = abs(x[0]) + abs(x[-1] - x[0])
for i in range(n-k+1):
time = abs(x[i]) + abs(x[i+k-1] - x[i])
if time < min_time:
min_time = time
print(min_time) |
p02708 | s840056402 | Accepted | n, k = map(int, input().split())
MOD = 10**9+7
n += 1
ans = 0
for i in range(k, n+1):
p = i*(2*n - (i-1)) // 2
m = i*(2 + i-1) // 2
ans += p - m + 1
print(ans % MOD) |
p02773 | s523195463 | Wrong Answer | import collections
N = int(input())
l = [input() for _ in range(N)]
c = collections.Counter(l)
L = c.most_common()
values, counts = zip(*c.most_common())
A = list(values)
B = list(counts)
b = B.count(B[0])
|
p03478 | s726872079 | Accepted | N,A,B = map(int,input().split())
x = 0
count = 0
s = ""
for i in range(1,N+1):
s = str(i)
for j in range(len(str(i))):
x += int(s[j])
if x >= A and x <= B:
count += i
x = 0
print(count) |
p02660 | s018745184 | Accepted | import sys
from bisect import bisect_right
n = int(input())
data = [n*(n+1)//2 for n in range(1,40)]
cnt2 = 0
while n % 2 == 0:
cnt2 += 1
n //= 2
ans = bisect_right(data,cnt2)
if n == 1:
print(ans)
sys.exit()
for i in range(3,int(n**(0.5))+1,2):
cnt = 0
while n % i == 0:
cnt += 1
n //= i
ans += bisect_right(data,cnt)
if n == 1:
break
else:
ans += 1
print(ans) |
p02659 | s179045314 | Wrong Answer | a=list(input().split())
x=int(a[0])
y=float(a[1])
print(int(x*y))
|
p03261 | s651295150 | Wrong Answer | n = int(input())
list_w = [input() for s in range(0, n)]
for i in range(0, n):
if i == 0 or (list_w[i][-1] == list_w[i][0] and list_w[i] in list_w[:i]):
continue
else:
print("No")
exit()
print("Yes") |
p03486 | s122907679 | Accepted | s = list(input())
t = list(input())
if s==t:
print('No')
exit()
s = sorted(s)
s = ''.join(s)
t = sorted(t, reverse=1)
t = ''.join(t)
l = [s,t]
k = sorted(l)
if l==k:
print('Yes')
else:
print('No') |
p03637 | s573070333 | Accepted | n = int(input())
a = list(map(int, input().split()))
num1, num2, num4 = 0, 0, 0
for i in a:
if i % 4 == 0:
num4 += 1
elif i % 2 == 0:
num2 += 1
else:
num1 += 1
if num1 <= num4:
print('Yes')
elif num1 == num4 + 1 and num2 == 0:
print('Yes')
else:
print('No') |
p02570 | s739054093 | Accepted | D,T,S = map(int, input().split())
if T*S>=D:
print("Yes")
else:
print("No")
|
p02607 | s796924617 | Wrong Answer | n = int(input())
a = [int(x) for x in input().split()]
cnt = 0
for a0 in a[::1]:
if a0%2 == 1:
cnt += 1
print(cnt) |
p02972 | s208123590 | Accepted | n,*a=map(int,open(0).read().split())
b=[0]*n
for i in range(1,n+1)[::-1]:
if not sum(b[i-1::i])%2==a[i-1]:
b[i-1]=1
print(sum(b))
print(*[i+1 for i,b_i in enumerate(b) if b_i==1]) |
p02615 | s138731039 | Wrong Answer | def resolve():
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = sum(A) - min(A)
if (A[0] > 1 and A[0] == A[1]):
ans += A[0] - A[-2]
print(ans)
resolve() |
p02785 | s048167215 | Accepted | n,k=map(int,input().split())
h_list=[int(i) for i in input().split()]
h_list.sort()
print(sum(h_list[:n-k]) if n>k else 0) |
p04034 | s592871423 | Accepted | n,m=map(int,input().split())
quant=[1]*(n+1)
prob=[0]*(n+1)
prob[1]=1
for i in range(m):
x,y=map(int,input().split())
quant[x]-=1
quant[y]+=1
if prob[x]>0:
prob[y]+=1
if quant[x]==0:
prob[x]=0
cnt=0
for i in range(n+1):
if prob[i]>0:
cnt+=1
print(cnt)
|
p03478 | s324996201 | Accepted | N, A, B = map(int, input().split())
nums = []
for i in range(1,N+1):
I = str(i)
s = 0
for j in range(len(I)):
s += int(I[j])
if s >= A and s <= B:
nums.append(i)
print(sum(nums)) |
p02731 | s969231865 | Accepted | L = int(input())
ans = L**3 / 27
print(ans) |
p02785 | s057036309 | Accepted | n, k = map(int, input().split())
h = [i for i in map(int, input().split())]
c = n - k
if c>0:
h.sort(reverse=True)
h = h[-c:]
print(sum(h))
else:
print(0) |
p03254 | s751135569 | Wrong Answer | N,x=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
for i in range(len(A)):
if x-A[i]<0:
break
else:
x-=A[i]
print(i) |
p03136 | s363421361 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
if l.pop(0) < sum(l):
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() |
p02939 | s641249043 | Wrong Answer | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
S = input()
last = ""
tmp = ""
ans = 0
for s in S:
tmp += s
if s == last:
continue
# print(tmp)
last = tmp
tmp = ""
ans += 1
print(ans) |
p02989 | s401871282 | Accepted | n = int(input())
d = list(map(int, input().split()))
d.sort()
print(d[n//2] - d[n//2-1])
|
p03371 | s172907327 | Accepted | A,B,C,X,Y = map(int,input().split())
if 2*C >= A+B:
print(X*A+Y*B)
else:
if X >= Y:
if A > 2*C:
print(2*X*C)
else:
print(2*Y*C + (X-Y)*A)
else:
if B > 2*C:
print(2*Y*C)
else:
print(2*X*C+(Y-X)*B)
|
p03073 | s783344281 | Accepted | s = input()
cnt = 0
for i in range(len(s)):
if i%2 != int(s[i]):
cnt += 1
print(min(cnt, len(s)-cnt)) |
p02571 | s759540474 | Accepted | s= input()
t = input()
n = len(s)
n1 = len(t)
ans= 100000
for i in range(n-n1+1):
count= 0
for j in range(n1):
#print(i,j,n,n1)
if s[i+j]==t[j]:
continue
else:
count+=1
#print(count)
ans = min(ans,count)
print(ans)
|
p03030 | s644928998 | Wrong Answer | n=int(input())
a=[]
for i in range(n):
s,p=input().split()
a.append([s,100-int(p)])
print(a)
city=sorted(a)
print(city)
for i in city:
print(a.index(i)+1)
|
p03351 | s819207950 | Accepted | a, b, c, d = map(int, input().split())
if ((abs(a - c) <= d) or (abs(a - b) <= d and abs(b - c) <= d)):
print("Yes")
else:
print("No")
|
p03644 | s809230217 | Accepted | n = int(input())
ans=1
for i in range(7):
if 2**i<=n:
ans=2**i
print(ans) |
p03076 | s848818269 | Accepted | order = [int(input()) for _ in range(5)]
tmp=0
diff = 10
for i in order:
if i%10 != 0:
diff = min(i%10, diff)
tmp+=((i//10)+1)*10
else:
tmp+=i
print(tmp+diff-10) |
p03760 | s508594891 | Accepted | o = input()
e = input()
s = ""
for a in range(max(len(o), len(e))):
try:
s += o[a]
except IndexError:
pass
try:
s += e[a]
except IndexError:
pass
print(s) |
p03544 | s006984828 | Wrong Answer | n = int(input())
x = 2
y = 1
if n==1:
print(2)
elif n==2:
print(1)
else:
for i in range(n-1):
l = x+y
x = y
y = l
print(l) |
p02811 | s621931633 | Wrong Answer | K, X = map(int, input().split())
print('Yes' if 500 * X >= K else 'No') |
p02744 | s028051167 | Wrong Answer | num = int(input())
base = ["a","b","c","d","e","f","g","h","j","k"]
if num == 1:
print("a")
elif num == 2:
print("aa")
print("ab")
elif num == 3:
print("aaa")
print("aab")
print("aba")
print("abb")
print("abc")
elif num == 4:
print("aaaa")
print("aaab")
print("aaba")
print("aabb")
print("aabc")
print("abaa")
print("abab")
print("abac")
print("abba")
print("abbb")
print("abbc")
print("abca")
print("abcb")
print("abcc")
print("abcd") |
p02996 | s674519642 | Wrong Answer | n = int(input())
ab = [[0] * 2 for _ in range(n)]
for i in range(n):
a, b = map(int, input().split())
ab[i][0], ab[i][1] = a, b
ab = sorted(ab, key=lambda x: x[1])
#print(ab)
time = 0
for task in ab:
time += task[0]
if time <= task[1]:
print(time, task[1])
continue
else:
print('No')
exit()
print('Yes')
|
p03160 | s511061826 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
h = [int(x) for x in input().split()]
dp = [float('inf')] * (n + 1)
dp[1] = 0
dp[2] = abs(h[1] - h[0])
for i in range(3, n + 1):
dp[i] = min(dp[i - 1] + abs(h[i - 1] - h[i - 2]), dp[i - 2] + abs(h[i - 1] - h[i - 3]))
print(dp[-1])
|
p02854 | s184619545 | Wrong Answer | n = int(input())
li = list(map(int,input().split()))
s = sum(li)
sum_li = []
for i,l in enumerate(li):
if i == 0:
sum_li.append(l)
continue
sum_li.append(sum_li[-1]+l)
all_li = []
for ss in sum_li:
#print(s,ss)
all_li.append(abs(s-ss))
print(min(all_li))
|
p02595 | s816188402 | Accepted | N,D=map(int,input().split())
ans=0
for i in range(N):
x,y=map(int,input().split())
if x**2+y**2<=D**2:
ans+=1
print(ans) |
p02583 | s692525153 | Accepted | n=int(input())
l=list(map(int,input().split()))
ans=0
for i in range(n):
for j in range(n):
for k in range(n):
if l[i]<l[j]<l[k] and l[i]+l[j]>l[k]:
ans+=1
print(ans) |
p03408 | s629815747 | Accepted | lwrd = list()
lcnt = list()
N = int(input())
for i in range(N):
w = input()
if w in lwrd:
lcnt[lwrd.index(w)] += 1
else:
lwrd.append(w)
lcnt.append(1)
M = int(input())
for i in range(M):
w = input()
if w in lwrd:
lcnt[lwrd.index(w)] -= 1
else:
lwrd.append(w)
lcnt.append(-1)
if max(lcnt) >= 0:
print(max(lcnt))
else:
print(0) |
p04011 | s881759031 | Accepted | # -*- coding: utf-8 -*-
# ケアレスミスしないように一旦紙に式を書くこと
n = int(input())
k = int(input())
x = int(input())
y = int(input())
diff = y - x
p_x = x * n
p_y = diff * (n - k) if (n - k) > 0 else 0
print(p_x + p_y)
#p_x = x * k if n - k >= 0 else x * n
#p_y = (n - k) * y if n - k > 0 else 0
#print(p_x + p_y) |
p02818 | s613040494 | Wrong Answer | a,b,k=map(int,input().split())
if a==0 and b>=k:
print(0,b-k)
elif a>=k and b==0:
print(a-k,b)
else:
print(0,0)
|
p04031 | s607850313 | Accepted | N=int(input())
a=list(map(int,input().split()))
def rewrite(n,l):
cost=0
for i in l:
cost += (i-n)**2
return cost
r1=rewrite(int(sum(a)/len(a)),a)
r2=rewrite(int(sum(a)/len(a))+1,a)
print(r1 if r1<r2 else r2) |
p02848 | s366211417 | Accepted | from string import *
N = int(input())
S = input()
ans = ""
for i in range(len(S)):
n = ascii_uppercase.find(S[i])
if(n+N-1 >= 25):
ans += ascii_uppercase[n+N-26]
else:
ans += ascii_uppercase[n+N]
print(ans) |
p02983 | s194714737 | Accepted | mod = 2019
l, r = map(int, input().split())
if r//mod - l//mod > 0:
print(0)
else:
l %= mod
r %= mod
ans = mod - 1
for i in range(l+1, r+1):
for j in range(l, i):
ans = min(i*j%mod, ans)
print(ans) |
p02621 | s689031160 | Wrong Answer | a = int(input())
b=a+a^2+a^3
print(b) |
p02682 | s198550701 | Accepted | a, b, c, k = map(int, input().split())
if k <= a:
print(k)
else:
k -= a
if k <= b:
print(a)
else:
k -= b
print(a + k * (-1)) |
p02702 | s773454395 | Wrong Answer | S=input()
cnt=0
for i in range (3,len(S)+1):
for j in range (i-3):
if int(S[j:i+1])%2019==0:
cnt+=1
print(cnt-1) |
p03711 | s495293828 | Accepted | a,b = map(int, input().split())
c = [1,3,5,7,8,10,12]
d = [4,6,9,11]
if a in c:
if b in c:
print('Yes')
else:
print('No')
elif a in d:
if b in d:
print('Yes')
else:
print('No')
else:
print('No') |
p03695 | s687218017 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
mi=0
ma=0
l=[]
count=0
for i in range(N):
if a[i]<2800:
l.append(a[i]//400)
else:
count=count+1
print(len(set(l))+min(1,count),len(set(l))+max(0,count)) |
p03557 | s383683720 | Wrong Answer | from bisect import bisect_left, bisect_right
n = int(input())
a = sorted(map(int, input().split()))
b = sorted(map(int, input().split()))
c = sorted(map(int, input().split()))
ans = 0
print(a)
print(b)
print(c)
def bin_search(x, n, flag):
if flag == True:
return bisect_left(x, n)
else:
return bisect_right(x, n)
for i in range(n):
ans += bin_search(a, b[i], True) * (n - bin_search(c, b[i], False))
print(ans) |
p03041 | s773263492 | Wrong Answer | N, K = map(int, input().split())
S = input()
ans = ""
for i in range(N):
if i == K:
ans += S[i].lower()
else:
ans += S[i]
print(ans)
|
p02786 | s958935458 | Wrong Answer | H = int(input())
i = 1
while H > 1:
H = -(-H//2)
print("H=%d,i=%d" % (H,i))
if H >= 1:
i += 1
print(2**i-1) |
p02701 | s896914321 | Accepted | N = int(input())
S = set()
for i in range(N):
S.add(input())
print(len(S)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.