problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02747 | s184229244 | Accepted | S = input()
if S == "hi" or S == "hihi" or S == "hihihi" or S == "hihihihi" or S == "hihihihihi" :
print("Yes")
else:
print("No")
|
p02687 | s632319327 | Accepted | print("ABC" if input() == "ARC" else "ARC") |
p02882 | s511512308 | Accepted | import math
a, b, x = map(int, input().split())
def fm(a, b, x):
return (2*x / (a**2)) - b
def fn(a, b, x):
return 2*x / (a*b)
if fm(a, b, x) >= 0:
ans = math.degrees(math.atan((b - fm(a, b, x)) / a))
else:
ans = math.degrees(math.atan(b / fn(a, b, x)))
print(ans) |
p02897 | s845318038 | Accepted | N = int(input())
ans = ((N + 1) // 2) / N
print(ans) |
p02918 | s565023891 | Accepted | N , K = map(int,input().split())
S = list(input())
old_s = S[0]
count = 0
for s in S:
if old_s!=s:
count+=1
old_s = s
print((N-1)-count+min(2*K,count)) |
p03309 | s057161654 | Accepted | N=int(input())
A=list(map(int,input().split()))
B=[]
for i in range(N):
B.append(A[i]-(i+1))
B.sort()
if N%2==0:
a=N/2
b=int((B[int(a)]+B[int(a-1)])/2)
else:
a=(N+1)/2
b=B[int(a-1)]
for i in range(N):
B[i]=abs(B[i]-b)
print(sum(B))
|
p02748 | s859228037 | Accepted | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = min(a) + min(b)
c_min = 200001
for _ in range(M):
x, y, c = map(int, input().split())
c_min = min(c_min, a[x-1] + b[y-1] - c)
result = min(s, c_min)
print(result) |
p03437 | s866814711 | Accepted | X,Y = map(int,input().split())
if X%Y==0:
print(-1)
else:
print(X) |
p02987 | s106475053 | Wrong Answer | s=str(input().split())
s=sorted(s)
if s[0]==s[1] and s[2]==s[3] and s[1]!=s[2]:
print('Yes')
else:
print('No') |
p02683 | s945929722 | Wrong Answer | n,m,x = map(int,input().split())
#a_L = list(map(int,input().split()))
import itertools
#print(L)
a_L = []
c_L = []
import numpy as np
for i in range(n):
tmp= list(map(int,input().split()))
c = tmp[0]
tmpL = tmp[1:]
a_L.append(tmpL)
c_L.append(c)
print(-1) |
p03000 | s193958414 | Accepted | n,x = map(int,input().split())
l = list(map(int,input().split()))
n,c = 0,1
for i in l:
n+=i
if(n<=x): c+=1
else: break
print(c) |
p03317 | s700422312 | Accepted | n,k=map(int,input().split())
A = list(map(int,input().split()))
n -= k
k -= 1
ans = 1
ans += (n+k-1)//k
print(ans) |
p02899 | s559640385 | Wrong Answer | import numpy as np
N = int(input())
A = [int(x) for x in input().split()]
B = [0 for _ in range(N)]
for i in range(N):
B[A[i]-1] = i+1
print(B) |
p03017 | s065210660 | Accepted | n, a, b, c, d = map(int, input().split())
s = input()
a -= 1; b -= 1; c -= 1; d -= 1; e = 1
for i in range(b, min(c, d)+1):
if s[i-1] == "." and s[i] == "." and s[i+1] == ".": e = 0
if c < d: e = 0
for i in range(a, max(c, d)):
if s[i] == "#" and s[i+1] == "#": e = 1
print("Yes") if e == 0 else print("No") |
p02556 | s429495336 | Wrong Answer | input = input() |
p02729 | s791911098 | Accepted | import math
N,M = map(int,input().split())
#Nは偶数
#Mは奇数
#偶数偶数
if N >= 2:
Nf = math.factorial(N)//(math.factorial(N-2)*2)
else:
Nf = 0
#奇数奇数
if M >= 2:
Mf = math.factorial(M)//(math.factorial(M-2)*2)
else:
Mf = 0
ans = int(Nf + Mf)
print(ans)
|
p03352 | s204201716 | Wrong Answer | X=int(input())
ans=0
for i in range(X+1):
if i*i<=X:
sum=i*i
for j in range(X):
if i*(i*j)>X:
break
sum=max(sum,i*(i*j))
else:
break
ans=max(ans,sum)
print(sum) |
p03721 | s164646336 | Accepted | n, k = map(int, input().split())
ab = [tuple(map(int, input().split())) for _ in range(n)]
ab.sort(key=lambda x: x[0])
sm = 0
for a, b in ab:
sm += b
if sm >= k:
print(a)
break |
p03821 | s788547965 | Accepted | def solve():
ans = 0
N = int(input())
A = [0]*N
B = [0]*N
for i in range(N):
A[i],B[i] = map(int, input().split())
for i in range(N-1,-1,-1):
A[i] += ans
if A[i]%B[i]>0:
ans += B[i]-A[i]%B[i]
return ans
print(solve()) |
p03327 | s206391607 | Wrong Answer | N = input()
if N <= str(999):
print('ABC')
if N >= str(1000):
print('ABD') |
p03625 | s173592298 | Accepted | import collections
n=int(input())
a=list(map(int,input().split()))
a=collections.Counter(a)
a=sorted(a.items(),reverse=True)
#print(a)
tm=0
for i in range(n):
if a[i][1]>=4 and tm==0:
print(a[i][0]*a[i][0])
exit()
elif a[i][1]>=2:
if tm==0:
tm=a[i][0]
else:
print(tm*a[i][0])
exit()
print("0")
|
p02718 | s423896025 | Wrong Answer | n,m = list(map(int, input().split()))
A = list(map(int,input().split()))
A = sorted(A,reverse=True)
ans = "Yes"
sumA = sum(A)
compare = sumA//(4*m)
for i in range(m):
if A[i] < compare:
ans = "No"
print(ans)
|
p02947 | s839349602 | Accepted | N = int(input())
A = []
D = {}
cnt = 0
for i in range(N):
S=''.join(sorted(input()))#文字列で受け取る
A.append(S)
for s in A:
if s in D:
cnt += D[s]
D[s] += 1 #D[s]=これまでのs登場回数
else:
D[s]=1
print(cnt) |
p02946 | s409014298 | Wrong Answer | k,x = map(int,input().split())
c = []
for i in range(-k+1,k):
c.append(str(x-i))
c.sort()
print(' '.join(c)) |
p02933 | s928617068 | Accepted | a=int(input())
s=input()
if a<3200:
print('red')
else:
print(s) |
p02882 | s850258654 | Wrong Answer | import math
a, b, x = map(int,input().split())
v = a*a*b
if x > v/2:
y = 2*(b-(x/(a*a)))
naname = math.sqrt((y*y) + (a*a))
cosine = a/naname
print(math.degrees(math.acos(cosine)))
elif x < v/2:
y = 2*x/(b*a)
naname = math.sqrt((y*y)+(b*b))
cosine = b / naname
print(90-math.degrees(math.acos(cosine)))
else:
print(3)
naname = math.sqrt((a*a)+(b*b))
cosine = a/naname
print(math.degrees(math.acos(cosine)))
|
p02879 | s799167675 | Accepted | a,b=list(map(int,input().split()));
hh=False;
if (a>9 or b>9):
print(-1);
else:
print(a*b); |
p03556 | s729812793 | Wrong Answer | n = int(input())
answer = 0
for i in range(1,n+1):
if (i**2) > n:
answer = (i-1)**2
else :
break
print(answer) |
p02899 | s051189693 | Accepted | n = int(input())
h = list(map(int,input().split()))
c = []
for i in range(n):
c.append([h[i],i+1])
c.sort()
for i , k in c:
print(k)
|
p03479 | s414699448 | Accepted |
def resolve():
X,Y=map(int,input().split())
count =0
while X<=Y:
count +=1
X*=2
print(count)
if __name__ == "__main__":
resolve() |
p03012 | s923720984 | Wrong Answer | n = int(input())
w = list(map(int, input().split()))
a = 0
b = sum(w)
for i in w:
a += i
b -= i
if a > b:
break
print(abs(a-b)) |
p02621 | s552864179 | Accepted | import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
a = ri()
print(a+a**2+a**3)
|
p02963 | s083765557 | Accepted | s = int(input())
if s == 10**18:
print(0, 0, 10**9, 0, 0, 10**9)
exit()
t = 10**9
a, b = s // t + 1, t - s % t
print(0, 0, 1, t, a, b)
|
p02657 | s484272869 | Accepted | A, B = map(int, input().split())
print(A*B) |
p02597 | s361616350 | Wrong Answer | n=int(input())
c=list(input())
r=0
for i in range(n):
if c[i]=='W':
r=i
num=0
for i in range(n):
if c[i]=='W':
num+=1
if num>=n-r:
print(num-1)
else:
print(num) |
p03254 | s291887911 | Accepted | n, x = map(int, input().split())
A = sorted([int(i) for i in input().split()])
# print(A)
cnt = 0
for e in A:
if e <= x:
x = x - e
cnt += 1
if cnt == n and x > 0:
print(cnt-1)
else:
print(cnt)
|
p03986 | s109343224 | Accepted | x = list(map(str, input().rstrip()))
stock = 0
rest = 0
for i in x:
if i == "S":
stock += 1
elif i == "T" and stock >= 1:
stock -= 1
else:
rest += 1
print(stock + rest) |
p03220 | s647869952 | Accepted | n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))
diff = 1000
ans = 0
for i in range(n):
if diff > abs(a - (t - h[i]*0.006)):
diff = abs(a - (t - h[i]*0.006))
ans = i + 1
print(ans) |
p03338 | s260005633 | Accepted | def main():
n = int(input())
s = input()
ans = 0
for i in range(n):
x = set()
for j in range(i):
x.add(s[j])
y = set()
for j in range(i, n):
if s[j] in x:
y.add(s[j])
ans = max(ans, len(y))
print(ans)
if __name__ == '__main__':
main()
|
p02989 | s082661008 | Wrong Answer | n = int(input());
arr = list(map(int, input().split()));
arr.sort();
ans = 0;
for i, x in enumerate(arr):
arc_arr = list(filter(lambda target: target >= x, arr));
if len(arc_arr) == n - len(arc_arr): ans = x - arr[i-1]
print(ans);
|
p03605 | s816786794 | Wrong Answer | n = list(input())
print('YES' if '9' in n else 'NO') |
p03239 | s960629622 | Wrong Answer | n,t = map(int,input().split())
ans = 10000
for i in range(n):
c,ti = map(int,input().split())
if ti <= t:
ans = min(c,ans)
print(ans) |
p02621 | s361902927 | Wrong Answer | import random
a=random.randint(1,10)
print(str(a+a*a+a*a*a)) |
p02621 | s578832701 | Accepted | a = int(input())
print(a + a**2 + a ** 3) |
p03324 | s260214482 | Accepted | D, N = map(int,input().split())
cnt = 0
for i in range(1, 1500000):
if i%(100**D) == 0 and i%(100**(D+1)) != 0:
cnt += 1
if cnt == N:
print(i)
break |
p02756 | s902024903 | Accepted | from collections import deque
S = deque(input())
Q = int(input())
q = [input().split() for _ in range(Q)]
flag = True
for x in q:
if x[0] == "1":
if flag: flag = False
else: flag = True
else:
if x[1] == "1":
if flag: S.appendleft(x[2])
else: S.append(x[2])
else:
if flag: S.append(x[2])
else: S.appendleft(x[2])
s = list(S)
if not flag: s = s[::-1]
print("".join(s)) |
p03071 | s722128356 | Accepted | A, B = map(int, input().split())
ans = 0
for a in range(0, 2):
if A > B:
ans += A
A -= 1
else:
ans += B
B -= 1
print(ans)
|
p03035 | s227069628 | Wrong Answer | A, B = map(int, input().split())
if A >= 13:
print(B)
elif A < 6:
print(0)
else:
print(B / 2) |
p02791 | s578458915 | Wrong Answer | from bisect import bisect
N, *P = map(int, open(0).read().split())
INF = 10 ** 6
dp = [INF] * (N + 1)
for i in range(N):
dp[bisect(dp, -P[i])] = -P[i]
print(sum(dp[i] < INF for i in range(N)))
|
p03254 | s072964063 | Accepted | n, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
rem = x
give = 0
for i in range(n):
rem -= a[i]
give += 1
if rem < 0:
break
if rem != 0:
give -= 1
print(give)
|
p02861 | s404673704 | Wrong Answer | import math
n = int(input())
x = []
y = []
sum = 0
#座標入力
for i in range(n):
a, b = map(int, input().split())
x.append(a)
y.append(b)
#距離の総和
for i in range(n):
for j in range(n):
num = math.factorial(n-1)
dist = ((x[i]-x[j])^2+(y[i]-y[j])^2)**0.5
sum+= num*dist
print(sum/math.factorial(n)) |
p02684 | s965075905 | Accepted | n,k = map(int, input().split())
a = list(map(int, input().split()))
a = [i-1 for i in a]
num = [0] * (n)
num[0] = 1
now = 0
looped = 0
for i in range(2,k+2):
nex = a[now]
if num[nex]:
start = num[nex]
cycle = i - num[nex]
v = (k+1-i) % cycle + start
ans = num.index(v) + 1
looped = 1
break
else:
num[nex] = i
now = nex
if looped:
print(ans)
else:
print(now+1) |
p03106 | s510111416 | Accepted | a,b,k = map(int,input().split())
for i in range(101,0,-1):
if a%i==0 and b%i==0:
k-=1
if k==0:
print(i)
exit() |
p02873 | s251672910 | Accepted | s = input()
cnt = 0
n = len(s)
al = [0]*(n+1)
ag = [0]*(n+1)
for i in range(n):
if s[i] == '<':
al[i+1] = al[i] + 1
for i in range(n-1, -1, -1):
if s[i] == '>':
ag[i] = ag[i+1] + 1
a = [x if x > y else y for x, y in zip(al, ag)]
print(sum(a))
|
p03821 | s743306210 | Accepted | n=int(input())
ab=[list(map(int,input().split())) for i in range(n)]
ab.reverse()
ans=0
for i in range(n):
d=ab[i][0]+ans
if d%ab[i][1]!=0:
ans+=ab[i][1]-d%ab[i][1]
print(ans) |
p03693 | s320223143 | Accepted | r,g,b=map(str,input().split())
s=r+g+b
s=int(s)
if s%4==0:
print("YES")
else:
print("NO") |
p03821 | s488820335 | Wrong Answer | n = int(input())
ab = [list(map(int, input().split())) for _i in range(n)]
x = 0
r = 0
for i in range(n-1, -1, -1):
a, b = ab[i]
r += (x+a)%b
x = r
print(r) |
p02678 | s212016035 | Wrong Answer | N,M=map(int,input().split())
A=list(map(int,input().split()))
s=sum(A)
if s>N:
print(-1)
exit()
print(N-s) |
p02548 | s647261574 | Accepted | n=int(input())
cnt=0
for a in range(1,n):
cnt+=(n-1)//a
print(cnt) |
p03329 | s122605996 | Wrong Answer | import numpy as np
N=int(input())
six=[0]
nine=[0]
for i in range(1,N):
six.append(6**i)
nine.append(9**i)
if 6**i>N:
break
six=np.array(six)
nine=np.array(nine)
now=N
count=0
while now>0:
sub=max(1,six[six<=now].max(),nine[nine<=now].max())
now-=sub
count+=1
print(count)
#print(six, nine) |
p03524 | s158848965 | Accepted | s=list(input())
an=s.count("a")
bn=s.count("b")
cn=s.count("c")
cl=[an, bn, cn]
m=max(cl)
cl.remove(m)
for n in cl:
if (m-1)!=n and (m-1)!=n-1:
print("NO")
exit()
print("YES")
|
p03555 | s298462554 | Wrong Answer | data1 = input()
data2 = input()
count = 3 -1
sw = 0
i = 0
j = len(data2)-1
while i <= count:
if data1[i] == data2[j]:
sw += 1
i += 1
j -= 1
if sw == 3:
print("Yes")
else:
print("No") |
p02572 | s817235349 | Accepted | n = int(input())
A = list(map(int, input().split()))
sum_A = sum(A)
ans = 0
for i in range(n-1):
sum_A -= A[i]
ans += A[i] * sum_A
ans %= 10**9+7
print(ans) |
p03611 | s515915758 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
sa =set(a)
ca = Counter(a)
ans = 0
for x in sa:
# カウンタオブジェクトは存在しない要素に０を返す
tmp = ca[x-1] + ca[x] + ca[x+1]
if ans < tmp:
ans = tmp
print(ans) |
p04034 | s161311511 | Wrong Answer | n,m=map(int, input().split())
aka = [0]*(n+1)
siroaka = [1]*(n+1)
aka[1] = 1
for i in range(m):
x,y=map(int, input().split())
if(aka[x]==1):
siroaka[x]-=1
siroaka[y]+=1
if(siroaka[x]==0):
aka[x]=0
aka[y]=1
print(sum(aka))
|
p03329 | s782539883 | Accepted | N = int(input())
lst = [1]
lst += [ 6**i for i in range(1, 10) if 6**i <= 100000]
lst += [ 9**i for i in range(1, 10) if 9**i <= 100000]
lst.sort()
dp = list(range(N+1))
for i in range(1, N+1):
temp = []
for j in lst:
if j <= i:
temp.append(dp[i-j] + 1)
dp[i] = min(temp)
print(dp[N]) |
p02676 | s051327824 | Accepted | k = int(input())
s = input().strip()
if len(s) <= k:
print(s)
else:
print(s[:k] + "...") |
p02854 | s582913010 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
from itertools import accumulate
N = int(input()) # len(A)
A = list(map(int, input().split()))
zenbu=sum(A)
B = [0] + A
B = list(accumulate(B)) # 累積和を格納したリスト作成
ans=10**18
for i in range(1, N):
ans = min(abs(B[i]-(zenbu-B[i])),ans)
print(ans)
resolve() |
p03698 | s846336302 | Wrong Answer | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
s = input().rstrip()
string_dict={}
for i in s:
if i not in string_dict:
d = {i:1}
string_dict.update(d)
else:
print("No")
exit()
print("Yes")
if __name__=="__main__":
main() |
p03455 | s069673724 | Accepted | a, b = map(int, input().split())
answer = a * b
if answer % 2 == 0:
print('Even')
else:
print('Odd') |
p03371 | s572185010 | Accepted | a,b,c,x,y=map(int,input().split())
ret=float('inf')
for i in range(max(x,y)+1):
ret=min(ret,i*c*2+max((x-i),0)*a+max((y-i),0)*b)
print(ret) |
p03835 | s489806881 | Wrong Answer | K,S = map(int, input().split())
if K == S:
print( (K+5)*(K+4)//2 )
exit()
ans = 0
for X in range(K+1):
S1 = S - X
if S1 < 0:
break
else:
if S1 <= K:
ans += S1 + 1
elif S1 <= 2 * K:
ans += S1 - 2*K + 1
else:
continue
print(ans) |
p02645 | s991027441 | Accepted | # -*- coding: utf-8 -*-
s = input()
# 出力
print(s[0:3]) |
p03644 | s519057331 | Wrong Answer | n = int(input())
ans = 0
for i in range(1, 7):
if 2**i <= n:
ans = 2**i
print(ans) |
p03543 | s566148290 | Wrong Answer | N = input()
for i in range(10):
if N.count(str(i)) >= 3:
print('Yes')
break
else:
print('No') |
p03379 | s544654636 | Accepted | n = int(input())
x = list(map(int,input().split()))
xs = sorted(x)
mid = xs[n//2]
tmp = n//2
for i, xx in enumerate(x):
if xx < mid:
print(mid)
elif xx > mid:
if xx == xs[tmp-1]:
print(xs[tmp-2])
else:
print(xs[tmp-1])
else:
print(xs[tmp-1])
|
p03796 | s692053634 | Wrong Answer | import math
print(math.factorial(int(input()))) |
p03971 | s325428995 | Wrong Answer | x = list(map(int,input().split()))
n = x[0]
a = x[1]
b = x[2]
s = input()
c = 0
k = 0
for i in range(0,n):
#print(c)
if(s[i] == "c"):
print("No")
elif(s[i] == "a"):
if(c <= a + b):
print("yes")
c = c + 1
else:
print("No")
else:
if(c <= a + b and k <= b):
print("Yes")
c = c + 1
k = k + 1
else:
print("No") |
p03817 | s973203199 | Accepted | x = int(input())
ans = int(x//5.5)
half = ans//2
y = 6*half+5*half
ans = 2*half
if x <= y:
print(ans)
else:
for i in range(3):
if i % 2 == 0:
y += 6
else:
y += 5
ans += 1
if x <= y:
print(ans)
break
|
p02789 | s472275735 | Wrong Answer | N,M=map(int,input().split())
if N==M:
print("YES")
else:
print("NO")
|
p03331 | s515071271 | Wrong Answer | def SumReturn(num):
total=0
while num!=0:
total += num%10
num //= 10
return total
if __name__ == '__main__':
n = int(input())
min = 10000
for i in range(n+1):
if(min > SumReturn(i)+SumReturn(n-i)):
min = SumReturn(i)+SumReturn(n-i)
print(min)
|
p03524 | s108261877 | Accepted | s=str(input())
s=list(s)
import collections
c=collections.Counter(s)
if max(c["a"],c["b"],c["c"])-min(c["a"],c["b"],c["c"])<=1:
print("YES")
else:
print("NO") |
p03407 | s588686047 | Accepted | a,b,c=map(int,input().split());print("YNeos"[a+b<c::2]) |
p03360 | s841328602 | Accepted | a, b, c = sorted(map(int, input().split()), reverse=True)
print(sum([a << int(input()), b, c]))
|
p04011 | s698842870 | Wrong Answer | N = int(input())
K = int(input())
X = int(input())
Y = int(input())
AC=0
if N > K:
for _ in range(K):
AC += X
for _ in range(N-K):
AC += Y
print(AC)
else:
for _ in range(K):
AC += X
print(AC) |
p03262 | s596990766 | Accepted | from fractions import gcd
from functools import reduce
n, x = map(int, input().split())
c = list(map(int, input().split()))
print(reduce(gcd, [abs(i-x) for i in c]))
|
p02658 | s618573249 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 1
if 0 in a:
print(0)
else:
for i in range(n):
ans *= a[i]
if ans > 10**18:
print(-1)
break
else:
print(ans) |
p03351 | s301230837 | Wrong Answer | a,b,c,d=map(int,input().split())
if abs(b-a)<=d and abs(c-b)<=d:
print("Yes")
else:
print("No") |
p02880 | s810035901 | Accepted | N = int(input())
l = []
for i in range(1,10):
for j in range(1,10):
l.append(i*j)
if N in l:
print("Yes")
exit()
else:
print("No")
exit() |
p02696 | s408199297 | Accepted | A,B,N = map(int,input().split())
if B <= N:
X = B-1
elif B > N:
X = N
print(int((A*X)/B) - A*int(X/B)) |
p02639 | s695473684 | Accepted | def main():
import sys
L = list(map(int, sys.stdin.readline().split()))
print(L.index(0)+1)
if __name__=='__main__':
main() |
p02623 | s473021553 | Accepted | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
a, b = [0], [0]
for i in range(N):
a.append(A[i]+a[i])
for i in range(M):
b.append(B[i]+b[i])
j = M
for i in range(N+1):
if a[i]>K:
break
while b[j]>K-a[i]:
j-=1
ans = max(ans, i+j)
print(ans) |
p03774 | s886722176 | Accepted | n, m = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
for i in range(n):
a, b = ab[i]
dis = 10 ** 20
res = 0
for i, check in enumerate(cd):
tmp_dis = abs(a - check[0]) + abs(b - check[1])
if dis == tmp_dis:
continue
if tmp_dis < dis:
dis = tmp_dis
res = i + 1
print(res) |
p02594 | s389526939 | Accepted | n=int(input())
if(n>=30):
print("Yes")
else:
print("No") |
p02987 | s300359593 | Accepted | S=input()
T=list(S)
U=list(set(T))
b=[0]*2
if len(U)==2:
for x in range(4):
if U[0]==S[x]:
b[0]+=1
elif U[1]==S[x]:
b[1]+=1
if b[0]==2 and b[1]==2:
print("Yes")
else:
print("No")
else:
print("No") |
p02836 | s928364616 | Accepted | S = input()
print(sum(a < b for a, b in zip(S, S[::-1]))) |
p03338 | s226185363 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
S = input()
ans = 0
for i in range(1, N):
first = set(S[:i])
second = set(S[i:])
score = len(first & second)
ans = max(ans, score)
print(ans)
if __name__ == '__main__':
main()
|
p03773 | s515474994 | Accepted | a,b=map(int,input().split())
if a+b >= 24:
print(a+b-24)
else:
print(a+b) |
p02888 | s962727053 | Wrong Answer | from itertools import combinations
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
ans = 0
for i in range(n):
c = l[i]
can_select = False
for a, b in combinations(l[i+1:], 2):
if c < a+b:
ans += 1
can_select = True
if not can_select:
break
print(ans)
|
p02917 | s891600113 | Accepted | n = int(input())
B = list(map(int, input().split()))
C = []
C.append(B[0])
for i in range(len(B) - 1):
C.append(min(B[i], B[i+1]))
C.append(B[-1])
print(sum(C))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.