problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02766 | s531618629 | Wrong Answer | n,k = map(int, input().split())
for i in range(1,10):
if n <= k ** i - 1:
print(i)
break |
p03469 | s108292378 | Accepted | print('2018'+input()[4:]) |
p02888 | s954514931 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N):
right = i + 2
for left in range(i+1, N):
while right < N and L[right] < L[i] + L[left]:
right += 1
ans +=... |
p02684 | s730607980 | Accepted | n, k = map( int, input().split() )
a = [ 0 ] + list( map( int, input().split() ) )
now = 1
visited = [ 1, -1 ] + [ -1 ] * ( n - 1 )
diary = [ -1, 0 ] + [ -1 ] * ( n - 1 )
for i in range( 1, k+1 ):
now = a[ now ]
visited[ i ] = now
if diary[ now ] != -1:
cycle = i - diary[ now ]
d = ( k - i... |
p03637 | s038750963 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
l=[0]*N
for i in range(N):
if a[i]%4:
if a[i]%2:l[i]=1
else:l[i]=2
else:l[i]=4
print('Yes'if(l.count(1)+(l.count(2)%2)+1)//2<=l.count(4)else'No') |
p02699 | s675363869 | Accepted | S, W = list(map(int, input().split()))
ans = "unsafe"
if S > W:
ans = "safe"
print(ans) |
p03282 | s928722646 | Accepted | s = input()
k = int(input())
n = len(s)
cnt = 0
for i in range(n):
if s[i] !="1":
break
cnt+=1
if k<=cnt:
print(1)
else:
print(s[cnt])
|
p02748 | s928436312 | Accepted | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 200000
for i in range(M):
x, y, c = map(int, input().split())
ans = min(ans, a[x-1] + b[y-1] - c)
ans = min(ans, min(a) + min(b))
print(ans)
|
p03821 | s710109225 | Accepted | N = int(input())
X = [tuple(map(int, input().split())) for _ in range(N)]
X = reversed(X)
ans = 0
for a, b in X:
a += ans
if a % b == 0:
continue
ans += b - a % b
print(ans)
|
p02658 | s366532580 | Wrong Answer | N = int(input())
An_all = input().split()
An = []
for i in range(N):
An.append(int(An_all[i]))
mult = 1
for i in range(N):
mult = mult * An[i]
if mult >= 10e18:
print(-1)
else:
print(mult) |
p02797 | s911886822 | Accepted | N,K,S = map(int,input().split())
pad = [10**9,10**9-1][(S == 10**9)]
l = ([S]*K)
l.extend([pad]*(N-K))
print(" ".join(map(str,l)))
|
p03162 | s603547674 | Accepted | N = int(input())
H = []
for _ in range(N):
h = tuple(map(int, input().split()))
H.append(h)
dp = [H[0]]
for i in range(1, N):
dp.append([
max(dp[i-1][1] + H[i][0], dp[i-1][2] + H[i][0]),
max(dp[i-1][0] + H[i][1], dp[i-1][2] + H[i][1]),
max(dp[i-1][0] + H[i][2], dp[i-1][1] + H[i][2])... |
p02832 | s062212640 | Accepted | n = int(input())
nums = list(map(int, input().split()))
l = [int(x) for x in range(1, n + 1)]
remain = [0]
count = 0
for i in nums:
if i == remain[-1] + 1:
remain.append(i)
else:
count += 1
if nums == l:
print(0)
elif (count > 0) and (count != n):
print(count)
else:
print(-1) |
p03705 | s124668179 | Wrong Answer | N,A,B=map(int,input().split())
if A<B:
print(0)
if N==1 and A!=B:
print(0)
else:
print((N-2)*(B-A)+1) |
p02702 | s586600896 | Wrong Answer | s = input()
n = len(s)
A = []
for i in range(100):
A.append(str(2019*i))
ans = 0
for a in A:
for i in range(n):
if i+len(a) <= n:
if a == s[i:i+len(a)]:
ans += 1
print(ans)
|
p02714 | s885527103 | Accepted | from collections import Counter
N = int(input())
S = input()
rgb_cnt = Counter(S)
ans = rgb_cnt["R"] * rgb_cnt["G"] * rgb_cnt["B"]
for i in range(1,N-1):
max_dist = min(i,N-i-1)
m = S[i]
for d in range(1,max_dist+1): # 中心からの距離
l = S[i-d]
r = S[i+d]
if (l!=m and r!=m and l!= r):
... |
p02783 | s758627323 | Wrong Answer | a,b=input().split()
a=int(a)
b=int(b)
if a%b==0:
print(a/b)
else:
print(int(a/b)+1) |
p03339 | s799825065 | Wrong Answer | n=int(input())
s=input()
ans=s.count('E')
pin=ans
for i in range(1,n):
if s[i-1]=='W':
pin+=1
if s[i]=='E':
pin-=1
ans=min(ans,pin)
print(ans) |
p02911 | s011847019 | Accepted | """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, Q, *A = map(int, read().split())
point = [K - Q] * (N + 1)
for i in A:
point[i] += 1
ans = '\n'.join('Yes' if i > 0 else ... |
p02694 | s273700999 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
import math
X = int(input())
ans = False
money = 100
year = 0
while money < X:
money += money // 100
year += 1
print(year)
|
p03779 | s338783001 | Accepted | import numpy as np
import bisect
X = int(input())
A = np.cumsum(range(1, 10 ** 5))
idx = bisect.bisect_left(A, X)
print(idx + 1) |
p04020 | s470358515 | Accepted | def main():
N = int(input())
A = [int(input()) for i in range(N)]
ans = 0
for i in range(N):
ans += A[i]//2
A[i] %= 2
if i < N - 1 and A[i] > 0 and A[i+1] > 0:
ans += 1
A[i] -= 1
A[i+1] -= 1
print(ans)
if __name__ == '__main__':
main(... |
p02753 | s710636090 | Wrong Answer | stations = str(input())
bus = False
for i in range(0, len(stations)-2):
if(stations[i] != stations[i+1]):
bus = True
if(bus):
print('Yes')
else:
print('No') |
p03472 | s261984969 | Wrong Answer | import sys
input = sys.stdin.readline
n, h = map(int, input().split())
ab = []
for i in range(n):
a, b = map(int, input().split())
ab.append((-a, b, i))
ab.sort()
index = ab[0][2]
ab2 = ab[:]
ab2.sort(key = lambda x:x[1], reverse = True)
cnt = 0
for a, b ,i in ab2:
if h <= 0:
print(cnt)
sys.exit()
... |
p03000 | s399935867 | Accepted | #ABC 130B
n, x = map(int, input().split())
l = list(map(int, input().split()))
d = 0
cnt = 1
for i in l:
d += i
if d <= x:
cnt += 1
print(cnt) |
p02838 | s576531912 | Accepted | n=int(input())
mod=10**9+7
a=list(map(int,input().split()))
ans=0
for i in range(60):
ichi=0
for j in range(n):
if (a[j]>>i)&1:
ichi+=1
zero=n-ichi
s=ichi*zero*pow(2,i,mod)%mod# xorをしたあとi桁目が1になる組み合わせの個数 x 2**i
ans+=s
ans%=mod
print(ans)
|
p02860 | s806431000 | Wrong Answer | N= int(input())
flag = False
for i in range(1,10):
for j in range(1,10):
A=i*j
if(A==N):
flag=True
break
if flag: break
if flag:print("Yes")
else:print("No") |
p03815 | s414426157 | Wrong Answer | import math
def main():
x = int(input())
if(x>6):
res = 1
if(x%11<=6):
a = math.ceil((x+5)/11)
b = a-1
print(a+b)
else:
a=math.ceil((x)/11)
b=a
print(a+a)
if __name__ == '__main__':
main()
|
p02689 | s986212034 | Accepted |
N, M = map(int, input().split())
H = list(map(int, input().split()))
S = [True]*N
for _ in range(M):
a, b = map(int, input().split())
if H[a-1] == H[b-1]:
S[b-1] = False
S[a-1] = False
elif H[a-1] > H[b-1]:
S[b-1] = False
else:
S[a-1] = False
print(sum(S)) |
p02718 | s893573845 | Accepted | N,M = map(int,input().split())
A = list(map(int,input().split()))
total = 0
for i in A:
if i >= (sum(A) / (4 * M)):
total = total + 1
if total >= M:
print("Yes")
else:
print('No') |
p02793 | s026481088 | Wrong Answer | import fractions
from functools import reduce
mod = 10**9 + 7
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y) % mod
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
n = int(input())
a = list(map(int, input().split()))
a_ = []
for i in range(n):
a_.append(pow(a[i], mod - 2, mod))
num_lcm... |
p02571 | s718829960 | Accepted | s =list(input())
t=list(input())
ans=[]
for i in range(len(s)-len(t)+1):
check=0
s_check=s[i:i+len(t)]
for k in range(len(s_check)):
if s_check[k]==t[k]:
check+=1
ans.append(check)
print(len(t)-max(ans)) |
p03524 | s245067079 | Accepted | S = input()
maxi = max(S.count("a"), S.count("b"), S.count("c"))
mini = min(S.count("a"), S.count("b"), S.count("c"))
mid = len(S)-maxi-mini
if maxi == mid and mid == mini:
print("YES")
elif maxi == mid + 1 and mid == mini:
print("YES")
elif maxi == mid and mid == mini + 1:
print("YES")
else:
print("NO"... |
p02547 | s841357202 | Wrong Answer | n = int(input())
cnt = 0
flg = 0
for i in range(n):
a, b = map(int, input().split())
if a == b:
cnt += 1
if cnt >= 3:
flg = 1
else:
cnt = 0
print(cnt)
print(flg)
if flg == 1:
print("Yes")
else:
print("No")
|
p03565 | s792108399 | Wrong Answer | s = input()
t = input()
s_long = len(s)
t_long = len(t)
ok = []
for i in range(s_long - t_long+1):
part_s = s[i:i+t_long]
check = True
for j in range(t_long):
if part_s[j] != "?" and part_s[j] != t[j]:
check = False
if check == True:
ok.append(i)
if len(ok) == 0:
print("UNRESTORABLE")
else:
... |
p03474 | s643410387 | Accepted | A, B = map(int, input().split())
S = input()
for i in range(A+B+1):
if S[A] == '-':
if S[:A].isdecimal() == True and S[A+1:].isdecimal() == True:
print('Yes')
break
else:
print('No') |
p02705 | s536291030 | Wrong Answer | import math
R = int(input())
ans = R*R*math.pi
print(ans) |
p02873 | s592104546 | Accepted | s = input()
n = len(s)
a1 = [0] * (n+1) # 左側に連続する<の個数
a2 = [0] * (n+1) # 右側に連続する>の個数
tmp1 = 0
tmp2 = 0
for i in range(n):
if s[i] == "<": tmp1 += 1
else: tmp1 = 0
if s[n-i-1] == ">": tmp2 += 1
else: tmp2 = 0
a1[i+1] = tmp1
a2[n-i-1] = tmp2
ans = 0
for i in range(n+1):
ans += max(a1[i], a2[i]... |
p03417 | s579701940 | Accepted | n, m = map(int, input().split())
n, m = min(n, m), max(n, m)
if n == 1:
if m == 1:
print(1)
else:
print(m - 2)
else:
print((n - 2) * (m - 2))
|
p02684 | s358682117 | Accepted | n,k,*a=map(int,open(0).read().split())
d=[2*k]*n
s=0
while k:s=a[s]-1;d[s]=k=~-k%(d[s]+1-k)
print(s+1) |
p02584 | s511805000 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
a = int(X/D)
ans = 0
if a>=K:
ans = X-(D*K)
else:
if K%2==0:
if a%2==0: ans = X-(D*a)
else: ans = X-(D*a)-D
else:
if a%2==0: ans = X-(D*a)-D
else: ans = X-(D*a)
ans = int(abs(ans))
print(ans)
|
p02835 | s004328749 | Wrong Answer | p = list(map(int, input().split()))
if sum(p) >= 22:
print('bust')
else:
print('Win')
|
p02994 | s560839750 | Wrong Answer | n,l=map(int,input().split())
r=l+n-1
m=r if r<0 else l
s=(l+r)*n//2
print(s if l*r<0 else s-m) |
p02861 | s254276927 | Accepted | from math import sqrt
N = int(input())
pts = []
for i in range(N):
x,y = map(int,input().split())
pts.append((x,y))
def fact(n):
if n == 1:
return 1
return fact(n-1)*n
ans = 0
for i in range(N):
for j in range(N):
x1,y1 = pts[i]
x2,y2 = pts[j]
dx = x1-x2
dy = ... |
p02630 | s590460836 | Accepted | n=int(input())
a = list(map(int, input().split()))
q=int(input())
bc = [list(map(int, input().split())) for i in range(q)]
memo=[0]*100001
ans=0
for i in range(n):
ans+=a[i]
memo[a[i]-1]+=1
for i in range(q):
memo[bc[i][1]-1]+=memo[bc[i][0]-1]
ans+=memo[bc[i][0]-1]*(bc[i][1]-bc[i][0])
memo[bc[i][0]-... |
p03481 | s579302944 | Wrong Answer | import math
x,y = map(int,input().split())
n = math.floor(math.log2(y)-math.log2(x))+1
print(n) |
p03417 | s374851537 | Accepted | N, M = map(int, input().split())
if N == 1 and M == 1:
print(1)
elif N == 1 and M != 1:
print(M - 2)
elif M == 1 and N != 1:
print(N - 2)
else:
print((N - 2) * (M - 2))
|
p03435 | s957640996 | Accepted | import sys
c = [list(map(int, input().split())) for _ in range(3)]
# a1 = 0と仮定
b = []
a = [0]
for i in range(3):
b.append(c[0][i])
for i in range(3):
if i == 0:
continue
else:
a.append(c[i][i] - b[i])
for i in range(3):
for j in range(3):
if c[i][j] != a[i] + b[j]:
... |
p03723 | s379255134 | Wrong Answer | a,b,c=map(int,input().split())
e=a-b|b-c
print(len(f'{e&-e:b}')-(e==b&1)) |
p02744 | s674683920 | Accepted | import sys
sys.setrecursionlimit(10**9)
N = int(input())
def bfs(s, cnt, m):
if cnt == N:
print(s)
return
for i in range(97,ord(m)+2):
if chr(i) > m:
bfs(s+chr(i), cnt+1, chr(i))
else:
bfs(s+chr(i), cnt+1, m)
bfs('a',1,'a') |
p03457 | s362606799 | Accepted | # 最高で進んでもtを超えることはできない
# 1ターンにつき1進むので偶奇をみる
n = int(input())
pre = [0, 0, 0] # time, x, y
for i in range(n):
t, x, y = map(int, input().split())
t -= pre[0]
x -= pre[1]
y -= pre[2]
if t < abs(x) + abs(y) or (abs(x) + abs(y)) % 2 != t % 2:
print("No")
exit()
pre = [t, x, y]
print(... |
p03998 | s173936190 | Accepted | s=[input() for i in range(3)]
l=[len(s[i]) for i in range(3)]
abc=[0,0,0]
now=0
while abc[now]!=l[now]:
s_sub=s[now][abc[now]]
abc[now]+=1
now=(0 if s_sub=="a" else 1 if s_sub=="b" else 2)
print("A" if now==0 else "B" if now==1 else "C") |
p02795 | s017202186 | Accepted | def main():
H = int(input())
W = int(input())
N = int(input())
ans = 0
h, w = 0, 0
while True:
if H >= W and h != H:
N -= H
h += 1
elif w != W:
N -= W
w += 1
ans += 1
if N <= 0:
print(ans)... |
p02576 | s740718035 | Accepted | n,x,t=map(int,input().split())
tt=((n-1)//x+1)*t
print(tt)
|
p03721 | s938548906 | Accepted | n,k=map(int,input().split())
d={}
for _ in range(n):
a_i,b_i=map(int,input().split())
if a_i in d:
d[a_i]+=b_i
else:
d[a_i]=b_i
a=[]
b=[]
d=sorted(d.items(),key=lambda x: x[0])
prev=0
for key,value in d:
a.append(key)
b.append(prev+value)
prev+=value
for j in range(len(b... |
p02676 | s698189686 | Accepted | K = int(input())
S = input()
if len(S) <= K:
print(S)
else:
print(S[:K] + "...") |
p02577 | s274896419 | Accepted | n=int(input())
result= sum(list(map(int, str(n))))
if result % 9==0:
print("Yes")
else:
print("No") |
p03469 | s517055623 | Wrong Answer | S = list(input())
S[3] = "8"
print(S) |
p03095 | s333738387 | Wrong Answer | from collections import Counter
n = int(input())
s = str(input())
d = Counter(s)
S = list(set(s))
ans = 1
for t in S:
ans *= d[t] + 1
print(ans - 1)
|
p03360 | s230276264 | Accepted | a = list(map(int,input().split()))
k = int(input())
a.sort(reverse = True)
a[0] = a[0] * (2 ** k)
print(sum(a)) |
p02701 | s930083760 | Accepted | n=int(input())
st=set()
for _ in range(n):
st.add(input())
print(len(st)) |
p02630 | s567668613 | Accepted | N = int(input())
A = list(map(int, input().split()))
ma = [0] * (100000 + 1)
for i in range(N):
ma[A[i]] += 1
Q = int(input())
s = sum(A)
for i in range(Q):
b, c = map(int, input().split())
diff = c * ma[b] - ma[b] * b
ma[c] += ma[b]
ma[b] = 0
s += diff
print(s)
|
p02699 | s201838266 | Wrong Answer | import sys,math,copy,queue,itertools,bisect,collections
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))
S,W = L... |
p02786 | s463776948 | Accepted | h=int(input())
d=1
ans=0
while h:
ans+=d
h//=2
d*=2
print(ans) |
p03803 | s090587908 | Accepted | def main():
A, B = map(int, input().split())
if A == B:
print('Draw')
elif A == 1 and B <= 13:
print('Alice')
elif B == 1 and A <= 13:
print('Bob')
elif A > B:
print('Alice')
elif B > A:
print('Bob')
main() |
p04012 | s943409746 | Wrong Answer | w = input()
w_dict = {}
for char in w:
if char in w_dict:
w_dict[char] += 1
else:
w_dict[char] = 1
if all(elem%2 == 0 for elem in w_dict.values()):
print('YES')
else:
print('NO') |
p03607 | s568914828 | Accepted | n=int(input())
a= [int(input()) for i in range(n)]
a.sort()
ans=0
m=1
for i in range(1,n):
if a[i-1] == a[i]:
m+=1
else:
ans+=(m%2)
m=1
ans+=(m%2)
print(ans)
|
p02922 | s703275535 | Accepted | A, B = map(int, input().split())
for i in range(20):
if (A*i-(i-1) >= B ):
print(i)
exit(0) |
p03471 | s707486885 | Accepted | n, y = map(int, input().split())
def search():
for i in range(n+1):
for j in range(n-i+1):
k = (n - i - j)
if i * 10000 + j * 5000 + 1000 * k == y:
return i, j, k
return -1, -1, -1
print(*search()) |
p02623 | s195932782 | Accepted | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
ans, j = 0, M
for i in range(N+1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i+j)
... |
p02802 | s839312040 | Accepted | n,m = map(int, input().split())
p = [0]*n
q = [False]*n
for _ in range(m):
v,s = input().split()
v = int(v)-1
if q[v]: continue
if s == 'AC': q[v] = True
else: p[v] += 1
print(sum(q),sum(p[i] for i in range(n) if q[i])) |
p02922 | s592343683 | Wrong Answer | A, B = map(int, input().split())
if B%(A-1) == 1:
print((B-1)//(A-1) )
elif B == 0:
print(0)
else:
print(B//A +1) |
p03835 | s169651538 | Wrong Answer | K,S = map(int,input().split())
z = 0
o = 0
t = 0
for i in reversed(range(K+1)):
if i < (S-1)//3 + 1:
break
else:
num = min(S-i,i)-(S-i+1)//2 + 1
z += num
if (S-i) % 2 == 0:
z -= 1
o += 1
if min(S-i,i) == i:
z -= 1
o += 1
if S % 3 == 0:
t += 1
o -= 1
#print(z,o,t)
pr... |
p02732 | s868072852 | Wrong Answer | import sys
input = sys.stdin.readline
n = int(input())
A = list(map(int,input().split()))
B = [0] * (n+1)
for i in range(n):
B[A[i]] += 1
C = [0] * (n+1)
for i in range(n):
C[i] = B[i]*(B[i]-1)//2
su = sum(C)
for i in range(n):
print(su - C[A[i]] + (B[A[i]]-1)*(B[A[i]]-2)//2) |
p02601 | s404238934 | Accepted | # vim: fileencoding=utf-8
def main():
red, green, blue = map(int, input().split())
k = int(input())
res = "No"
for i in range(k):
if blue <= green or blue <= red:
blue *= 2
elif green <= red:
green *= 2
if blue > green and green > red:
res = ... |
p03799 | s781780115 | Accepted | N,M=map(int,input().split())
ans=min(N,M//2)
M-=ans*2
M=max(M,0)
ans+=M//4
print(ans)
|
p02987 | s139697904 | Accepted | s=input()
t=set(s)
t=list(t)
if len(t)!=2:
print("No")
exit(0)
c1,c2=0,0
for ss in s:
if t[0]==ss:c1+=1
if t[1]==ss:c2+=1
if c1==2 and c2==2:
print("Yes")
else:
print("No") |
p02665 | s416190073 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
V = [0]*(N+1)
flug = 0
Lsum= sum(A)
V[0] = 1
for i in range(N):
V[i+1] = (V[i]*2 - A[i+1])
if V[i] <= 0:
flug = 1
Lsum = Lsum - A[i+1]
if V[i+1] > Lsum :
V[i+1] = Lsum
V[N]=0
ans = sum(V)+sum(A)
if A[0] != 0:
ans = -1
if flug ==... |
p03017 | s046160088 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n,a,b,c,d = iim()
s = input()[:d]
if '##' in s:
print('No')
elif c < d:
print('Yes')
else:
print('Yes' if '...' in s else ' No') |
p03416 | s239313830 | Accepted | A, B = map(int, input().split())
ans = 0
for i in range(A, B + 1):
str_i = str(i)
if str_i[0] == str_i[-1] and str_i[1] == str_i[-2]:
ans += 1
print(ans)
|
p02924 | s235493676 | Accepted | N=int(input())
print(N*(N-1)//2) |
p03592 | s853118846 | Wrong Answer | N, M, K = map(int, input().split())
for i in range(M):
for j in range(N):
area = i * j + (N - i) * (M - j)
if area == K:
print('Yes')
exit()
print("No") |
p03862 | s564910965 | Accepted | n,x=map(int,input().split())
a=list(map(int,input().split()))
sm=0
for i in range(n-1):
b=max(a[i]+a[i+1]-x,0)
a[i+1]=max(a[i+1]-b,0)
sm+=b
print(sm) |
p03779 | s684454371 | Accepted | N=int(input())
for i in range(1,10**5):
if (i*(i+1))//2>=N:
print(i)
exit() |
p03633 | s491556938 | Wrong Answer | n = int(input())
T = [int(input()) for _ in range(n)]
from fractions import gcd
from functools import reduce
print(reduce(gcd,T)) |
p02823 | s951588535 | Wrong Answer | n, a, b = map(int, input().split())
if (b - a) % 2 == 0:
print(int(b - (a+b)/2))
else:
if (a - 1) >= (n - b):
print("a")
print((n-b) + 1 + int(n - (n+a+(n-b)+1)/2))
else:
print((a-1) + 1 + int(b-(a-1)-1 - (b-(a-1)-1 + 1)/2)) |
p02622 | s691269097 | Accepted | S = str(input())
T = str(input())
count = 0
for i in range(len(S)):
if(S[i]!=T[i]):
count = count+1
print(count) |
p03211 | s593608977 | Wrong Answer | S = input()
num = ""
l = len(S)
dis = float("inf")
for i in range(l-2):
num = S[i:i+3]
if abs(787-int(num)) < dis:
dis = abs(753-int(num))
for i in range(l-3):
num = S[i:i+4]
if abs(787-int(num)) < dis:
dis = abs(753-int(num))
print(dis) |
p02897 | s571410772 | Wrong Answer | N = int(input())
n = (N+1)//2
print(n)
print(n/N) |
p02963 | s390129549 | Accepted | s = int(input())
MOD = 10**9
x = (-s) % MOD
y = (s+x)//MOD
print(0, 0, 10**9, 1, x, y) |
p03698 | s741142807 | Wrong Answer | s = input()
n = len(s)
flg=True
for i in range(n-1):
if(s[i] == s[i+1]):
print("no")
flg=False
break
if flg:
print("yes") |
p02922 | s387489325 | Wrong Answer | import sys
import os
import math
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
A, B = list(map(int, sys.stdin.readline().split()))
print(math.ceil(B/A))
if __name__ == '__main__':
main()
|
p02700 | s904004289 | Wrong Answer | a,b,c,d=map(int,input().split())
for i in range(100):
if i%2==0:
c-=b
else:
a-=d
if a<=0:
print("No")
break
if c<=0:
print("Yes")
break |
p03944 | s267307539 | Accepted | W, H, N=map(int, input().split())
hen=[0,W,0,H]
for _ in range(N):
x, y, a=map(int, input().split())
if a==1:
hen[a-1]=max(hen[a-1], x)
elif a==2:
hen[a-1]=min(hen[a-1], x)
elif a==3:
hen[a-1]=max(hen[a-1], y)
elif a==4:
hen[a-1]=min(hen[a-1], y)
yoko=hen[1]-hen[0]
tate=hen[3]-hen[2]
if yoko<0... |
p02879 | s423726910 | Accepted | a,b=map(int,input().split())
if a<=9 and b<=9:
print(a*b)
else:
print(-1) |
p02988 | s893921675 | Wrong Answer | n = int(input())
p = list(map(int, input().split()))
ans = set()
for i in range(1, n-1):
a = []
a.append(p[i-1])
a.append(p[i])
a.append(p[i+1])
a.sort()
if a[0] < a[1] and a[1] < a[2]:
ans.add(a[1])
print(len(ans)) |
p03000 | s695476754 | Wrong Answer | N, X = map(int, input().split())
L = map(int, input().split())
D = 0
ans = 0
for l in L:
if D > X:
break
D = D + l
ans += 1
print(ans) |
p02973 | s449193673 | Wrong Answer | n = int(input())
A = [int(input()) for _ in range(n)]
ans = 0
b = float('inf')
for a in A:
if a < b:
b = a
ans += 1
print(ans) |
p03759 | s777313927 | Accepted | a,b,c = map(int,input().split())
if b-a == c-b:
print("YES")
else:
print("NO") |
p02748 | s936823992 | Wrong Answer | a, b, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = sorted(a)
bb = sorted(b)
lis = []
mi = 10**12
for i in range(m):
x, y, c = map(int, input().split())
s = a[x-1]+b[y-1]-c
mi = min(s, mi)
mii = a[0]+b[0]
ans = min(mii,mi)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.