problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02623 | s344113025 | Wrong Answer | import bisect
N, M, K = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
arui = [0] * (N + 1)
brui = [0] * (M + 1)
for i in range(N):
arui[i + 1] = a[i] + arui[i]
for i in range(M):
brui[i + 1] = b[i] + brui[i]
ans = 0
for i in range(1, N + 1):
if arui[i] > K:
break
bcnt = M
while brui[bcnt] + arui[i] > K:
bcnt -= 1
ans = max(ans, i + bcnt)
print(ans) |
p03455 | s304892238 | Accepted | a, b = map(int,input().split())
print("Even" if a * b % 2 == 0 else "Odd")
|
p03011 | s382944090 | Accepted | p, q, r = map(int, input().split())
print(min(min(p+q, q+r), r+p)) |
p03699 | s086525192 | Accepted | n = int(input())
S = [0]*n
for i in range(n):
S[i] = int(input())
r = sum(S)
S.sort()
for i in range(n):
if r%10 != 0:
break
if r%10 == 0 and S[i]%10!=0:
r -= S[i]
break
if i==n-1:
r = 0
print(r) |
p02629 | s021556562 | Accepted | import sys
sys.setrecursionlimit(10 ** 9)
asc2en = lambda x: chr(x + 97)
N = int(input())
def rec(N):
if (N - 1) // 26:
return rec((N - 1) // 26) + asc2en((N - 1) % 26)
return asc2en((N - 1) % 26)
print(rec(N))
|
p03221 | s507941845 | Accepted | N,M = map(int,input().split())
PY = [[int(i) for i in input().split()]+[j] for j in range(M)]
dic = {}
PY.sort(key = lambda x:x[1])
ken = [0 for i in range(N)]
for k,value,s in PY:
ken[k-1] += 1
s1 = str(k).zfill(6)
s2 = str(ken[k-1])
s2 = s2.zfill(6)
dic[s] = s1+s2
ans = sorted(dic.items(),key=lambda x:x[0])
for i,j in ans:
print(j) |
p02598 | s615477331 | Accepted | n, k = map(int, input().split())
A = list(map(int, input().split()))
def judge(length):
cnt = 0
for a in A:
cnt += a // length
if a % length == 0: # ちょうど割り切れるときは切る回数が一回少なくて済む
cnt -= 1
return cnt <= k
ng, ok = 0, max(A)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if judge(mid):
ok = mid
else:
ng = mid
print(ok) |
p03494 | s022236439 | Accepted | N = int(input())
a = list(map(int, input().split()))
i = 0
odd = 0
while odd == 0:
for n in range(N):
if a[n] % 2 == 0:
a[n] /= 2
else:
odd = 1
break
if odd == 0:
i += 1
print(i) |
p02646 | s437984937 | Accepted | from sys import exit
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if w >= v:
print("NO")
exit()
time = abs(a - b) / (v - w)
if time > t:
print("NO")
else:
print("YES") |
p04043 | s725869987 | Accepted | As=input().split()
count5=0
count7=0
for A in As:
if A=="5":
count5+=1
elif A=="7":
count7+=1
if count5==2 and count7==1:
print("YES")
else:
print("NO")
|
p02594 | s356970751 | Wrong Answer | text=input('現在の気温')
if text.isdigit():
temperature=int(text)
if temperature<30:
print('No')
elif temperature>=30:
print('Yes') |
p02702 | s230876708 | Wrong Answer | s = input()
l = len(s)
ans = 0
for i in range(l):
for j in range(i+1, l+1):
a =int(s[i:j]) % 10**9+7
if a % 2019 % 10**9+7 == 0:
ans +=1
print(ans) |
p02687 | s303096677 | Accepted | S = input()
if S == "ARC":
print("ABC")
elif S =="ABC":
print("ARC")
|
p02661 | s950585062 | Accepted | N = int(input())
a_list = []
b_list = []
for i in range(N):
A, B = map(int, input().split())
a_list.append(A)
b_list.append(B)
a_list.sort()
b_list.sort()
a_m = a_list[N // 2 - 1] + a_list[N // 2] if N % 2 == 0 else a_list[(N + 1) // 2 - 1]
b_m = b_list[N // 2 - 1] + b_list[N // 2] if N % 2 == 0 else b_list[(N + 1) // 2 - 1]
a_m /= 2
b_m /= 2
print(int((b_m - a_m) / 0.5) + 1) |
p03030 | s475388186 | Accepted | n=int(input())
A = [list(map(str,input().split())) for i in range(n)]
A_s = sorted(A, key=lambda x: int(x[1]), reverse=True)
A_ss = sorted(A_s, key=lambda x: x[0], reverse=False)
for i in range(n):
print(A.index( A_ss[i])+1) |
p02582 | s265474820 | Accepted | def find(s):
ans=0
for i in s:
if i=="R":
ans+=1
elif i=="S" and ans>0:
return ans
return ans
s=input()
print(find(s)) |
p02767 | s421726379 | Accepted | N = int(input())
X = list(map(int, input().split()))
HP = set()
for p in range(100):
p += 1
A = 0
for i in range(N):
A += (X[i] - p)**2
HP.add(A)
print(min(HP)) |
p02829 | s458767388 | Accepted | a = int(input())
b = int(input())
ans = 0
if a == 1:
if b == 2:
ans = 3
else:
ans = 2
elif a == 2:
if b == 1:
ans = 3
else:
ans = 1
else:
if b == 1:
ans = 2
else:
ans = 1
print(ans) |
p03449 | s271657210 | Wrong Answer | n = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans = 0
for i in range(n):
ans = sum(A1[:i+1]) + sum(A2[i:])
print(ans) |
p03012 | s974449393 | Accepted | N = int(input())
W = [int(x) for x in input().split()]
sumW = sum(W)
s = 0
ans = 100 * N
for i in range(N):
s += W[i]
ans = min(ans, abs(sumW - 2 * s))
print(ans) |
p03944 | s656722596 | Accepted | W, H, N = map(int, input().split())
sum = W*H
X1 = [0]
X2 = [W]
Y1 = [0]
Y2 = [H]
for i in range(N):
x,y,a = map(int, input().split())
if a == 1:
X1.append(x)
elif a == 2:
X2.append(x)
elif a == 3:
Y1.append(y)
else:
Y2.append(y)
left = max(X1)
right = min(X2)
bottom = max(Y1)
top = min(Y2)
if left >= right or bottom >= top:
print(0)
else :
print((right-left)*(top-bottom)) |
p02916 | s948586413 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=[0]+list(map(int,input().split()))
c=[0]+list(map(int,input().split()))
cnt=0
before=0
for i in range(n):
cnt+=b[a[i]]
if a[i]==before+1:
cnt+=c[before]
before=a[i]
print(cnt) |
p03827 | s636974824 | Accepted | n = int(input())
s = input()
x = 0
maxVal = 0
for letter in s:
if letter == "D":
x -= 1
elif letter == "I":
x += 1
maxVal = max(x,maxVal)
print(maxVal) |
p03696 | s371235933 | Wrong Answer | n=int(input())
S=input()
L,R=0,0
l,r=0,0
for i in S:
if "(":l +=1
else:l -=1;L=min(L,l)
for i in S[::-1]:
if ")":r +=1
else:r -=1;R=min(R,r)
print("("*-L+S+")"*-R) |
p03487 | s107107883 | Wrong Answer | def Good_Sequence(n , al):
count = {}
ans = 0
for i in al:
if i in count:
count[i] += 1
else:
count[i] = 1
for i in count.keys():
key = int(i)
value = int(count[i])
if key != value:
ans += value if value < key else key - value
return ans
def main():
n = int(input())
al = list(map(int , input().split()))
print(Good_Sequence(n , al))
if __name__ == '__main__':
main()
|
p03910 | s104189193 | Accepted | N = int(input())
k = 1
while (k*(k+1))//2<N:
k += 1
A = [i for i in range(1,k+1)]
if N==(k*(k+1))//2:
for a in A:
print(a)
else:
m = (k*(k+1))//2-N
for a in A:
if a!=m:
print(a) |
p03338 | s123710479 | Accepted | N = int(input())
S = list(map(str, input().rstrip()))
ans = 0
for i in range(1, N):
ans = max(ans, len(set(S[:i]) & set(S[i:])))
print(ans) |
p03162 | s158427539 | Accepted | n = int(input())
A, B, C = [], [], []
for i in range(n):
a, b, c = map(int, input().split())
A.append(a); B.append(b); C.append(c)
dp = [[0] * 3 for _ in range(n+1)]
for i in range(n):
dp[i+1][0] = max(dp[i+1][0], max(dp[i][1], dp[i][2])+A[i])
dp[i+1][1] = max(dp[i+1][1], max(dp[i][0], dp[i][2])+B[i])
dp[i+1][2] = max(dp[i+1][2], max(dp[i][1], dp[i][0])+C[i])
print(max(dp[n])) |
p03324 | s218444628 | Wrong Answer | D,N = map(int,input().split())
if D==0 and N ==100:
ans = 100**D*N+1
else:
ans = 100**D*N
print(ans)
|
p03387 | s512155836 | Accepted | num = list(map(int, input().split()))
num.sort()
x = num[2] * 3 - sum(num)
if x%2 == 0:
ans = int(x/2)
else:
ans = int(x//2 + 2)
print(ans)
|
p02963 | s310592944 | Accepted | s = int(input())
a = (s-1)//10**9+1; b = 10**9-(s-1)%10**9-1
print(0, 0, 1, a, 10**9, b) |
p02556 | s512424751 | Wrong Answer | n=int(input())
x=[]
for i in range(n):
x.append(list(map(int, input().split())))
a=2*(10**9)
b=0
for j in range(n):
if sum(x[j])<a:
a=sum(x[j])
c=j
if sum(x[j])>b:
b=sum(x[j])
d=j
if c==d:
print(0)
else:
print(x[d][0]-x[c][0]+x[d][1]-x[c][1]) |
p02748 | s209941428 | Accepted | # coding: utf-8
# Your code here!
a,b,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
x=[0]*m
y=[0]*m
c=[0]*m
d=[]
for i in range(m):
x[i],y[i],c[i]=map(int,input().split())
d.append(a[x[i]-1]+b[y[i]-1]-c[i])
print(min(min(d),min(a)+min(b)))
|
p02742 | s231000598 | Accepted | h,w=map(int,input().split());print([0--h*w//2,1][h<2 or w<2]) |
p02995 | s633329958 | Accepted | a, b, c, d = map(int, input().split())
import fractions
#import math
from functools import reduce
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
#return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
l = lcm_base(c, d)
i = b//c-(a-1)//c
j = b//d-(a-1)//d
k = b//l-(a-1)//l
#print(i, j, k)
ans = b-a+1-(i+j-k)
print(ans)
|
p04031 | s424781376 | Accepted | N=int(input())
List = list(map(int, input().split()))
sumS = 0
for i in range(N):
sumS +=List[i]
trial = sumS // N
mid = 0
res = 10000000
for i in range(N):
trial += i
mid = 0
for j in range(N):
mid += (trial - List[j])**2
res = min(res, mid)
print(res) |
p02596 | s488110660 | Accepted | def resolve():
K = int(input())
N = 7
c = 1
for i in range(10**6):
if N % K == 0:
print(c)
break
else:
N = N * 10 + 7
N %= K
c += 1
else:
print(-1)
resolve() |
p03017 | s831210045 | Wrong Answer | N, A, B, C, D = map(int, input().split())
s = list(input())
flag = False
if C > D:
s[D-1] = '#'
s = ''.join(s)
if "..." in s[B-1:D]:
flag = True
else:
s = ''.join(s)
if "##" in s:
print("No")
else:
if not flag:
print("No")
else:
print("Yes") |
p03827 | s038445686 | Accepted | N = int(input())
S = input()
x = 0
m = 0
for i in range(N):
if S[i] == "I": x += 1
else: x -= 1
if m < x:
m = x
print(m) |
p02665 | s884978711 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
if a[0]:exit(print(-1))
b=[1]
for i in range(1,n+1):
b.append(b[-1]*2-a[i])
b[-1]=a[-1]
for i in range(n,0,-1):
b[i-1]=min(b[i-1],b[i])
b[i-1]+=a[i-1]
if not(b[i-1]-a[i-1]<=b[i]<=2*(b[i-1]-a[i-1])):exit(print(-1))
print(sum(b)) |
p02658 | s692550241 | Accepted | import sys
if __name__ == "__main__":
N = int(input())
P = list(map(int,input().split()))
if(0 in P):
print(0)
else:
P.sort()
mult = 1
for i in P:
mult *= i
if (mult > 10 ** 18):
print(-1)
sys.exit()
print(mult)
|
p03861 | s484936008 | Wrong Answer | #!/usr/bin/env python
import math
a, b, x = map(int, input().split())
if a%x == 0:
if b%x == 0:
if b//x - a//x != 0:
ans = b//x - a//x + 1
print(ans)
exit()
else:
ans = b//x - a//x
print(ans)
exit()
ans = b//x - a//x
print(ans)
|
p02712 | s837842030 | Accepted | N = int(input())
sum = 0
for i in range(N+1):
if i % 15 == 0:
pass
elif i % 3 == 0:
pass
elif i % 5 == 0:
pass
else:
sum = sum + i
print(sum) |
p02730 | s760657047 | Accepted | s = input()
s1 = s[:len(s)//2]
s2 = s[len(s)//2+1:]
print("Yes" if s==s[::-1] and s1==s1[::-1] and s2==s2[::-1] else "No") |
p03067 | s388519880 | Wrong Answer | #Tenka1 Programmer Beginner Contest 2019 a
a,b,c=map(int,input().split())
if a<c and c<b:
print("Yes")
else:
print("No") |
p03994 | s529874768 | Wrong Answer | def main():
S = input()
k = int(input())
ans = []
for s in S:
if (r := 123 - ord(s)) <= k:
ans.append('a')
k -= r
else:
ans.append(s)
if k > 0:
k %= 26
ans[-1] = chr(a if (a := ord(ans[-1]) + k) <= 122 else a - 26)
print(''.join(ans))
if __name__ == '__main__':
main()
|
p03206 | s599725164 | Wrong Answer | d=int(input())
print("Christmas"+"Eve"*(25-d))
|
p03475 | s353566000 | Wrong Answer | N = int(input())
CSF = [list(map(int, input().split())) for _ in range(N - 1)]
for i in range(N):
t = 0
for c, s, f in CSF[i:]:
# 待ち時間
if t < s:
t = s
else:
t = ((t - s) // f) * f + s
# i -> i+1に移動
t += c
print(t) |
p03417 | s661620895 | Accepted | N, M = map(int,input().split())
if N>1 and M>1:
print(N*M-(N*2 + (M-2)*2))
elif N==1 and M>1:
print(N*M-2)
elif M==1 and N>1:
print(N*M-2)
else:
print(1) |
p02570 | s578885204 | Accepted | d,t,s=map(int,input().split())
if s*t>=d:
print("Yes")
else:
print("No")
|
p02612 | s008001308 | Wrong Answer | N = int(input())
print(1000 - (N % 1000)) |
p03324 | s095437730 | Accepted | D,N=list(map(int,input().split()))
if D==0:
if N==100:
print(101)
exit()
print(N)
elif D==1:
if N==100:
print(100*101)
exit()
print(100*N)
else:
if N==100:
print(100*100*101)
exit()
print(100*100*N) |
p02732 | s246866185 | Accepted | s = input()
n=int(s[0])
s = input().split()
d={}
dc={}
summ=0
for i in s:
if i not in d:
d[i]=1
else:
d[i]+=1
for i in d:
n = d[i]
if n>1:
e=n*(n-1)/2
summ+=e
dc[i]=e
else:
dc[i]=0
for i in s:
n = d[i]-1
e = n*(n-1)/2
print(int(summ-dc[i]+e))
|
p02973 | s768514446 | Accepted | n = int(raw_input())
ais = [int(raw_input()) for _ in range(n)]
tails = []
import bisect
for a in ais:
if not(tails) or (tails[-1] >= a):
tails.append(a)
else:
# maintain a decreaing tails
986643321
lo,hi = 0, len(tails) - 1
while(lo<hi):
med= (lo + hi)/2
if tails[med] < a:
hi = med
else:
lo = med + 1
tails[lo] = a
print len(tails) |
p02790 | s398688022 | Wrong Answer | a, b = map(str, input().split())
anser = ""
if a > b:
for i in range(0, int(a) + 1):
anser = b * i
if a == b:
for i in range(0, int(a) + 1):
anser = b * i
if a < b:
for i in range(0, int(b) + 1):
anser = b * i
print(anser) |
p03206 | s155451221 | Wrong Answer | d = int(input())
print('christmas' + ' Eve' * (25 - d)) |
p04012 | s223243977 | Accepted | def main():
w = input()
A = [0]*26
for char in w:
A[ord(char) - ord('a')] += 1
for a in A:
if a%2 != 0:
print("No")
return
print("Yes")
return
main() |
p02861 | s540994618 | Accepted | n = int(input())
towns = []
total = 0
for i in range(n):
town = list(map(int,input().split()))
towns.append(town)
for i in range(n):
for j in range(n):
total += ((towns[i][0] - towns[j][0])**2 + (towns[i][1] - towns[j][1])**2)**(1/2) / n
print(total)
|
p03548 | s990028039 | Accepted | X, Y, Z = map(int, input().split())
mylist=[]
for i in range(X):
if (Y*i)+(Z*(i+1)) <= X:
mylist.append(1)
else:
pass
print(len(mylist)-1) |
p02624 | s544198027 | Wrong Answer | n=int(input())
ans=0
lastk=n
for i in range(1,n+1):
k=n//i
if i>k:
break
ans+=k*(k+1)//2*i
ans+=i*(i-1)//2*(lastk+k+1)*(lastk-k)//2
lastk=k
print(ans)
|
p03219 | s162569101 | Wrong Answer | X,Y = map(int,input().split())
print(X + Y/2) |
p03804 | s308354406 | Accepted | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
ans = 'No'
for i in range(N-M+1):
for j in range(N-M+1):
C = [A[k][i:i+M] for k in range(j, j+M)]
if B == C:
ans = 'Yes'
print(ans) |
p03254 | s407598244 | Accepted | N, x = [int(i) for i in input().split(" ")]
lst = [int(i) for i in input().split(" ")]
lst.sort()
cnt = 0
for i in range(0,N-1):
if x >= lst[i]:
x -= lst[i]
cnt += 1
else:
break
if x == lst[N-1]:
cnt +=1
print(cnt) |
p02989 | s153037360 | Accepted | n = int(input())
d = list(map(int,input().split()))
d.sort()
if d[int(n/2)] == d[int(n/2)-1]:
ans = 0
else:
ans = d[int(n/2)] - d[int(n/2)-1]
print(ans) |
p03087 | s175114674 | Accepted | N, Q = map(int, input().split())
S = input()
ans = [0] * N
for i in range(N-1):
if S[i] == "A" and S[i+1] == "C":
ans[i+1] += (ans[i] + 1)
else:
ans[i+1] = ans[i]
for _ in range(Q):
l, r = map(int, input().split())
print(ans[r-1] - ans[l-1]) |
p03352 | s785980973 | Wrong Answer | x = int(input())
ans = 0
for i in range(1,x+1):
for j in range(2,int(i**0.5)+2):
if i**(1/j) % 1 == 0:
ans = i
print(ans) |
p03672 | s945007200 | Accepted | S=input()
S2=S[:(len(S))//2]
while len(S)>=2:
S=S[:-2]
S2=S2[:-1]
if S==S2+S2:
print(len(S))
exit()
|
p03109 | s806905401 | Accepted | S = input()
now = int(S[5:7]+S[8:10])
if now <= 430:
print("Heisei")
else:
print("TBD")
|
p02548 | s466495701 | Wrong Answer | n = int(input())
ans = 0
for a in range(1,int(n**(1/2))):
tmp = 0
if n%a == 0:
tmp += ((n//a)-1-a)*2
tmp += 1
else:
tmp += (n//a-a)*2
tmp += 1
#print(tmp)
ans += tmp
print(ans)
|
p02711 | s289262021 | Accepted | N = input()
if '7' in N:
print('Yes')
else:
print('No') |
p03986 | s363242912 | Wrong Answer | s=input()
ans=0
a=0
b=0
for i in range(len(s)):
if s[i]=="T":
a+=1
else:
break
for i in range(len(s)):
if s[-i-1]=="S":
b+=1
else:
break
print(a+b) |
p02641 | s731804150 | Wrong Answer | import sys
(x, n) = list(map(int, input().split()))
arr = list(map(int, input().split()))
if(len(arr) == 0):
print(x)
sys.exit()
if(x in arr):
print(x)
sys.exit()
i = 1
while True:
if(not (x - i in arr)):
print(x - i)
sys.exit()
if(not (x + i in arr)):
print(x + i)
sys.exit()
i += 1
|
p03339 | s589427606 | Accepted | from itertools import accumulate
from operator import add
N = int(input())
S = input()
E = list(accumulate("E"==s for s in "W"+S[:0:-1]))[::-1]
W = list(accumulate("W"==s for s in "E"+S[:-1]))
print(min(map(add, E, W))) |
p03852 | s744182968 | Wrong Answer | def resolve():
s = input()
w = ['dream', 'dreamer', 'erase', 'eraser']
h = dict()
for i in range(len(w)):
h[w[i][::-1]] = True
s = s[::-1]
c = ''
for i in s:
c += i
if h.get(c):
c = ''
if not len(c):
print('YES')
else:
print('NO')
resolve() |
p03760 | s227883294 | Accepted | o = input()
e = input()
x = []
o = list(o)
e = list(e)
for i in range(0,max(len(o),len(e))):
#print(x)
if(len(o) != 0 and len(e) != 0):
x.append(o[0])
del o[0]
x.append(e[0])
del e[0]
elif(len(o) != 0 and len(e) == 0):
x.append(o[0])
del o[0]
elif(len(o) == 0 and len(e) != 0):
x.append(e[0])
del e[0]
print(''.join(x))
|
p02660 | s112330520 | Wrong Answer | import math
N = int(input())
num_list = [0] + [0] * int(math.sqrt(N)) # 0~N
pn_list = []
for i in range(2, int(math.sqrt(N))+1):
if num_list[i] == 0:
pn_list.append(i)
num_list[i::i] = [1] * len(num_list[i::i])
count = 0
for pn in pn_list:
e = 1
while N%(pn**e)==0 and N//(pn**e)>=1:
N //= (pn**e)
e += 1
count += 1
print(count) |
p03719 | s346705948 | Accepted | a, b, c = map(int, input().split())
if (c >= a) and (c <= b):
print('Yes')
else:
print('No')
|
p03067 | s974311271 | Accepted | a, b, c = map(int, input().split())
if((a < c < b) or b < c < a):
print("Yes")
else:
print("No") |
p03721 | s330191523 | Accepted | from collections import defaultdict
import sys
buf = sys.stdin.buffer
def main():
n, k = map(int, buf.readline().split())
AB = map(int, buf.read().split())
count = defaultdict(int)
for a, b in zip(AB, AB):
count[a] += b
idx = 0
for num in sorted(count.keys()):
idx += count[num]
if idx >= k:
print(num)
break
if __name__ == "__main__":
main()
|
p03146 | s319659100 | Wrong Answer | s = int(input())
A = [s]
ans = 1
while True:
ans = +1
s = (s/2 if s%2==0 else 3*s+1)
if s in A:
break
A.append(s)
print(ans+1) |
p02645 | s877371759 | Accepted | s = input()
print(s[:3]) |
p03774 | s989705521 | Accepted | n, m = map(int, input().split())
stu = []
for i in range(n):
stu.append(list(map(int, input().split())))
chk = []
for i in range(m):
chk.append(list(map(int, input().split())))
for i in range(n):
near = 10**10
for j in range(m):
mht = abs(stu[i][0]-chk[j][0])+abs(stu[i][1]-chk[j][1])
if near > mht:
near = mht
idx = j
print(idx+1)
|
p03061 | s464576225 | Accepted | import fractions
n = int(input())
l = list(map(int,input().split()))
left = []
right = []
left.append(1)
right.append(1)
left.append(l[0])
right.append(l[-1])
le = l[0]
ri = l[-1]
for i in range(1,n-1):
le = fractions.gcd(le,l[i])
left.append(le)
ri = fractions.gcd(ri,l[-i-1])
right.append(ri)
m = []
for i in range(1,n-1):
m.append(fractions.gcd(left[i],right[-i-1]))
m.append(left[-1])
m.append(right[-1])
print(max(m))
|
p02723 | s769594014 | Wrong Answer | S = str(input())
if S[2] == S[3] and S[4] == S[5]:
print('Yes')
else:
print('no')
|
p03611 | s128709840 | Accepted | N = int(input())
a = [int(x) for x in input().split()]
memo = [0]*(10**5+2)
ans = 1
for i in range(N):
memo[a[i]] += 1
memo[a[i]+1] += 1
memo[a[i]-1] += 1
print(max(memo))
|
p02718 | s409665700 | Accepted | def resolve():
N, M = map(int, input().split())
arr = sorted(list(map(int, input().split())), reverse=True)
s = sum(arr)
th = s / 4 / M
ans = 'Yes'
for i in range(M):
if arr[i] < th:
ans = 'No'
break
print(ans)
resolve() |
p03086 | s082302745 | Wrong Answer | s = input().strip()
ans = 0
tmp = 0
for _, x in enumerate(s):
if x == "A" or x == "C" or x == "G" or x == "T":
tmp += 1
else:
ans = max(ans, tmp)
tmp = 0
print(ans)
|
p02676 | s501212550 | Accepted | K = int(input())
S = input()
if len(S)<=K:
print(S)
else:
s_list = list(S)[0:K]
print("".join(s_list)+"...") |
p03680 | s532890134 | Accepted | #!/usr/bin/env python3
N = int(input())
a = [int(input()) for i in range(N)]
x = 1
ans = 0
for i in range(N):
ans += 1
x = a[x - 1]
if x == 2:
print(ans)
exit()
print(-1)
|
p03759 | s995664888 | Wrong Answer | a, b, c = map(int, input().split())
print('YES' if b - a and c - b else 'NO') |
p02882 | s928220521 | Wrong Answer | a,b,x = map(int, input().split())
import math
if x==a*a*b:
print(0)
exit()
if x > (a*a*b)/2:
theta = math.atan((a*b*b)/(2*(a*a*b - x)))
else:
theta = math.atan((2*x) / (a*b*b))
print(90-math.degrees(theta)) |
p03345 | s334253619 | Accepted | a, b, c, k=map(int, input().split())
sub=a-b
if k%2==1:
sub*=-1
print(sub)
|
p04030 | s767506891 | Accepted | ans = []
for c in input():
if c == "B":
if len(ans) > 0:
ans.pop()
else:
ans.append(c)
print("".join(ans))
|
p02970 | s225914435 | Accepted | n, d = map(int, input().split())
if n % (2 * d + 1) == 0:
print(n // (2 * d + 1))
else:
print(n // (2 * d + 1) + 1) |
p02823 | s149865446 | Accepted | n,a,b = map(int, input().split())
if abs(a-b)%2 == 0: print((b-a)//2)
else: print(min(a-1, n-b) + 1 + (b-a-1)//2) |
p03693 | s156002208 | Accepted | r, g, b = list(map(str, input().split()))
if int(r + g + b) % 4 == 0:
print('YES')
else:
print('NO') |
p02717 | s635599254 | Accepted | str1 = list(map(int, input().split()))
print(str1[2], str1[0], str1[1])
|
p03456 | s639688630 | Wrong Answer | a = int(input().replace(" ", ""))
for i in range(1,201):
if i * i == a:
print("Yes")
break
else:
print("No")
|
p02765 | s327498899 | Accepted | N, R = map(int, input().split())
if N >= 10:
print(R)
else:
print(R+(100*(10-N))) |
p02601 | s395713631 | Accepted | A,B,C = map(int,input().split())
K = int(input())
# a < b < c
c = 0
while A >= B:
B *= 2
c += 1
while B >= C:
C *= 2
c += 1
print('Yes' if c <= K else 'No') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.