problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03262 | s279769021 | Wrong Answer | n,x = map(int,input().split())
x_list = list(map(int,input().split()))
x_list.append(x)
x_list = sorted(x_list)
if len(x_list) >= 3:
c = [x_list[2] - x_list[1],x_list[1] - x_list[0]]
while c[0]%c[1] != 0:
c.append(c[0]%c[1])
c.pop(0)
else:
print(c[1])
else:
print(x_list[1]-x_list[0]) |
p03037 | s881159150 | Accepted | N, M = map(int, input().split())
L = []
R = []
for i in range(M):
l, r = map(int, input().split())
L.append(l)
R.append(r)
ans = 0
l = max(L)
r = min(R)
for i in range(N):
if i+1 >= l and i+1 <= r:
ans += 1
print(ans) |
p03338 | s339355291 | Accepted | N = int(input())
S = list(input())
ans = 0
for i in range(N):
l = set(S[:i])
r = set(S[i:])
S_intersection = l & r
ans = max(len(S_intersection), ans)
print(ans) |
p03592 | s821437145 | Accepted | n,m,k=map(int,input().split())
for x in range(n+m+1):
for a in range(min(n+1,x+1)):
if 0<=x-a<=m:
num=a*m+(x-a)*(n-2*a)
if k==num:
print("Yes")
exit()
print("No")
|
p02744 | s798366151 | Accepted | def dfs(N, s, maxc):
if len(s) == N:
print(s)
else:
for i in range(ord(maxc)-ord('a') + 2):
ord_c = ord('a')+i
dfs(N, s+chr(ord_c), chr(max(ord_c, ord(maxc))))
N = int(input())
dfs(N, 'a', 'a') |
p03062 | s010244631 | Accepted | from sys import stdin, setrecursionlimit
from bisect import bisect_right
def main():
input = stdin.buffer.readline
n = int(input())
a = list(map(int, input().split()))
a.sort()
idx = bisect_right(a, 0)
if idx % 2 == 0:
print(sum(a[idx:]) - sum(a[:idx]))
elif idx == n:
print(a[idx - 1] - sum(a[:idx - 1]))
else:
print(sum(a[idx:]) - sum(a[:idx]) - 2 * min(-a[idx - 1], a[idx]))
if __name__ == "__main__":
setrecursionlimit(10000)
main()
|
p02594 | s060652592 | Wrong Answer | def main():
x=input()
if x=='30':
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() |
p02792 | s303156646 | Accepted | N=int(input())
d={}
for i in range(1,10):
for j in range(1,10):
d[i*10+j]=0
for i in range(1,min(10,N+1)):
d[i*10+i]=1
for i in range(11,N+1):
i=str(i)
h,t=int(i[0])*10,int(i[-1])
if t!=0:
d[h+t]+=1
ans=0
for i in range(1,9):
for j in range(i+1,10):
ans+=(d[i*10+j]*d[j*10+i])*2
for i in range(1,10):
ans+=d[i*10+i]**2
print(ans) |
p02718 | s618317916 | Accepted | import sys
from collections import defaultdict
n,m=map(int,sys.stdin.readline().split())
l=list(map(int,sys.stdin.readline().split()))
l.sort()
l.reverse()
limit=(sum(l)/(4*m))
i=0
#print(l,'l')
while i<n and l[i]>=limit:
i+=1
if i>=m:
print('Yes')
else:
print('No')
|
p03835 | s674289221 | Wrong Answer | k,s=map(int,input().split())
ans=0
if s%3==0:
ans+=1
for i in range(k):
if 2*k<=s<3*k:
ans+=3
for i in range(k-1):
for j in range(i+1,k):
for k in range(j+1,k+1):
if i+j+k==s:
ans+=6
print(ans) |
p03251 | s304584697 | Accepted | N, M, X, Y = map(int, input().split())
xs = list(map(int, input().split()))+[X]
ys = list(map(int, input().split()))+[Y]
print(("No " if max(xs) < min(ys) else "")+"War") |
p03730 | s060459218 | Accepted | import fractions
A,B,C=map(int,input().split())
lcm = A*B#//fractions.gcd(A,B)
#A*(i+j)%B=C
#A*(i+j)=BX+C
i=A
while i<=lcm:
#print(i,lcm)
if i%B==C:
print("YES")
exit()
i+=A
print("NO") |
p02613 | s216454325 | Accepted | n = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(n):
s = input()
if s == "AC":
AC += 1
elif s == "WA":
WA += 1
elif s == "TLE":
TLE += 1
else:
RE += 1
print("AC x",AC)
print("WA x",WA)
print("TLE x",TLE)
print("RE x",RE) |
p03449 | s922943949 | Accepted | N = int(input())
A1, A2 = [list(map(int, input().split())) for _ in range(2)]
print(max([sum(A1[:i + 1] + A2[i:]) for i in range(N)]))
|
p02814 | s046258964 | Accepted | import sys
import fractions
from functools import reduce
input = sys.stdin.readline
n, m = [int(x) for x in input().rstrip().split()]
a = [int(x)//2 for x in input().rstrip().split()]
a = list(set(a))
def lcm_base(x, y): return x * y // fractions.gcd(x, y)
lcm = reduce(lcm_base, a, 1)
for x in a:
if (lcm // x) % 2 == 0:
print(0)
break
else:
print((m // lcm + 1) // 2)
|
p03146 | s840317037 | Accepted | def f(n):
if n%2==0:
return n/2
else:
return 3*n+1
def has_duplicates(seq):
return len(seq) != len(set(seq))
s=int(input())
a=list()
a.append(s)
i=0
while True:
a.append(f(a[i]))
double=has_duplicates(a)
if double==True:
print(i+2)
break
i+=1 |
p03338 | s028638442 | Wrong Answer | n = int(input())
s = list(input())
ans = 0
c = 0
fh = []
lh = s
for i in range(n):
tmp = lh.pop(0)
if tmp not in fh:
if tmp in lh:
c += 1
else:
c -= 1
fh.append(tmp)
ans = max(ans, c)
print(ans) |
p03455 | s384376404 | Accepted | aAndb = list(map(int, input().split()))
ab = aAndb[0] * aAndb[1]
if ab%2==0:
print("Even")
else:
print("Odd") |
p03555 | s247865710 | Wrong Answer | c = [input() for _ in range(2)]
if c[0][1] == c[1][1] and sorted(c[0]) == sorted(c[1]):
print("Yes")
else:
print("No")
|
p03380 | s196655901 | Accepted | from bisect import bisect_left
n = int(input())
a = list(map(int, input().split()))
a.sort()
ma = a[-1]
mid = ma / 2 # ma/2に最も近いものをとってくればよい
idx = bisect_left(a, mid)
if abs(a[idx] - mid) < abs(a[idx-1] - mid):
ans_idx = idx
else:
ans_idx = idx - 1
print(ma, a[ans_idx])
|
p03695 | s401173853 | Accepted | n = int(input())
a = list(map(int, input().split()))
color = [0] * 8
free = 0
for i in a:
if i < 3200:
c = i // 400
color[c] = 1
else:
free += 1
ans = sum(color)
print(max(1, ans), ans + free)
|
p03720 | s944947386 | Accepted | n, m = map(int, input().split())
deg = [0] * n
for i in range(m):
u, v = map(int, input().split())
deg[u - 1] += 1
deg[v - 1] += 1
for i in range(n):
print(deg[i]) |
p03407 | s752333430 | Accepted | a, b, c = map(int, input().split())
print("Yes" if a+b>=c else "No") |
p03835 | s329020875 | Accepted | K,S=map(int,input().split())
num=0
for i in range(K+1):
for j in range(K+1):
k=S-i-j
if 0<=k<=K:
num+=1
print(num)
|
p03720 | s942019666 | Accepted | N, M = map(int, input().split())
list = []
for i in range(M):
a, b = map(int, input().split())
list.append(a)
list.append(b)
for i in range(1,N+1):
print(list.count(i)) |
p02918 | s823106144 | Accepted | def main():
n,k=map(int,input().split())
s=input()
A=(('L','R'),('R','L'))
B=[]
Bappend=B.append
cnt=0
for i in range(n-1):
tmp=(s[i],s[i+1])
cnt+=1
if tmp==A[0]:
Bappend(cnt)
cnt=0
elif tmp==A[1]:
Bappend(cnt)
cnt=0
cnt+=1
Bappend(cnt)
print(n-max(1,len(B)-2*k))
if __name__=='__main__':
main() |
p02546 | s690756232 | Wrong Answer | S = input()
if S[-1] == 'e':
print(S+'s')
else:
print(S+'es') |
p02801 | s911725371 | Wrong Answer | a = input()
next = (chr(ord(a)+1))
print("'"+a+"'"+"の次は"+"'"+next+"'"+"です") |
p02576 | s753792796 | Accepted | n,x,t = map(int,input().split())
x = n/x
if x%1 == 0:
print(int(x)*t)
else:
print((int(x)+1)*t) |
p02897 | s182971398 | Accepted | #142_A
n = int(input())
print(0.5 if n % 2 == 0 else (n + 1) / (2 * n)) |
p03944 | s627989837 | Accepted | w,h,n=map(int,input().split())
p,q=[0,w],[0,h]
for _ in range(n):
x,y,a=map(int,input().split())
if a==1:
p[0]=max(p[0],x)
elif a==2:
p[1]=min(p[1],x)
elif a==3:
q[0]=max(q[0],y)
else:
q[1]=min(q[1],y)
s=(p[1]-p[0])*(q[1]-q[0])
print(s if p[0]<=p[1] and q[0]<=q[1] else 0) |
p02958 | s820144497 | Accepted | n=int(input())
l=[int(x) for x in input().split()]
cnt=0
x=0
y=0
b=0
for i in range(n):
if(i+1!=l[i]):
cnt+=1
if(cnt>2):
print("NO")
else:
print("YES")
|
p02829 | s631244576 | Wrong Answer | a = int(input())
b = int(input())
c = a-b
if c == 3:
print(3)
elif c == 4:
print(2)
else:
print(1) |
p03210 | s467727393 | Accepted | n = int(input())
print("YES" if n == 3 or n == 5 or n == 7 else "NO") |
p03699 | s104891769 | Accepted | def main():
n, *S = map(int, open(0).read().split())
S.sort()
ans = sum(S)
if ans % 10 == 0:
for s in S:
if s % 10 != 0:
return ans - s
return 0
else:
return ans
print(main()) |
p02778 | s298010090 | Accepted | s = input()
X = ''
for i in range(len(s)):
X = X + 'x'
print(X)
|
p02695 | s117245922 | Accepted | import itertools
N, M, Q = map(int, input().split())
ABCD = [[int(x) for x in input().split()] for i in range(Q)]
ans=0
t=[m for m in range(1,M+1)]
for A in itertools.combinations_with_replacement(t, N):
ans2=0
for (a,b,c,d) in ABCD:
if A[b-1]-A[a-1]==c:
ans2+=d
ans=max(ans, ans2)
print(ans)
|
p03485 | s009571386 | Accepted | a,b=map(int,input().split())
print((a+b-1)//2+1) |
p03449 | s756680787 | Wrong Answer | # -*- coding: utf-8 -*-
n = int(input())
a_u = list(map(int, input().split()))
a_d = list(map(int, input().split()))
num = 0
for i in range(n):
num += a_u[0]
a_u.pop(0)
if sum(a_u) <= sum(a_d[:-1]):
num += sum(a_d[:-1])
break
a_d.pop(0)
print(num+a_d[-1]) |
p02829 | s506389083 | Wrong Answer | N = int(input())
nums = 1
while(N >= 0):
if N < 2:
nums*=1
else:
nums*=N
N-=2
counter = 0
div = 10
while(True):
if nums % div != 0:
break
counter+=1
div*=10
print(counter) |
p03448 | s259935150 | Accepted | a = int(input())
b = int(input())
c = int(input())
x = int(input())
cnt = 0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
total = 500*i + 100*j + 50*k
if total == x:
cnt += 1
print(cnt) |
p02784 | s703101201 | Accepted | hn = list(map(int,input().split()))
h,n = hn
a = list(map(int,input().split()))
h -= sum(a)
if h > 0:
print ("No")
else:
print ("Yes") |
p02939 | s691216161 | Wrong Answer | s = list(input())
a = s[0]
cou = 1
i = 1
while i!=len(s) and i!=len(s)-1:
if s[i]!=a:
cou += 1
a = s[i]
i += 1
# print(0,a,cou,i)
else:
a = "".join(s[i:i+2])
cou += 1
i += 2
# print(10,a,cou,i)
#print(a,cou,i)
if a==s[-1] and len(a)==1:
print(cou)
elif a=="".join(s[-2:]) and len(a)==2 and i==len(s)-2:
print(cou)
else:
print(cou+1) |
p03379 | s577513953 | Accepted | N = int(input())
X = list(map(int,input().split()))
Y = sorted(X)
m1 = Y[N//2-1]
m2 = Y[N//2]
for x in X:
if x<m2:
print(m2)
else:
print(m1) |
p02732 | s681855053 | Accepted | n=int(input())
a=list(map(int,input().split()))
l=[0]*(n+1)
for i in a:
l[i]+=1
ans=0
for i in range(n+1):
ans+=l[i]*(l[i]-1)//2
for i in a:
print(ans-l[i]*(l[i]-1)//2+(l[i]-1)*(l[i]-2)//2) |
p03854 | s427734830 | Wrong Answer | s = input()
s = s.replace("eraser", "")
s = s.replace("dreamer", "")
s = s.replace("erase", "")
s = s.replace("dream", "")
if len(s) == 0:
print("YES")
else:
print("NO") |
p02777 | s682965294 | Wrong Answer | S,T=input().split()
A,B=map(int,input().split())
U=input()
print(S, T)
if(U==S):
print(A-1, B)
else:
print(A, B-1) |
p02594 | s309880773 | Wrong Answer | def main():
tmp = int(input())
if tmp >= 35:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main() |
p02880 | s445451003 | Accepted | n = int(input())
for i in range(1,10):
if n % i == 0 and 1<= n/i <= 9:
print("Yes")
break
else:
print("No") |
p03309 | s010867925 | Wrong Answer | from functools import lru_cache
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split(' '))))
i = np.arange(1, N + 1)
left = -2 * (10 ** 9)
right = 2 * (10 ** 9)
@lru_cache(maxsize=None)
def cost(b):
return np.sum(np.abs(A - (i + b)))
while True:
mid = (left + right) // 2
c_left = cost(left)
c_right = cost(right)
if left == mid or right == mid:
print(min(c_left, c_right))
break
elif c_left < c_right:
right = mid
else:
left = mid
|
p02631 | s072597555 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
start = a[0]
for i in range(1, n):
start = start ^ a[i]
ans = []
for i in range(n):
ans_i = start ^ a[i]
ans.append(str(ans_i))
print(' '.join(ans)) |
p02832 | s661556956 | Wrong Answer | n = int(input())
a = [int(x) - 1 for x in input().split()]
target, point = 0, 0
ans = 0
for i in range(n):
if a[i] == target:
ans += i - point
point = i + 1
target += 1
if target == 0:
print(-1)
else:
print(ans) |
p03221 | s398652147 | Accepted | N,M = map(int, input().split())
P = [list(map(int, input().split())) for m in range(M)]
C = (N+1)*[0]
D = {}
for p,y in sorted(P,key=lambda x: x[1]):
C[p]+= 1
D[y]="%06d%06d" % (p,C[p])
for p,y in P:
print(D[y]) |
p02601 | s251001186 | Wrong Answer | a, b, c = map(int, input().split())
k = int(input())
for i in range(k):
if a < b and b < c:
print("Yes")
exit()
elif a > b:
b *= 2
elif b > c:
c *= 2
if a < b and b < c:
print("Yes")
else:
print("No")
|
p02628 | s906427845 | Accepted | n, k = map(int, input().split())
p_list = list(map(int, input().split()))
ans = sorted(p_list)[:k]
print(sum(ans)) |
p03994 | s306210417 | Wrong Answer | s=input()
n=len(s)
a=[ord(i)-ord('a') for i in s]
k=int(input())
for i in range(n):
if a[i]+k>=26 and a[i]>0:
k-=26-a[i]
a[i]=0
k%=26
print(a)
a[-1]+=k
a=[chr(i + ord('a')) for i in a]
print(*a,sep="") |
p03795 | s957619970 | Accepted | n = int(input())
print(n*800 - (n//15)*200) |
p03371 | s672523281 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ans = float('inf')
for i in range(0, 2 * max(x, y)+1, 2):
if min((x - (i // 2)), (y - (i // 2))) < 0:
break
#合計費用
total = a * (x - (i // 2)) + b *(y - (i // 2)) + c * i
ans = min(ans, total)
print(ans) |
p03239 | s960041005 | Accepted | N,T=map(int, input().split())
c_list=[]
for i in range(N):
c,t=map(int, input().split())
if t<=T:
c_list.append(c)
if c_list==[]:
print("TLE")
else:
print(min(c_list))
|
p02618 | s564004163 | Accepted | d = int(input())
lc = list(map(int, input().split()))
for i in range(d):
ls = list(map(int, input().split()))
print(ls.index(max(ls))+1)
|
p03219 | s316396983 | Accepted | a,b=map(int,input().split())
print(a+b//2) |
p03723 | s951192349 | Accepted | a = list(map(int, input().split()))
if a[0] % 2 == 1 or a[1] % 2 == 1 or a[2] % 2 == 1:
print(0)
exit()
cnt = 0
for _ in range(1000):
for i in a:
if i % 2 == 1:
print(cnt)
exit()
a[0], a[1], a[2] = a[1] // 2 + a[2] // 2, a[0] // 2 + a[2] // 2, a[0] // 2 + a[1] // 2
cnt += 1
else:
print(-1) |
p02642 | s556951658 | Wrong Answer | import numpy as np
N=int(input())
alist=list(map(int, input().split()))
alist.sort()
#print(alist)
if alist.count(alist[0])==1:
ans=1
else:
ans=0
for i in range(1,N):
a=alist[i]
aaa=[a]*(i)
x=np.array(aaa)
y=np.array(alist[0:i])
amari=x%y
#print(x)
#print(y)
#print(amari)
if list(amari).count(0)==0:
ans+=1
print(ans)
|
p02759 | s310833058 | Accepted | N = int(input())
Num = int(N/2)
perseNum = N%2
if perseNum != 0:
print(Num+perseNum)
else:
print(Num) |
p03644 | s089250886 | Wrong Answer | if __name__ == '__main__':
a = int(input())
max =0
maxcount=0
for i in range(1,a+1):
s2 = i
count =0
while s2 >=2:
if s2 %2 == 0:
count+=1
s2 = s2//2
else:
break
if maxcount < count:
max = i
maxcount = count
print(max) |
p03377 | s562887094 | Accepted | a,b,x = map(int,input().split())
if b >= x - a >= 0:
print('YES')
else:
print('NO') |
p02630 | s354373123 | Accepted | N = int(input())
A = list(map(int,input().split()))
Q = int(input())
S = [list(map(int, input().split())) for l in range(Q)]
numList = {}
sum = 0
for n in range(N):
if A[n] not in numList:
numList[A[n]] = 0
numList[A[n]] += 1
sum += A[n]
for q in range(Q):
if S[q][0] in numList:
if S[q][1] not in numList:
numList[S[q][1]] = 0
sum += (S[q][1] - S[q][0]) * numList[S[q][0]]
numList[S[q][1]] += numList[S[q][0]]
numList[S[q][0]] = 0
print(sum) |
p03804 | s657875249 | Wrong Answer | N, M = map(int, input().split())
a = []
b = []
for i in range(N):
a.append(input())
c = 0
for i in range(M):
b.append(input())
for i in range(N-M+1):
for j in range(N-M+1):
for k in range(M):
if a[i+k][j:j+M] == b[k]:
c += 1
if c == M:
print("Yes")
break
print("No") |
p03814 | s216654513 | Wrong Answer | s = (input())
sa = s.find("a")
sz = int(s.rfind("z"))
print(sz-sa+1)
|
p02555 | s797783832 | Accepted | s = int(input())
mod = 10**9 + 7
dp = [0]*(s+1)
dp[0] = 1
x = 0
for i in range(1,s+1):
for j in range(0,(i-3)+1):
dp[i] += dp[j]
dp[i] %= mod
print(dp[s]) |
p03543 | s330223453 | Accepted | N = input()
l = list()
for a in N:
l.append(a)
if (l[0] == l[1] and l[1] == l[2]) or l[1] == l[2] and l[2] == l[3]:
print('Yes')
else:
print('No') |
p02712 | s086346400 | Wrong Answer | number = int(input())
for i in range(1, 1000000 + 1):
Total = []
if (i % 3 == 0) and (i % 5 ==0):
print('FizzBuzz')
elif i % 3 == 0:
print('Fizz')
elif i % 5 == 0:
print('Buzz')
else:
print(str(i))
print(sum(Total)) |
p03339 | s816826506 | Accepted | n = int(input())
s = input()
lie = [0] * (n+1)
liw = [0] * (n+1)
ans = 10**10
for i in range(n):
if s[i] == 'E':
lie[i+1] = lie[i] + 1
liw[i+1] = liw[i]
else:
lie[i+1] = lie[i]
liw[i+1] = liw[i] + 1
for i in range(n):
cnte = lie[-1] - lie[i+1]
cntw = liw[i]
ans = min(ans, cnte + cntw)
print(ans)
|
p03943 | s476615691 | Accepted | a, b, c = map(int,input().split())
ans = False
if a == b + c or b == a + c or c == a + b:
ans = True
if ans:
print("Yes")
else:
print("No") |
p03699 | s772444958 | Wrong Answer | import itertools
N=int(input())
A=[0]*N
for i in range(N):
A[i]=int(input())
m=sum(A)
if(m%10==0):
A=sorted(A)
for a in A:
if a%10!=0:
print(m-a)
exit()
else:
print(m)
|
p02628 | s538048279 | Wrong Answer | N,K= map(int,input().split())
A = list(map(int,input().split()))
B = [1001 for i in range(K)]
for x in A:
for i in range(K):
if x < B[i]:
B[i] = x
break
S = 0
for y in B:
S += y
print(S) |
p02957 | s380409363 | Accepted | a,b=map(int,input().split())
if abs(a+b)%2==0:
print(int(abs(a+b)/2))
else:
print("IMPOSSIBLE") |
p03319 | s562748051 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
if K == 1:
print(N - 1)
elif N == K:
print(1)
else:
if (N - K) % (K - 1) != 0:
print((N - K) // (K - 1) + 1)
else:
print((N - K) // (K - 1))
|
p03699 | s631213272 | Wrong Answer | n = int(input())
l = [int(input()) for i in range(n)]
#print(l)
if sum(l) % 10 != 0:
print(sum(l))
else:
l2 = sorted(l)
print(sum(l)-l2[0])
|
p03545 | s440684018 | Wrong Answer | a,b,c,d = list(input())
sign = '+-'
for i in range(2):
for j in range(2):
for k in range(2):
if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:
print(str(a+sign[i]+b+sign[j]+c+sign[k]+d) + '=7')
|
p02911 | s679215958 | Accepted | n, k, q = map(int, input().split())
ans_cnt = []
for i in range(n): ans_cnt.append(0)
for i in range(q):
answer = int(input())
ans_cnt[answer-1] += 1
for i in range(n):
had_point = k - (q-ans_cnt[i])
if had_point > 0: print('Yes')
else: print('No')
|
p02700 | s911491536 | Accepted | A, B, C, D = map(int, input().split())
while A > 0 or C > 0:
C -= B
if C <= 0:
print("Yes")
break
A -= D
if A <= 0:
print("No")
break |
p03221 | s678384745 | Accepted | N,M = map(int,input().split())
PY = [list(map(int,input().split())) for i in range(M)]
ans = [[0,0]]*(M)
prefectures = [[] for i in range(0,N+1,1)]
for i in range(M):
prefectures[PY[i][0]].append([PY[i][1],i])
for i in range(N+1):
prefectures[i].sort()
for i in range(N+1):
for j in range(len(prefectures[i])):
ans[prefectures[i][j][1]]=[i,j+1]
for i in range(M):
ans[i][0] = str(ans[i][0]).zfill(6)
ans[i][1] = str(ans[i][1]).zfill(6)
print("".join(ans[i]))
|
p03339 | s385718965 | Accepted | N = int(input())
S = list(input())
L = 0
R = S.count('E')
ans = L + R
for i in range(0, N):
if S[i] == 'E':
R -= 1
R = max(0, R)
ans = min(ans, L+R)
else:
L += 1
print(ans) |
p03086 | s158373087 | Accepted | S = input()
ret = 0
for i in range(len(S)):
for j in range(i, len(S)):
f = True
for k in S[i:j + 1]:
if k not in ("ACGT"):
f = False
break
if f:
ret = max(ret, (j + 1) - i)
print(ret) |
p03131 | s097761216 | Accepted | K, A, B = map(int, input().split())
rem = K-(A-1)
if rem>0:
if rem%2==0:
print(max(K+1, A+(B-A)*(rem//2)))
else:
print(max(K+1, A+(B-A)*(rem//2)+1))
else:
print(K+1) |
p02988 | s437881688 | Wrong Answer | n=int(input())
*p,=map(int,input().split())
c=0
for i in range(n-1):
c+=sorted(p[i:i+3])[1]==p[i+1]
print(c) |
p03106 | s816884045 | Accepted | A, B, K = [int(n) for n in input().split()]
x = []
for i in range(1, min(A, B)+1):
if A%i == 0 and B%i ==0:
x.insert(0, i)
print(x[K-1])
|
p02818 | s438847234 | Accepted | a,b,k = list(map(int,input().split(' ')))
"""takahashi has a
aoki has b
loop k
for _ in range(k):
if a >= 1:
a -= 1
elif b >= 1:
b -= 1
elif a == 0 and b == 0:
break
"""
if a <= k:
k -= a
a = 0
else:
a -= k
k = 0
#print('a,k',a,k)
if b <= k:
k -= b
b = 0
else:
b -=k
k = 0
#print('b,k',b,k)
print(a,b) |
p02552 | s857044447 | Wrong Answer | x=input()
if x==0:
print(1)
elif x==1:
print(0) |
p03645 | s581867060 | Wrong Answer | n,m = map(int,input().split())
c = [False for i in range(200000)]
d = [False for i in range(200000)]
for i in range(m):
a,b = map(int,input().split())
if a == 1:
c[b] == True
if b == n:
d[a] = True
for i in range(n):
if c[i] and d[i]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") |
p03951 | s718994342 | Wrong Answer | n = int(input())
s = input()
t = input()
if s == t: print(n)
else:
ans = n * 2
for i in range(n):
if s[-(i+1)] == t[i]: ans -= 1
else: break
print(ans) |
p02687 | s966379569 | Accepted | import sys
#import cython
def main():
read = lambda: sys.stdin.readline().rstrip()
#N: cython.longlong = 0
N = read()
print("ABC" if N[1]=="R" else "ARC")
if __name__ == "__main__":
main() |
p03127 | s734666047 | Accepted | import math
def computeGCD(x, y):
while(y):
x, y = y, x % y
return x
n=int(input())
a=list(map(int,input().split()))
ans=computeGCD(a[0],a[1])
for i in range(2,n):
ans=computeGCD(ans,a[i])
print(ans) |
p02731 | s049854745 | Wrong Answer | L=int(input())
ans=0
tmp=0
d=1
for i in range(L*d):
for j in range(L*d-i):
tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
ans=max(ans,tmp,0)
print(ans) |
p02973 | s054193167 | Wrong Answer | n=int(input())
color_list=[[] for _ in range(n+1)]
color_list[1].append(int(input()))
max_color=1
for i in range(n-1):
a=int(input())
max_index=0
max_number=0
for j in range(1,max_color+1):
if color_list[j][-1]<a:
if color_list[j][-1]>max_index:
max_index=j
max_number=color_list[j][-1]
if max_index==0:
max_color+=1
color_list[max_color].append(a)
else:
color_list[max_index].append(max_number)
print(max_color) |
p03817 | s906476919 | Accepted | # coding: utf-8
class Proc:
def __init__(self):
self.x = int(input().rstrip())
def get_ans(self):
if self.x <= 0:
return 0
if self.x <= 6:
return 1
if self.x <= 11:
return 2
ans = int(self.x / 11) * 2
self.x = self.x % 11
ans += self.get_ans()
return ans
print(Proc().get_ans())
|
p03282 | s528498838 | Wrong Answer | S = input()
K = int(input())
ans = 0
if S[0] == "1":
if K == 1:
print(1)
else:
if len(S) == 1:
print(1)
else:
print(S[1])
else:
print(S[0]) |
p02779 | s463041525 | Accepted | n = int(input())
a = list(map(int, input().split()))
ac = set(a)
if len(ac) == len(a):
print("YES")
else:
print("NO") |
p02677 | s388748547 | Accepted | import sys
sys.setrecursionlimit(100000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from math import radians,cos
def main():
a,b,H,M = map(int,input().split())
H *= 30
H += M/2
M *= 6
x = min(360-abs(H - M),abs(H-M))
x = radians(x)
ans = a*a + b*b - 2*a*b*cos(x)
print(ans**0.5)
if __name__ == '__main__':
main()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.