problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03645 | s164045064 | Accepted | #!/usr/bin/env python3
N, M = map(int, input().split())
B = {}
for i in range(1, N+1):
B[i] = []
for i in range(M):
a, b = map(int, input().split())
if b == N or a == 1:
B[a].append(b)
for sima in B[1]:
if N in B[sima]:
print('POSSIBLE')
exit()
print('IMPOSSIBLE')
|
p02818 | s462256558 | Accepted | A,B,K=map(int, input().split())
b=0
res=0
if A<=K:
B=max(b,B-(K-A))
A=0
else:
A=A-K
print(A,B) |
p02947 | s964866997 | Wrong Answer | # coding: utf-8
N = int(input())
alp = [chr(i) for i in range(97, 97+26)]
L = []
for i in range(N):
s = list(set(list(input())))
L.append(s)
for i in range(N):
L[i].sort()
L.sort()
ans = 0
cnt = 1
for i in range(N-1):
if L[i]==L[i+1]:
cnt += 1
else:
ans += cnt*(cnt-1)//2
cnt = 1
if cnt > 1:
ans += cnt*(cnt-1)//2
print(ans) |
p03150 | s857618759 | Accepted | s = input()
b = s[:7]
e = s[-7:]
flg = 0
for i in range(7):
if b[:i] + e[i:] == "keyence":
flg = 1
if flg:
print("YES")
else:
print("NO") |
p02546 | s363228290 | Wrong Answer | s = input()
if s[len(s)-1] != s:
print(s + "s")
else:
print(s + "es") |
p02747 | s047033298 | Wrong Answer | s=input()
if 'hi' in s:
print('Yes')
else:
print('No') |
p03377 | s444263748 | Accepted | a,b,x = map(int,input().split())
print("YES" if a <= x <= a+b else "NO")
|
p03208 | s791378651 | Accepted | N,K=map(int,input().split())
A=[0]*N
for i in range(N):
A[i]=int(input())
A=sorted(A)
t=10**9
for i in range(N-K+1):
t=min(t,abs(A[K-1+i]-A[i]))
print(t) |
p03274 | s049642367 | Wrong Answer | import bisect
N, K = map(int, input().split())
x = list(map(int, input().split()))
id = bisect.bisect_left(x, 0)
ID = bisect.bisect_right(x, 0)
ans = 10**10
if id >= K:
ans = min(ans, x[id-K])
if id + K - 1 < N:
ans = min(ans, x[id+K-1])
for i in range(max(0, id - K + 1), ID):
if i+K-1 < N:
ans = min(ans, -x[i]*2 + x[i+K-1], -x[i]+x[i+K-1]*2)
print(ans)
|
p02596 | s945383707 | Wrong Answer | k = int(input())
mod = 0
for i in range(1, k):
mod = ((mod * 10) + 7) % 7
if mod == 0:
print(i)
exit()
print(-1) |
p02793 | s947627463 | Wrong Answer | import fractions
N=int(input())
a = list(map(int, input().split()))
gcd = a[0]
for i in range(1, N):
gcd = gcd * a[i] // fractions.gcd(gcd, a[i])
b= []
for i in range(N):
b.append(gcd //a[i])
ans=0
if N%2==0:
for i in range(0,N,2):
ans = (b[i]+b[i-1])%1000000007
else:
b.append(0)
for i in range(0,N,2):
ans = (b[i]+b[i-1])%1000000007
print(ans) |
p02578 | s510912903 | Accepted | N = int(input())
l = input().split()
cnt = 0
current = int(l[0])
for i in range(1, N):
now = int(l[i])
if now >= current:
current = now
if now < current:
cnt += current - now
print(cnt)
|
p02787 | s291268489 | Accepted | h,n=map(int,input().split())
lis=[list(map(int,input().split())) for i in range(n)]
dp=[float('inf') for i in range(h+10**4+1)]
dp[0]=0
for i in range(1,h+10**4+1):
for j in range(n):
if i>=lis[j][0]:
dp[i]=min(dp[i],dp[i-lis[j][0]]+lis[j][1])
else:
dp[i]=dp[i]
print(min(dp[h:])) |
p03612 | s347305775 | Wrong Answer | n = int(input())
p = list(map(int, input().split()))
i=0
ans =0
while i<n-1:
if p[i]==i+1:
ans += 1
i+=1
i += 1
print(ans)
|
p02963 | s079731705 | Accepted | S = int(input())
x1 = 10 ** 9
y1 = 1
x2 = 10 ** 9 - S % (10 ** 9)
y2 = S // (10 ** 9) + 1
if S == 10 ** 18:
x1, y1 = 10 ** 9, 0
x2, y2 = 0, 10 ** 9
print('0 0 {0} {1} {2} {3}'.format(x1, y1, x2, y2)) |
p02729 | s102096977 | Accepted |
n, m = map(int, input().split())
c = int(n*(n-1) / 2 + m*(m-1) / 2)
print(c) |
p02676 | s911252045 | Accepted | k = int(input())
s = input()
if len(s) <= k:
print(s)
else:
str_k = ''
for i in range(k):
str_k = str_k + s[i]
print(str_k + '...') |
p02784 | s768818510 | Wrong Answer | h,n = map(int,input().split())
lis = list(input().split())
attack = 0
for i in range(len(lis)):
attack = attack + int(lis[i])
if attack >= h:
print('Yes')
else:
print('') |
p02661 | s599339717 | Accepted | from statistics import median
n = int(input())
abl = [list(map(int,input().split())) for nesya in range(n)]
al = []
bl = []
for ab in abl:
al.append(ab[0])
bl.append(ab[1])
if n%2 == 1:
print(median(bl)-median(al)+1)
else:
print(int(median(bl)*2-median(al)*2+1))
|
p03211 | s411147779 | Accepted | s = input()
m = 1000
for i in range(len(s)):
x = int(s[i:i+3])
if m > abs(753-x):
m = abs(753-x)
print(m) |
p02832 | s623866285 | Wrong Answer | #import sys
#sys.setrecursionlimit(10**7)
#from functools import reduce
#from fractions import gcd
# input
n = int(input())
alist = list(map(int, list(input().split())))
# process/output
if not 1 in alist:
print(-1)
else:
ans = 0
i = 1
while len(alist) > 0:
if i in alist:
index = alist.index(i)
alist = alist[index+1:]
ans += index
i += 1
else:
break
print(ans)
|
p03803 | s735497255 | Accepted | a,b = map(int,input().split())
if a == b:
print("Draw")
elif (a > b):
if b == 1:
print("Bob")
else:
print("Alice")
elif (a < b):
if a == 1:
print("Alice")
else:
print("Bob") |
p02778 | s279957841 | Wrong Answer | S = input()
n = len(S)
for i in range(n):
print('x') |
p02753 | s926037966 | Wrong Answer | S = input();
if S == "AAA" or "BBB":
print("No");
else:
print("Yes"); |
p03221 | s946314733 | Accepted | from collections import defaultdict
n, m = map(int, input().split())
PY = [tuple(map(int, input().split())) for _ in range(m)]
ypi = sorted((y, p, i) for i, (p, y) in enumerate(PY))
d = defaultdict(lambda: 0)
ans = [None]*m
for y, p, i in ypi:
d[p] += 1
ans[i] = str(p).zfill(6) + str(d[p]).zfill(6)
print(*ans, sep='\n') |
p03607 | s558133561 | Accepted | from collections import defaultdict
d = defaultdict(int)
N = int(input())
for i in range(N):
d[int(input())] += 1
ans = sum([1 for i in d.values() if i % 2 == 1])
print(ans)
|
p03327 | s532666484 | Accepted | n = int(input())
if n<=999:
print('ABC')
else:
print('ABD') |
p02817 | s489229306 | Accepted | #!/usr/bin/env python3
s,t=input().split()
print(t+s)
|
p02847 | s060696737 | Accepted | # A - Can't Wait for Holiday
week = ['MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN']
S = str(input())
print(7 - week.index(S) - 1 if S != 'SUN' else 7)
|
p02796 | s162237393 | Accepted |
n = int(input())
rl = []
for i in range(n):
x,l = map(int,input().split())
rl.append([x+l,x-l])
rl.sort()
ans = 1
migihasi = rl[0][0]
hasikouho = []
for i in range(1,n):
right = rl[i][0]
left = rl[i][1]
if left < migihasi:continue
migihasi = right
ans += 1
print(ans)
|
p02630 | s395656893 | Accepted | n = int(input())
l_a = list(map(int, input().split()))
many = [0]*101000
for i in range(0, len(l_a)) :
many[l_a[i]-1]+=1
bef = sum(l_a)
q = int(input())
ans = []
for _ in range(q) :
b, c = map(int, input().split())
bef += (c - b)*many[b - 1]
ans.append(bef)
many[c - 1] += many[b - 1]
many[b - 1] = 0
for value in ans :
print(value) |
p02813 | s692212109 | Accepted | import itertools
def abc150c_count_order():
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
pattern = list(itertools.permutations(range(1, n + 1), n))
print(abs(pattern.index(p)-pattern.index(q)))
abc150c_count_order()
|
p03150 | s732168996 | Accepted | s=input()
k="keyence"
t=""
for i in range(7):
if k[i]!=s[i]:
t+=k[:i]
break
else:
print("YES")
exit()
print("YES" if t+s[i-7:]==k else "NO") |
p02629 | s072452953 | Accepted | n = int(input())
s = "abcdefghijklmnopqrstuvwxyz"
ans = ""
while True:
a = n % 26
if a == 0:
n = n//26 - 1
else:
n //= 26
ans = s[a-1] + ans
if n == 0:
break
print(ans) |
p03075 | s483482938 | Wrong Answer | a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
if b-a>k or c-b>k or d-c>k or e-d>k:
print(":(")
else:
print("Yay!") |
p03059 | s811882198 | Accepted | import math
a, b, t = map(int, input().split())
print( math.floor(t / a) * b ) |
p03284 | s625786918 | Accepted | N,K = map(int, input().split())
a = [0]*K
i = 0
while N > 0:
a[i%K] += 1
N -= 1
i += 1
a.sort()
print(a[K-1]-a[0])
|
p03721 | s513808983 | Accepted | import sys
from collections import defaultdict
def main():
input = sys.stdin.readline
N, K = map(int, input().split())
count1 = 0
count2 = 0
d = []
l = defaultdict(int)
for i in range(N):
a,b = map(int, input().split())
l[a] += b
for i, j in sorted(l.items()):
count2 += j
if count2 >= K:
print(i)
break
if __name__ == "__main__":
main()
|
p02730 | s139591322 | Accepted | def ispalindrome(str): return 1 if str == str[::-1] else 0
def resolve():
S = list(input())
if not ispalindrome(''.join(S)):
print('No')
return
num = len(S)
half = num // 2
half_1 = S[0:half]
half_2 = S[half + 1:]
if not ispalindrome(''.join(half_1)):
print('No')
return
if not ispalindrome(''.join(half_2)):
print('No')
return
print('Yes')
resolve() |
p02555 | s535894214 | Wrong Answer | import math
S=int(input())
ans=0
for i in range(1,int(S//3)+1):
ans+=math.factorial(i)
ans%=10**9+7
print(ans) |
p02688 | s927467779 | Wrong Answer | n,k=map(int,input().split())
list_a=[]
for d in range(k):
d=int(input())
a=list(map(int,input().split()))
list_a.extend(a)
ans=0
for i in range(1,n):
if list_a.count(i)==0:
ans+=1
print(ans)
|
p03221 | s843168060 | Accepted | def pad(n):
n = str(n)
if len(n) < 6:
n = "0"*(6-len(n))+n
return n
N,M = map(int,input().split())
PY = [list(map(int,input().split())) for _ in range(M)]
for i in range(M):
PY[i].append(i)
PY.sort()
turn = 1
PY[0].append(pad(PY[0][0])+pad(turn))
for i in range(1,M):
if PY[i][0] != PY[i-1][0]:
turn = 1
else:
turn += 1
PY[i].append(pad(PY[i][0])+pad(turn))
PY.sort(key = lambda x:x[2])
for i in range(M):
print(PY[i][3])
|
p03220 | s766615476 | Accepted | N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
TM = [0]*N
for i in range(N):
TM[i] = T - H[i]*0.006
TM[i] = abs(TM[i]-A)
#print(TM)
print(TM.index(min(TM))+1) |
p02820 | s232220484 | Accepted | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
ans = 0
def get_score(c):
if c == 's':
score = r
elif c == 'p':
score = s
else:
score = p
return score
for i in range(n):
c = t[i]
if i < k:
ans += get_score(c)
else:
if c == t[i-k]:
t[i] = '0'
else:
ans += get_score(c)
print(ans) |
p03565 | s414308397 | Wrong Answer | 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:]
ans = ans.replace("?", "a")
print(ans)
break
print(ans) |
p03720 | s660136282 | Wrong Answer | N,M = map(int,input().split())
c = ""
for _ in range(M):
a,b = input().split()
c += a+b
for i in range(1,N+1):
print(c.count(str(i))) |
p03328 | s920829138 | Wrong Answer | a, b = map(int, input().split())
i = 1
c = 2
while i <= a:
i += c
c += 1
print(i-a) |
p02744 | s242579082 | Wrong Answer | N = int(input())
alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
def norm(n, prev_list):
out_list = []
for line in prev_list:
for i in range(len(set(line))+1):
new_line = line + alphabet[i]
out_list.append(new_line)
return out_list
init_line = ['a']
for _ in range(N-1):
init_line = norm(1, init_line)
print(init_line)
|
p03592 | s723687014 | Accepted | n,m,k = map(int,input().split())
for i in range(n+1):
for j in range(m+1):
tmp = i * (m - j) + (n - i) * j
if tmp == k:
print("Yes")
exit()
print("No") |
p03095 | s115594484 | Accepted | #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
n = inn()
s = ins()
p = 1
for i in range(26):
c = s.count(chr(ord('a')+i))
p = (p*(c+1))%R
print(p-1)
|
p03239 | s118451142 | Accepted | import math
N,T=map(int, input().split())
ans = math.inf
for i in range(N):
c,t=map(int,input().split())
if t <= T:
ans = min(ans, c)
print(ans if ans != math.inf else "TLE") |
p02832 | s914144048 | Accepted | n = int(input())
a = list(map(int,input().split()))
count = 1
ans = 0
for i in range(n):
if a[i] == count:
count += 1
else:
ans += 1
if ans == n:
print(-1)
else:
print(ans) |
p03695 | s946723689 | Wrong Answer | N=int(input())
p=list(map(int,input().split()))
s=set()
z=0
for i in range(N):
p[i]//=400
if p[i]<8:
s.add(p[i])
else:
z+=1
print(len(s),end=' ')
print(len(s)+z) |
p02700 | s716896492 | Wrong Answer | a, b, c, d = map(int, input().split())
p = 0
while(c > 0):
c = c - b
if c == 0:
break
a = a - d
if a == 0:
p = 1
break
if p == 1:
print("No")
else:
print("Yes") |
p03487 | s919457894 | Accepted | N=int(input())
a=map(int,input().split())
ans,d=0,{}
for x in a:
d[x]=d.get(x,0)+1
ans+=1
if d[x]==x:
ans-=x
print(ans)
|
p02785 | s826672045 | Accepted | from sys import stdin
def main():
n,m = map(int,stdin.readline().split())
l = list(map(int,stdin.readline().split()))
l.sort()
aco = 0
for i in range(n-m):
aco+= l[i]
print(aco)
main()
|
p03408 | s628167480 | Wrong Answer | #!/usr/bin/env python3
# input
n = int(input())
s = [input() for _ in range(n)]
m = int(input())
t = [input() for _ in range(m)]
# calc
d = {}
for i in s:
if i in d.keys():
d[i] += 1
else:
d[i] = 1
for i in t:
if i in d.keys():
d[i] -= 1
else:
d[i] = -1
#import pdb; pdb.set_trace()
if len(d.keys()) != 1:
print(max(d.values()))
else:
print(max(list(d.values())[0], 0)) |
p02766 | s869720652 | Accepted | N, K = map(int, input().split())
l = []
while N // K != 0:
l.insert(-1, N % K)
N = N // K
l.append(N)
print(len(l)) |
p04030 | s092717210 | Wrong Answer | li = list(str(input()))
for i in range(len(li)):
if(li[i] == "B" and not i == 0):
li[i-1] = ""
li[i] = ""
print("".join(li)) |
p02897 | s770540088 | Accepted | n = int(input())
if n % 2 == 0:
print('{:.10f}'.format((n / 2) / n))
else:
print('{:.10f}'.format(((n + 1) / 2) / n)) |
p02939 | s775161936 | Wrong Answer | S = input()
N = len(S)
dp = [0 for _ in range(N)]
dp[0] = 1
dp[1] = 1
for i in range(2, N):
if S[i] != S[i - 1]:
dp[i] += dp[i - 1] + 1
else:
dp[i] += dp[i - 3] + 2
print(dp[N - 1])
|
p04029 | s089673816 | Wrong Answer | N = int(input())
print((N+1)*(N//2)) |
p03821 | s564476936 | Accepted | _, *AB = map(int, open(0).read().split())
AB = iter(AB[::-1])
increment = 0
for b, a in zip(AB, AB):
a += increment
if a % b:
increment += b - a % b
print(increment) |
p02916 | s848842316 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
ans = 0
for i in range(n):
ans += b[a[i]-1]
if(a[i]!= n and i != n-1 ):
ans += c[a[i]-1]
print(ans)
|
p03339 | s898609352 | Accepted | def resolve():
n = int(input())
S = tuple(input())
c_e = S.count('E')
c_w = 0
ans = n
for s in S:
if s == 'E':
c_e -= 1
ans = min(ans, c_w + c_e)
# 自分がWの場合はmax計算の後にカウントする
if s == 'W':
c_w += 1
print(ans)
if __name__ == '__main__':
resolve() |
p03407 | s145164899 | Wrong Answer | # 入力 : 数字3つ
A, B, C = map(int, input().split())
if A == C or B == C or (A+B) == C :
print("Yes")
else :
print("No")
|
p03001 | s797106337 | Accepted | from decimal import Decimal
w, h, x, y = map(int, input().split())
print(Decimal(w*h/2), 1 if w == 2*x and h == 2*y else 0) |
p03659 | s643704374 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
t=sum(a)
m=10**9
flag=0
for i in range(len(a)-1):
t-=2*a[i]
m=min(t,m)
print(m) |
p02917 | s699390884 | Wrong Answer | n = int(input())
b = list(map(int,input().split()))
a = b[0]
for i in range(n-1):
a += min(b[i-1],b[i])
a += b[n-2]
print(a) |
p02742 | s342585336 | Accepted | h , w = map(int, input().split())
if h == 1 or w == 1: exit(print(1))
a1 = h//2 + 1 if h % 2 != 0 else h//2
a2 = h - a1
a3 = w//2 + 1 if w%2!=0 else w//2
a4 = w - a3
#print(a1 , a2 , a3,a4)
ans = a1*a3 + a2*a4
print(ans) |
p03013 | s973715793 | Accepted | # 初期入力
N,M = (int(x) for x in input().split())
A = set([int(input()) for i in range(M)])
#
mod_9 = 10**9 +7
dp =[0]*(N +1)
dp[0] = 1
if 1 not in A:
dp[1] =1
for i in range(N-1):
if i+2 in A:
dp[i+2] = 0
else:
dp[i+2] = dp[i+1] + dp[i]
dp[i+2] %= mod_9
kotae =dp[N] # % mod_9
print(kotae ) |
p02951 | s659617735 | Wrong Answer | a,b,c = map(int,input().split())
print(b+c-a) |
p03803 | s546494964 | Accepted | n=input().split(' ')
for i in range(0,2):
if(int(n[i])==1):
n[i]=14
n[i]=int(n[i])
if(n[0]>n[1]):
print("Alice")
elif(n[1]>n[0]):
print("Bob")
else:
print("Draw")
|
p02618 | s199900239 | Wrong Answer | D = int(input())
c = list(map(int, input().split()))
sdi = [list(map(int, input().split())) for i in range(D)]
lastdi = [0 for i in range(26)]
ans_c = []
for d in range(D):
day_s = sdi[d]
sloss = [day_s[i] + c[i]*(d - lastdi[i]) for i in range(26) ]
ans = sloss.index(max(sloss))
ans_c.append( ans )
for i in range(26):
if i != ans:
lastdi[i] += 1
lastdi[ans] = d
for i in range(D):
print(ans_c[i]) |
p02881 | s028252751 | Accepted | N=int(input())
n=int(N**(0.5))
ans=1
for i in range(1,n+1):
if N%i==0:
ans=i
else:
pass
q=N//ans
print(q+ans-2)
|
p02642 | s808416215 | Wrong Answer | from collections import Counter
input()
s = set(map(int, input().split()))
t = {k for k, v in Counter(s).items() if v == 1}
r = int(1 in t)
if 1 not in s:
for x in t:
i = 2
while i * i <= x:
if x % i == 0 and {i, x // i} & s:
break
i += 1
else:
r += 1
print(r)
|
p03860 | s666507220 | Accepted | li = input().split()
print("A"+li[1][0]+"C") |
p02677 | s976280621 | Wrong Answer | import math
a, b, h, m= map(int, input().split())
x = abs(30 * h - 6 * m)
y = 360 - x
z = min(abs(30 * h - 6 * m), y)
c = a ** 2 + b ** 2 - 2 * a * b * math.cos(math.radians(z))
c = math.sqrt(c)
print(c) |
p03323 | s931165901 | Wrong Answer | a,b = map(int,input().split())
kaku_a = 360/16 * a
kaku_b = 360/16 * b
if kaku_a <= 180 and kaku_b <= 180:
print('Yey!')
else:
print(':(') |
p04043 | s026344207 | Wrong Answer | a,b,c=map(int,input().split())
if(a+b+c==17 and a*b*c==25*7):
print("Yes")
else:
print("No") |
p02639 | s479256846 | Accepted | import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
def main():
A=LI()
print(15-sum(A))
if __name__ == "__main__":
main()
|
p02988 | s089412865 | Accepted | n = int(input())
p = list(map(int, input().split()))
counter = 0
for i in range(1,n-1):
if (p[i]-p[i-1])*(p[i]-p[i+1]) < 0:
counter += 1
print(counter) |
p03435 | s715253305 | Wrong Answer | lc = [[int(w) for w in input().split()] for i in range(3)]
cond = False
lb = lc[0]
a2 = lc[1][0]-lb[0]
a3 = lc[2][0]-lb[0]
la = [0, a2, a3]
for i in range(3):
for j in range(3):
if lc[i][j] != la[i]+lb[j]:
cond = False
break
print("Yes" if cond else "No")
|
p04031 | s337514382 | Accepted | n = int(input())
a = sorted(map(int, input().split()))
ave = round(sum(a) / n)
ans = sum(map(lambda x: (ave - x) ** 2, a))
print(ans) |
p02802 | s438112948 | Accepted | import sys
n, m = [int(i) for i in sys.stdin.readline().split()]
_set = set()
ac = 0
wa = 0
ls = []
for i in range(m):
p, s = [i for i in sys.stdin.readline().split()]
if s == "AC":
_set.add(p)
ls.append([p, s])
new_set = set()
for p, s in ls:
if s == "AC":
new_set.add(p)
if s == "WA" and p in _set and p not in new_set:
wa += 1
print(len(_set), wa)
|
p02633 | s472590597 | Wrong Answer | r = int(input())
print(360 / r) |
p03696 | s848561784 | Wrong Answer | N = int(input())
S = input()
cr = 0
cl = 0
for i in range(N):
if i == "(":
cr += 1
else:
if cr > 0:
cr -= 1
else :
cl += 1
print("("*cl+S+")"*cr) |
p03711 | s688362227 | Wrong Answer | a=[0,1,3,1,2,1,2,1,1,2,1,2,1]
x,y=map(int,input().split())
if a[x]==a[y]:
print("YES")
else:
print("NO")
|
p02660 | s246340714 | Accepted | import math
from collections import defaultdict
def get_max_frequency(x):
n = 1
while True:
if n*(n+1)/2 <= x and x < (n+1)*(n+2)/2:
break
n += 1
return n
N = int(input())
divided = N
d = defaultdict(int)
ans = 0
for i in range(2, int(math.sqrt(N)//1)+1):
while True:
if divided%i == 0:
divided //= i
d[i] += 1
else:
break
d[divided] += 1
if 1 in d:
del d[1]
for v in d.values():
ans += get_max_frequency(v)
print(ans) |
p03281 | s916316078 | Accepted | N = int(input())
ans=0
for _ in range(1,N+1,2):
eight=0
for i in range(1,N+1):
if _ % i ==0:
eight +=1
if eight == 8:
ans+=1
print(ans) |
p04011 | s231346906 | Wrong Answer | n=int(input())
k=int(input())
x=int(input())
y=int(input())
print(k*x+(n-k)*y)
|
p03696 | s129013264 | Accepted | n = int(input())
s = list(input())
d = [0]
x = 0
for i in range(len(s)):
if s[i] == '(':
x += 1
else:
x -= 1
d.append(x)
ans = []
x = min(d)
for i in range(max(0,(-1*x))):
ans.append('(')
for i in s:
ans.append(i)
for i in range(max(d[len(d)-1]-x,0)):
ans.append(')')
a = ''.join(ans)
print(a)
|
p02819 | s697240279 | Wrong Answer | import math
x = int(input())
if x % 2 == 0:
n = x + 1
else:
n = x + 2
while True:
isPrime = True
for i in range(2, int(math.sqrt(n))):
if n % i == 0:
isPrime = False
break
if isPrime:
print(n)
break
n += 2
|
p03761 | s144552484 | Accepted | #import sys
#input = sys.stdin.
def main():
N = int(input())
num = 97
T = [[0 for _ in range(N)] for _ in range(26)]
for i in range(N):
S = list(map(str,input()))
for moji in S:
T[ord(moji)-num][i] += 1
ans = ""
for i in range(26):
use = min(T[i])
ans += chr(num+i)*use
print(ans)
if __name__ == "__main__":
main() |
p03434 | s448281015 | Accepted | n = input()
a = list(map(int, input().split()))
a.sort(reverse=True)
alice_score = sum(a[0::2])
bob_score = sum(a[1::2])
print(alice_score - bob_score) |
p02647 | s819172011 | Accepted | import numpy as np
from numba import njit, i8
n, k = map(int, input().split())
arr = np.array(list(map(int, input().split())))
@njit(i8[:](i8, i8, i8[:]))
def solve(n, k, arr):
for i in range(min(k, 50)):
tmp_arr = np.zeros(n + 2, np.int64)
for i, power in enumerate(arr):
tmp_arr[max(0, i - power + 1)] += 1
tmp_arr[min(n + 1, i + power + 2)] -= 1
arr = np.cumsum(tmp_arr)[1:-1]
return arr
print(*solve(n, k, arr)) |
p03030 | s609198930 | Wrong Answer | n = int(input())
sp = [input().split() for _ in range(n)]
sp_s = sorted(sp, key=lambda x:(x[0], -int(x[1])))
for i in sp:
print(sp_s.index(i)+1) |
p03087 | s536409484 | Accepted | nq = list(map(int,input().split()))
n = nq[0]
q = nq[1]
s = input()
lr = [map(int, input().split()) for _ in range(q)]
l, r = [list(i) for i in zip(*lr)]
sam = [0]*n
for i in range(n-1):
if s[i] == "A" and s[i+1] == "C":
sam[i+1] = sam[i] + 1
else:
sam[i+1] = sam[i]
for i in range(q):
ans = sam[r[i]-1] - sam[l[i]-1]
print(ans)
|
p02953 | s018976024 | Accepted | import sys
def main():
N = int(sys.stdin.readline().rstrip())
H = list(map(int, input().split()))
for x in reversed(range(1, N)):
if H[x] >= H[x-1]:
pass
elif H[x] == H[x-1] - 1:
H[x-1] -= 1
else:
print('No')
sys.exit()
print('Yes')
main() |
p03815 | s752781081 | Accepted | #6→5を交互に上に向けるのが効率良い
n = int(input())
if n%11 == 0:
print(n//11*2)
elif n%11 < 7:
print((n//11)*2+1)
else:
print((n//11+1)*2) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.