problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03803 | s456869438 | Accepted | A, B = map(int, input().split())
if A == B:
print('Draw')
exit()
if A == 1:
print('Alice')
elif B == 1:
print('Bob')
elif A > B:
print('Alice')
else:
print('Bob')
|
p04020 | s453931458 | Accepted | N = int(input())
A = [0] + [int(input()) for i in range(N)]
ans = 0
for i in range(1, N+1):
a = A[i]; pre_a = A[i-1]
if pre_a == 1 and a >= 1:
ans += 1
a -= 1
ans += a//2
A[i] = a % 2
print(ans) |
p02665 | s045235652 | Accepted | N = int(input())
A = [int(a) for a in input().split()]
MA = [0] * (N + 2)
MA[0] = 1
ma = 1
for i, a in enumerate(A):
if a > ma or (a == ma and i < N - 1):
print(-1)
exit()
ma = (ma - a) * 2
MA[i+1] = ma
ans = 0
s = 0
for i in range(N + 1)[::-1]:
a = A[i]
s = min(s + a, MA[i])
an... |
p03611 | s528990442 | Wrong Answer | n = int(input())
a = [int(k) for k in input().split()]
cnt = [0]*(10**5+1)
for i in a:
cnt[i] += 1
s = cnt[0] + cnt[1] + cnt[2]
ans = 1
for i in range(3,n-2):
s -= cnt[i-3]
s += cnt[i]
#print(s)
ans = max(s,ans)
print(ans)
|
p03814 | s722442155 | Wrong Answer | s=input()
print(len(s[s.find("A"):s.find("Z")+1])) |
p03797 | s712556394 | Accepted | import sys
input = sys.stdin.readline
n,m=map(int,input().split())
print(min(m//2,(n+m//2)//2))
|
p02911 | s056508557 | Wrong Answer | n,k,q = map(int,input().split())
S=[0]*n
for i in range(q):
a = int(input())
S[a-1]+=1
print( S, max(S) )
for i in range(n):
if S[i]>q-k :
print("Yes")
else:
print("No")
|
p02866 | s245137436 | Wrong Answer | N=int(input())
D=list(map(int,input().split()))
layer=[0]*N
mx=0
for item in D:
layer[item]+=1
mx=max(mx,item)
if layer[0]>1:
print(0)
exit()
ans=1
for i in range(mx):
ans*=layer[i]**layer[i+1]
print(ans%998244353) |
p02713 | s548342649 | Wrong Answer | import math
K=int(input())
r=0
for i in range(1,K+1):
for j in range(1,K+1):
a=math.gcd(i,j)
for k in range(K+1):
b=math.gcd(a,k)
r+=b
print(r) |
p02972 | s806681100 | Accepted | # D - Preparing Boxes
n = int(input())
a = list(int(x) for x in input().split())
ans = [0] * n
for i in range(n)[::-1]:
tmp = 0
j = 0
while i+(i+1)*j<n:
tmp += ans[i+(i+1)*j]
j += 1
if tmp%2==a[i]:
continue
else:
ans[i] = 1
print(sum(ans))
if sum(ans)>0:
print... |
p03000 | s694326743 | Accepted | n, x = map(int, input().split())
l = [int(i) for i in input().split()]
p = 0
for i in range(n):
p += l[i]
if p > x:
print(i + 1)
break
else:
print(n + 1)
|
p02622 | s486607432 | Accepted | s = input()
t = input()
df = 0
for i in range(len(s)):
if s[i] != t[i]:
df += 1
print(df) |
p03437 | s883135486 | Accepted | def resolve():
X, Y = [int(i) for i in input().split()]
if X % Y == 0:
print(-1)
else:
print(X)
resolve()
|
p02923 | s648172963 | Accepted | n = int(input())
h = list(map(int,input().split()))
ans = 0
kar = 0
for i in range(n-1):
if h[i] >= h[i+1]:
kar += 1
else:
if kar >= ans:
ans = kar
kar = 0
if kar >= ans:
ans = kar
print(ans) |
p02571 | s282130104 | Accepted | import sys
string1 = str(input())
string2 = str(input())
n, m = len(string2), len(string1)
ans = sys.maxsize
for i in range(m - n + 1):
minRemovedChar = 0
for j in range(n):
if (string2[j] != string1[i + j]):
minRemovedChar += 1
ans = min(minRemovedChar, ans)
print(ans) |
p03359 | s128183908 | Accepted | a,b=map(int,input().split())
if (a<=b):
print(a)
elif (a>b):
print(a-1) |
p03219 | s331948617 | Accepted | x,y=map(int,input().split())
print(x+y//2) |
p02618 | s544834762 | Accepted | D = int(input())
c = list(map(int,input().split()))
last_di = [0] * 26
for d in range(1, D+1):
s = list(map(int,input().split()))
satisfaction_list = [0] * 26
for i in range(26):
satisfaction_list[i] = c[i] - (d - last_di[i])
min_index = satisfaction_list.index(min(satisfaction_list))
print(... |
p02951 | s114643742 | Accepted | a,b,c=map(int, input().split())
if c-(a-b) >= 0:
print(c-(a-b))
else:
print(0) |
p03252 | s824050853 | Wrong Answer | s = set(input())
t = set(input())
if len(s) == len(t):
print('Yes')
else:
print('No') |
p02917 | s977750396 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
B = [int(x) for x in input().split()]
A = []
for i in range(N) :
if i == 0 :
Ai = B[0]
elif i == N-1 :
Ai = B[i-1]
else :
Ai = min(B[i-1], B[i])
A.append(Ai)
print(sum(A))
|
p03720 | s339185419 | Accepted | n, m = map(int, input().split())
counter_list = [0] * (n + 1)
for i in range(m):
a, b = map(int, input().split())
counter_list[a] += 1
counter_list[b] += 1
for i in range(1, n + 1):
print(counter_list[i])
|
p03544 | s736404657 | Wrong Answer | n=int(input())
k,l=2,1
for i in range(n-1):
k,l=k+l,k
print(l)
|
p03293 | s901930349 | Accepted | s=input()
t=input()
l=len(s)
for _ in range(l):
if s==t:
print("Yes")
exit()
else:
s=s[-1]+s[:l-1]
print("No")
|
p03457 | s833079507 | Wrong Answer | N = int(input())
cs = []
t1, x1, y1 = 0, 0, 0
ans = 'Yes'
for i in range(N):
t2, x2, y2 = map(int, input().split())
d = abs(x1-x2) + abs(y1-y2)
if d == 0 or d > (t2 - t1) or d % 2 != (t2 - t1) % 2:
ans = 'No'
break
print(ans) |
p03160 | s220073194 | Accepted | import sys
sys.setrecursionlimit(10**6)
N = int(input())
h = list(map(int, input().split()))
dp = [-1] * (N+1)
def rec(i):
if i == 0:
return 0
if dp[i] != -1:
return dp[i]
dp[i] = 2**60 # 十分大きな値
if i - 1 >= 0:
dp[i] = min(dp[i], rec(i - 1) + abs(h[i - 1] - h[i]))
if i - 2 >... |
p02725 | s642937636 | Accepted | k,n=map(int,input().split())
a=list(map(int,input().split()))
dist=[]
for i in range(n-1):
dist.append(a[i+1]-a[i])
dist.append(k-a[n-1]+a[0])
print(sum(dist)-max(dist)) |
p03997 | s333706070 | Wrong Answer | # 入力
a, b, h = [int(input())for i in range(3)]
# 処理
S =((a + b) * h) / 2
# 出力
print(S) |
p02952 | s164421203 | Accepted | n = int(input())
cnt = 0
for i in range(1,10**5+1):
if (i <= n) and (len(str(i)) in [1,3,5]):
cnt += 1
print(cnt) |
p02576 | s654378922 | Wrong Answer | N=20; X=12; T=6
import math
T_total = ( math.ceil( N / X )*T + T )
print (T_total) |
p03095 | s060599676 | Wrong Answer | mod = 10**9+7
n = int(input())
s = input()
dic = [0 for _ in range(26)]
for i in range(n):
dic[ord(s[i])-97] += 1
dic = [i for i in dic if i > 0]
result = 0
for i in range(1, 2**len(dic)):
c = 1
num = i
for j in dic:
if num%2==1:
c *= j
c %= mod
num >>= 1
resu... |
p03487 | s666594930 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
d={}
ans=0
for a in A:
try:
d[a]+=1
except KeyError:
d[a]=1
if d[a]>a:
ans+=1
d[a]-=1
print(ans)
|
p03243 | s927670058 | Accepted | n=int(input())
t=111
c=1
while t<n:
c+=1
t=111*c
print(t) |
p03637 | s988080536 | Accepted | n = int(input())
a = list(map(int, input().split()))
"""
４の倍数がn//2個以上
or
全部が２の倍数
"""
n2 = 0
n4 = 0
for _a in a:
if _a%4 == 0:
n4 += 1
elif _a%2 == 0:
n2 += 1
if n4 + n2//2 >= n//2:
print("Yes")
else:
print("No") |
p02759 | s187396087 | Accepted | import math
n = int(input())
print(math.ceil(n/2)) |
p02817 | s277462659 | Accepted | s,t=input().split()
print(t+s) |
p03262 | s093253581 | Wrong Answer | from fractions import gcd
n,x=map(int,input().split())
l=list(map(int,input().split()))
a=[]
for i in range(n):
a.append(abs(l[i]-x))
g=0
for i in range(n-1):
g=gcd(g,gcd(a[i],a[i+1]))
print(g) |
p02918 | s177380236 | Accepted | n,k=map(int,input().split())
s=input()
c=0
for i in range(n-1):
if s[i]==s[i+1]:
c+=1
print(min(n-1,c+2*k)) |
p03264 | s795280400 | Wrong Answer | n=int(input())
if n%2==0:
print((n//2)*(n//2+1))
else:
print((n//2)**2) |
p03693 | s853986043 | Accepted | print('YNEOS'[int(input()[::2])%4>0::2]) |
p03767 | s269712351 | Accepted | N = int(input())
a = list(map(int, input().split()))
r = 2 * N
ans = 0
a.sort(reverse=True)
if a[0] > 10**9:
exit()
a_choiced = a[0:r][1::2]
for i in a_choiced:
ans += i
print(ans) |
p02818 | s941485047 | Accepted | A,B,K=map(int,input().split())
a=max(A-K,0)
k=K-(A-a)
b=max(B-k,0)
print(a,b) |
p03994 | s077479012 | Wrong Answer | s = list(input())
k = int(input())
#print(ord("z"))
for i in range(len(s)):
if 123 - ord(s[i]) <= k:
k -= (123 - ord(s[i]))
s[i] = 'a'
#print(k)
#print(s, k)
for i in range(1, len(s) + 1):
if k == 0:
break
else:
if 122 - ord(s[-i]) < k:
k -= 122 - ord(s[-i])
s[-i] = 'z'
else:
... |
p02628 | s752682357 | Accepted | N,K = map(int,input().split())
P = list(map(int,input().split()))
P = sorted(P)
print(sum(P[0:K])) |
p02659 | s057565214 | Accepted | import sys
input = input().split()
A = int(input[0])
B = int(input[1].replace('.',''))
print((A*B // 100)) |
p02780 | s522143374 | Accepted | N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
L = [0] * N
for i in range(N):
L[i] = (1 + p[i]) / 2
ans = 0
k = 0
for i in range(K):
k += L[i]
ans = k
for i in range(K, N):
k += L[i] - L[i - K]
ans = max(ans, k)
print(ans) |
p03951 | s037826283 | Wrong Answer | N = int(input())
s = input()
t = input()
sr = s[::-1]
if s== t:
print(s)
else:
for i in range(N):
if sr[i] != t[i]:
break
print(2*N-i)
|
p02783 | s492747080 | Accepted | import math
H, A = map(int, input().split())
print(math.ceil(H / A))
|
p02744 | s954467895 | Accepted | def solve():
N = int(raw_input())
ret = [('a', 'a')]
for i in range (2, N+1):
tmp = []
for stri in ret:
for j in range(ord('a'), ord(stri[1]) + 1):
tmp.append((stri[0] + chr(j), stri[1]))
tmp.append((stri[0] + chr(ord(stri[1]) + 1), chr(ord(stri[1]) + ... |
p02683 | s203839100 | Accepted | n,m,x = map(int, input().split())
c = [0 for _ in range(n)]
a = [[0] for j in range(n)]
for i in range(n):
c[i],*a[i] = map(int, input().split())
cmin = sum(c) + 1
tassei = False
for i in range(1<<n):
rikai = [0 for i in range(m)]
cnow = 0
for j in range(n):
if i & (1<<j):
cnow+=c[j]
for mno... |
p03250 | s182166979 | Accepted | abc=sorted(list(map(int,input().split())),reverse=True)
a=[1]*10
for i in range(10**7):
a.append(a)
print(sum(abc)+abc[0]*9)
|
p03012 | s773183496 | Wrong Answer | n = int(input())
w = [int(i) for i in input().split()]
s = sum(w) // 2
x = 0
for i in w:
if s - x > x + i - s:
x += i
else:
break
print(abs(s - x) * 2) |
p03035 | s292456003 | Accepted | a, b = map(int, input().split())
if a>=13:
print(b)
elif 6<=a<=12:
print(b//2)
else:
print(0) |
p03252 | s723800919 | Wrong Answer | s = list(input())
t = list(input())
S,T = set(s),set(t)
sl = tl = []
for i in S:
sl.append([j for j, x in enumerate(s) if x == i])
for i in T:
tl.append([j for j, x in enumerate(t) if x == i])
if sorted(sl)==sorted(tl):print('Yes')
else:print('No') |
p03293 | s619221944 | Accepted | import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
def main():
if os.getenv("LOC... |
p03612 | s489228746 | Wrong Answer | import math
n = int(input())
p = [x-1 for x in list(map(int, input().split()))]
c = 0
flag = 0
ans = 0
for i in range(n):
if p[i] == i and flag:
c += 1
elif p[i] == i:
c += 1
flag = 1
elif p[i] != i and c > 0:
if c == 1:
ans += 1
else:
ans +... |
p03456 | s646906543 | Accepted | def is_square_num(n):
a = 0
for i in range(0, n+1):
if a == n:
return True
if a > n:
return False
a += i * 2 + 1
a, b = map(str, input().split())
val = int(a+b)
if is_square_num(val):
print('Yes')
else:
print('No') |
p02597 | s904249368 | Wrong Answer | n = int(input())
al = list(input())
cr = al.count('R')
cr2 = cr//2
ans = 0
flag = False
flag2 = False
for a in al[::-1]:
if a == 'R':
cr2 -= 1
if cr2 == 0:
flag = True
continue
if flag and not flag2 and a == 'R':
flag2 = True
continue
if flag2 and a == 'W':
... |
p02951 | s475495425 | Accepted | a, b, c = map(int,input().split())
print(c - (a - b) if c - (a - b) > 0 else 0) |
p03059 | s717885222 | Wrong Answer | A, B, T = map(int, input().split())
print(int(B/A * (T + 0.5)))
|
p02702 | s268508449 | Accepted | P=2019
S = input()
N=len(S)
count=[0]*P
ans = 0
count[0] = 1
u = 0
for i, s in enumerate(reversed(S)):
u = (int(s) * pow(10, i, P) + u) % P
ans += count[u]
count[u] += 1
print(ans) |
p02711 | s134938882 | Accepted | n = list(input())
for i in n:
if int(i) == 7:
print('Yes')
break
else:
print('No') |
p02708 | s171622679 | Accepted | n,k = map(int, input().split())
n_list=list(range(n+1))
saisyou=sum(n_list[0:k])
saidai=sum(n_list[n-k+1:n+1])
ans=saidai-saisyou+1
for i in range(k+1,n+2):
saisyou+=n_list[i-1]
saidai+=n_list[-(i)]
ans+=saidai-saisyou+1
ans%=10**9+7
print(ans) |
p02583 | s316246463 | Accepted | N = int(input())
Ls = list(map(int, input().split()))
Ls.sort(reverse=True)
count = 0
for k, Lk in enumerate(Ls[:-2]):
for j, Lj in enumerate(Ls[k+1:-1]):
for i, Li in enumerate(Ls[k+j+2:]):
if Lk == Lj or Lj == Li or Li == Lk:
continue
if Lk < Lj + Li:
... |
p02628 | s633751626 | Accepted | n, k = map(int, input().split())
lst = list(map(int, input().split()))
lst.sort()
print(sum(lst[:k])) |
p02772 | s454460330 | Accepted | N = int(input())
A = list(map(int, input().split()))
for i in range(len(A)):
if A[i]%2 == 0:
if A[i]%3 != 0 and A[i]%5 != 0:
print("DENIED")
exit(0)
print("APPROVED")
|
p03659 | s645930380 | Accepted | n = int(input())
a = [int(x) for x in input().split()]
ans = pow(10, 15)
key = sum(a)
p = 0
for i in range(n-1):
p += a[i]
if ans > abs(key-2*p):
ans = abs(key-2*p)
print(ans) |
p03059 | s069584697 | Wrong Answer | a,b,t = map(int,input().split())
bis = 0
for i in range(1,20):
time = a * i
if time < t + 0.5:
bis += b
print(bis) |
p03795 | s035338794 | Accepted | N = int(input())
x = N * 800
y = (N // 15) * 200
answer = x - y
print(answer) |
p03657 | s795267804 | Accepted | import numpy as np
a, b = map(int ,input().split())
l = np.array([a, b, a+b])
l %= 3
if all(l):
print("Impossible")
else:
print("Possible")
|
p03324 | s492018715 | Accepted | d, n = map(int, input().split())
if d == 0:
if n != 100:
print(n)
else:
print(n + 1)
elif d == 1:
if n != 100:
print(n * 100)
else:
print(n * 100 + 100)
else:
if n != 100:
print(n * 10000)
else:
print(n * 10000 + 10000)
|
p03077 | s175648419 | Accepted | import math
def main():
n = int(input())
# n, m = map(int, input().split())
# a = list(map(int, input().split()))
# s = input()
# h = [int(input()) for _ in rane(n)]
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
print(math.ceil(n / mi... |
p02748 | s179080995 | Wrong Answer | a, b, m = map(int,raw_input().split())
dr = map(int,raw_input().split())
wa = map(int,raw_input().split())
xyc = [map(int,raw_input().split()) for i in range(m)]
low = 200001
for i in range(m):
f = xyc[i][0] - 1
d = xyc[i][1] - 1
if low >= dr[f]+wa[d]-xyc[i][2]:
law = dr[f]+wa[d]-xyc[i][2]
dr.sort... |
p02707 | s129242087 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
for i in range(N-1):
b=A.count(i+1)
print(b) |
p02882 | s625931875 | Wrong Answer | import math
A,B,C = list(map(int,input().split()))
V = A**2 * B
r = math.atan(2 * (V - C) / (A ** 3))
ans = math.degrees(r)
print(ans) |
p02731 | s597553477 | Accepted | L = int(input())
print((L/3)**3) |
p03328 | s279932290 | Accepted | a, b = map(int, input().split())
n = b - a
sumb = n * (n + 1) // 2
print(sumb - b) |
p02658 | s077612532 | Accepted | n=int(input())
a=list(map(int,input().split()))
if 0 in a:
print(0)
else:
s=1
for i in a:
s=s*i
if s>10**18:
s=-1
break
print(s) |
p03309 | s703126806 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A = [x-i-1 for i, x in enumerate(A)]
R = round(sum(A)/N)
m = 1000000000000
for i in range(-100, 100):
m = min(m, sum(abs(a-R-i) for a in A))
print(m) |
p03625 | s970732299 | Accepted | N = int(input())
a = list(map(int,input().split()))
a.sort()
x = []
i = len(a)-1
#print(a)
while i > 0:
if a[i] == a[i-1]:
x.append(a[i])
i-=1
i-=1
if len(x) == 2:
print(x[0]*x[1])
exit()
print(0)
|
p03659 | s801570074 | Accepted | _,*a=map(int,open(0).read().split());s,t=sum(a),0;l=[]
for i in a:t+=i;l+=[abs(s-t*2)]
print(min(l[:-1])) |
p03556 | s810922661 | Accepted | N = int(input())
print(int(N**0.5)**2)
|
p04044 | s099640663 | Accepted | n, l = map(int, input().split())
s_list = []
s_list.append(input())
for i in range(n-1):
s = input()
for j in range(len(s_list)):
if s_list[j] >= s:
s_list.insert(j, s)
break
elif j == len(s_list) - 1:
s_list.append(s)
ans = ''
for i in range(len(s_list)):
ans += s_list[i]
print(ans... |
p02766 | s819617056 | Accepted | import sys
input = sys.stdin.readline
N, K = map(int, input().split())
def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
print(len(Base_10_to_n(N, K)))
|
p02601 | s903479375 | Accepted | a, b, c = map(int, input().split())
k=int(input())
for i in range(k):
if a>=b:
b*=2
elif b>=c:
c*=2
if a<b and b<c:
print("Yes")
else:
print("No") |
p03438 | s381385710 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
pos=[0]*n
s=0
for i in range(n):
if b[i]-a[i]>=0:
pos[i]=b[i]-a[i]
else:
s+=a[i]-b[i]
for p in pos:
s-=p//2
if s<=0:
print('Yes')
else:
print('No') |
p02922 | s606012245 | Wrong Answer | A,B=map(int,input().split())
if B%A!=0:
print(B//A+1)
else:
print(B//A) |
p04029 | s372348267 | Wrong Answer | # 入力
N = int(input())
# 処理
total = 0
for i in range(1, N+1):
print(total)
total = total + i
# 出力
print(total) |
p03633 | s619941322 | Wrong Answer | from functools import reduce
from fractions import gcd
N = int(input())
T = []
for i in range(N):
T.append(int(input()))
x = reduce(gcd,T)
sum=0
for i in T:
sum+=x*i
print(sum) |
p02597 | s130498410 | Wrong Answer | n = int(input())
c = input()
def try_count(c, color):
try:
return c.count(color)
except:
return 0
all_r = try_count(c, 'R')
all_w = try_count(c, 'W')
left_w = try_count(c[:all_w], 'W')
print(min(all_r,all_w,left_w)) |
p03250 | s239164782 | Accepted | L = list(map(int,input().split()))
print(10*max(L)+sum(L)-max(L))
|
p02700 | s571946240 | Accepted | A,B,C,D=map(int,input().split())
while True:
if C-B<=0:
print('Yes')
exit()
if A-D<=0:
print('No')
exit()
C-=B
A-=D |
p02743 | s059671249 | Wrong Answer | import sys
import os
import math
Q = 10*9
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
a, b, c = list(map(int, sys.stdin.readline().split()))
# print(math.sqrt(a), math.sqrt(b), math.sqrt(c))
# print(math.sqrt(a*Q), math.sqrt(b*Q), math.sqrt(c*Q))
print('Yes' if ... |
p02707 | s886917145 | Accepted | from collections import defaultdict
def c163(n, al):
count = defaultdict(int)
for i in range(n-1):
count[al[i]] += 1
return count
def main():
n = int(input())
al = list(map(int, input().split()))
dilist = c163(n, al)
for i in range(1 , n + 1):
try:
print(dilis... |
p02836 | s468931919 | Accepted | # AtCoder Beginner Contest 147 - B
# -*- encoding: UTF-8 -*-
s = input()
la = len(s)
lf = la // 2
slist =list(s)
flist = slist[:lf]
slist.reverse()
#print(flist)
#print(slist)
count = 0
for i in range(lf) :
if flist[i] != slist[i] :
count = count + 1
print(count)
|
p03556 | s202835042 | Wrong Answer | N = int(input())
max=1
for i in range(1, N):
if max<int(i**2)<=N:
max=i**2
else:
break
print(max) |
p03338 | s106824425 | Wrong Answer | #template
def inputlist(): return [int(j) for j in input().split()]
from collections import Counter
#template
#issueから始める
N = int(input())
s = list(input())
ans = -1
for i in range(1,N-1):
lif = s[:i]
lib = s[i:]
cf= list(Counter(lif).keys())
cb= list(Counter(lib).keys())
k = len(cf) + len(cb) - len... |
p04044 | s058561007 | Accepted | n,l=map(int,input().split())
S=[input() for i in range(n)]
S.sort()
print(*S,sep='') |
p02697 | s658878789 | Accepted | def main():
n, m = map(int, input().split())
n2 = n//2
if n%2:
for i in range(1, m+1):
print(i, n-i+1)
else:
for i in range(1, m+1):
if n+1-2*i <= n2:
print(i, n-i)
else:
print(i, n-i+1)
if __n... |
p02725 | s385490247 | Accepted | K, N = map(int,input().split())
a = list(map(int,input().split()))
x = [a[0]-a[-1]+K]
for i in range(1,N):
x.append(a[i]-a[i-1])
print(K-max(x)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.