problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02699 | s625687369 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
s, w = map(int, input().split())
if w >= s:
print("unsafe")
else:
print("safe") |
p02697 | s257092221 | Accepted | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
from collections import deque
n, m = map(int, input().split())
ans = []
front = deque([item for item in range(1, (n+1) // 2 + 1)])
back = deque([item for item in range(n // 2 + 2, n + 1)])
while len(front) > 1:
l = front.popleft(); r = front.pop()
ans.append((l, r))
while len(back) > 1:
l = back.popleft(); r = back.pop()
ans.append((l, r))
for i in range(m):
print(*ans[i]) |
p03438 | s623256844 | Accepted | n = int(input())
al = list(map(int,input().split()))
bl = list(map(int,input().split()))
k = sum(bl) - sum(al)
def ceil(a, b):
return a // b + (a % b > 0)
up = 0
down = 0
for a, b in zip(al,bl):
if b - a > 0:
up += ceil(b-a, 2)
down = (b-a) % 2
else:
down = (a-b)
if k >= up and k >= down:
print("Yes")
else:
print("No") |
p03785 | s886849619 | Wrong Answer | N, C, K = map(int, input().split())
T = [int(input()) for _ in range(N)]
T.sort()
lim = 0
ans = 0
wait = 0
for t in T:
if t > lim:
if wait:
ans += 1
lim = t + K
wait = 1
else:
wait += 1
if wait == C:
ans += 1
wait = 0
lim = 0
if wait:
ans += 1
print(ans) |
p03435 | s498334601 | Accepted | C = []
for i in range(3):
C.append([int(i) for i in input().split()])
ans = "Yes"
A = [0] * 3
B = C[0]
A[1] = C[1][0] - B[0]
A[2] = C[2][0] - B[0]
for i in range(3):
for j in range(3):
if C[i][j] != A[i] + B[j]:
ans = "No"
break
print(ans)
|
p03565 | s652610832 | Wrong Answer | import re
import sys
s = input()
t = input()
tLen = len(t)
"""
sの中の?を.に置換する
"""
s = s.replace("?",".")
sLen = len(s)
for i in range(tLen,sLen+1):
#[-i:(-i+tLen)]の区間の文字列が、tにマッチするかを調べる。マッチするなら置換する。
test = s[sLen-i:sLen-i+tLen]
pattern = re.compile(r"%s" % test)
if pattern.search(t):
s = s[:sLen-i]+t+s[sLen-i+tLen+1:]
s = s.replace(".","a")
print(s)
sys.exit()
print("UNRESTORABLE") |
p03943 | s972214739 | Accepted | a=[int(i) for i in input().split()]
print("Yes" if sum(a)==2*max(a) else "No")
|
p02723 | s403363799 | Accepted | word=input()
if word[2]==word[3] and word[4]==word[5]:
print("Yes")
else:
print("No") |
p02684 | s325181203 | Accepted | from time import time
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
L = [-1 for i in range(N)]
visited = []
now = 0
loopstarts = None
looplength = None
t0 = time()
for i in range(N):
if L[now] != -1:
break
else:
L[now] = i
visited.append(now)
now = A[now]-1
loopstarts = visited.index(now)
looplength = len(visited)-loopstarts
if K < loopstarts:
print(visited[K]+1)
else:
print(visited[loopstarts+(K-loopstarts)%looplength]+1)
# print(time()-t0)
|
p03331 | s243378942 | Accepted | import sys
n=int(input())
ans=0
flag=0
while n%10==0:
n=n//10
if n==1:
print(10)
sys.exit()
s=str(n)
for i in range(len(s)):
ans+=int(s[i])
print(ans)
|
p03548 | s701805731 | Accepted | x,y,z = map(int,input().split())
print((x-z)//(y+z)) |
p03719 | s635879729 | Accepted | a,b,c=map(int,input().split())
if c >= a and c <= b:
print("Yes")
else:
print("No") |
p02729 | s030113641 | Wrong Answer | n,m = map(int,input().split())
print(n*(n-1)/2+m*(m-1)/2) |
p03017 | s290746679 | Accepted | n, a, b, c, d = map(int, input().split())
s = input()
#s = '.' + s
if '##' in s[a:c-1] or '##' in s[b:d-1]:
print('No')
else:
if c < b or c < d:
print('Yes')
else:
if '...' in s[b-2:d+1]:
print('Yes')
else:
print('No')
|
p03644 | s051095405 | Accepted | def main():
n = int(input())
answer = 1
while answer <= n:
answer *= 2
print(answer // 2)
if __name__ == '__main__':
main()
|
p03210 | s994476104 | Accepted | X = int(input())
print('YES' if X in [7, 5, 3] else 'NO') |
p02817 | s301444548 | Accepted | S, T = input().split()
ans = T + S
print(ans)
|
p03644 | s458453290 | Accepted | N = int(input())
if N < 2:
ans = 1
elif N < 4:
ans = 2
elif N < 8:
ans = 4
elif N < 16:
ans = 8
elif N < 32:
ans = 16
elif N < 64:
ans = 32
else:
ans = 64
print(ans) |
p02819 | s690494960 | Wrong Answer | # -*- coding: utf-8 -*-
import numpy as np
from collections import deque
x = int(input())
# x までの素数を探す
prim_numbers = [2]
for divider in range(2, int(np.sqrt(x))):
if x % divider == 0:
continue
else:
prim_numbers.append(divider)
def is_primt(q):
for divider in prim_numbers:
if q % divider == 0:
return False
return True
while True:
if is_primt(x):
print(x)
exit()
else:
x += 1
continue
|
p02727 | s232166036 | Wrong Answer | X,Y,A,B,C = map(int,input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.extend(Q)
P.extend(R)
P.sort()
a=-(X+Y)
print(sum(P[a:])) |
p02982 | s411658655 | Wrong Answer | #B
n, d = map(int, input().split())
x = []
for i in range(n):
x.append(list(map(int, input().split())))
ans=0
for i in range(n):
for j in range(i + 1, n):
norm = 0
for k in range(d):
dif = abs(x[i][k] - x[j][k])** 2
norm += dif
flag=False
for k in range(norm):
if k ** 2 == norm:
flag = True
if flag:
ans += 1
print(ans) |
p03672 | s285229047 | Wrong Answer | s=input()
for i in range(len(s)//2):
t=s[:-2*i]
half=len(t)//2
if t[:half]==t[half:]:
ans=len(t)
break
print(ans)
|
p02971 | s639894861 | Accepted | n = int(input())
s = []
for i in range(n):
s.append(int(input()))
m = max(s)
s2 = s.copy()
s2.remove(m)
m2 = max(s2)
for i in s:
if i == m:
print(m2)
else:
print(m) |
p03038 | s049642536 | Wrong Answer | n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
list = [list(map(int, input().split())) for x in range(m)]
list.sort(key=lambda x: x[1], reverse=True) # １番の要素で降順ソート
app_count = 0
for i in list:
a += [i[1]]*i[0]
app_count += i[0]
if app_count>n:
break
a.sort(reverse=True)
print(a[:n]) |
p03475 | s658001265 | Accepted | n = int(input())
CSF = [tuple(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
elif t % f != 0:
t += f - t % f
t += c
print(t)
|
p02729 | s210714905 | Wrong Answer | n,m=map(int,input().split())
if n<2 and m<2:
print(0)
else:
print(n*(n-1)/(2)+m*(m-1)/2) |
p03625 | s035228073 | Wrong Answer | from collections import Counter
n = int(input())
a = Counter(map(int, input().split()))
xy = []
a = sorted(a.items(), key=lambda x: x[0], reverse=True)
for i in a:
if len(xy) == 2:
break
if i[1] >= 4:
xy.append(i[0])
xy.append(i[0])
break
if i[1] >= 2:
xy.append(i[0])
else:
pass
print(xy[0] * xy[1]) if len(xy) == 2 else print(0)
|
p02553 | s732618416 | Wrong Answer | a,b,c,d = map(int,input().split())
ans = -10**9
ans = max(ans,a*c)
ans = max(ans,a*d)
ans = max(ans,b*c)
ans = max(ans,b*d)
print(ans) |
p03478 | s365155051 | Accepted | # abc083_b.py
N,A,B = map(int,input().split())
ans = 0
for i in range(N+1):
s = str(i)
add = 0
for j in s:
add += int(j)
if add <= B and add>= A:
ans += i
print(ans) |
p02748 | s868796059 | Accepted | A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
xyc = [list(map(int,input().split())) for _ in range(M)]
ans = min(a) + min(b)
for x,y,c in xyc:
ans = min(ans, a[x-1]+b[y-1]-c)
print(ans) |
p03387 | s585568106 | Accepted | A, B, C = map(int, input().split())
ans = 0
if A % 2 != B % 2 == C % 2:
B += 1
C += 1
ans += 1
elif B % 2 != C % 2 == A % 2:
C += 1
A += 1
ans += 1
elif C % 2 != A % 2 == B % 2:
A += 1
B += 1
ans += 1
ABC = sorted([A, B, C])
ans += ((ABC[2] - ABC[1]) // 2 + (ABC[2] - ABC[0]) // 2)
print(ans) |
p04045 | s382499909 | Accepted | n, k = map(int, input().split())
D = set(map(int, input().split()))
num = set(i for i in range(10))
D = num - D
for i in range(n, 100000):
for _ in str(i):
if int(_) not in D:
break
else:
print(i)
break
|
p02701 | s435714167 | Accepted | # n = int(input())
# s = input()
# a = list()
n = int(input())
s = [input() for _ in range(n)]
# a, b, c, d = map(int, input().split())
count = set()
for i in s:
count.add(i)
print(len(count))
|
p03211 | s938376823 | Wrong Answer | S = input()
ans = 753- int(S[:3])
for i in range(1, len(S)-1):
tmp = int(S[i:i+3])
ans = min(abs(753-tmp), ans)
print(ans) |
p03659 | s412436741 | Accepted | n = int(input())
a = list(map(int,input().split()))
x = 0
y = sum(a)
ans = 10**10
for i in range(n-1):
x += a[i]
y -= a[i]
ans = min(ans,abs(x-y))
print(ans) |
p04011 | s552408008 | Wrong Answer | n = int(input())
k = int(input())
x = int(input())
y = int(input())
print(x*k + y * (n-k)) |
p03071 | s424688529 | Wrong Answer | a,b = list(map(int,input().split()))
if a >= b:
print(a+a-1)
elif a <= b:
print(b+b-1)
else:
print(a+b) |
p03136 | s227676860 | Accepted | N = int(input())
L = list(map(int, input().split()))
if max(L) < sum(L) - max(L):
print('Yes')
else:
print('No') |
p02831 | s293970307 | Accepted | import fractions
A, B = map(int, input().split())
def get_lcm(a, b):
return (a * b) // fractions.gcd(a, b)
print(get_lcm(A, B)) |
p03377 | s774203796 | Accepted | a,b,x = map(int,input().split())
if a <= x and a + b >= x:
print('YES')
else:
print('NO') |
p02795 | s438008388 | Wrong Answer | h = int(input())
w = int(input())
n = int(input())
if(h>w):
if(n % h == 0):
print(n//h)
else:
print(n//h + 1)
else:
if(n % h == 0):
print(n//w)
else:
print(n//w + 1) |
p03623 | s741049109 | Accepted | x,a,b = map(int, input().split())
if abs(x-a) < abs(x-b):
print("A")
else:
print("B") |
p02552 | s723635489 | Accepted | #!/usr/bin/env python3
import sys
input = iter(sys.stdin.read().splitlines()).__next__
N = int(input())
res = 1-N
print(res)
|
p02546 | s296432817 | Accepted | s = input()
s_list = list(s)
if s[-1] == "s":
Ans = s + "es"
else:
Ans = s + "s"
print(Ans) |
p03137 | s005945677 | Wrong Answer | N, M = map(int, input().split(' '))
if N >= M:
print(0)
else:
points = sorted(tuple(map(int, input().split(' '))))
distances = sorted([abs(p1 - p2) for p1, p2 in zip(points, points[1:])])
print(sum(distances[:-N + 1]))
|
p03087 | s228623269 | Wrong Answer | import itertools
import math
import fractions
import functools
import copy
n, q = map(int, input().split())
s = input()
l = []
r = []
for i in range(q):
li, ri = map(int, input().split())
li -= 1
l.append(li)
r.append(ri)
count_list = [0] * n
for i in range(1,n):
if s[i-1] == "A" and s[i]=="C":
count_list[i] = 1
count = 0
print(count_list)
for i in range(q):
if count_list[i] == 0:
print(sum(count_list[l[i]:r[i]]))
else:
print(sum(count_list[l[i]:r[i]])-1)
|
p02572 | s815372164 | Wrong Answer | mod = 1e9 +7
n = int(input())
a = list(map(int,input().split()))
pref=[0 for x in range(n)]
pref[0] = a[0]
for i in range(1,n):
pref[i] += ((pref[i-1]+a[i])%mod)
ans=0
for i in range(n-1,0,-1):
ans = (ans + a[i]*pref[i-1])%mod
print(int(ans))
|
p02787 | s859188086 | Accepted | H, N = map(int, input().split())
abl = []
for _ in range(N):
ab = list(map(int, input().split()) )
abl.append(ab)
dp = [10**8]*(2*10**4+1)
dp[0] = 0
for h in range(H+1):
for ab in abl:
a,b = ab
dp[h+a] = min(dp[h+a], dp[h]+b)
print(min( dp[H:] )) |
p03037 | s946928795 | Wrong Answer | N,M = map(int, input().split())
L = []
R = []
for _ in range(M):
l,r = map(int, input().split())
L.append(l)
R.append(r)
if min(R) <= max(L):
print(min(R)-max(L)+1)
else:
print(0) |
p02959 | s014786996 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
tmp=0
res=0
for i in range(n):
if b[i] + tmp > a[i]:
res += a[i]
tmp = b[i] + tmp -a[i]
else:
res += b[i] + tmp
tmp = 0
if tmp > a[-1]:
res += a[-1]
else:
res += tmp
print(res)
|
p03281 | s336937317 | Accepted | N = int(input())
count = 0
for i in range(1,N+1):
yaku = 0
if i%2 == 1:
for j in range(1,i+1):
if i%j == 0:
yaku += 1
if yaku == 8:
count += 1
print(count) |
p03799 | s404605794 | Wrong Answer | N,M=map(int,input().split())
ans=0
ans=min(N,M/2)
ans+=max(0,(M-2*ans)//4)
print(ans) |
p02718 | s637271345 | Wrong Answer | url = "https://atcoder.jp/contests/abc161/tasks/abc161_b"
def main():
n, m = list(map(int, input().split()))
n_li = list(map(int, input().split()))
n_li = sorted(n_li, reverse=True)
all_num = sum(n_li)
for i in range(1, m + 1):
if all_num // (4 * m) > n_li[i - 1]:
print('No')
exit()
print('Yes')
if __name__ == '__main__':
main()
|
p02618 | s194760568 | Wrong Answer | import random
D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(D)]
cnt = []
for i in range(D):
rand = random.randrange(0, 26)
cnt.append(rand)
[print(i) for i in cnt] |
p03814 | s079142015 | Accepted | s = input()
print(s.rfind("Z") - s.find("A") + 1)
|
p03262 | s374901076 | Wrong Answer | N, X = map(int, input().split())
a = list(map(int, input().split()))
m = []
for aa in a:
m.append(abs(X-aa))
print(min(m)) |
p03105 | s061715576 | Wrong Answer | S = list(input())
cnt0 = S.count("0")
cnt1 = S.count("1")
print(min(cnt0, cnt1) * 2) |
p03680 | s852708836 | Accepted | n = int(input())
a = [int(input()) for i in range(n)]
flag = False
ind = 1
for cnt in range(n):
ind = a[ind-1]
if ind == 2:
flag = True
break
print(cnt+1 if flag else -1) |
p02973 | s900840516 | Accepted | from sys import stdin, setrecursionlimit
from bisect import bisect_left
from collections import deque
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def main():
N = int(input())
A = tuple(int(input()) for _ in range(N))
B =deque([A[0]])
for a in A[1:]:
if a <= B[0]:
B.appendleft(a)
else:
B[bisect_left(B, a) - 1] = a
print(len(B))
if __name__ == '__main__':
main()
|
p03803 | s620449104 | Accepted | a, b = map(int, input().split())
print([["Alice", "Bob"][(a - 2)%13 < (b - 2)%13], "Draw"][a==b]) |
p03474 | s627137311 | Accepted | a,b=map(int,input().split())
s=input()
if s[:a].isdecimal() and s[a+1:].isdecimal() and s[a]=='-':
print('Yes')
else:
print('No')
|
p04020 | s543368615 | Accepted | # --*-coding:utf-8-*--
N = int(input())
A = list(int(input()) for _ in range(N))
s = 0
s2 = 0
for a in A:
if a != 0:
s2 += a
else:
s += s2//2
s2 = 0
s += s2//2
print(s)
|
p03386 | s307256447 | Accepted | a, b, k = map(int, input().split())
s = {a + i for i in range(min(k, b - a + 1))} | {b - i for i in range(min(k, b - a + 1))}
l = sorted(list(s))
for i in l:
print(i)
|
p02748 | s193191658 | Accepted | A,B,m=map(int,input().split())
xyc=[]
a=[]
b=[]
s=list(map(int,input().split()))
for i in range(A):
a.append([s[i],i])
a.sort()
t=list(map(int,input().split()))
for i in range(B):
b.append([t[i],i])
b.sort()
ans=a[0][0]+b[0][0]
for i in range(m):
p,q,r=map(int,input().split())
ans=min(ans,s[p-1]+t[q-1]-r)
print(ans) |
p03071 | s399140980 | Accepted | A,B = map(int,input().split())
if(A == B):
print(str(A * 2))
else:
print(str(max(A,B) * 2 - 1)) |
p03281 | s803459248 | Wrong Answer | n = int(input())
ans = 0
for i in range(1, n+1, 2):
cnt = 0
for j in range(1, i+1):
if n % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p02814 | s226187230 | Accepted | import fractions
from functools import reduce
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
N,M=map(int,input().split())
A=[int(i)//2 for i in input().split()]
q=lcm(*A)
#print(q)
for i in A:
#print(i)
if q//i%2==0:
print(0)
exit()
print((M//q+1)//2) |
p02838 | s213352909 | Accepted | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = ii()
alis = li()
import numpy as np
A = np.array(alis,dtype=np.int64)
b = [0] * 61
count = 0
ans = 0
MOD = 10**9 + 7
while A.any():
one = np.count_nonzero(A & 1)
k = (1<<count) % MOD
#ans += (one * (n - one) * pow(2, count, MOD)) % MOD
ans += (one * (n - one)) * k % MOD
ans %= MOD
A >>= 1
count += 1
print(ans) |
p03136 | s299697669 | Accepted | n=int(input())
l=list(map(int,input().split()))
if 2*max(l)<sum(l):
print('Yes')
else:
print('No') |
p02553 | s193831956 | Accepted | #B
a,b,c,d = map(int,input().split())
print(max(a*c,a*d,b*c,b*d)) |
p02640 | s421025549 | Accepted | import sys
x,y=map(int,input().split())
for i in range(x+1):
asi=i*2+(x-i)*4
if asi==y:
print("Yes")
sys.exit()
print("No") |
p03408 | s783736247 | Accepted | n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))
|
p02935 | s629904529 | Accepted | N = int(input())
V = [int(hoge) for hoge in input().split()]
V.sort()
ans = V[0]
for n in range(1,N):
ans += V[n]
ans /= 2
print(ans) |
p03673 | s019931471 | Wrong Answer | from collections import deque
B = deque()
n = int(input())
A = list(map(int, input().split()))
for i, a in enumerate(A):
if i % 2 == 0:
B.append(a)
else:
B.appendleft(a)
print(*B)
|
p03105 | s309226511 | Accepted | A,B,C = map(int, input().split())
D = B // A
print(C if C < D else D) |
p02786 | s185419411 | Accepted | h = int(input())
for i in range(100):
if 2**i > h:
print(2**i - 1)
exit() |
p03623 | s013332334 | Accepted | x,a,b=map(int,input().split())
if min(abs(x-a),abs(x-b))==abs(x-a):
print("A")
else:
print("B") |
p02726 | s138611995 | Wrong Answer | n,x,y = [int(n) for n in input().split()]
ans = [0] * (n-1)
for i in range(n-1):
for j in range(i+1,n):
a=j-i
b=abs(y-j)+abs(i-x)+1
ans[min(a,b)-1]+=1
for i in ans:
print(i) |
p03910 | s839905347 | Accepted | #97 B - Exactly N points
N = int(input())
A = []
num = 1
cnt = 0
for _ in range(N):
A.append(num)
cnt += 1
if num == cnt:
cnt = 0
num += 1
ans = [A[-1]]
tgt = N - A[-1]
for i in range(A[-1]-1,0,-1):
tgt -= i
if tgt == 0:
ans.append(i)
break
if tgt < 0:
tgt += i
continue
ans.append(i)
for a in ans:
print(a) |
p03555 | s260152375 | Accepted | def main():
g = [input() for _ in range(2)]
for r in range(2):
for c in range(3):
if g[r][c] != g[1 - r][2 - c]:
print('NO')
return
print('YES')
if __name__ == '__main__':
main()
|
p03779 | s981549742 | Accepted | from collections import defaultdict
from collections import deque
import itertools
import math
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
x = readInt()
ans = math.ceil((-1+(x*8)**0.5)/2)
print(ans) |
p02959 | s495560595 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
remain = 0
for i in range(N):
# before
A[i] -= remain
ans += remain
# now
remain = max(B[i]-A[i], 0)
ans += min(A[i], B[i])
if remain > 0:
ans += min(A[N], remain)
print(ans) |
p02880 | s292798425 | Wrong Answer | N=int(input())
for x in range(1,10):
for y in range (1,10):
if x*y==N:
print('Yes')
else:
print('No') |
p03699 | s380568898 | Wrong Answer | N = int(input())
s = [int(input()) for _ in range(N)]
ten = 0
other = []
for num in s:
if num % 10 == 0:
ten += num
else:
other.append(num)
if other:
other.sort()
print(ten + sum(other[1:]))
else:
print(0) |
p02699 | s123474194 | Wrong Answer | S, W = [int(x) for x in input().split()]
if S <= 2 * W:
print('unsafe')
else:
print('safe')
|
p03665 | s001376143 | Wrong Answer | # coding: utf-8
from math import factorial
N, P = map(int, input().split())
A = list(map(int, input().split()))
odd, even = 0, 0
for i in range(N):
if A[i] % 2 == 0:
even += 1
else:
odd += 1
ans = 0
if P == 0:
ans += 2 ** even
v = ans
ans += (odd * (odd-1)) // 2 * max(1, v)
else:
for i in range(1, odd, 2):
ans += factorial(odd) // (factorial(i) * factorial(odd - i)) * 2**even
print(ans) |
p02571 | s367050733 | Wrong Answer | S = list(input())
T = list(input())
ls = len(S)
lt = len(T)
ans = lt
for offset in range(ls - lt + 1):
cnt = 0
for i in range(lt):
if S[offset + i] != T[i]:
cnt += 1
ans = min(lt, cnt)
print(ans) |
p03479 | s666209963 | Accepted | def main():
x, y = map(int, input().split())
ans = 0
while y >= x:
x *= 2
ans += 1
print(ans)
if __name__ == '__main__':
main() |
p03105 | s409648114 | Accepted | a, b, c = map(int, input().split())
print(min(b//a, c))
|
p02861 | s604516022 | Accepted | n=int(input())
a=[[int(i)for i in input().split()]for i in range(n)]
import itertools as it
li=list(it.permutations(range(n)))
total=0
for i in li:
tmp=0
for j in range(n-1):
x1,x2=a[i[j]][0],a[i[j+1]][0]
y1,y2=a[i[j]][1],a[i[j+1]][1]
tmp=(x1-x2)**2+(y1-y2)**2
total+=tmp**0.5
print(total/len(li)) |
p02882 | s882489989 | Accepted | import math
a,b,x = map(int,input().split())
x = x/a
if x >a*b/2:
theta = math.degrees(math.atan2(2*(a*b-x)/a,a))
else:
theta = math.degrees(math.atan2(b,2*x/b))
print(theta) |
p03838 | s714760437 | Accepted | x,y = map(int,input().split())
ans = abs(abs(x) - abs(y))
if(x*y>0)&(x>y):
ans += 2
if(x*y < 0):
ans += 1
if(x*y==0)&(x>y):
ans += 1
print(ans) |
p03962 | s876834505 | Accepted | print(len(set(input().split()))) |
p02796 | s914903749 | Accepted | N = int(input())
arms = []
ans = 1
for i in range(N):
X,L = (int(x) for x in input().split())
arms.append((X-L,X+L))
arms.sort(key=lambda x:x[1])
limit = arms[0][1]
for x in arms[1:]:
if x[0] < limit:
continue
else:
limit = x[1]
ans += 1
print(ans) |
p03106 | s926813358 | Accepted | a,b,k = map(int,input().split())
frm = min(a, b)
cnt = 0
for i in range(frm, 0, -1):
if a % i == 0 and b % i == 0:
cnt += 1
if cnt == k:
print(i)
exit()
|
p03345 | s115911347 | Accepted | a, b, c, k = map(int,input().split())
if k % 2 == 0:
print(a-b)
else:
print(b-a) |
p02832 | s786656881 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
count = 0
i = 0
while i+1 != a[i]:
a.pop(i)
count += 1
if i+1 == a[i]:
i += 1
if a == []:
print(-1)
exit()
if len(a) == a[-1]:
print(count)
exit()
|
p02678 | s568675749 | Wrong Answer | #n=int(input())
n,m=map(int,input().split())
#a=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(m)]
ll=[[]for i in range(n)]
for i in range(m):
ll[l[i][0]-1].append(l[i][1])
ll[l[i][1]-1].append(l[i][0])
lt=[0 for i in range(n)]
lll=[1]
for i in range(n):
for j in ll[lll[i]-1]:
lll.append(j)
lll=list(dict.fromkeys(lll))
print(lll)
|
p02982 | s656469337 | Wrong Answer | from math import sqrt
N, D = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N - 1):
dist = 0
for j in range(i + 1, N):
for k in range(D):
dist += (X[i][k] - X[j][k]) ** 2
if sqrt(dist) % 1 == 0:
ans += 1
print(ans) |
p02665 | s384372693 | Wrong Answer | def Csum(a):
b,c=[0],0
for i in range(len(a)):
c+=a[i]
b.append(c)
return b
n=int(input())
a=list(map(int,input().split()))
s=Csum(a)
su=sum(a)
b=1
c=0
for i in range(n+1):
c+=b
b-=a[i]
if b<=0:
if i==n:
break
print(-1)
exit()
b=min(b*2,su-s[i+1])
print(c) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.