input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
H,N = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = "No"
sumA = 0
for a in A:
sumA += a
if sumA >= H:
ans = "Yes"
break
print(ans) | H,N = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = "No"
if sum(A) >= H:
ans = "Yes"
print(ans) | p02784 |
import sys
H,N=list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(N):
m=max(A)
H-=m
if(H <= 0):
print('Yes')
sys.exit()
A.remove(m)
print('No')
| import sys
H,N=list(map(int,input().split()))
A = list(map(int,input().split()))
sortA=sorted(A)
for i in range(N):
H-=sortA.pop()
if(H <= 0):
print('Yes')
sys.exit()
print('No')
| p02784 |
h, n = list(map(int, input().split()))
arr = list(map(int, input().split()))
if sum(arr) >= h: print('Yes')
else: print('No') | In1 = input().split()
h = int(In1[0])
n = int(In1[1])
ith = input().split()[0:n]
count = 0
for x in ith:
h -= int(x)
if h <= 0:
break
if h > 0:
print("No")
else:
print("Yes") | p02784 |
H,N=list(map(int, input().split()))
A=[int(i) for i in input().split()]
Ans = "Yes" if H<=sum(A) else "No"
print(Ans) | H,N=map(int, input().split())
A=[int(i) for i in input().split()]
print("Yes") if H<=sum(A) else print("No")
| p02784 |
h,n = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(n):
h = h - a[i]
if h <= 0:
print('Yes')
exit(0)
print('No') | h,n = list(map(int,input().split()))
a = list(map(int,input().split()))
a = sum(a)
if a >= h:
print('Yes')
else:
print('No') | p02784 |
# Problem B - Common Raccoon vs Monster
# input
h, n = list(map(int, input().split()))
a_list = list(map(int, input().split()))
# initialization
a_sum = sum(a_list)
# output
if h - a_sum<=0:
print("Yes")
else:
print("No")
| # Problem B - Common Raccoon vs Monster
# input
H, N = list(map(int, input().split()))
a_nums = list(map(int, input().split()))
# initialization
a_sum = sum(a_nums)
# output
if a_sum>=H:
print("Yes")
else:
print("No")
| p02784 |
h,n=list(map(int,input().split()))
if sum(list(map(int,input().split())))<h:
print('No')
else:
print('Yes')
| h,n=list(map(int,input().split()))
print(('Yes' if sum(list(map(int,input().split())))>=h else 'No')) | p02784 |
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
print(('Yes' if sum(A) >= H else 'No')) | H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
print(('Yes' if H <= sum(A) else 'No'))
| p02784 |
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
T = 0
for a in A: #for i in A だとAの要素を繰り返す
T += a
if T >= H:
print("Yes")
else:
print("No") | H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
if sum(A) >= H:
print("Yes")
else:
print("No") | p02784 |
H,N = list(map(int,input().split()))
A =list( map(int,input().split()))
s = sum (A)
if s>=H:
print("Yes")
else:
print("No")
| H,N = list(map(int,input().split()))
A =list( map(int,input().split()))
if sum (A)>=H:
print("Yes")
else:
print("No")
| p02784 |
h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
h -= a[i]
if h <= 0:
print("Yes")
else:
print("No") | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
h, n = list(map(int, input().split()))
A = list(map(int, input().split()))
print(("Yes" if h <= sum(A) else "No"))
if __name__ == '__main__':
resolve()
| p02784 |
#template
from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
H,N = inputlist()
A = inputlist()
s = sum(A)
if H <= s:
print("Yes")
else:
print("No") | #template
def inputlist(): return [int(k) for k in input().split()]
#template
H,N = inputlist()
A = inputlist()
s = sum(A)
if s >= H:
print("Yes")
else:
print("No") | p02784 |
h,n=list(map(int,input().split()))
l=list(map(int,input().split()))
print(('Yes' if sum(l)>=h else 'No')) | H, N = list(map(int, input().split()))
A = sum(map(int, input().split()))
print(("Yes" if H <= A else "No")) | p02784 |
H,N=list(map(int,input().split()))
A=sorted((list(map(int,input().split()))))
A=A[::-1]
print(("Yes" if sum(A[0:N])>=H else "No")) | H,N,*A=list(map(int,open(0).read().split()))
print(("Yes" if sum(A)>=H else "No")) | p02784 |
def main():
h, n = list(map(int, input().split()))
*a, = list(map(int, input().split()))
print(('No' if h > sum(a) else 'Yes'))
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input()... | H, N = list(map(int, input().split()))
*A, = list(map(int, input().split()))
print(('Yes' if sum(A) >= H else 'No'))
| p02784 |
H,N=list(map(int,input().split()))
A=sum(map(int,input().split()))
print(("Yes" if H-A<=0 else "No")) | H,N=list(map(int,input().split()))
A=sum(map(int,input().split()))
print(("Yes" if H<=A else "No")) | p02784 |
H, N = list(map(int, input().split()))
PP = list(map(int, input().split()))
print(("Yes" if sum(PP) >= H else "No")) | def resolve():
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
print(("Yes" if sum(A) >= H else "No"))
resolve() | p02784 |
import itertools
import sys
H,N = list(map(int,input().split()))
Attacks = [_ for _ in map(int,input().split())]
Attacks.sort(reverse = True)
if sum(Attacks) < H:
print('No')
sys.exit(0)
else:
for i in range(1,N+1):
if sum(Attacks[0:i]) >= H:
print('Yes')
sys.exit... | import sys
H,N = list(map(int,input().split()))
Attacks = [_ for _ in map(int,input().split())]
if sum(Attacks) < H:
print('No')
sys.exit(0)
if sum(Attacks) >= H:
print('Yes')
sys.exit(0) | p02784 |
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
def answer(H: int, N: int, A: list) -> str:
damage = 0
for i in range(0, N):
damage += int(A[i])
i += 1
if damage < H:
return 'No'
else:
return 'Yes'
print((answer(H, N, A)))
| H, N = list(map(int,input().split()))
A = list(map(int,input().split()))
if H <= sum(A):
print("Yes")
else:
print("No") | p02784 |
H, N = list(map(int, input().split()))
A = list(map(int,input().split()))
sum = 0
for i in A:
sum += i
if sum >= H:
print('Yes')
else:
print('No') | H, N = list(map(int, input().split()))
A = sum(list(map(int,input().split())))
if A >= H:
print('Yes')
else:
print('No') | p02784 |
H,N = list(map(int,input().split()))
A = list(map(int,input().split()))
if sum(A)>=H:
print("Yes")
else:
print("No") | H,N = list(map(int,input().split()))
A = list(map(int,input().split()))
tot = sum(A)
if tot>=H:
print("Yes")
else:
print("No") | p02784 |
import itertools
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = 'No'
for i in itertools.product([True, False], repeat=N):
if sum([A[j] for j in range(len(A)) if i[j]]) == H:
ans = 'Yes'
print(ans) | H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
total = sum(A)
if total >= H:
print('Yes')
else:
print('No')
| p02784 |
H, N = list(map(int, input().split()))
D = list(map(int, input().split()))
f = [1] + [0 for i in range(1, H+1)]
flag = 0
for i in range(N):
for j in range(H-D[i], -1, -1):
if f[j] == 1:
f[j+D[i]] = 1
if f[-1] == 1:
print("Yes")
flag = 1
break
if flag == 0:
print("No") | H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
if sum(A) >= H:
print("Yes")
else:
print("No") | p02784 |
import math
monsterHP, araiN = list(map(int, input().split()))
araiSum = sum(list(map(int, input().split())))
if monsterHP <= araiSum:
print("Yes")
else:
print("No") | h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
if h <= sum(a): print("Yes")
else: print("No") | p02784 |
#!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(H: int, N: int, A: "List[int]"):
for i in range(N):
H-=max(A)
A.remove(max(A))
if H<=0:
print(YES)
break
else:
print(NO)
return
# Genera... | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(H: int, N: int, A: "List[int]"):
A.sort()
for i in range(N):
H-=A[-1]
del A[-1]
if H<=0:
print(YES)
break
else:
print(NO)
return
# ... | p02784 |
h,n = list(map(int,input().split()))
a_list = list(map(int,input().split()))
def part_sum(a,A):
#初期化
N = len(a)
dp = [[0 for i in range(A+1)] for j in range(N + 1)]
dp[0][0] = 1
#DP
for i in range(N):
for j in range(A+1):
if a[i] <= j :
dp[i +... | h,n = list(map(int,input().split()))
a_list = list(map(int,input().split()))
if sum(a_list) >= h:
print("Yes")
else:
print("No")
| p02784 |
h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort(reverse=True)
sum = 0
for i in a:
sum += i
if sum >= h:
print('Yes')
exit()
print('No') | h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
if h - sum(a) <= 0:
print('Yes')
else:
print('No') | p02784 |
h,m = list(map(int, input().split()))
atack = list(map(int, input().split()))
atack_select=[] #候補を保存しておくリスト
for i in range(m):
atack_select.append(max(atack))
atack.remove(max(atack)) #最大値を消していく
if h - sum(atack_select) <= 0:
print("Yes")
else:
print("No") | h,m = list(map(int, input().split()))
atack = list(map(int, input().split()))
atack.sort(reverse=True) #降順に並び替え
atack_select = atack[:m]
if h - sum(atack_select) <= 0:
print("Yes")
else:
print("No") | p02784 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
h, n = list(map(int, input().rstrip('\n').split()))
a = list(map(int, input().rstrip('\n').split()))
print(("Yes" if sum(a) >= h else "No"))
if __name__ == '__main__':
solve()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
h, n = list(map(int, readline().split()))
a = sum(list(map(int, readline().split())))
print(("Yes" if a >= h else "No"))
if __name__ == '__main__':
solve()
| p02784 |
h , n = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n):
h -= a[i]
if h <= 0:
print('Yes')
else:
print('No') | h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
if h <= sum(a):
print('Yes')
else:
print('No') | p02784 |
h, n = list(map(int,input().split()))
a = list(map(int,input().split()))
total = 0
for i in range(n):
total += a[i]
if total >= h:
print("Yes")
else:
print("No") | h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
aa = sum(a)
if aa >= h:
print("Yes")
else:
print("No") | p02784 |
import math
inputs = input().split(" ")
health, moves_num = int(inputs[0]), int(inputs[1])
moves_inp = input().split(" ")
moves = [int(move) for move in moves_inp]
can_win = False
for move in moves:
health -= move
if health <= 0:
can_win = True
break
print(("Yes" if can_win el... | H,N=list(map(int,input().split()))
A=list(map(int,input().split()))
x=sum(A)
print(("Yes" if x>=H else "No")) | p02784 |
H,N=list(map(int,input().split()))
a=list(map(int,input().split()))
atk=0
for i in range(len(a)):
atk+=max(a)
a.remove(max(a))
if atk>=H:
print("Yes")
else:
print("No") | H,N=list(map(int,input().split()))
a=list(map(int,input().split()))
atk=0
for i in range(len(a)):
atk+=a[i]
if atk>=H:
print("Yes")
else:
print("No") | p02784 |
h,n = list(map(int,input().split()))
li = list(map(int,input().split()))
ls =[]
for i in range(n):
m = li.index(max(li))
ls.append(li.pop(m))
if sum(ls) >= h:
print('Yes')
else:
print('No') | h,n = list(map(int,input().split()))
li = list(map(int,input().split()))
if sum(li) >= h:
print('Yes')
else:
print('No') | p02784 |
h,n=list(map(int,input().split()))
print(("Yes"if sum(list(map(int,input().split())))>=h else "No")) | h, n = list(map(int, input().split()))
print(("Yes" if h <= sum(map(int, input().split())) else "No")) | p02784 |
# Input
h, n = input().split()
a = list(map(int, input().split()))
# Declaring variables
h = int(h)
n = int(n)
sum = 0
# Calculating the sum
for i in range(n):
sum += a[i]
# Judging if the raccoon can win without using the same move twice or more.
if sum >= h:
print("Yes")
else:
print("N... | # Initializing variables
monsterHP, specialMoves = list(map(int, input().split()))
a = list(map(int, input().split()))
sum = 0
# Calculating if the raccoon can win without using the same move twice or more.
for i in range(specialMoves):
sum += a[i]
if sum >= monsterHP:
print("Yes")
else:
print... | p02784 |
h, n = list(map(int, input().split()))
a = [int(x) for x in input().split()]
if sum(a) >= h:
print('Yes')
else:
print('No') | h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
if sum(a) >= h:
print('Yes')
else:
print('No') | p02784 |
import math
H,N = list(map(int,input().split()))
A = [int(x) for x in input().split()]
count = 0
sum2 = []
for i in range(2 ** N):
sum1 = []
for j in range(len(A)):
if ( i >> j) & 1 == 1:
sum1.append(A[j])
if sum(sum1) == H:
count = 1
... | import math
H,N = list(map(int,input().split()))
A = [int(x) for x in input().split()]
count = 0
sum2 = []
'''for i in range(2 ** N):
sum1 = []
for j in range(len(A)):
if ( i >> j) & 1 == 1:
sum1.append(A[j])
if sum(sum1) == H:
count = 1
... | p02784 |
# -*- coding: utf-8 -*-
h, n = list(map(int,input().split()))
a = [int(i) for i in input().split()]
for i in range(n):
h -= a[i]
if h <= 0:
print("Yes")
else:
print("No")
| # -*- coding: utf-8 -*-
h, n = list(map(int,input().split()))
a = [int(i) for i in input().split()]
"""
for i in range(n):
h -= a[i]
"""
h -= sum(a)
if h <= 0:
print("Yes")
else:
print("No")
| p02784 |
h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
at = 0
for i in range(n):
at = at + a[i]
if at >= h:
print("Yes")
else:
print("No") | h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
at = sum(a)
if at >= h:
print("Yes")
else:
print("No") | p02784 |
h, n = list(map(int, input().split()))
a = [int(i) for i in input().split()]
sum = 0
for i in range(n):
sum += a[i]
print(("Yes" if h <= sum else "No")) | h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
print(('Yes' if sum(a) >= h else 'No')) | p02784 |
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
total = sum(A)
if H > total:
ans = "No"
else:
ans = "Yes"
print(ans)
| H,N=list(map(int,input().split()))
atk = sum(map(int,input().split()))
if atk>=H:
print("Yes")
else:
print("No") | p02784 |
h,n=list(map(int,input().split()))
a=list(map(int,input().split()))
print(("Yes" if sum(a)>=h else "No")) | h,n=list(map(int,input().split()))
a=sum(map(int,input().split()))
print(("Yes" if a>=h else "No")) | p02784 |
# coding: utf-8
# Here your code !
def main(N,k):
p = 0
for i in range(N-1):
p2 = p
while p2-1-p2//k != p:
p2+=1
p=p2
return p
if __name__ == '__main__':
N,k=input().split()
print((main(int(N),int(k)))) | # coding: utf-8
# Here your code !
def main(N,k):
p = 0
p2 = 0
memo = 0
for i in range(N-1):
p, p2 = p2, k*(p2+1)//(k-1) - 2
while p2-1-p2//k != p:
p2+=1
return p2
if __name__ == '__main__':
N,k=input().split()
print((main(int(N),int(k)))) | p01810 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
from collections import Counter
# 直径が分かる。中心からの距離が分かる。
N = int(eval(input()))
A = [int(x) for x in input().split()]
diag = max(A)
def solve_even():
# 中心が1頂点
depth = [x-diag//2 for x in A]
if any(x < 0 for x in depth):
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
"""
・直径の長さをdとする。だいたい、半径より下の長さは存在できない
・だいたいd/2より上は任意に足せる。ただし中心は1組のみ
"""
N,*A = list(map(int,read().split()))
def test(A):
D = max(A)
r = (D+1)//2
counter = [0] * (D+1)
fo... | p03988 |
from collections import Counter, deque
N = int(eval(input()))
A = list(map(int, input().split()))
cntA = Counter(A)
valA = list(set(A))
valA.sort(reverse=True)
pathLeng = [0] * (N + 1)
if cntA[valA[0]] < 2 or cntA[valA[-1]] > 2:
print('Impossible')
exit()
pathLeng[1] = valA[0]
pathLeng[2] =... | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
cntA = Counter(A)
valA= list(set(A))
valA.sort()
if valA[-1] % 2 == 1:
if valA[0] != -(-valA[-1] // 2) or cntA[valA[0]] != 2:
print('Impossible')
exit()
for a in range(valA[0], valA[-1] + 1... | p03988 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, acos, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, acos, ... | p03988 |
# cf16-exhibition-final-openC - Cheating Nim
import sys
input = sys.stdin.readline
from functools import reduce
from operator import xor
def main():
# player is second move -> make xor 0
N = int(eval(input()))
A = sorted(map(int, [eval(input()) for _ in range(N)]), reverse=1)
ans, x = 0, ... | # cf16-exhibition-final-openC - Cheating Nim
import sys
input = sys.stdin.readline
def main():
# player is second move -> make xor 0
N = int(eval(input()))
A = sorted(map(int, [eval(input()) for _ in range(N)]), reverse=1)
ans, x, flg = 0, 0, [0] * 30
for i in A:
x ^= i
... | p03880 |
N,*A=list(map(int,open(0)))
x=0
B=[]
for a in A:
x^=a
B+=a^a-1,
z=0
k=2**30
for b in sorted(set(B))[::-1]:
while not(x&k):
k//=2
if b&k:
x^=b
z+=1
print((-1if x else z)) | N,*A=list(map(int,open(0)))
x=0
B=[]
for a in A:
x^=a
B+=a^a-1,
z=0
k=2**30
for b in sorted(B)[::-1]:
while k and not(x&k):
k//=2
if b&k and b<2*k:
x^=b
z+=1
print((-1if x else z)) | p03880 |
from functools import reduce
from operator import xor
N, *A = list(map(int, open(0).read().split()))
x = reduce(xor, A)
ans = 0
K = x.bit_length()
for k in reversed(list(range(K))):
if (x >> k) & 1:
for a in A:
t = a ^ (a - 1)
if t == 2 ** (k + 1) - 1:
... | from functools import reduce
from operator import xor
N, *A = list(map(int, open(0).read().split()))
x = reduce(xor, A)
memo = set(a ^ (a - 1) for a in A)
ans = 0
K = x.bit_length()
for k in reversed(list(range(K))):
if (x >> k) & 1:
t = (2 << k) - 1
if t in memo:
x ^= t... | p03880 |
import itertools
from functools import reduce
from operator import mul
N = int(eval(input()))
# a, b, x = map(lambda i: int(i), input().split(' '))
def main():
# hen1 = a / 2
# hen2 = b - (x / (a * a))
# print(math.degrees(math.atan(hen2 / hen1)))
primes = prime_factorize(N)
if len(pri... | import math
N = int(eval(input()))
# a, b, x = map(lambda i: int(i), input().split(' '))
def main():
root_n = math.sqrt(N)
answer = -1
for a in range(1, int(root_n) + 1):
if N % a == 0:
b = N // a
v = a + b - 2
if answer == -1 or answer > v:
... | p02881 |
def main():
N = int(eval(input()))
i = 2
ans = N + 1
while i ** 2 <= N:
if N % i == 0:
ans = min(i + N / i, ans)
i += 1
print((int(ans - 2)))
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
f = []
i = 2
while i * i <= n:
if n % i == 0:
f.append(i)
if i * i != n:
f.append(n // i)
i += 1
if n != 1:
f.append(n)
f.sort()
answer = float("inf")
for ff in f:
an... | p02881 |
N = int(eval(input()))
root = int(N**0.5)
pairs = [[i, N //i] for i in range(1, root+1) if N % i == 0]
move = min([pair[0] + pair[1] -2 for pair in pairs])
print(move) | N = int(eval(input()))
root = int(N**0.5)
print((min([i + N // i -2 for i in range(1, root+1) if N % i == 0]))) | p02881 |
n = int(eval(input()))
i = int(n**(1/2))
while n%i:
i-=1
j = n//i
ans = (i - 1) + (j - 1)
#print(i,j)
print(ans) | n = int(eval(input()))
for i in range(1,int(n**(1/2)+1))[::-1]:
if not n%i:
j = n//i
print((i-1+j-1))
break
| p02881 |
def solve(string):
n = int(string)
l = int(n**0.5)
while n % l > 0:
l -= 1
return str(l + n // l - 2)
if __name__ == '__main__':
print((solve(eval(input()))))
| def solve(string):
n = int(string)
for i in range(int(n**0.5) + 1, 0, -1):
if n % i:
continue
else:
return str(i + n // i - 2)
if __name__ == '__main__':
print((solve(eval(input()))))
| p02881 |
def solve(string):
n = int(string)
for i in range(int(n**0.5) + 1, 0, -1):
if n % i == 0:
return str(i + n // i - 2)
if __name__ == '__main__':
print((solve(eval(input()))))
| def solve(string):
n = int(string)
for i in range(int(n**0.5) + 1, 0, -1):
if not n % i:
return str(i + n // i - 2)
if __name__ == '__main__':
print((solve(eval(input()))))
| p02881 |
import math
n = int(eval(input()))
mins = n
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
mins = min(mins, i + (n // i) - 2)
print(mins)
| import math
n = int(eval(input()))
ans = 1e+15
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
ans = min(ans, i + n//i - 2)
print(ans) | p02881 |
def main():
N = int(eval(input()))
loop = int(N ** 0.5)
ans = float("inf")
for i in range(1, loop + 1):
if N % i == 0:
j = N // i
tmp = i + j - 2
if tmp < ans:
ans = tmp
print(ans)
if __name__ == "__main__":
main() | def func(N):
loop = int(N ** 0.5)
ans = float("inf")
for i in range(1, loop + 1):
if N % i:
continue
j = N // i
tmp = i + j - 2
ans = min(ans, tmp)
return ans
if __name__ == "__main__":
N = int(eval(input()))
print((func(N... | p02881 |
N = int(eval(input()))
ans = []
for i in range(1,int(pow(N,0.5))+1):
j = N//i
if i*j == N:
ans.append(i+j)
print((min(ans)-2)) | N = int(eval(input()))
ans = []
for i in range(1,int(pow(N,0.5))+1):
if N%i==0:
ans.append(i+N//i)
print((min(ans)-2)) | p02881 |
N = int(eval(input()))
ans = float("inf")
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
for i in make_div... | N = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
div = make_divisors(N)
if div[-1] ... | p02881 |
N=int(eval(input()))
K=list()
for i in range(1,int(N**0.5)+1):
if(int(N/i)==N/i):
M=int(N/i) #N<=M
L=i
K.append(M+L-2)
print((min(K))) | import math
def make_divisors(n):
divisors = []
for i in range(2, int(math.sqrt(n))+1):
if n % i == 0:
divisors.append(i)
divisors.sort()
return divisors
def main():
N=int(eval(input()))
di=make_divisors(N)
if di==[]:
print((N-1))
else:
... | p02881 |
n = int(eval(input()))
a = n - 1
p = 1
for c in range(2, int((n ** 0.5) * 2)):
if p % 2 == 1 and c > (n ** 0.5):
break
if n % c == 0:
p = c
w = int(n / c)
if (w + c - 2) < a:
a = (w + c -2)
else:
continue
else:
continue
p... | N = int(eval(input()))
ans = N - 1
p = 1
for i in range(2, int((N ** 0.5) + 1)):
if p % 2 == 1 and i > (N ** 0.5):
break
if N % i == 0:
p = i
j = N // i
m = i + j - 2
if m < ans:
ans = m
else:
continue
else:
conti... | p02881 |
N = int(eval(input()))
ans = N - 1
p = 1
for i in range(2, int((N ** 0.5) + 1)):
if p % 2 == 1 and i > (N ** 0.5):
break
if N % i == 0:
p = i
j = N // i
m = i + j - 2
if m < ans:
ans = m
else:
continue
else:
conti... | N = int(eval(input()))
ans = N - 1
for i in range(2, int((N ** 0.5) + 1)):
if N % i == 0:
j = N // i
m = i + j - 2
ans = min(ans, m)
print(ans)
| p02881 |
n = int(eval(input()))
r = int(n**.5)
for i in range(r):
if n % (r-i) == 0:
print(( (r-i) + n//(r-i) - 2 ))
break | n = int(eval(input()))
s = int(n**.5)
for i in range(s):
if n % (s-i) == 0:
print(((s-i) + n // (s-i) - 2))
break | p02881 |
n = int(eval(input()))
def factorize(n):
b = 2
fct = []
while b * b <= n:
while n % b == 0:
n //= b
fct.append(b)
b = b + 1
if n > 1:
fct.append(n)
return fct
a = factorize(n)
m = len(a)
ans = 0
if m==1:
print((a[0]-1))
elif m==2... | import math
INF = 1e12
n = int(eval(input()))
ans = INF
m = math.sqrt(n)
for i in range(1,math.ceil(m)+1):
if n%i==0:
j = n//i
ans = min(ans, i+j-2)
else:
continue
print(ans) | p02881 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.st... | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
d = [] # Nの約数(Nが平方数のとき、N**.5を敢えて2回dに入れている)
for i in range(1,int(N**.5)+1):
if N % i == 0:
d.append(i)
d.append(N//i)
# 目的地の(i,j)は、i*j==Nを満たす(i,j)の中でiとjが最も近いもの
d.sort()
a = len(d)
print((d[a//2] + d[a//2-1] ... | p02881 |
n=int(eval(input()))
a=-1
b=-1
for i in range(1,int(n**0.5)+1):
#print(i,n/i)
if n/i-int(n/i)==0:
a=i
b=int(n/i)
print((a+b-2)) | n=int(eval(input()))
#n=a*bのa+b-2のmin
ans=float("inf")
for i in range(1,int(n**0.5)+1):
if n%i==0:
ans=min(ans,n//i+i-2)
print(ans) | p02881 |
n = int(eval(input()))
import math
for i in range(math.floor(n**0.5),0,-1):
if n % i == 0:
print((i + n//i -2))
break | n = int(eval(input()))
for i in range(int(n**0.5)+1,0,-1):
if n % i == 0:
print((i + n//i -2))
break | p02881 |
n=int(eval(input()))
for i in range(int(n**.5),0,-1):
if n%i<1: print((i+n//i-2)); break | n=int(eval(input()))
print((min(i+n//i-2 for i in range(1,int(n**.5)+1) if n%i<1))) | p02881 |
n=int(eval(input()))
div = n
result = 10**12
for i in range(1,1000001):
if n % i == 0:
div = n // i
result = min(result, i+div)
print((int(result-2)))
| n=int(eval(input()))
result = 10**12
for i in range(1,int(n**0.5)+1):
if n % i == 0:
result = min(result, i + n//i)
print((int(result-2)))
| p02881 |
import math
n=int(eval(input()))
lst=[]
down=math.floor(math.sqrt(n))
for i in range(1,down+1):
if i**2>n:
break
if n%i==0:
lst.append(i+n//i)
print((min(lst)-2)) | import math
n=int(eval(input()))
lst=[]
down=math.floor(math.sqrt(n))
for i in range(1,down+1):
#if i**2>n:
# break
if n%i==0:
lst.append(i+n//i)
print((min(lst)-2))
| p02881 |
from math import *
n = int(eval(input()))
def ij(x):
for i in range(x):
i = x - i
if n / i == n//i:
return i, n//i
print((sum(ij(int(sqrt(n)))) - 2))
| from math import *
n = int(eval(input()))
def ij(x):
for i in range(x, 0, -1):
if n/i == n//i:
return i, n//i
print((sum(ij(int(sqrt(n)))) - 2)) | p02881 |
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
# if i != n // i:
# divisors.append(n // i)
divisors.append(n // i)
return divisors
N = int(eval(input()))
l = make_divisors(N)
a = l[len(l) - 1]
b = l[len(l) - 2]
... | def make_divisors(n):
divisors = []
for i in range(int(n ** 0.5), 0, -1):
if n % i == 0:
divisors.append(i)
# if i != n // i:
# divisors.append(n // i)
divisors.append(n // i)
break
return divisors
N = int(eval(input()))
l = make_divisors(N)
a = l[0]
b = l[1]
prin... | p02881 |
n = int(eval(input()))
def is_prime(num):
import math
if num == 2:
return True
elif num < 3 or num % 2 == 0:
return False
for i in range(3, int(math.sqrt(num)) + 1, 2):
if num % i == 0:
return False
return True
if is_prime(n):
print((n-1))
... | n = int(eval(input()))
def is_prime(num):
import math
if num == 2:
return True
elif num < 3 or num % 2 == 0:
return False
for i in range(3, int(math.sqrt(num)) + 1, 2):
if num % i == 0:
return False
return True
if is_prime(n):
print((n-1))
... | p02881 |
n = int(eval(input()))
l = []
for i in range(1,1000001):
a = n / i
if a.is_integer():
l.append(i+n/i)
print((int(min(l)-2))) | n = int(eval(input()))
a = 10**20
for i in range(1,int(n**0.5)+1):
if n%i==0:
a = min(a,i+n//i)
print((a-2)) | p02881 |
import math
n=int(eval(input()))
ans=n
i=1
while(i<=math.sqrt(n)):
if n%i==0:
d=i+n/i-2
ans=min(ans,d)
i+=1
print((int(ans))) | from math import floor
from math import sqrt
n=int(eval(input()))
nn=floor(sqrt(n))
rest=n%nn
while rest!=0:
nn-=1
rest=n%nn
nnn=n/nn
print((int(nn+nnn-2))) | p02881 |
n = int(eval(input()))
import math
m = int(math.sqrt(n))+1
anss = []
for x in range(1, m+1):
y = n//x
z = n%x
if z == 0:
anss.append(abs(x-1)+abs(y-1))
print((min(anss)))
| n = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
#divisors.sort(reverse=True)
return divisors
l = make_divisors(n)
min_ = flo... | p02881 |
n = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
#divisors.sort(reverse=True)
return divisors
l = make_divisors(n)
ans = fl... | n =int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
#divisors.sort(reverse=True)
return divisors
l = make_divisors(n)
ans = float... | p02881 |
n =int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
#divisors.sort(reverse=True)
return divisors
l = make_divisors(n)
ans = float... | n = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
d = make_divisors(n)
ans = 10**18
for a in ... | p02881 |
from math import sqrt
from sys import exit
N = int(eval(input()))
for i in range(int(sqrt(N)) +1, -1, -1):
if N % i == 0:
print(((i - 1) + (N // i - 1)))
exit() | n = int(eval(input()))
t = int(n**0.5+1)
ans = 10**13
for i in range(1, t):
if n%i == 0 and i+n//i-2 < ans:
ans = i+n//i-2
print(ans) | p02881 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = int(eval(input()))
divisors = make_divisors(n)
ans = 10**... | import math
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n = int(eval(input()))
divisors = make_divisors(n... | p02881 |
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
N=int(eval(inpu... |
from math import sqrt
N=int(eval(input()))
for i in range(int(sqrt(N)),0,-1):
if N%i==0:
a=i
break
b=N//a
print((a-1+b-1)) | p02881 |
n = int(eval(input()))
i = 1
ans = 10**13
while(i*i<=n):
if n%i == 0:
ans = min(ans,n//i+i-2)
i+=1
print(ans) | n = int(eval(input()))
i = 1
ele = []
while i * i <= n:
if n % i == 0:
ele.append([i,n//i])
i += 1
ans = 10**13
for i in range(len(ele)):
ans = min(ans,ele[i][0]+ele[i][1]-2)
print(ans) | p02881 |
n=int(eval(input()))
import math
l=[]
for a in range(1,int(math.sqrt(n))+1):
if n%a==0:
b=int(n/a)
l.append(a+b-2)
print((min(l)))
| n=int(eval(input()))
import math
l=[]
v=n+1-2
for a in range(1,int(math.sqrt(n))+1):
if n%a==0:
b=int(n/a)
temp=a+b-2
if v>temp:
v=temp
print(v)
| p02881 |
n=int(eval(input()))
import math
l=[]
v=n+1-2
for a in range(1,int(math.sqrt(n))+1):
if n%a==0:
b=int(n/a)
temp=a+b-2
if v>temp:
v=temp
print(v)
| n=int(eval(input()))
import math
ans=n+1-2
for i in range(1,int(math.sqrt(n))+1):
if n%i==0:
ans=min(ans,i+n//i-2)
print(ans)
| p02881 |
import math
n = int(eval(input()))
b = 0
list = []
sqrt = math.ceil(math.sqrt(n))
for i in range(1,sqrt+1):
if(n%i==0):
b = i
print((b + (n//b) -2)) | N = int(eval(input()))
ans=1e+18
for i in range(1,int(N**0.5+1)):
if(N%i==0):
ans = min(ans,int(i+N/i-2))
print(ans) | p02881 |
from functools import lru_cache
def factorize(n):
f = []
tmp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
while tmp % i == 0:
f.append(i)
tmp //= i
if tmp != 1:
f.append(tmp)
if not f:
f.append(n)
return f
def distance(s)... | from collections import defaultdict
def factorize(n):
f = defaultdict(int)
tmp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
while tmp % i == 0:
f[i] += 1
tmp //= i
if tmp != 1:
f[tmp] += 1
if not f:
f[n] += 1
return f
def... | p02881 |
n=int(eval(input()))
ans=0
for i in range(1,int(n**0.5)+1):
if n%i==0:
ans=n//i+i-2
print(ans)
| n=int(eval(input()))
ans=n
for i in range(int(n**0.5),0,-1):
if n%i==0:
ans=n//i+i-2
break
print(ans)
| p02881 |
n=int(eval(input()))
ans=n-1
for i in range(2,int(n**0.5)*2):
if n % i == 0:
tmp=i+n//i-2
ans=min(ans,tmp)
print(ans) | n=int(eval(input()))
ans=n-1
for i in range(2,int(n**0.5)+1):
if n%i==0:
tmp=i+n//i-2
ans=min(ans,tmp)
print(ans) | p02881 |
N = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort()
return divisors
l = make_divisors(N)
if len(l) % 2 == 0:
x = l[len(l) // 2 - 1]
y = l[... | N = int(eval(input()))
import math
n = math.sqrt(N)
if n.is_integer():
x = round(n) - 1
print((2 * x))
else:
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
d... | p02881 |
import math
N = int(eval(input()))
a = math.floor(N ** 0.5) + 1
ans = N + 1
for i in range(1, a):
j = N // i
if i * j == N and i + j - 2 < ans:
ans = i + j - 2
print(ans) | import math
N = int(eval(input()))
a = math.floor(N ** 0.5)
ans = N
for x in range(1, a + 1):
if N % x != 0: continue
y = N // x
if ans > x + y - 2:
ans = x + y - 2
print(ans) | p02881 |
n = int(eval(input()))
x = int(n**0.5)
while n%x!=0:
x-=1
x,y = x-1, n//x -1
print((x+y)) | n = int(eval(input()))
x = int(n**0.5)
while n%x!=0: x-= 1
y = n//x
print((x-1+y-1)) | p02881 |
n = int(eval(input()))
l = int(n**0.5)
while l:
if n%l: l-=1
else: break
print(((l-1)+(n//l-1))) | n = int(eval(input()))
x, y = 1, n
for i in range(1, int(n**0.5)+1):
if n%i==0: x = i
y = n//x
print((x+y-2)) | p02881 |
n = int(eval(input()))
min1 = 10**20
for i in range(1,int(n**0.5)+1):
if n/i %1 == 0:
j = n//i
min1 = min(min1,i+j)
print((min1-2)) | n = int(eval(input()))
ans = 10**13
for i in range(1,int(n**0.5//1)+1):
if n%i == 0:
ans = min(ans,i+n//i-2)
print(ans) | p02881 |
import itertools
n = int(eval(input()))
def divisor(n):
i = 1
table = []
while i * i <= n:
if n%i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
l = []
for it in itertools.combinations_with_replacement(divis... | import itertools
n = int(eval(input()))
def divisor(n):
i = 1
table = []
while i * i <= n:
if n%i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
d = divisor(n)
l = float('inf')
for i in range(len(d)):
... | p02881 |
n = int(eval(input()))
for i in range(int(n**0.5), 0, -1):
if n % i == 0:
print((n // i + i - 2))
exit() | # 2019-11-19 19:43:48(JST)
import sys
# import collections
import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import arr... | p02881 |
# 2019-11-19 19:43:48(JST)
import sys
# import collections
import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import arr... | import sys
def divisors(n):
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i: continue
res.append(i)
res.append(n // i)
return res
n = int(sys.stdin.readline().rstrip())
def main():
res = divisors(n)
print((res[-1] + res[-2] - 2))
if __name__ == '__main__':
mai... | p02881 |
from functools import reduce
from operator import mul
def prod(arr):
return reduce(mul, arr, 1)
def fancy(arr, index):
output = []
for i, v in enumerate(index):
if v:
output.append(arr[i])
return output
def prime_factorize(n):
answers = []
while n % 2 == 0... | N = int(eval(input()))
minstep = 9999999999999999999999999999999
for i in range(1, int(N**0.5+1)):
if N%i == 0:
minstep = min(minstep, i+N//i-2)
print(minstep) | p02881 |
N = int(eval(input()))
def factorize(n):
b = 2
fct = []
while b * b <= n:
while n % b == 0:
n //= b
fct.append(b)
b = b + 1
if n > 1:
fct.append(n)
return fct
A = factorize(N)
if len(A) == 1:
ans = N-1
else:
ans = 9999999999999... | from math import ceil, sqrt
N = int(eval(input()))
for i in range(ceil(sqrt(N)),0,-1):
if N%i == 0:
print((i + N//i -2))
break | p02881 |
n = int(eval(input()))
ans = n -1
prime = []
while n != 1:
for i in range(2,int(n**0.5)+1):
if n % i == 0:
prime.append(i)
n /= i
break
else:
prime.append(int(n))
n = 1
for bit in range(1 << len(prime)):
a = 1
b = 1
for... | import sys
n = int(eval(input()))
for i in range(int(n**0.5),0,-1):
if n % i == 0:
print((n//i + i - 2 ))
sys.exit() | p02881 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.