problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02714 | s826947342 | Wrong Answer | n = int(input())
s = input()
count = 0
for i in range(n-2):
lis = []
lis.append(s[i])
for j in range(i+1,n-1):
if not s[j] in lis :
lis.append(s[j])
for k in range(j+1,n):
if not s[k] in lis :
if j-i != k-j:
count += 1
print(count) |
p02664 | s409655872 | Accepted | t=input()
qn=t.count("?")
print(t.replace("?", "D")) |
p02880 | s448289404 | Accepted | n = int(input())
for a in range(1,10):
for b in range(1,10):
if a*b == n:
print('Yes')
exit(0)
print('No')
|
p02552 | s026986883 | Wrong Answer | num = input
if num == 0:
print(1)
else:
print(0) |
p03324 | s906846626 | Accepted | d,n = map(int, input().split())
print(100**d * (n+(n==100)) if d > 0 else (n + (n==100)))
|
p02724 | s277972024 | Accepted | X = int(input())
happy = 0
q, m = divmod(X, 500)
happy += q*1000
q, m = divmod(m, 5)
happy += q*5
print(happy) |
p03086 | s364460469 | Accepted | string = input()
ans = 0
score = 0
ok = set('ACGT')
for c in string:
if c in ok:
score += 1
else:
ans = max(ans, score)
score = 0
ans = max(ans,score)
print(ans) |
p02729 | s813043156 | Accepted | n, m = map(int, input().split())
print(n*(n-1)//2+m*(m-1)//2) |
p03607 | s718841107 | Wrong Answer | import sys
readline = sys.stdin.readline
from collections import Counter
def main():
N = int(readline())
A = [int(readline()) for _ in range(N)]
c = Counter(A)
ans = 0
for _, v in zip(c.keys(), c.values()):
if v % 2 == 1:
ans += v
print(ans)
if __name__ == '__main__':... |
p02835 | s307853080 | Wrong Answer | a1, a2, a3 = map(int, input().split())
if 1 <= a1 <= 13 and 1 <= a2 <= 13 and 1 <= a3 <= 13:
if a1 + a2 + a3 == 22:
print('bust')
else:
print('win') |
p02917 | s783748629 | Wrong Answer | N = int(input()) # sを取得し、strに値を入れる
B = list(map(int, input().split()))
sum = B[0]
for i in range(0, N-1):
sum += min(B[i],B[i-1])
sum += B[N-2]
print(sum) |
p02802 | s809571487 | Wrong Answer | n, m = map(int, input().split())
resultList = [0 for i in range(n)]
#print(resultList)
ansAC = 0
ansWA = 0
for i in range(m) :
result = input().split()
prob = int(result[0]) - 1
if result[1] == 'AC' and resultList[prob] == 0 :
resultList[prob] = 1
ansAC += 1
if result[1] == 'WA' and resu... |
p02842 | s780647651 | Accepted | import sys
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
n = inint()
if int(-(-n//1.08) * 1.08) != n:
print(":(")
else:
print(int(-(-n//... |
p04019 | s863465014 | Accepted | t = input()
n = t.count('N')
s = t.count('S')
w = t.count('W')
e = t.count('E')
if ((n == 0 and s == 0) or (n > 0 and s > 0)) and\
((w == 0 and e == 0) or (w > 0 and e > 0)):
print("Yes")
else:
print("No")
|
p02783 | s441629062 | Wrong Answer | h,a=map(int,input().split())
print(h//a+1) |
p02748 | s317039888 | Accepted | a,b,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mi = min(a) + min(b)
for i in range(m):
x,y,c = map(int,input().split())
v = a[x-1] + b[y-1] - c
mi = min(mi,v)
print(mi) |
p03565 | s546408325 | Accepted | s = input()
T = input()
slen = len(s)
Tlen = len(T)
ans = "UNRESTORABLE"
if slen >= Tlen:
for i in range(slen - Tlen + 1)[::-1]:
for j in range(Tlen):
if not s[i+j] in ("?", T[j]):
break
else:
ans = s
ans = ans[:i] + T + ans[i+Tlen:]
a... |
p03657 | s449206783 | Accepted | a,b=map(int, input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
print("Possible")
else:
print("Impossible") |
p03524 | s796164465 | Accepted | import sys
import os
def file_input():
f = open('CODE_FESTIVAL_2017Final/input.txt', 'r')
sys.stdin = f
def main():
#file_input()
S=input()
a=b=c=0
for s in S:
if s=='a':
a+=1
elif s=='b':
b+=1
else:
c+=1
if max(a,b,c)-min(a,b,... |
p03633 | s571246293 | Accepted | from fractions import gcd
N = int(input())
T = [int(input()) for _ in range(N)]
ans = T[0]
for i in range(N):
ans = (ans * T[i]) // gcd(ans, T[i])
print(ans)
|
p03105 | s762071081 | Accepted | a,b,c=map(int,input().split())
print(c if a*c<=b else b//a)
|
p03408 | s787121192 | Accepted | N = int(input())
s = [input() for _ in range(N)]
M = int(input())
t = [input() for _ in range(M)]
ans = 0
for i in set(s):
ans = max(s.count(i) - t.count(i),ans)
print(ans) |
p03127 | s759312760 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
A.sort()
ans = []
def gcd(a,b):
if b%a == 0:
return(a)
else:
return(gcd(b%a,b))
for i in range(len(A)-1):
ans.append(gcd(A[i],A[i+1]))
A[i+1]=ans[i]
ans.append(gcd(A[1],A[-1]))
print(min(ans)) |
p03487 | s954042062 | Accepted | import collections
N=int(input())
a=list(map(int,input().split()))
c = collections.Counter(a)
itms=c.items()
cnt=0
for key,value in itms:
if key<value:
cnt+=value-key
elif key==value:
continue
else:
cnt+=value
print(cnt) |
p03659 | s480762625 | Wrong Answer | def nb(n,a,b,ho):
#print(n,a,b,ho)
if(b-a<=1):
return min(abs(hoge[n]-2*hoge[a]),abs(hoge[n]-2*hoge[b]))
c=(a+b)//2
if(hoge[b]-2*hoge[c]>=0):
return nb(n,c,b,ho)
else:
return nb(n,a,c,ho)
n=int(input())
moge=list(map(int,input().split()))
hoge=[0]*n
hoge[0]=moge[0]
for i in range(1,n):
hoge[... |
p02818 | s573624360 | Wrong Answer | a, b, k = map(int, input().split())
print(max(0, a-k), b+min(0, a-k)) |
p03208 | s263819963 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
N, K = map(int, input().split())
h = [int(input()) for _ in range(N)]
h.sort()
ans = float("inf")
for i in range(len(h)-(K-1)):
ans = min(ans, h[i+K-1] - h[i])
print(ans) |
p03379 | s731306932 | Accepted | n = int(input())
if n == 2:
a, b = map(str,input().split())
print(b + " " + a)
else:
L = list(map(int, input().split()))
M = sorted(L)
c = (n + 1) // 2 - 1
a = M[c + 1]
b = M[c]
for l in L:
if l> b:
print(b)
else:
print(a) |
p03163 | s440257330 | Accepted | N, W = map(int, input().split())
dp = [0] + [-1] * W
for i in range(1, N + 1):
w, v = map(int, input().split())
for sum_w in range(W - w, -1, -1):
if dp[sum_w] >= 0:
dp[sum_w + w] = max(dp[sum_w + w], dp[sum_w] + v)
# print(dp)
print(max(dp))
|
p03471 | s235270024 | Accepted | N, Y = [int(str) for str in input().strip().split()]
Y //= 1000
for i in range(N + 1):
for j in range(N - i + 1):
k = N - i - j
if 10 * i + 5 * j + k == Y:
print(i, j, k)
exit()
print(-1, -1, -1) |
p02598 | s903798976 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
def f(L):
res=0
for x in A:
res+=(x-1)//L
return res
l=0
r=max(A)
while r-l>1:
M=(r+l)//2
if f(M)>K:
l=M
else:
r=M
print(r)
|
p02630 | s405532390 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
q = int(input())
s = []
S = sum(a)
def find(b, a): #配列aからbを探し出す
counter = 0
for i in range(len(a)):
if a[i] == b:
counter += 1
return counter
for i in range(q):
b, c = map(int,input().split())
count = find(b,a)
S += count * (c - b)
print(S) |
p03043 | s669476013 | Accepted | import math
n,k = map(int,input().split())
sumlist = []
for i in range(1,n+1):
point = i
if point <= k-1:
s = math.log(k/i,2)
if s == int(s):
sumlist.append((1/2)**(int(s)))
else:
sumlist.append((1/2)**(int(s)+1))
else:sumlist.append(1)
print(round(sum(sumlist)/n,10)-10**(-10)) |
p03427 | s021915942 | Accepted | N = int(input())
n = len(str(N))
NS = str(N)
ans0 = 0
for i in NS:
ans0 += int(i)
ans1 = int(NS[0])-1 + 9 * (n-1)
ans2 = 9 * (n-1)
print(max(ans0, ans1, ans2))
|
p03109 | s980139795 | Accepted | s = input()
year = int(s[:4])
mo = int(s[5:7])
if year < 2019:
ans = "Heisei"
elif year == 2019 and mo<= 4:
ans ='Heisei'
else:
ans = 'TBD'
print(ans) |
p02693 | s922657752 | Accepted | k=int(input())
a,b=map(int,input().split())
for i in range(a,b+1):
if i%k==0:
print("OK")
exit()
print("NG") |
p03434 | s263346065 | Accepted | n = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = sum(A[::2]) - sum(A[1::2])
print(ans) |
p03545 | s310002210 | Wrong Answer | from itertools import product
s = str(input())
a = list(s)
for i in product([0,1],repeat=3):# 01 に関する直積
for j,k in enumerate(i): #jが添え字 kがbit
x = ["+","+","+"]
#print(i,j,k)
if k == 1:
x[j] == "-"
if eval(a[0]+x[0]+a[1]+x[1]+a[2]+x[2]+a[3]) == 7:
print(a[0]+x[0]+a[1... |
p02618 | s075406111 | Wrong Answer | D=int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for _ in range(D)]
last_day = [0]*26
score = 0
def calc_sum(day,t,sum):
sum += s[day-1][t-1]
for j in range(len(c)):
if(j!=day-1):
sum -= c[j]*(day-last_day[j])
return sum
for i in range(D):
t = 1
max = -1000000
... |
p03211 | s956625213 | Accepted | s = input().rstrip()
ans = 10**3
for i in range(len(s)-2):
x = int(s[i:i+3])
ans = min(ans, abs(x-753))
print(ans) |
p02775 | s291789726 | Accepted | n = input()
dp = [0,1]
ans = 0
for i in range(len(n)):
cur1 = dp[0]
cur2 = dp[1]
if i != len(n)-1:
dp[0] = min(cur1+int(n[i]), cur2+10-int(n[i]))
dp[1] = min(cur1+int(n[i])+1, cur2+9-int(n[i]))
else:
ans = min(dp[0]+int(n[i]), dp[1]+10-int(n[i]))
print(ans)
|
p02766 | s766169765 | Accepted | n,k =map(int,input().split())
digitlist = []
while (n/k != 0):
tmp = n%k
digitlist.insert(0,(tmp))
n = n//k
print(len(digitlist)) |
p03328 | s264299600 | Wrong Answer | icase=0
if icase==0:
import sys
a,b=map(int,input().split())
for i in range(1,999):
isum=i*(i+1)//2
for j in range(i,1000):
if j*(j+1)//2-isum==b-a and 1<=j*(j+1)//2-b:
print(j*(j+1)//2-b)
sys.exit()
|
p03059 | s848691672 | Wrong Answer | a, b, t = map(int, input().split())
c = a
while t+0.5 >c :
c += a
c -= a
aa = (c*b)//3
print(aa) |
p03472 | s498124769 | Accepted | (n,h),*ab = [list(map(int, s.split())) for s in open(0)]
mxa = max([a for a, b in ab])
bb = sorted([b for a, b in ab if b>mxa],reverse=True)
ans = 0
for b in bb:
h-=b
ans += 1
if h<=0:
break
if h>0:
ans += (0--h//mxa)
print(ans) |
p02922 | s784390869 | Wrong Answer | a, b = map(int, input().split())
c = 1
while a < b:
a += a
c += 1
print(c) |
p04045 | s506150983 | Accepted |
n,k = map(int,input().split())
t = list(map(int,input().split()))
for j in range(n,100000):
h = str(j)
u=0
for s in h:
if int(s) in t:
u+=1
break
if u==0:
print(h)
break
|
p02612 | s067560850 | Wrong Answer | n = int(input())
while n >= 1000:
n = n-1000
print(1000-n) |
p03495 | s158499845 | Wrong Answer |
def calcPattern(N, Y):
for i in range(0, N+1):
for j in range(0, N+1):
if i == ((Y - 1000*N - 4000*j) / 9000):
if (N-i-j) >= 0: return (str(i) + " " + str(j) + " " +str(N-i-j))
return ("-1 -1 -1")
n,y = map(int, input().split())
print(calcPattern(n,y)) |
p02601 | s597504833 | Accepted | a, b, c = map(int, input().split())
k = int(input())
count = 0
while a >= b:
b *= 2
count += 1
while b >= c:
c *= 2
count += 1
if count <= k:
print("Yes")
else:
print("No")
|
p02603 | s640764278 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
money = 1000
stock = 0
for day in range(N):
if day == N - 1:
money += stock * A[day]
stock = 0
elif A[day] == A[day+1]:
continue
elif A[day] < A[day+1]:
stock = money // A[day]
money = money % A[day]
elif A[day... |
p03835 | s959707379 | Accepted | k, s = map(int, input().split())
ans = 0
for i in range(k+1):
for j in range(k+1):
if (i + j <= s) and (s - i - j <= k):
ans += 1
print(ans) |
p02713 | s025477137 | Wrong Answer | K = int(input())
ans = 0
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
for a in range(K):
for b in range(K):
for c in range(K):
ans += gcd(gcd(a, b), c)
print(ans) |
p02639 | s177675652 | Wrong Answer | a,b,c,d,e = map(int,input().split())
x = [a,b,c,d,e]
for i in range(4):
if x[i] == 0:
print(i+1) |
p02598 | s764275215 | Accepted | from heapq import heappush, heappop, heapify
import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
l = 0
r = 10 ** 9
def check(m):
now = 0
for i in range(N):
#A[i]-1してるのは、たとえばm=3のときは4,7から回数が増えるため
now += (A[i]-1) // m
return now <= K
#差が1になったら終了
while r - l > ... |
p02717 | s649593856 | Accepted | x, y, z = map(int, input().split())
print(z, x, y) |
p03345 | s696686230 | Accepted | a, b, c, k = map(int, input().split())
if k%2 == 0:
ans = a-b
else:
ans = b-a
if abs(ans)> 10**18:
print('Unfair')
else:
print(ans) |
p03145 | s350103965 | Wrong Answer | a, b, c = map(int, input().split())
print(a*b/2) |
p03721 | s398689287 | Wrong Answer | def main():
N, K = map(int,input().split())
AB = [list(map(int,input().split())) for _ in range(N)]
S = []
for ab in AB:
S += [ab[0]]*ab[1]
print(S[K-1])
if __name__ == '__main__':
main()
|
p02785 | s134904056 | Accepted | if __name__ == '__main__':
N, K = map(int, input().split())
H = list(map(int, input().split()))
H = sorted(H)[::-1]
cnt = 0
for h in H:
if K>0:
K -= 1
else:
cnt += h
print(cnt) |
p02642 | s833274877 | Accepted | n = int(input())
A = list(map(int, input().split()))
A.sort()
A.append(-1)
x = A[0]
if x != 1:
flag = True
for a in A:
if a % x != 0:
flag = False
if flag:
print(0)
exit()
used = [False] * A[-2]
ans = 0
for idx, a in enumerate(A[:-1]):
if used[a - 1]:
conti... |
p02702 | s281170475 | Wrong Answer |
S = list(map(int, list(input())))
mod = 2019
ctr = [0] * mod
p = 1
t = 0
for i, v in enumerate(reversed(S)):
t = (t + int(v) * pow(10, i, mod)) % mod
ctr[t] += 1
ans = ctr[0]
for v in ctr[1:]:
ans += v * (v - 1) // 2
print(ans)
|
p03796 | s355539618 | Wrong Answer | N = int(input())
result = 1
for i in range(1, N+1):
result = (result * i) % (10^9+7)
print(result) |
p02690 | s051384607 | Accepted | from sys import exit
x = int(input())
for a in range(-200, 201):
for b in range(-200, 201):
if a**5 - b**5 == x:
print(a, b)
exit() |
p03324 | s349805612 | Accepted | d, n = map(int, input().split())
if n == 100:
print((100 ** d) * n + 100**d)
else:
print((100**d)*n)
|
p02792 | s017809879 | Accepted | N = int(input())
D = {i: 0 for i in range(100)}
for i in range(1, N+1):
if i % 10 != 0:
s = str(i)
D[int(s[0])*10+int(s[-1])] += 1
S = 0
for i in range(10):
for j in range(10):
S += D[i*10+j] * D[j*10+i]
print(S) |
p02791 | s896174687 | Accepted | import heapq
n=int(input())
q=[]
p=list(map(int,input().split()))
ans=1
flag=0
q.append(p[0])
heapq.heapify(q)
for i in range(1,n):
if n==1:
ans=1
break
if p[0]==1:
break
if p[i]<q[0]:
#print("i",i,q[0])
ans+=1
heapq.heappush(q,p[i])
print(ans) |
p02765 | s884037380 | Accepted | n,r=map(int, input().split())
print(r+100*(10-n) if n < 10 else r) |
p02678 | s866246675 | Accepted | from collections import deque
int1 = lambda x: int(x) - 1
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int1, input().split())
G[a].append(b)
G[b].append(a)
# bfs
ans_lst = [None] * N
ans_lst[0] = 0
D = deque([0])
while D:
v = D.popleft()
for x in G[v]:... |
p02899 | s880209816 | Wrong Answer |
n=int(input())
a=list(map(int,input().split()))
ans=[]
for i in range(1,n+1):
ans.append(a.index(i)+1)
print(ans) |
p02615 | s283508327 | Wrong Answer | import sys
def resolve(in_):
n = int(in_.readline())
a = list(map(int, in_.readline().split()))
assert len(a) == n
a.sort(reverse=True)
return sum(a[:-1])
def main():
answer = resolve(sys.stdin.buffer)
print(answer)
if __name__ == '__main__':
main() |
p02598 | s710223180 | Accepted | import math
n,k = map(int,input().split())
alist = list(map(int,input().split()))
max_length = max(alist)
cur_length = 0
while(max_length - cur_length > 1):
next_length = (max_length+cur_length)//2
test_k = 0
for i in range(n):
test_k += math.ceil(alist[i]/next_length)-1
if test_k <= k:
... |
p03220 | s374447618 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
temp = 10**10
ans = -1
for i in range(N):
if temp > abs(T-H[i]*0.006-A):
ans = i
temp = abs(T-H[i]*0.006-A)
print... |
p02756 | s813802837 | Accepted | s = input()
q = int(input())
rev = 0
head = []
tail = []
for i in range(q):
t = input().split()
if t[0] == "1":
rev ^= 1
else:
if (int(t[1])-1)^rev == 0:
head.append(t[2])
else:
tail.append(t[2])
h = "".join(head)
t = "".join(tail)
if rev == 0:
print(h... |
p03624 | s595973857 | Wrong Answer | S = input()
for i in range(ord("a"), ord("z")+1):
if chr(i) not in S:
print(chr(i))
exit() |
p02663 | s870125685 | Wrong Answer | A,B,C,D,E=map(int,input().split())
print(C*60-A*60-E if C*60-A*60-E>=0 else 0) |
p03251 | s563971384 | Wrong Answer | n,m,x,y = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.sort(reverse = True)
b.sort()
if b[0] - a[0] < 1:
print('War')
else:
if x == b[0] or y == b[0]:
print('War')
elif x == a[0] or y == a[0]:
print('War')
else:
print('No War') |
p02987 | s603420822 | Accepted | import sys
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
S = LS2()
if S[0] == S[1] == S[2] == S[3]:
print('No')
elif S[0] == S[1] and S[2] == S[3]:
print('Yes')
elif S[0] == S[2] and S[1] == S[3]:
print('Yes')
elif S[0] == S[3] and S[1] == S[2]:
print('Yes')
else:
print('No')
|
p03565 | s421478974 | Wrong Answer | s = input()
t = input()
s = s[::-1]
t = t[::-1]
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[i+j] != t[j] and s[i+j] != '?':
break
else:
break
else:
print('UNSTORERABLE')
exit(0)
s = s[:i] + t + s[i+len(t):]
s = s.replace('?','a')
s = s[::-1]
print(s) |
p02775 | s119557223 | Wrong Answer | n = int(input())
s = str(n)
length = len(s)
ans = 0
for i in range(length):
x = int(s[i])
if x < 5:
ans = ans + x
else:
ans = ans + (10 - x)
if int(s[-1]) == 0:
ans = ans - 1
print(ans + 1) |
p03673 | s587621129 | Wrong Answer | import collections
N = int(input())
A = list(map(int, input().split()))
ans = collections.deque()
for i in range(N):
if i % 2 == 0:
ans.append(A[i])
else:
ans.appendleft(A[i])
print(*ans)
|
p03416 | s602192699 | Wrong Answer | a,b = map(int,input().split())
ans = 0
for i in range(a-1,b+1):
j1 = str(i)
j2 = ''.join(list(reversed(j1)))
if j1 == j2:
ans += 1
print(ans) |
p03679 | s704298952 | Accepted | x, a, b = map(int, input().split())
if a >= b:
print("delicious")
elif a + x >= b:
print("safe")
else:
print("dangerous") |
p02723 | s511547435 | Wrong Answer | s=input()
if(s[2]==s[3] and s[4]==s[5]):
print("YES")
else:
print("NO") |
p03339 | s236119130 | Wrong Answer |
n=int(input())
s=str(input())
e_cnt=s.count('E')
num=[0]*n #Wの数
num2=[0]*(n+1) #Eno左から数えた数
count=0
count2=0
for i in range(n):
if s[i]=='W':
num[i]=count
num2[i+1]=e_cnt-count2
count+=1
else:
num[i]=count
num2[i+1]=e_cnt-count2
count2+=1
ans=[0]*n
for... |
p03759 | s561655844 | Accepted | a,b,c = map(int,input().split())
if b-a == c-b:
print("YES")
else:
print("NO") |
p02947 | s221024647 | Accepted | import collections
n = int(input())
l = []
for i in range(n):
s = input()
l.append("".join(sorted(s)))
l_2 = collections.Counter(l)
ans = 0
for j in l_2.values():
ans += int((j*(j-1))/2)
print(ans)
|
p03011 | s643160141 | Accepted | p,q,r = map(int,input().split())
print(min(p+q,q+r,r+p)) |
p02714 | s267983116 | Accepted | N = int(input())
S = input()
r = S.count('R')
g = S.count('G')
b = S.count('B')
c = 0
for i in range(N-2):
for j in range(i+1,(i+N+1)//2):
k = j*2-i
if len(set([S[i], S[j], S[k]]))==3:
c += 1
print(r*g*b-c) |
p03087 | s066042033 | Wrong Answer | N,Q = [int(zz) for zz in input().split()]
S = input()
li = [0]*N
Aflag = 0
AC = 0
for i in range(N):
if S[i] == 'A':
Aflag = 1
elif S[i] == 'C' and Aflag:
AC += 1
Aflag = 0
li[i] = AC
ans = []
for _ in range(Q):
l,r = [int(zz)-1 for zz in input().split()]
ans.append(li[r]-l... |
p02601 | s738018944 | Wrong Answer | A, B, C = list(map(int, input().split()))
K = int(input())
c = 0
while A >= B:
B *= 2
c += 1
if c >= K:
break
while B >= C:
C *= 2
c += 1
if c >= K:
break
ans = 0
if A < B < C:
ans = "Yes"
else:
ans = "No"
print(ans) |
p03071 | s708387820 | Accepted | c,d=map(int,input().split())
a=max(c,d)
b=min(c,d)
if a-1>=b:
print(a+a-1)
else:
print(a+b) |
p02982 | s824581175 | Wrong Answer | import math
n,m = map(int,input().split())
x = [list(map(int,input().split())) for _ in range(n)]
cnt,tmp = 0,0
for i in range(n-1):
for j in range(i+1,n):
tmp = 0
for M in range(m):
tmp += (x[i][M] - x[j][M])**2
#print(tmp)
if math.sqrt(tmp).is_integer():
cnt += 1
print(cnt) |
p02917 | s665351556 | Accepted | def main():
N = int(input())
B = list(map(int, input().split()))
A = [0]*N
A[0] = B[0]
for i in range(1, N-1):
A[i] = min(B[i-1], B[i])
A[-1] = B[-1]
print(sum(A))
main() |
p03815 | s183812480 | Accepted | x = int(input())
x11 = x/11
num = [1,2,3,4,5,6]
num2= [7,8,9,10]
if x in num:
print(1)
exit()
elif x in num2:
print(2)
exit()
elif int(x11) == x11:
print(int(x11)*2)
exit()
elif x > int(x11)*11 + 6:
print(int(x11)*2 +2)
exit()
else:
print(1+int(x11)*2)
exit()
|
p03986 | s527242667 | Wrong Answer | x = input()
ans = len(x)
s = 0
t = 0
tar = "S"
for c in x:
if c == "S":
if tar == "T":
ans -= min(s,t)*2
s,t = 0,0
s += 1
else:
t += 1
tar = c
else:
if tar == "T":
ans -= min(s,t)*2
print(ans) |
p02780 | s087141779 | Accepted | N,K= map(int,(input().split()))
p = list(map(int,input().split()))
rui_p=[]
rui_p.append(0)
sum_p=[]
for i in range(N):
rui_p.append(rui_p[i]+p[i])
for j in range(K,N+1):
sum_p.append(rui_p[j]-rui_p[j-K])
msp=max(sum_p)
ans=(msp/2)+(0.5*K)
print(ans) |
p03150 | s960243666 | Accepted | S = input()
N = len(S)
for i in range(N):
for j in range(i, N + 1):
if S[:i] + S[j:] == "keyence":
print("YES")
quit()
print("NO") |
p03673 | s696030174 | Accepted | n = int(input())
A = list(map(int, input().split()))
fw = [a for i,a in enumerate(A) if i%2 == 0]
bw = [a for i,a in enumerate(A) if i%2 == 1]
if len(A) % 2 == 0:
ans = list(reversed(bw)) + fw
else:
ans = list(reversed(fw)) + bw
print(' '.join([str(a) for a in ans])) |
p03861 | s021425859 | Accepted | a,b,x=map(int,input().split())
print(b//x - (a-1)//x)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.