input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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() | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
def enum_divisors(n):
# 約数列挙
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
... | p02881 |
from operator import mul
from functools import reduce
import itertools
import copy
N = int(eval(input()))
# N = i*jをみつける
# (i, j)
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.appen... | import math
N = int(eval(input()))
result = N
for i in range(1, int(math.sqrt(N))+2):
if N % i == 0:
result = min(result, i - 1 + N//i - 1)
print(result)
| p02881 |
from copy import deepcopy
N = int(eval(input()))
def prime_factors(n):
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
n = prime_factors(N)... | 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
n = sorted(make_divisors(N))
sum... | p02881 |
import math
N = int(eval(input()))
answer = N + 1
for a in range(1, math.floor(math.sqrt(N)) + 1):
if N % a == 0:
answer = min(answer, int(a + N / a) - 2)
print(answer) | import math
N = int(eval(input()))
print((min([a + N // a - 2 for a in range(math.floor(math.sqrt(N)) + 1, 0, -1) if N % a == 0])))
| p02881 |
def factorize(n):
fct = [] # prime factor
b, e = 2, 0 # base, exponent
while b * b <= n:
while n % b == 0:
n = n // b
e = e + 1
if e > 0:
fct.extend([b]*e)
b, e = b + 1, 0
if n > 1:
fct.extend([n]*1)
return fct
N = ... | import math
N = int(eval(input()))
tmp = math.ceil(N**(1/2))
ans = N
for i in range(1,tmp+1):
if N%i == 0:
A = max(N//i-1,0)
B = max(i-1,0)
ans = min(ans,A+B)
print(ans) | p02881 |
import math
N = int(eval(input()))
tmp = math.ceil(N**(1/2))
ans = N
for i in range(1,tmp+1):
if N%i == 0:
A = max(N//i-1,0)
B = max(i-1,0)
ans = min(ans,A+B)
print(ans) | N = int(eval(input()))
ans = N
for i in range(1,int(N**(1/2))+1):
if N%i == 0:
A = i-1
B = N//i-1
ans = min(ans,A+B)
print(ans) | p02881 |
n = int(eval(input()))
tmp = 1
for i in range(1,10**6+1):
if n%i == 0:
if i <= n//i:
tmp = i
else:
break
elif tmp == 1 and i >= n/i:
break
print((tmp + (n//tmp) -2)) | n = int(eval(input()))
tmp = 1
for i in range(1,10**6+1): #10**12とかにしてしまうとTLE
#たとえばn=2*大きい素数である時を考えると，この時は全回ししてまう
if n%i == 0:
if i <= n//i:
tmp = i
else:
break
elif tmp == 1 and i >= n/i:
break
print((tmp + (n//tmp) -2)) | p02881 |
n = int(eval(input()))
tmp = 1
for i in range(1,10**6+1):
if n%i == 0:
if i <= n//i:
tmp = i
else:
break
elif i >= n/i:
break
print((tmp + (n//tmp) -2)) | n = int(eval(input()))
tmp = 1
for i in range(1,10**10):
if n%i == 0:
if i <= n//i:
tmp = i
else:
break
elif i >= n/i:
break
print((tmp + (n//tmp) -2)) | p02881 |
import itertools
def primes(n):
l = []
i = 2
while i <= n**(1/2):
while n % i == 0:
n //= i
l.append(i)
i += 1
l.append(n)
return l
def mul(l):
result = 1
for i in l:
result *= i
return result
n = int(eval(input()))
... | import itertools
def primes(n):
l = []
i = 2
while i <= n**(1/2):
while n % i == 0:
n //= i
l.append(i)
i += 1
l.append(n)
return l
def mul(l):
result = 1
for i in l:
result *= i
return result
n = int(eval(input()))
... | p02881 |
import itertools
def primes(n):
l = []
i = 2
while i <= n**(1/2):
while n % i == 0:
n //= i
l.append(i)
i += 1
if n > 1:
l.append(n)
return l
def mul(l):
result = 1
for i in l:
result *= i
return result
n = in... | import math
N = int(eval(input()))
ans = 10**15
for k in range(1, int(math.sqrt(N))+1):
if N % k > 0:
continue
ans = min(ans, k + N//k - 2)
print(ans)
| p02881 |
n = int(eval(input()))
s = int(n ** 0.5)
i = 0
while True:
if n%(s + i) == 0:
k = 1
break
if n%(s - i) == 0:
k = -1
break
i += 1
s = s + i * k
print(((s + n // s) - 2)) | import math
N = int(eval(input()))
a = 1
b = 1
ran = int(math.floor(math.sqrt(N)))
m = 1
for i in range(1,ran+1):
if N%i == 0:
if i > m:
m = i
print((int(m + N/m -2))) | p02881 |
def is_prime(n):
for i in range(2, n + 1):
if i * i > n:
break
if n % i == 0:
return False
return n != 1
# -------- #
data = int(eval(input()))
ng_flag = False
min_value = 9999999
if is_prime(data):
print((data -1))
exit(0)
for i in range(1, ... | 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)
return divisors
min_value = 1000000000000
data = int(eval(input()))
ng_flag = False
divisors_array = make... | p02881 |
N = int(eval(input()))
m = 10**12
for i in range(1, 10**6+1):
if N % i == 0:
m = min(m, i + (N // i))
print((m-2)) | import math
N = int(eval(input()))
# (1, 1)から(a, b)に至るまでの移動回数は(a+b−2)であることに注意すると、
# a*b=N を満たす(a, b)について(a+b−2)の最小値を求めればよい
# 対称性より、O(√N)
# 今回はN=O(10^12)なので間に合う
# a+b-2の最小値を求める
ans = N-1
for i in range(1, int(math.sqrt(N))+1):
if N % i == 0:
ans = min(ans, (N//i)+i-2)
print(ans) | p02881 |
n = int(eval(input()))
dv = 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
div = make_divisors(n)
# pr... | 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 len(div) % 2 == 0:... | p02881 |
import math
import copy
n=int(eval(input()))
i=int(n**0.5)
j=0
# print(i)
for i in range(i+1,0,-1):
# print(i)
if n==i:
print((n-1))
break
if n%i==0:
j=n/i
print((int(i+j-2)))
break
| def main():
n = int(eval(input()))
ans = -1
for i in range(1,int(n**0.5)+1):
if n % i == 0:
a = i
b = n // i
if ans == -1:
ans = a + b - 2
else:
ans = min(ans,a + b - 2)
print(ans)
if __name__ == '__main_... | p02881 |
N = int(eval(input()))
curMin = 10**12+1
for i in range(1, int(N**0.5)+1):
if N % i == 0:
chk = (i - 1) + (N//i - 1)
if curMin <= chk:
break
else:
curMin = min(curMin, (i - 1) + (N//i - 1))
print(curMin) | N = int(eval(input()))
ans = 10**18+1
for i in range(1, int(N**0.5)+1):
if N % i != 0:
continue
j = N // i
ans = min(ans, i+j-2)
print(ans) | p02881 |
n = int(eval(input()))
def factorize(n):
b = 2
fct = []
end = int(n ** (0.5)) + 2
for b in range(2, end):
while n % b == 0:
n //= b
fct.append(b)
if n == 1:
break
if n > 1:
fct.append(n)
return fct
fact = factorize(n)
dif = []
from ite... | n = int(eval(input()))
end = int(n**0.5) + 2
dif = []
for i in range(1, end):
if n % i == 0:
dif.append(abs(n//i + i) - 2)
print((min(dif))) | p02881 |
import math
n=int(eval(input()))
r=int(math.sqrt(n))
l=[]
for a in range(1,r+1):
if n%a == 0:
l.append(a+int(n/a)-2)
print((min(l)))
| import math
n=int(eval(input()))
ans=n
math.ceil(math.sqrt(n))
for a in range(1,math.ceil(math.sqrt(n))+1):
if n % a == 0:
ans=min(ans,a+(n//a)-2)
print(ans)
| p02881 |
n=int(eval(input()))
ans=float('inf')
for i in range(1,int(n**0.5)+2):
if n%i==0:
ans=min(ans,n//i-1+i-1)
print(ans)
| n=int(eval(input()))
ans=float('inf')
for i in range(1,int(n**0.5)+1):
if n%i==0:
ans=min(ans,i-1+n//i-1)
print(ans)
| p02881 |
from math import sqrt
n = int(eval(input()))
stop = int(sqrt(n)) + 1
min_count = 10 ** 100
for a in range(1, stop):
if n % a != 0:
continue
else:
b = n // a
count = a + b - 2
if count < min_count:
min_count = count
print(min_count) | n = int(eval(input()))
stop = int(n**0.5) + 1
min_count = 10 ** 100
for a in range(1, stop):
if n % a != 0:
continue
else:
b = n // a
count = a + b - 2
if count < min_count:
min_count = count
print(min_count) | p02881 |
n = int(eval(input()))
stop = int(n**0.5) + 1
min_count = 10 ** 100
for a in range(1, stop):
if n % a != 0:
continue
else:
b = n // a
count = a + b - 2
if count < min_count:
min_count = count
print(min_count) | n = int(eval(input()))
print((min(i + (n // i) - 2 for i in range(1, int(n**0.5) + 1) if n % i == 0))) | p02881 |
import math
n = int(eval(input()))
p = 10 ** 12
m = math.floor(math.sqrt(n))
for i in range(1,m + 1):
if n % i == 0:
j = n // i
p = min(p,i-1+j-1)
print(p) | from math import sqrt
from math import floor
n = int(eval(input()))
ans = 10 ** 12
m = floor(sqrt(n))
for i in range(1,m+1):
if n % i == 0:
j = n // i
ans = min(ans,i+j-2)
print(ans) | p02881 |
def prime_factors(n): # 戻り値はiterable type
i = 2
while i * i <= n:
if n % i:
i += 1
else:
n //= i
yield i # whileループを進めるごとにイテレータに値を貯め続ける
if n > 1:
yield n
def min2(x,y):
return x if x < y else y
from itertools i... | 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]
def min2(x,y):
... | p02881 |
from functools import reduce
from itertools import combinations
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
... | def factorize(n):
a = []
f = 2
while f * f <= n:
if n % f == 0:
a.append((f, n//f))
f += 1
if not len(a):
a.append((1, n))
return a
n = int(eval(input()))
factor = factorize(n)
ans = int(1e13)
for fa in factor:
a, b = fa
ans = min(ans, a... | 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((int(ans))) | 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) | p02881 |
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(eval(input()))
min = 10 ** 15
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0 and min > i + n // i - 2:
min = i + n // i - 2
print(min)
if __name__ == "__main__":
... | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(eval(input()))
min = 10 ** 15
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
j = n // i
if min > i + j - 2:
min = i + j - 2
print(min)
... | p02881 |
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')
# 約数の全列挙
def divisors(n):
divisors... | N = int(eval(input()))
ans = N - 1
for i in range(1, int(N**0.5) + 10):
if N % i == 0:
j = N // i
ans = min(ans, i + j - 2)
print(ans) | p02881 |
N = int(eval(input()))
ans = N - 1
for i in range(1, int(N**0.5) + 10):
if N % i == 0:
j = N // i
ans = min(ans, i + j - 2)
print(ans) | N = int(eval(input()))
ans = 10**18
for i in range(1, int(N**0.5) + 10):
if N % i > 0:
continue
j = N // i
ans = min(ans, i + j - 2)
print(ans)
| p02881 |
N = int(eval(input()))
ans = N - 1
for i in range(1, int(N**0.5) + 100):
if N % i != 0:
continue
j = N // i
ans = min(ans, i + j - 2)
print(ans)
| N = int(eval(input()))
# 約数の全列挙
def divisors(n):
divisors = []
R = int(n**(0.5)) + 1
for i in range(1, R):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
# divisors.sort(reverse=True) # ソート
return divisors
an... | p02881 |
N = int(eval(input()))
n = int(N**0.5) + 1
A = 0
B = 0
b = 0
for a in range(1, n):
if N % a == 0:
b = N // a
A = a
B = b
ans = (A - 1) + (B - 1)
print(ans) | N = int(eval(input()))
n = int(N**0.5) + 1
for a in range(1, n):
if N % a == 0:
b = N // a
ans = (a - 1) + (b - 1)
print(ans) | p02881 |
import itertools
a = int(eval(input()))
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
... | import itertools
a = int(eval(input()))
def md(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
ab = [[i,a//i] for i in md(a)]
... | p02881 |
import math
N = int(eval(input()))
ans = 10**12
for i in range(1,10**6+1):
j = math.ceil(N/(i+1))
if (1+i)*j == N:
ans = min(i+j-1,ans)
if i == 10**6 and ans == 10**12:
ans = N-1
break
print(ans) | N = int(eval(input()))
ans = 10**12
for i in range(1,10**6+1):
j = N//i
if i*j == N:
ans = min(i+j-2,ans)
if i == 10**6 and ans == 10**12:
ans = N-1
break
print(ans) | p02881 |
N = int(eval(input()))
def prime_factorization(n):
factor = []
f = 2
while f ** 2 <= n:
if n % f == 0:
factor.append(f)
n //= f
else:
f += 1
if n > 1:
factor.append(n)
return factor
p = prime_factorization(N)
from itertool... | N = int(eval(input()))
S = N+1
from math import sqrt
for a in range(int(sqrt(N))+2, 0, -1):
b, y = divmod(N, a)
if y != 0:
continue
S = min(S, a+b)
print((S-2)) | p02881 |
N=int(eval(input()))
bar=10**12
def f(x):
d=[]
for i in range(1,int(x**0.5)+1):
if x%i==0:
d.append(i)
if i!=x//i:
d.append(x//i)
d.sort()
return d
for i in f(N):
for j in f(N):
if i*j==N and i+j<bar:
bar=i+j
x=i
y=j
print((x-1+y-1))
| N=int(eval(input()))
bar=10**12
d=[]
for i in range(1,int(N**0.5)+1):
if N%i==0 and i+N//i<bar:
d.append(i+N//i)
bar=i+N//i
#print(d)
print((min(d)-2)) | p02881 |
n = int(eval(input()))
import math
a = int(math.sqrt(n))
point = 1
for i in range(1,a+1):
if n%i == 0:
point = i
distance = (point-1) + int(n/point)-1
print(distance) | n = int(eval(input()))
a = int(n**0.5)
n1 = 1
n2 = 1
for i in range(a,0,-1):
if n%i==0:
n1 = i
break
n2 = n//n1
print((n2+n1-2))
| p02881 |
N=int(eval(input()))
from itertools import combinations
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)
return divisors
d=make_divisors(N... | N=int(eval(input()))
from itertools import combinations
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)
return divisors
d=make_divisors(N... | p02881 |
#ABC 144 C - Walk on Multiplication Table
N = int(eval(input()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:... | N = int(eval(input()))
ans = N*3
for i in range(1,int(N**0.5)+1):
if N%i==0:
s1 = i
s2 =N/i
if ans > s1+s2:
ans =int(s1+s2)
print((ans-2)) | p02881 |
n = int(eval(input()))
divisors = []
for i in range(1, int(pow(n, 0.5)) + 1):
if n % i == 0:
divisors.append([i, n // i])
divisors = sorted(divisors, key= lambda x:x[1])
res = 0
for i in divisors[0]:
res += i - 1
print(res) | n = int(eval(input()))
divisors = []
for i in range(1, int(pow(n, 0.5)) + 1):
if n % i == 0:
divisors.append([i, n // i])
divisors = sorted(divisors, key= lambda x:x[1])
res = 0
for i in divisors[0]:
res += i - 1
print(res) | p02881 |
n = int(eval(input()))
divisors = []
for i in range(1, int(pow(n, 0.5)) + 1):
if n % i == 0:
divisors.append([i, n // i])
divisors = sorted(divisors, key= lambda x:x[1])
res = 0
for i in divisors[0]:
res += i - 1
print(res) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
# nの約数を列挙列挙する
def make_divisors(n):
divisors = []
for i in range(1, int(pow(n, 0.5)) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
... | p02881 |
from math import sqrt
n=int(eval(input()))
for i in range(int(sqrt(n)+1),-1,-1):
if n%i==0:
print((i+(n//i)-2))
break | #C
from math import sqrt
n=int(eval(input()))
for i in range(int(sqrt(n)+1),-1,-1):
if n%i==0:
print((i+(n//i)-2))
break | p02881 |
import math
n = int(eval(input()))
mini = 1000000000000000
for i in range(1, math.ceil(math.sqrt(n))+1):
if n % i == 0 and ((n/i + i) - 2) < mini:
mini = ((n/i + i) - 2)
print((int(mini))) | import math
n = int(eval(input()))
mini = n+2
for i in range(1, int(math.sqrt(n)+1)):
if not n%i:
if i + int(n/i) -2 < mini:
mini = i + int(n/i) -2
print(mini) | p02881 |
import math
n=int(eval(input()))
for i in reversed(list(range(1,int(math.sqrt(n))+1))):
if n%i == 0:
ans = i+n//i-2
break
print(ans)
| import math
n=int(eval(input()))
r=int(math.sqrt(n))
while n%r!=0:
r-=1
print((n//r+r-2))
| p02881 |
N = int(eval(input()))
ans=N
for i in range(1, int(N**0.5+1)):
if N%i==0:
a = N/i
b = N/a
up_ans = a + b -2
ans = min(ans, up_ans)
else:
continue
print((int(ans))) | N = int(eval(input()))
for i in range(int(N**0.5), 0 , -1):
if N%i == 0:
print((int(N/i + i -2)))
break | p02881 |
n=int(eval(input()))
list=[]
for i in range(1,n+1):
if len(list) == 1 and i>int(n/i):
ans=(list[-1][0]-1)+(list[-1][1]-1)
break
a=n%i
if a == 0:
if(i<n/i):
list.append([i,int(n/i)])
if list[-1][0] == list[-1][1]:
ans=(list[-1... | import math
n = int(eval(input()))
for i in range(int(math.sqrt(n)), 0, -1):
if n % i == 0:
print((int(i + n / i - 2)))
break | p02881 |
N = int(eval(input()))
c = 1
ans = 10**18
while c <= N**0.5:
if N%c == 0:
ans = min(ans, c+N//c)
c += 1
print((ans-2)) | N = int(eval(input()))
ans = N
i = 1
while i <= N**0.5:
if N%i == 0:
ans = min(ans, i+N//i-2)
i += 1
print(ans) | p02881 |
import math
N = int(eval(input()))
A = []
for i in range(2,int(math.sqrt(N))+1):
if N%i == 0:
for j in range(1,N//2+1):
if N == i * j:
A.append(i + j - 2)
if not A:
print((N-1))
else:
print((min(A))) | import math
N = int(eval(input()))
A = []
for i in range(2,int(math.sqrt(N))+1):
if N%i == 0:
A.append(i + (N//i) - 2)
if not A:
print((N-1))
else:
print((min(A))) | p02881 |
import math
A = int(eval(input()))
B = int(math.sqrt(A))
count = 0
for i in reversed(list(range(1,B+1))):
if count == 0:
if A % i == 0:
print((int(i+A/i-2)))
count += 1 | import math
N=int(eval(input()))
P=math.sqrt(N)
C=float("inf")
for i in range (1,int(P+1)):
if N%i==0:
C=min(C,(i+N//i))
print((C-2)) | p02881 |
import math
N=int(eval(input()))
P=math.sqrt(N)
C=float("inf")
for i in range (1,int(P+1)):
if N%i==0:
C=min(C,(i+N//i))
print((C-2)) | import math
N=int(eval(input()))
M=int(math.sqrt(N))
ans=float("inf")
for i in range(1,M+1):
if N%i==0:
ans=min(ans,N//i+i)
print((ans-2))
| p02881 |
n = int(eval(input()))
t = []
for i in range(1, int(n**0.5+1)):
if n % i == 0:
t.append(int(i+n/i))
print((min(t) - 2))
| def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append([i, n // i])
return divisors
n = int(eval(input()))
divisors = make_divisors(n)
print((min([sum(x)-2 for x in divisors])))
| p02881 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
def main():
N = int(eval(input()))
ans = 10e+12
max_sq = int(math.sqrt(N)+1)
for i in range(1, max_sq):
if N % i == 0:
j = N // i
ans = min(ans, i+j-2)
pr... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
def main():
N = int(eval(input()))
ans = N-1
max_sq = int(math.sqrt(N)+1)
for i in range(1, max_sq):
if N % i != 0:
continue
j = N // i
ans = min(ans, i+j-... | p02881 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
def main():
N = int(eval(input()))
ans = N-1
max_sq = int(math.sqrt(N)+1)
for i in range(1, max_sq):
if N % i != 0:
continue
j = N // i
ans = min(ans, i+j-... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): r... | p02881 |
n = int(eval(input()))
def divisor(n):
i = 1
a = 0
b = 0
out = float('inf')
while i * i <= n:
if n%i == 0:
a = i
b = n//i
if a+b < out:
out = a+b
i += 1
return out
print((divisor(n)-2)) | n = int(eval(input()))
def divisor(n):
i = 1
out = float('inf')
while i * i <= n:
if n%i == 0:
out = min((i+n//i),out)
i += 1
return out
print((divisor(n)-2)) | p02881 |
N=int(eval(input()))
L=float("inf")
for i in range(1,int(N**0.5)+1):
if N%i==0:
x,y=i,N//i
l=x+y-2
L=min(L,l)
print(L) | N=int(eval(input()))
ans=min(i-1+N//i-1 for i in range(1,int(N**0.5)+1) if N%i==0)
print(ans) | p02881 |
n=int(eval(input()))
ans=float('inf')
a=1
while n**0.5>=a:
if n%a==0:
ans=min(ans,a+n//a-2)
a+=1
print(ans)
| n=int(eval(input()))
ans=float('inf')
for a in range(1,int(n**0.5+1)):
if n%a==0:
ans=min(ans,a+n//a-2)
print(ans)
| p02881 |
n = int(eval(input()))
ans = n
for i in range(1,int(n**.5)+2):
if n%i == 0:
ans = min(ans, i + n//i - 2)
print(ans) | def divisor(n):
ass = []
for i in range(1, int(n**0.5)+1):
if n%i == 0:
ass.append(i)
ass.append(n//i)
return sorted(ass)
n = int(eval(input()))
p = divisor(n)
ans = n + 10
for x in p:
if x*x > n:
break
y = n//x
if ans > y+x:
ans = y+x
print((a... | p02881 |
N = int(eval(input()))
sqN = int(N**0.5)+1
for i in range(sqN,0,-1):
if N % i == 0:
ans = i+N//i
break
print((ans-2)) | # 約数s
def make_divisors(n):
divisors = []
ret = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
ret.append((i,n//i))
return ret
if __name__ == "__main__":
n = int(eval(input()))
ret = make_divisors(n)
# print(ret)
ans = 10**18
for a,b in ret:
... | p02881 |
import math
N=int(eval(input()))
li=[]
l=0
m=0
for i in range(math.floor(math.sqrt(N))):
if N%(i+1)==0:
l=i
m=N/(i+1)-1
li.append(l+m)
else:
pass
print((int(min(li))))
| N=int(eval(input()))
answer=0
for i in range(int(pow(N,1/2)),0,-1):
if N%i==0:
answer=(i-1)+(N//i-1)
break
print(answer)
| p02881 |
def main():
N = int(eval(input()))
st = [N + 1] # (1,N)
d = 2
while d * d <= N:
if N % d == 0:
st.append(d + N // d) # (d, N // d)
d += 1
print((min(st) - 2))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
ans = N - 1
d = 1
while d * d <= N:
if N % d == 0:
ans = min(ans, d + N // d - 2)
d += 1
print(ans)
if __name__ == '__main__':
main()
| p02881 |
import math
n=int(eval(input()))
num=math.ceil(math.sqrt(n))
c=n+2
for i in range(1,num+1):
if n%i==0 and (i+n//i)<c:
a=i
b=n//i
c=a+b
print((a+b-2))
| import math
n=int(eval(input()))
num=math.ceil(math.sqrt(n))
L=max([i for i in range(1,num+1) if n%i==0])
print((L+n//L-2)) | p02881 |
import math
n=int(eval(input()))
num=math.ceil(math.sqrt(n))
L=max([i for i in range(1,num+1) if n%i==0])
print((L+n//L-2)) | 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)
s=float('inf')
for i... | p02881 |
import math
n=int(eval(input()))
to=int(math.sqrt(n))
a=n*2
for i in range(1,to+1):
if n%i==0:
a=min(a,n//i+i)
print((a-2)) | import math
n=int(eval(input()))
L=[]
for i in range(1,int(math.sqrt(n))+2):
if n%i==0:
L.append((i,n//i))
ans=float("inf")
for i in L:
ans=min(ans,i[0]+i[1]-2)
print(ans) | p02881 |
n=int(eval(input()))
n2=int(n**0.5)
for n3 in range(n2,0,-1):
if n%n3==0:
n4=n/n3
n5=int((n3-1)+(n4-1))
print(n5)
break | n=int(eval(input()))
n2=int(n**0.5)
abmin=n
for i in range(1,n2+1):
if n%i==0:
ab=n//i+i-2
abmin=min(ab,abmin)
print(abmin) | p02881 |
n=int(eval(input()))
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)
if n==divisors[-1]**2:
print((divisors[-1]*2-2))
else:
print((divisors[-1]+divisors[-2]-2)) | n=int(eval(input()))
divisors = []
def a(n):
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
divisors.append(n//i)
divisors.sort()
return divisors
a(n)
x=len(divisors)//2
print((divisors[x]+divisors[x-1]-2)) | p02881 |
n=int(eval(input()))
mini=float('inf')
for i in range(1,int(n**0.5)+1):
if n%i==0:
mini=min(i+(n/i)-2,mini)
print((int(mini))) | 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
lis=make_divisors(n)
x=lis[-1]
if n%x**2==0:
... | p02881 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p02881 |
N=int(eval(input()))
move=int(N**.5)
while N%move!=0:
move-=1
print((N//move+move-2)) | N=int(eval(input()))
move=10**12
for n in range(1,int(N**.5)+1):
if N%n==0:
move=min(move,N//n+n-2)
print(move) | p02881 |
N = int(eval(input()))
root = int(N ** (1/2)) + 1
num = 1
for i in range(root, 0, -1):
if N % i == 0:
num = i
break
num2 = N // num
print((num+num2-2)) | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def make_divisors(n): # nの約数を列挙
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
d... | p02881 |
N = int(eval(input()))
ans = 10 ** 20
for i in range(1, 10 ** 6 + 1):
if i ** 2 > N: break
if N % i == 0:
ans = min(ans, i + N // i - 2)
print(ans) | import sys
def solve():
N = int(eval(input()))
moveN = 10000000000000000000
for i in range(1, N + 1):
if i ** 2 > N: break
if N % i == 0:
moveN = min(i + (N // i) - 2, moveN)
print(moveN)
return 0
if __name__ == "__main__":
solve() | p02881 |
from math import sqrt
N = int(eval(input()))
ans = float("inf")
for k in range(1,int(sqrt(N)+1)+1):
if N%k == 0:
ans = min(ans,k-1+N//k-1)
print(ans)
| import math
N = int(eval(input()))
ans = 10**12 + 1
for k in range(1,math.floor(math.sqrt(N))+1):
if N % k == 0:
ans = min(ans,k+N//k-2)
print(ans)
| p02881 |
import math
N = int(eval(input()))
ans = 10**12 + 1
for k in range(1,math.floor(math.sqrt(N))+1):
if N % k == 0:
ans = min(ans,k+N//k-2)
print(ans)
| import math
N = int(eval(input()))
ans = 10**13
for k in range(1,math.floor(math.sqrt(N))+1):
if N % k == 0:
ans = min(ans,k+N//k-2)
print(ans)
| p02881 |
import itertools
N = int(eval(input()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
... | 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
min_cnt = 10**13
divisor = make_divisors... | p02881 |
n=int(eval(input()))
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.ap... | import math
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
a=make_divisors(n)
if len(a)%2==1:
print((2*int(math.sqrt(n))-2))
if len(a... | p02881 |
N = int(eval(input()))
s = N+1
import math
m = int(math.sqrt(N))+1
for i in range(1,m):
if N%i==0:
a = i
b = N/a
s = min(a+b, s)
print((int(s)-2)) | N = int(eval(input()))
import math
n = int(math.sqrt(N))
s = 0
for i in range(1,n+1):
if N%i == 0 and i > s:
s = i
p = int(s+N/s-2)
print(p) | p02881 |
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
ret = float('inf')
for i in range(1, 10000000):
q, mod = divmod(N, i)
if mod == 0:
j = N // i
ret = min(ret... | import sys
import os
import math
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
max = int(math.sqrt(N) + 1)
ret = float('inf')
for i in range(1, max):
q, mod = divmod(N, i)
if mod == 0:
... | p02881 |
import sys
import os
import math
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = int(sys.stdin.readline().rstrip())
max = int(math.sqrt(N) + 1)
ret = float('inf')
for i in range(1, max):
q, mod = divmod(N, i)
if mod == 0:
... | import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [s... | p02881 |
import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [s... | import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buff... | p02881 |
a=int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
res=[]
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n//i)
if res!=[]:
divisors.append(res)
return divisors
res=m... | 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
a=make_divisors(n)
#print(a)
if a[-1]**2==n:
... | p02881 |
N = int(eval(input()))
dmin = 10**13
for i in range(1,int(N**0.5)+1):
if N%i==0:
j = N//i
dmin = min(dmin,abs(i-1)+abs(j-1))
print(dmin) | N = int(eval(input()))
cmin = 10**12
for i in range(1,int(N**0.5)+1):
if N%i==0:
j = N//i
cmin = min(cmin,i-1+j-1)
print(cmin) | p02881 |
N = int(eval(input()))
cmin = 10**12
for i in range(1,int(N**0.5)+1):
if N%i==0:
j = N//i
cmin = min(cmin,i-1+j-1)
print(cmin) | N=int(eval(input()))
dmin = 10**12+10
for i in range(1,int(N**0.5)+1):
if N%i==0:
n = N//i
dmin = min(dmin,i-1+n-1)
print(dmin) | p02881 |
N=int(eval(input()))
dmin = 10**12+10
for i in range(1,int(N**0.5)+1):
if N%i==0:
n = N//i
dmin = min(dmin,i-1+n-1)
print(dmin) | N = int(eval(input()))
dmin = N+N
for i in range(1,int(N**0.5)+1):
if N%i==0:
dmin = min(dmin,i+N//i-2)
print(dmin) | p02881 |
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sy... | from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sy... | p02881 |
from functools import reduce
import itertools
def solve():
N = int(eval(input()))
primes = itertools.permutations(prime_factorize(N))
min_sub = float('inf')
for p in primes:
p = [1] + list(p) + [1]
for border in range(1, len(p)):
a = reduce(lambda x, y: x*y, p[:bor... | import math
def solve():
N = int(eval(input()))
rootN = math.sqrt(N)
min_val = float('inf')
for a in range(1, math.floor(rootN) + 1):
if N % a == 0:
b = N / a
min_val = min(min_val, a + b - 2)
print((int(min_val)))
if __name__ == '__main__':
s... | p02881 |
#素因数分解
def prime_factorization(N):
n=N
a=2
prime_factor=[]
while a**2<=n:
while n%a==0:
prime_factor.append(a)
n//=a
a+=1
if n>1:
prime_factor.append(n)
return prime_factor
# N=100
N=int(eval(input()))
a=1
b=N//a
dis=abs(a-... | N=int(eval(input()))
a=1
b=N//a
dis=abs(b-a)
for i in range(1,int(N**0.5)+1):
if N%i==0:
_a=i
_b=N//i
_dis=abs(_b-_a)
if _dis<dis:
a=_a
b=_b
dis=_dis
print((a-1+b-1)) | p02881 |
N = int(eval(input()))
i = int(N**0.5)
while N%i!=0:
i -= 1
print((i+N//i-2)) | def solve():
N = int(eval(input()))
n = int(N**0.5)+1
for i in range(n,0,-1):
if N%i==0:
ans = i+N//i-2
break
return ans
print((solve())) | p02881 |
N = int(eval(input()))
from collections import deque
def p_f(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
... | 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
List = make_... | p02881 |
n = int(eval(input()))
max_div_num = 1
for i in range(2, int(n**(1/2) + 1)):
if n % i == 0:
max_div_num = max(i, max_div_num)
x = max_div_num
y = n // max_div_num
print((x + y - 2)) | n = int(eval(input()))
max_div_num = 1
for i in range(2, int(n**(1/2) + 1)):
if n % i == 0:
max_div_num = i
x = max_div_num
y = n // max_div_num
print((x + y - 2)) | p02881 |
N = int(eval(input()))
def dist(i, j):
return i + j - 2
min = 10 ** 24
i = 1
while (i ** 2) <= N:
if 0 == N % i:
j = N // i
d = dist(i, j)
if min > d:
min = d
i += 1
print(d)
| import math
n = int(eval(input()))
ans = 0
for i in range(math.ceil(math.sqrt(n) + 1))[:0:-1]:
if 0 == n % i:
ans = i
break
ans_partner = n // ans
print((ans + ans_partner - 2))
| p02881 |
from functools import reduce
def factorization(n):
'''
素因数分解の結果を返す
例： n = 100 の時、[2, 2, 5, 5]
'''
arr = []
tmp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
if tmp % i == 0:
while tmp % i == 0:
arr.append(i)
tmp //= i
... | def make_divisors(n):
'''
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 + up... | p02881 |
import math
N = int(eval(input()))
for i in range(int(math.sqrt(N))):
if N % (int(math.sqrt(N))-i) == 0:
print((int(N/(int(math.sqrt(N))-i)+int(math.sqrt(N))-i-2)))
break | import math
N = int(eval(input()))
M = int(math.sqrt(N))
for i in range(M):
if N % (M-i) == 0:
print((int(N/(M-i)+M-i-2)))
break
| p02881 |
n=int(eval(input()))
l=1
for i in range(2,int(n**.5)+1):
if n%i<1:l=i
print((l+n//l-2)) | n=int(eval(input()));print((min(i+n//i-2for i in range(1,int(n**.5)+1)if n%i<1))) | p02881 |
def dfs(n):
table =[]
i = 2
while n >= i**2:
# nのその数自身を除いた素因数は√n以下であることから。
while n % i == 0:
table.append(i)
n /= i
i += 1
if n > 1:
table.append(int(n))
# 最後に残った、最大の素因数をリストに入れる。
return table
N = int(eval(input()))
f_list = dfs(N)
... | N = int(eval(input()))
from math import sqrt
def get_divs(n):
divs = []
for i in range(1, int(sqrt(n)) + 1):
if n % i == 0:
divs.append((i, n // i))
return divs
divs = get_divs(N)
ans = float('inf')
for x, y in divs:
ans = min(ans, (x + y - 2))
print(ans) | p02881 |
import collections
import copy
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return ... | import math
x = int(eval(input()))
x_sqrt = int(math.sqrt(x))
min_num = x-1
for i in range(2,x_sqrt+2):
if x % i == 0:
num = i+int(x/i)-2
if num < min_num:
min_num = num
print(min_num) | p02881 |
n = int(eval(input()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
if l... | n = int(eval(input()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
if l... | p02881 |
import math
n = int(eval(input()))
ans = 10**12
for i in range(1, math.ceil(math.sqrt(n))+1):
if n%i == 0:
ans = min(ans, int(i+n/i-2))
print(ans)
| import math
n = int(eval(input()))
ans = float("inf")
for i in range(1, int(math.sqrt(n))+1):
if n%i == 0:
ans = min(ans, i-1+(n//i)-1)
print(ans)
| p02881 |
num = int(eval(input()))
minimam = 10**12
for i in range(1,10**6+1):
q, mod = divmod(num, i)
distance = q + i -2
if mod == 0 and minimam > distance:
minimam = distance
print(minimam) | import math
input_num = int(eval(input()))
num_sqrt = int(math.sqrt(input_num))+1
minimam = input_num
for i in range(1,num_sqrt+1):
q, mod = divmod(input_num, i)
distance = q + i -2
if mod == 0 and minimam > distance:
minimam = distance
print(minimam)
| p02881 |
import math
input_num = int(eval(input()))
num_sqrt = int(math.sqrt(input_num))
minimam = input_num
for i in range(num_sqrt+1,0,-1):
q, mod = divmod(input_num, i)
distance = q + i -2
if mod == 0 and minimam > distance:
minimam = distance
print(minimam) | import math
def main1():
input_num = int(eval(input()))
num_sqrt = int(math.sqrt(input_num))
minimam = input_num
for i in range(num_sqrt+1,0,-1):
q, mod = divmod(input_num, i)
if mod == 0:
distance = q + i -2
if minimam > distance:
mini... | p02881 |
N = int(eval(input()))
from math import sqrt
ab_add = []
for i in range(1, int(sqrt(N)) + 1):
if N % i == 0:
ab_add.append(i + (N // i) - 2)
print((min(ab_add)))
| 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 + n // i) - 2)
if i != n // i:
divisors.append((n // i + i) - 2)
divisors.sort()
return divisors
div = make... | p02881 |
import math
N = int(eval(input()))
for i in range(int(math.sqrt(N)), 0, -1):
if N / i == int(N / i):
print((int(N / i + i - 2)))
exit() | import math
N = int(eval(input()))
for i in range(int(math.sqrt(N)), 0, -1):
if N % i == 0:
print((int(N / i + i - 2)))
exit() | p02881 |
import math
N=int(eval(input()))
A=int(math.sqrt(N))
a=1
b=1
for i in range(1, A+1):
if N%i==0:
a=i
b=N/i
print((int(a+b-2))) | from math import sqrt
N=int(eval(input()))
M=int(sqrt(N))
a=0
for i in range(M,0,-1):
if N%i==0:
a=i
break
b=int(N//i)
print((a+b-2)) | p02881 |
from collections import deque
pf={}
res = []
m= int(eval(input()))
for i in range(2,int(m**0.5)+1):
while m%i==0:
pf[i]=pf.get(i,0)+1
res.append(i)
m//=i
if m>1:
res.append(m)
pf[m]=1
cgg = deque()
for index in range(2**len(res)):
s1 = 1
s2 = 1
for j i... | import math
N = 10000000019
N = 50
N = 10
N = int(eval(input()))
result = []
for i in range(1, math.ceil(math.sqrt(N))+1):
if N % i == 0:
result.append((i + (N // i)) - 2)
print((min(result)))
| p02881 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.