problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02935 | s208565725 | Wrong Answer | n=int(input())
vlis=list(map(int,input().split()))
while len(vlis)>=2:
tlis=[]
for i in range(len(vlis)-1):
t=(vlis[i]+vlis[i+1])/2
tlis.append(t)
vlis.insert(tlis.index(min(tlis)),min(tlis))
for i in range(2):
vlis.pop(tlis.index(min(tlis))+1)
print(vlis[0]) |
p02607 | s496622990 | Accepted | #AIsing2020 b
import sys,math,collections,itertools
input = sys.stdin.readline
N=int(input())
A =[0]+list(map(int,input().split()))
count = 0
for i in range(1,N+1,2):
if A[i]%2 ==1:
count +=1
print(count)
|
p02761 | s670416472 | Accepted | N, M = map(int, input().split())
answer = [0 for _ in range(N)]
for _ in range(M):
s, c = map(int, input().split())
if not N == 1:
if s == 1 and c == 0:
print(-1)
exit()
if answer[s-1] == 0:
answer[s-1] = c
else:
if not answer[s-1] == c:
print(-1)
exit()
if answer[0] == 0 and not N == 1:
answer[0] = 1
print("".join(list(map(str, answer))))
|
p03493 | s148450154 | Accepted | s=input()
print(s.count('1')) |
p02882 | s617627996 | Accepted | # https://atcoder.jp/contests/abc144/tasks/abc144_d
from math import pi, tan, atan, degrees
a, b, x = [int(i) for i in input().split()]
theta = (pi * 0.5) - atan(2 * x / (a * b**2))
if b * tan(pi * 0.5 - theta) <= a:
print(degrees(theta))
else:
theta = atan(((2 * b) / a) - (2 * x / a**3))
print(degrees(theta))
|
p02661 | s756317100 | Wrong Answer | import statistics
n=int(input())
r=set([])
x=[[]]*n
for i in range(n):
a,b=list(map(int,input().split()))
x[i]=[a,b]
r0=statistics.median([x[z][0] for z in range(n)])
r1=statistics.median([x[z][1] for z in range(n)])
if ((r0*2) % 2)>0 or ((r1*2) % 2)>0:
mult=2
else:
mult=1
mult=int((r1-r0)*mult+1)
print(mult) |
p02785 | s207735421 | Accepted | N, K = map(int, input().split())
H = list(map(int, input().split()))
if len(H) <= K:
print('0')
else:
HA = sorted(H)
HA = HA[:len(H) - K]
print(str(sum(HA))) |
p02647 | s087594377 | Accepted | from numba import jit
N, K = map(int, input().split())
A = list(map(int, input().split()))
@jit
def solve(k,n,a):
for _ in range(k):
Y = [0]*(n+1)
for i, x in enumerate(a):
Y[max(0, i-x)] += 1
Y[min(n, i+x+1)] -= 1
for j in range(1, n):
Y[j] += Y[j-1]
if a == Y[:-1]:
break
a = Y[:-1]
return a
ans=solve(K,N,A)
print(*ans) |
p02646 | s319736056 | Wrong Answer | def main():
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v == w:
print('NO')
return 0
if a-b < 0 and v-w < 0:
print('NO')
return 0
if a-b > 0 and v-w > 0:
print('NO')
return 0
if abs((a-b)/(v-w)) <= t:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
|
p02582 | s086474592 | Accepted | s=input()
s=list(s)
s_c = s.count('R')
if s[1]=='S' and s_c==2:
s_c=1
print(s_c) |
p03645 | s473461411 | Accepted | N, M = [int(x) for x in input().split()]
AB = [[int(x) for x in input().split()] for _ in range(M)]
x = set()
for a, b in AB:
if a == 1:
x.add(b)
if b == 1:
x.add(a)
f = False
for a, b in AB:
if (a in x and b == N) or (b in x and a == N):
f = True
if f:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
|
p02547 | s930162797 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
ans = False
p = 0
for i in range(N):
D = list(map(int, input().split()))
if D[0] == D[1]:
p += 1
else:
p = 0
if p == 3:
ans = True
break
if ans:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
p02832 | s832154762 | Wrong Answer | N = int(input())
blocks = list(map(int, input().split()))
target = 1
for block in blocks:
if block == target:
target += 1
print(N-target+1) |
p03997 | s911236031 | Wrong Answer | a = int(input())
b = int(input())
h = int(input())
print((a + b) * h / 2) |
p04031 | s066595354 | Wrong Answer | n = int(input())
an = list(map(int, input().split()))
ans = 10*9
for i in range(min(an), max(an)+1):
check = 0
for a in an:
check += (a-i)**2
if ans >= check:
ans = check
print(ans)
|
p03557 | s130902216 | Accepted | N = int(input())
A = sorted(list(map(int,input().split())))
B = sorted(list(map(int,input().split())))
C = sorted(list(map(int,input().split())))
ans = 0
import bisect
b = []
for i in B:
x = bisect.bisect_right(C,i)
b.append(N-x)
y = sum(b)
c = [y]
for i in range(1,N):
y -= b[i-1]
c.append(y)
c.append(0)
for i in A:
a = bisect.bisect_right(B,i)
ans += c[a]
print(ans) |
p02675 | s563677630 | Accepted | N = str(input())
if N[-1] in ('2', '4', '5', '7', '9'):
print('hon')
elif N[-1] in ('0', '1', '6', '8'):
print('pon')
elif N[-1] in ('3'):
print('bon') |
p03998 | s257105386 | Accepted | #!/usr/bin/env python3
# from numba import njit
# input = stdin.readline
# @njit
def solve(d,next="A"):
while len(d[next]) != 0:
next = d[next].pop(0)
return next
def main():
d = {}
d["A"] = list(input().upper())
d["B"] = list(input().upper())
d["C"] = list(input().upper())
print(solve(d))
return
if __name__ == '__main__':
main()
|
p03493 | s003204316 | Accepted | print(input().count('1')) |
p02624 | s616948892 | Accepted | n = int(input())
count = 0
for i in range(n):
m = n // (i+1)
count += (i+1)*m*(m+1)/2
print(int(count)) |
p03329 | s539420686 | Wrong Answer | N =int(input())
SIX = [6**i for i in range(1,7)]
NINE = [9**i for i in range(1,5)]
SIX.extend(NINE)
SIX.append(1)
SIX = sorted(SIX,reverse=True)
N2 =N
cnt=0
for s in SIX:
if N2 >=s:
P,N2 = divmod(N2,s)
cnt+=P
print(cnt) |
p02994 | s239527517 | Accepted | n, l = map(int, input().split())
taste, taste_abs = [l + i for i in range(n)], [abs(l + i) for i in range(n)]
index = taste_abs.index(min(taste_abs))
taste.pop(index)
print(sum(taste)) |
p02675 | s863636430 | Wrong Answer | N = int(input())
if N%10 == [2,4,5,7,9]:
print('hon')
elif N%10 == [0,1,6,8]:
print('pon')
else:
print('bon') |
p02682 | s214909201 | Accepted | def main():
from builtins import int, map, list, print, min
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
input_list = (lambda: input().rstrip().split())
input_number = (lambda: int(input()))
input_number_list = (lambda: list(map(int, input_list())))
A,B,C,K = input_number_list()
ans = min(A,K)
K -= A+B
if K>0:
ans -= min(C,K)
print(ans)
if __name__ == '__main__':
main()
|
p02727 | s255726664 | Accepted | x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)
q = sorted(list(map(int, input().split())), reverse=True)
r = sorted(list(map(int, input().split())), reverse=True)
p = p[:x]
q = q[:y]
a = p + q + r
a = sorted(a, reverse=True)
print(sum(a[:(x+y)])) |
p03469 | s269960698 | Accepted | S = input()
print(S[:3]+"8"+S[4:]) |
p02866 | s439758401 | Accepted | from collections import*
n=input()
a=list(map(int,input().split()))
d=dict(Counter(a))
mod=998244353
ans=a[0]==0 and d[0]==1
for i in d:
if i==0:continue
ans*=pow(d.get(i-1,0),d[i],mod)
ans%=mod
print(ans) |
p03211 | s300339130 | Accepted | import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
s = input()
now = 100000000000
for i in range(len(s)-2):
chk = abs(753 - int(s[i:i+3]))
if i == 0:
now = chk
elif chk < now:
now = chk
print(now) |
p02888 | s112216769 | Accepted | from bisect import bisect_left
n = int(input())
l = list(map(int, input().split()))
l.sort()
ans = 0
for i in range(n - 2):
for j in range(i + 1, n - 1):
ans += bisect_left(l, l[i] + l[j]) - j - 1
print(ans) |
p02948 | s711576476 | Accepted | import heapq
n,m = map(int,input().split())
lst = [0 for _ in range(m)]
dic = {}
for i in range(n):
a,b = map(int,input().split())
if a in dic:
dic[a].append(-b)
else:
dic[a] = [-b]
q = []
heapq.heapify(q)
ans = 0
for i in range(1,m+1):
if i in dic:
for j in range(len(dic[i])):
heapq.heappush(q,dic[i][j])
if q:
ans -= heapq.heappop(q)
print(ans) |
p02888 | s795645520 | Accepted | #!/usr/bin/env python
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
INF = float("inf")
from bisect import bisect_right
def main():
N = int(input())
L = list(map(int,input().split()))
L.sort()
ans = 0
for b in range(N):
for a in range(b+1,N):
upper = b
lower = bisect_right(L, L[a] - L[b])
ans += max(0, upper - lower)
print(ans)
if __name__ == "__main__":
main() |
p02775 | s247550335 | Accepted | N=input()
a=0
k=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])+k
if n<6:
a+=n
if n==5 and i!=0 and int(N[i-1])>4:
k=1
else:
k=0
elif n!=10:
a+=10-n
k=1
else:
a+=0
k=1
a+=k
print(a) |
p02899 | s980749183 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
nA = []
for i in range(N):
nA.append([str(A[i]), str(i + 1)])
nA.sort(key=lambda x: x[0])
ans = list(map(list, zip(*nA)))[1]
print(' '.join(ans))
|
p02727 | s499146499 | Accepted | x,y,a,b,c = map(int,input().split())
r = sorted([i for i in map(int,input().split())],reverse = True)[0:x]
g = sorted([i for i in map(int,input().split())],reverse = True)[0:y]
n = sorted([i for i in map(int,input().split())],reverse = True)
com = sorted(r + g + n,reverse = True)
print(sum(com[0:x + y]))
|
p02714 | s050183353 | Accepted | n=int(input())
s=list(input())
r=[]
g=[]
b=[0]*n
for i in range(len(s)):
if s[i]=="R":
r.append(i)
if s[i]=="G":
g.append(i)
if s[i]=="B":
b[i]=1
ans=0
s=sum(b)
for i in r:
for j in g:
ans+=s
if 0<=2*j-i and 2*j-i<n:
ans-=b[2*j-i]
if (i+j)%2==0:
ans-=b[(i+j)//2]
if 0<=2*i-j and 2*i-j<n:
ans-=b[2*i-j]
print(ans) |
p03838 | s324664865 | Accepted | x,y=map(int,input().split())
if x>0 and y>0:
if x<=y:
print(y-x)
else:
print(x-y+2)
elif x<0 and y<0:
if x<=y:
print(y-x)
else:
print(x-y+2)
else:
if y==0 or x==0:
if y<0 or x>0:
print(abs(y)+abs(x)+1)
else:
print(abs(y)+abs(x))
else:
print(abs(abs(x)-abs(y))+1)
|
p03438 | s393274005 | Wrong Answer | import sys
N=input()
A=map(int, sys.stdin.readline().split())
B=map(int, sys.stdin.readline().split())
A.sort()
B.sort()
for a,b in zip(A,B):
if a>b:
print "No"
quit()
else:
print "Yes" |
p03951 | s518641837 | Accepted | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(input())
S = input().strip()
T = input().strip()
x = 0
for i in range(N):
if S[i:] == T[:N - i]:
x = N - i
break
print(N * 2 - x)
if __name__ == '__main__':
main()
|
p03624 | s817131072 | Wrong Answer | import sys
S = list(input())
s = list(set(S))
s.sort()
alfa = [chr(ord("a")+i) for i in range(26)]
ans = 0
if(len(s)==len(alfa)):
print('None')
else:
for i in range(len(s)):
if(s[i]!=alfa[i]):
print(alfa[i])
sys.exit() |
p03665 | s707792570 | Accepted | from scipy.special import comb
n, p = map(int, input().split())
A = list(map(int, input().split()))
cnt_o = len([a for a in A if a%2 == 1])
cnt_e = n - cnt_o
sum_comb_o = 0 # 奇数からとる組み合わせの和
for i in range(n+1):
if p == 0 and i%2 == 0:
sum_comb_o += comb(cnt_o, i, exact=True)
elif p == 1 and i%2 == 1:
sum_comb_o += comb(cnt_o, i, exact=True)
print(2**cnt_e * sum_comb_o) |
p02796 | s912146658 | Accepted | N = int(input())
X = []
for i in range(N):
x,l=map(int,input().split())
X.append([x-l,x+l])
X = sorted(X, key=lambda x:x[1])
a = X[0][0]-1
ans = 0
for i in range(N):
if X[i][0] >= a:
a =X[i][1]
ans +=1
else:
continue
print(ans) |
p02768 | s220981035 | Accepted | n,a,b = map(int,input().split())
m = 10**9 + 7
comb_a = 1
comb_b = 1
a_num = list(range(1,a+1))
j = 0
for i in range(1,a+1):
comb_a *= (n-i+1)
comb_a *= pow(a_num[i-1],m-2,m)
comb_a = comb_a % m
b_num = list(range(1,b+1))
j = 0
for i in range(1,b+1):
comb_b *= (n-i+1)
comb_b *= pow(b_num[i-1],m-2,m)
comb_b = comb_b % m
ans = pow(2,n,m) - comb_a - comb_b - 1
print(int(ans) % m) |
p03435 | s636008283 | Wrong Answer | c = []
for _ in range(3) :
c += [list(map(int, input().split()))]
a1 = c[1][0]-c[0][0]
a2 = c[2][0]-c[0][0]
c1 = [c[0][i] + a1 for i in range(3)]
c2 = [c[0][i] + a2 for i in range(3)]
if c[1] == c1 and c[2] == c2 :
print("yes")
else :
print("no") |
p03434 | s847864642 | Accepted | n=int(input())
a=sorted(list(map(int,input().split())),reverse=True)
ans=0
for i in range(n):
if i%2==0:
ans+=a[i]
else:
ans-=a[i]
print(ans) |
p03061 | s171615412 | Accepted | from fractions import gcd
N = int(input())
A = list(map(int,input().split()))
lg = [A[0]]
for a in A[1:]:
lg.append(gcd(lg[-1], a))
rg = [A[-1]]
for a in reversed(A[:-1]):
rg.append(gcd(rg[-1], a))
rg.reverse()
ans = max(lg[-2], rg[1])
for l,r in zip(lg,rg[2:]):
g = gcd(l,r)
ans = max(ans, g)
print(ans) |
p02732 | s724855294 | Accepted | n = int(input())
balls = list(map(int, input().split()))
conbi = [0]*n
for i in balls:
conbi[i-1] +=1
result = 0
for j in range(n):
result += (conbi[j]*(conbi[j]-1))//2
for k in balls:
print(result-conbi[k-1]+1, end=" ")
|
p02768 | s254083445 | Accepted | n, a, b = map(int, input().split())
mod = pow(10, 9) + 7
def comb(N, x):
numerator = 1
for i in range(N-x+1, N+1):
numerator = numerator * i % mod
denominator = 1
for j in range(1, x+1):
denominator = denominator * j % mod
d = pow(denominator, mod-2, mod)
return numerator * d
a = comb(n, a)
b = comb(n, b)
print((pow(2, n, mod) -1 -a -b) % mod) |
p03274 | s678466722 | Wrong Answer | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()
N, K = i_l()
x = i_l()
ans = 1 << 31
for i in range(N-K+1):
if x[i] >= 0:
ans = min(ans, x[i+K-1])
elif x[i+K-1] <= 0:
ans = min(ans, x[i])
elif x[i] <= 0 and 0 <= x[i+K-1]:
ans = x[i+K-1] - x[i] + min(abs(x[i+K-1]), abs(x[i]))
print(ans) |
p03796 | s712496106 | Wrong Answer | n= int(input())
cnt = 1
for i in range(1,n+1):
cnt *= i
print(cnt)
|
p03745 | s258343857 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
if n<=2:print(1);exit()
ans=1
chk=0
while chk<n-2:
if (l[chk]-l[chk+1])*(l[chk+1]-l[chk+2])<0:ans+=1;chk+=2
else:chk+=1
print(ans)
|
p03145 | s173610823 | Accepted | #!/usr/bin/env python3
a, b, c = map(int, input().split())
print(a*b//2) |
p03644 | s450385136 | Accepted | n = int(input())
for i in range(8):
if 2**i>n:
print(2**(i-1))
break |
p03821 | s439045378 | Accepted | n=int(input())
ab=[list(map(int, input().split())) for _ in range(n)]
ab=ab[::-1]
cnt=0
for [a,b] in ab:
if (a+cnt)%b!=0:
cnt+=(b)-(a+cnt)%b
#print(a,b,cnt)
print(cnt)
|
p02777 | s449494480 | Accepted | s, t = input().split()
a, b = map(int, input().split())
u = input()
if u == s:
print(a-1, b)
else:
print(a, b-1) |
p02777 | s949112266 | Wrong Answer | import sys
input = sys.stdin.readline
S, T = input().split()
A, B = map(int, input().split())
U = input()
if S==U:
print(A-1,B)
if T==U:
print(A,B-1) |
p02783 | s731786025 | Wrong Answer | h,a = map(int,input().split())
print(h // a + 1) |
p02717 | s109975613 | Accepted | A, B, C = map(int, input().split())
A, B = B, A
A, C = C, A
print(A, B, C) |
p03624 | s926893754 | Wrong Answer | S = list(input())
S.sort()
for i in range(len(S)-1):
if ord(S[i+1]) - ord(S[i]) == 0 or ord(S[i+1]) - ord(S[i]) == 1:
pass
else:
res = ord(S[i]) + 1
print(chr(res))
exit()
res = ord(S[-1]) + 1
if S[0] == 'a' and S[-1] == 'z':
print('None')
elif S[0] != 'a':
res = ord(S[0]) - 1
print(chr(res))
else:
print(chr(res))
|
p02546 | s660357797 | Accepted | s = str(input())
if s[-1] == "s":
print(s+"es")
else:
print(s+"s") |
p03760 | s285677513 | Wrong Answer | O = input()
E = input()
print(*[x + y for x,y in zip(O,E)],sep='')
|
p02681 | s836166155 | Accepted | S=input()
T=input()
print("Yes" if S==T[:len(T)-1] and len(S)+1==len(T) else "No") |
p03836 | s338140587 | Accepted | line = list(map(int,input().split()))
dx = line[2]-line[0]
dy = line[3]-line[1]
for i in range(dx):
print('R',end='')
for i in range(dy):
print('U',end='')
for i in range(dx):
print('L',end='')
for i in range(dy+1):
print('D',end='')
for i in range(dx+1):
print('R',end='')
for i in range(dy+1):
print('U',end='')
print('LU',end='')
for i in range(dx+1):
print('L',end='')
for i in range(dy+1):
print('D',end='')
print('R')
|
p03644 | s377305625 | Accepted | n = int(input())
ans = 1
while ans <= n//2:
ans *= 2
print(ans) |
p03252 | s637292494 | Accepted | S=input()
T=input()
def encode(S):
dict={}
now=0
result=""
for s in S:
if s not in dict.keys():
dict[s]=str(now)
now+=1
result=result+dict[s]
return result
if encode(S)!=encode(T):
print("No")
else:
print("Yes")
#print(encode(S),encode(T)) |
p02724 | s324684230 | Wrong Answer | money = int(input())
num_500 = int(money / 500)
remaining = int(money % 500)
num_5 = int(remaining / 5)
print('{}'.format(num_500 * 1000 + num_5 * 500 )) |
p03548 | s999252890 | Accepted | A,B,C = list(map(int,input().split()))
ans = 0
if B + C * 2 > A:
print(ans)
exit()
A -= B + C * 2
ans += 1
while A // (B+C) >= 1:
A -= B + C
ans += 1
print(ans) |
p02842 | s836940832 | Accepted | import math
N = int(input())
X = math.ceil(N / 1.08)
if math.floor(X * 1.08) == N:
print(X)
else:
print(':(')
|
p03438 | s631298559 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt = 0
for a_, b_ in zip(a, b):
if a_ > b_:
cnt += a_ - b_
else:
cnt -= (b_ - a_) // 2
if cnt <= 0:
print('Yes')
else:
print('No')
|
p02629 | s386893757 | Accepted | #!/usr/bin/env python3
ALPHABET = "abcdefghijklmnopqrstuvwxyz"
n = int(input()) - 1
ans = ""
while True:
ans += ALPHABET[n % 26]
n //= 26
n -= 1
if n < 0:
break
print(ans[::-1])
|
p02790 | s307337863 | Accepted | a, b = map(int, input().split())
if a>b:
for i in range(a):
print(b,end='')
else:
for i in range(b):
print(a,end='')
|
p03607 | s901919800 | Accepted | n=int(input())
d=dict()
for _ in range(n):
a=int(input())
if a not in d:
d[a]=0
else:
del d[a]
print(len(list(d))) |
p03711 | s632654264 | Accepted | import sys
input = sys.stdin.readline
def main():
A = {1, 3, 5, 7, 8, 10, 12}
B = {4, 6, 9, 11}
C = {2}
xy = set(map(int, input().split()))
if xy <= A or xy <= B or xy <= C:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main() |
p02577 | s808407271 | Accepted | s=input()
ans=0
for c in s:
ans+=int(c)
ans%=9
if ans==0:
print('Yes')
else:
print('No') |
p02983 | s839776082 | Accepted | l, r = map(int, input().split())
if r - l >= 2019:
print(0)
exit()
l = l%2019
r = r%2019
if l >= r:
print(0)
else:
ans = float('inf')
for left in range(l, r):
for right in range(left+1, r+1):
ans = min(ans, (left*right)%2019)
print(ans) |
p02556 | s760350485 | Wrong Answer | N = int(input())
v = [list(map(int, input().split())) for i in range(N)]
minx = min([v[i][0] for i in range(N)])
miny = min([v[i][1] for i in range(N)])
v.sort(key = lambda x:x[0] - minx + x[1] - miny)
d = abs(v[0][0] - v[N-1][0]) + abs(v[0][1] - v[N-1][1])
print(d)
|
p03495 | s117021301 | Wrong Answer | n,k = map(int,input().split())
A = list(map(int,input().split()))
d = {i:0 for i in set(A)}
for a in A:
d[a] += 1
ans = list(d.values())
ans.sort
print(sum(ans[k:])) |
p03720 | s774043771 | Accepted | n,m=map(int,input().split())
d=[0]*n
for i in range(m):
a,b=map(int,input().split())
d[a-1]+=1
d[b-1]+=1
for i in d:
print(i) |
p02873 | s962667367 | Accepted | S = input()
N = len(S) + 1
t = [0] * N
for i in range(N - 1):
if S[i] == '<':
t[i + 1] = t[i] + 1
for i in range(N - 2, -1, -1):
if S[i] == '>':
t[i] = max(t[i], t[i + 1] + 1)
print(sum(t)) |
p02613 | s744335694 | Wrong Answer | N = int(input())
G0, G1, G2, G3 = 0, 0, 0, 0
for i in range(N):
Si=input()
if Si == 'AC':
G0 += 1
elif Si=='WA':
G1 += 1
elif Si=='TLE':
G2 += 1
else:
G3 += 1
print('AC x' +str(G0))
print('WA x' +str(G1))
print('TLE x'+str(G2))
print('RE x' +str(G3)) |
p02633 | s796148806 | Accepted | X = int(input())
x = 1
while True:
if X*x % 360 == 0:
print(x)
break
x += 1 |
p02695 | s978045520 | Accepted | N, M, Q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
from itertools import combinations_with_replacement
l = [i for i in range(1, M+1)]
lis = list(combinations_with_replacement(l, N))
for l in lis:
tmp = 0
for j in range(Q):
a, b, c, d = abcd[j]
if l[b-1]-l[a-1]==c:
tmp+=d
ans = max(tmp, ans)
print(ans) |
p02939 | s891546807 | Wrong Answer | s=input()
ans=0
pre=""
for i in s:
if pre!=i:
pre=i
ans+=1
else:pre+=i
print(ans+int(len(pre)>=2)) |
p02813 | s773443911 | Wrong Answer | import itertools
import math
N=int(input())
R=list(range(1,N+1))
a=tuple(map(int,input().split()))
ai=0
b=tuple(map(int,input().split()))
bs=0
c=0
K=list(itertools.permutations(R))
for i in range(math.factorial(N)):
if K[i]==a:
ai=i
c+=1
elif K[i]==b:
bs=i
c+=1
elif c==2:
break
print(abs(ai-bs)) |
p02873 | s380638543 | Accepted | s=input()+' '
p=0
l=list()
for i in range(len(s)-1):
if s[i]==s[i+1]:
p+=1
else:
if s[i]=='<':
l.append([0,'<',p+1])
else:
l.append([p+1,'>',0])
p=0
a=sum([sum(range(i[2]+1)) if i[1]=='<' else sum(range(i[0]+1)) for i in l])
b=sum([min(l[i][2],l[i+1][0]) for i in range(len(l)-1)])
print(a-b) |
p02712 | s155421019 | Wrong Answer | n = int(input())
n3 = n // 3
n5 = n // 5
n15 = n // 15
print(n*(n+1)/2 + 3*n3*(n3+1)/2 + 5*n5*(n5+1)/2 - 15*n15*(n15+1)/2) |
p02553 | s971734945 | Wrong Answer | def resolve():
a, b, c, d = list(map(int, input().split()))
if b > 0 and d > 0:
print(b * d)
elif b > 0 and d < 0:
print(d * a)
elif b < 0 and d > 0:
print(c * b)
else:
print(a * c)
resolve() |
p02768 | s777930944 | Accepted | MOD = 1000000007
def cal(a, n):
if n == 1:
return a
if n % 2 == 0:
return (cal(a, n // 2) % MOD) ** 2 % MOD
else:
return (cal(a, n - 1) % MOD) * a % MOD
def cal_p(n, r):
res = 1
for i in range(r):
res = res * (n - i) % MOD
return res
n, a, b = map(int, input().split())
all = cal(2, n) - 1
A = cal_p(n, a) * cal(cal_p(a, a), 1000000005) % MOD
B = cal_p(n, b) * cal(cal_p(b, b), 1000000005) % MOD
print((all - A - B) % MOD)
|
p02786 | s942804974 | Accepted |
import math
H = int(input())
print(2**(int(math.log2(H))+1)-1)
|
p03971 | s292948249 | Accepted | n,a,b=map(int,input().split())
s=str(input())
o=0
e=0
for i in range(n):
if s[i]=='a':
if o<a+b:
o+=1
print('Yes')
else:
print('No')
elif s[i]=='b':
if o<a+b and e<b:
o+=1
e+=1
print('Yes')
else:
print('No')
else:
print('No')
|
p02725 | s098171552 | Wrong Answer | import sys
input = sys.stdin.readline
# int(input()) # 入力が1つ
k, n = map(int, input().split()) # 入力が複数
houses = list(input().split())
houses = [int(h) for h in houses]
houses.sort()
houses.append(k)
max_dist = 0
total = 0
for i in range(n):
d = houses[i + 1] - houses[i]
max_dist = max(max_dist, d)
total += d
ans = total - max_dist
print(ans)
|
p02761 | s881910682 | Accepted | N, M = map(int, input().split())
s_c = [list(map(int, input().split())) for _ in range(M)]
if N == 1:
a, b = 0, 10**N
elif N >= 2:
a, b = 10**(N-1), 10**N
ans = '-1'
for i in range(a, b):
flag = True
for j in range(M):
if str(i)[s_c[j][0]-1] != str(s_c[j][1]):
flag = False
if flag:
ans = i
break
print(ans) |
p03035 | s433610812 | Accepted | a,b=map(int,input().split())
if 13<=a:
print(b)
elif 6<=a<=12:
print(b//2)
else:
print(0) |
p03261 | s481073887 | Accepted | n = int(input())
w = []
for i in range(n):
w.append(str(input()))
ans = "Yes"
for i in range(1, n):
if w[i-1][-1] != w[i][0]:
ans = "No"
break
if len(set(w)) != len(w):
ans = "No"
print(ans) |
p02847 | s942448201 | Accepted | S = input()
DAY = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-DAY.index(S)) |
p03624 | s202453113 | Accepted | print(min(set(map(chr,range(97,123)))-set(input())or[None]))
|
p03126 | s221538928 | Wrong Answer | n,m=map(int,input().split())
c = [0]*m
for i in range(n):
a = list(map(int, input().split()))
for e in a:
c[e-1] += 1
print(c.count(n)) |
p02780 | s316015383 | Wrong Answer | n,k=map(int,input().split())
p = list(map(int,input().split()))
def ex_even(a):
return (a+1)/2
def ex_odd(b):
return b//2 + 1
ans = [0] * k
s = sum(p[0:k])
s_max = 0
for i in range(n-k):
s = s-p[i] + p[i+k]
s_max = max(s_max,s)
if s_max % 2 == 0:
print(ex_even(s_max) + 0.5*(k-1))
else:
print(ex_odd(s_max) + 0.5*(k-1)) |
p02657 | s383295085 | Accepted | #coding: utf-8
num1, num2= list(map(int, input().split()))
print(num1*num2) |
p03605 | s923117714 | Accepted | n = str(input())
if n[0]=='9' or n[1]=='9':
print('Yes')
else:
print('No') |
p03998 | s245669398 | Wrong Answer | # coding: utf-8
sa = input()
sb = input()
sc = input()
d = {"A":sa, "B":sb, "C":sc}
s = d["A"][0].upper()
d["A"] = d["A"][1:]
while True:
if len(d[s]) == 0:
print(s)
break
tmp = d[s][0].upper()
d[tmp] = d[tmp][1:]
if len(d[tmp]) == 0:
print(tmp)
break
s = tmp[:] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.