input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
def F(a, b):
def _(n):
c = 0
while n:
n //= 10
c += 1
return c
return _(max(a, b))
N = int(eval(input()))
ans = float('inf')
for a in range(1, N + 1):
b = N // a
if a > b:
break
if b != N / a:
continue
ans = min(ans, F(a, b))
print(ans)
|
def F(a, b):
# def _(n):
# c = 0
# while n:
# n //= 10
# c += 1
# return c
# return _(max(a, b))
return len(str(max(a, b)))
N = int(eval(input()))
ans = float('inf')
n = int(N**0.5) + 1
for a in range(1, n):
b = N // a
if b != N / a:
continue
ans = min(ans, F(a, b))
print(ans)
|
p03775
|
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()))
answer = float('inf')
max = 0
len_div = len(make_divisors(N))
if len_div % 2 == 0:
for i in range(len_div // 2):
A_len = len(str(make_divisors(N)[i]))
B_len = len(str(make_divisors(N)[len_div - i - 1]))
if A_len <= B_len:
max = B_len
else:
max = A_len
# print(A_len, B_len, max)
else:
for i in range(len_div // 2 + 1):
A_len = len(str(make_divisors(N)[i]))
B_len = len(str(make_divisors(N)[len_div - i - 1]))
# print(A_len, B_len)
if A_len <= B_len:
max = B_len
else:
max = A_len
# print(A_len, B_len, max)
print(max)
|
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()))
answer = 0
len_div = len(make_divisors(N))
# print(make_divisors(N))
# print(make_divisors(N))
# print(make_divisors(N))
# print(len(make_divisors(N)))
# print(make_divisors(N)[len_div // 2])
if len_div % 2 == 0:
A_len = len(str(make_divisors(N)[len_div // 2 - 1]))
B_len = len(str(make_divisors(N)[len_div // 2]))
if A_len <= B_len:
answer = B_len
else:
answer = A_len
else:
answer = len(str(make_divisors(N)[len_div // 2]))
# print(make_divisors(N)[len_div // 2])
print(answer)
|
p03775
|
import math
N = int(eval(input()))
div = []
for i in range(1, int(math.sqrt(N))+1):
if N % i == 0:
div.append((i, N//i))
ans = 30
for elem in div:
_, a = elem
cnt = 0
while a > 0:
a //= 10
cnt += 1
ans = min(ans, cnt)
print(ans)
|
import math
N = int(eval(input()))
div = []
for i in range(1, int(math.sqrt(N))+1):
if N % i == 0:
div.append((i, N//i))
ans = 30
for elem in div:
_, a = elem
res = len(str(a))
ans = min(ans, res)
print(ans)
|
p03775
|
import sys
import math
N = int(eval(input()))
for n in range(int(math.sqrt(N)),N+1):
if N%n==0:
print((max(int(math.log10(n)), int(math.log10(N//n)))+1))
sys.exit()
|
import sys
import math
N = int(eval(input()))
for n in range(int(math.sqrt(N))+1,0,-1):
if N%n==0:
print((max(int(math.log10(n)), int(math.log10(N//n)))+1))
sys.exit()
|
p03775
|
def main():
N = int(eval(input()))
def trial_division(n):
divs = []
for i in range(1, int(n**0.5)+1):
if n % i == 0 and i != n//i:
divs.append((i, n//i))
elif n % i == 0 and i == n//i:
divs.append((i, i))
return divs
ans = 10**13
divs = trial_division(N)
for a, b in divs:
ans = min(ans, max(len(str(a)), len(str(b))))
print(ans)
if __name__ == '__main__':
main()
|
def main():
N = int(eval(input()))
def enum_divisors(n):
ans = 10**12
for i in range(1, n+1):
if i*i > n:
break
if n % i == 0:
v1 = str(i)
v2 = str(n//i)
ans = min(ans, max(len(v1), len(v2)))
return ans
print((enum_divisors(N)))
if __name__ == '__main__':
main()
|
p03775
|
def f(a, b):
tmpA, tmpB = a, b
countA = 0
while tmpA:
tmpA //= 10
countA += 1
digitA = countA
countB = 0
while tmpB:
tmpB //= 10
countB += 1
digitB = countB
return max(digitA, digitB)
n = int(eval(input()))
ans = 11
for a in range(1, int(n ** 0.5) + 1):
b = n / a
if f(a, b) < ans and n % a == 0:
ans = f(a, b)
print(ans)
|
def f(a, b):
return max(len(str(a)), len(str(b)))
n = int(eval(input()))
ans = 11
for a in range(1, int(n ** 0.5) + 1):
b = n // a
if n % a == 0 and f(a, b) < ans:
ans = f(a, b)
print(ans)
|
p03775
|
n=int(eval(input()))
for a in range(1,n**2+1):
if n%a==0:
b=n//a
sa=str(a)
sb=str(b)
if a<=b:
ans=len(sb)
else:
break
print(ans)
|
n=int(eval(input()))
for a in range(1,int(n**0.5+1)):
if n%a==0:
b=n//a
sa=str(a)
sb=str(b)
if a<=b:
ans=len(sb)
else:
break
print(ans)
|
p03775
|
def calc_digit(n):
d = 0
while n > 0:
d += 1
n //= 10
return d
n = int(eval(input()))
temp = -1
ans = 12
i = 1
while i * i <= n:
if n % i == 0:
temp = max(calc_digit(i), calc_digit(n // i))
ans = min(temp,ans)
i += 1
print(ans)
|
def count_digit(n):
d = 0
while n > 0:
n //= 10
d += 1
return d
n = int(eval(input()))
i = 1
ans = 11
while i * i <= n:
if n % i == 0:
temp = max(count_digit(i), count_digit(n // i))
if ans > temp:
ans = temp
i += 1
print(ans)
|
p03775
|
import math
N=int(eval(input()))
for i in range(math.ceil(N**0.5),N+1):
if N%i==0:print((len(str(i))));break
|
N=int(eval(input()))
print((min(len(str(N//i))for i in range(1,int(N**.5)+1)if N%i<1)))
|
p03775
|
N = int(eval(input()))
ans = N
def F(a,b):
return max([len(str(i))for i in [a,b]])
for i in range(1,N+1):
if i*i>N:break
if N%i==0:
a,b = i,N//i
ans = min(ans,F(a,b))
print(ans)
|
N = int(eval(input()))
def f(a,b):
res = 0
for i in [a,b]:
res = max(len(str(i)),res)
return res
ans = float("inf")
for a in range(1,N+1):
if a*a>N:break
if N%a==0:
ans = min(ans, f(a,N//a))
print(ans)
|
p03775
|
def calc_digits(num):
ans = 1
while True:
if num // 10 == 0:
break
num //= 10
ans += 1
return ans
def main():
N = int(eval(input()))
n = int(N ** 0.5)
ans = 10 ** 10
for A in range(1, n + 1):
if N % A == 0:
B = int(N / A)
else:
continue
A_digits = calc_digits(A)
B_digits = calc_digits(B)
max_digits = max(A_digits, B_digits)
if max_digits < ans:
ans = max_digits
print(ans)
if __name__ == "__main__":
main()
|
def calc_digits(num):
ans = 1
while True:
if num // 10 == 0:
break
num //= 10
ans += 1
return ans
def main():
N = int(eval(input()))
ans = 10 ** 10
for A in range(1, int(N ** 0.5) + 1):
if N % A != 0:
continue
B = N // A
A_digits = calc_digits(A)
B_digits = calc_digits(B)
max_digits = max(A_digits, B_digits)
if max_digits < ans:
ans = max_digits
print(ans)
if __name__ == "__main__":
main()
|
p03775
|
N = int(eval(input()))
i = int(N**(1/2))
while N%i != 0:
i += 1
print((len(str(i))))
|
N = int(eval(input()))
i = int(N**(1/2))
while N%i != 0:
i -= 1
print((len(str(N//i))))
|
p03775
|
import math
n=int(eval(input()))
l=[]
for i in range(1,int(math.sqrt(n))+2):
if n%i==0:
l+=[max(len(str(i)),len(str(n//i)))]
print((min(l)))
|
n=int(eval(input()))
l=[]
for i in range(1,int(n**0.5)+3):
if n%i==0:
l.append(max(len(str(i)),len(str(n//i))))
print((min(l)))
|
p03775
|
import math
n=int(eval(input()))
ceil=math.ceil(math.sqrt(n))
def f(a,b):
return max(len(str(a)),len(str(b)))
tmp=10**9
for a in range(1,ceil+1):
if n%a==0:
b=n//a
tmp=min(tmp,f(a,b))
print(tmp)
|
n=int(eval(input()))
def f(a,b):
a=len(str(a))
b=len(str(b))
return max(a,b)
ans=10**9
for i in range(1,int(n**0.5)+1):
if n%i==0:
ans=min(ans,f(i,n//i))
print(ans)
|
p03775
|
import math
n = int(eval(input()))
ans = 10**9
for i in range(1,int(math.sqrt(n))+2):
if n % i == 0:
ans = max(len(str(i)),len(str(n//i)))
print(ans)
|
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
def func(a,b):
return max(len(str(a)),len(str(b)))
ans = 10**10
for i in range(1,int(n**0.5)+1):
if n%i == 0:
ans = min(ans,func(i,n//i))
print(ans)
|
p03775
|
n=int(eval(input()))
ans=len(str(n))
from math import floor,sqrt
s=floor(sqrt(n))
f=[]
for i in range(2,s+1):
if n%i==0:
while True:
f.append(i)
n//=i
if n%i!=0:
break
if n!=1:
f.append(n)
l=len(f)
iter=2**l-1
for i in range(2**l):
iter+=1
liter=str(bin(iter))[3:]
a,b=1,1
for j in range(l):
if liter[j]=="0":
a*=f[j]
else:
b*=f[j]
t=max(len(str(a)),len(str(b)))
if t<ans:
ans=t
print(ans)
|
n=int(eval(input()))
ans=len(str(n))
from math import floor,sqrt
s=floor(sqrt(n))
f=[]
ans=len(str(n))
for i in range(2,s+1):
if n%i==0:
t=max(len(str(i)),len(str(n//i)))
if t<ans:
ans=t
print(ans)
|
p03775
|
import math
n = int(eval(input()))
i = int(math.sqrt(n))
while i<=n:
if n%i==0:
print((len(str(i))))
break
i+=1
|
import math
n = int(eval(input()))
i = int(math.sqrt(n))
while i>0:
if n%i==0:
print((len(str(int(n/i)))))
break
i-=1
|
p03775
|
import math
def main():
#infile = open("compprog.txt", mode="r")
n = int(eval(input()))
res = f(1, n)
i = 2
while i <= math.sqrt(n):
if n % i == 0:
this_f = f(i, n // i)
res = this_f if this_f < res else res
i += 1
print(res)
#infile.close()
def f(a, b):
return max(len(str(a)), len(str(b)))
if __name__ == "__main__":
main()
|
import math
def main():
n = int(eval(input()))
res = f(1, n)
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
res = min(res, f(i, n // i))
print(res)
def f(a, b):
return max(len(str(a)), len(str(b)))
if __name__ == "__main__":
main()
|
p03775
|
N=int(eval(input()))
import math
sqN=math.sqrt(N)
sqN=math.floor(sqN)
i=sqN
while N%i!=0:
i-=1
a=math.floor(math.log10(i))+1
b=math.floor(math.log10(N//i))+1
candA=max(a,b)
i=sqN
while N%i!=0:
i+=1
a=math.floor(math.log10(i))+1
b=math.floor(math.log10(N//i))+1
candB=max(a,b)
print((min(candA,candB)))
|
N=int(eval(input()))
import math
sqN=math.sqrt(N)
sqN=math.ceil(sqN)
i=1
ans=float('inf')
def digits(n):
return(math.floor(math.log10(n))+1)
while i <= sqN:
q,r=divmod(N,i)
if r==0:
ans=min(ans,max(digits(i),digits(q)))
i+=1
print(ans)
|
p03775
|
N = int(eval(input()))
def factor(n):
factList = []
i = 1
while i * i <= n:
if n % i == 0:
factList.append(i)
factList.append(n // i)
i += 1
factList.sort()
return factList
fact = factor(N)
ans = float('inf')
for i in range(len(fact)):
f = max(len(str(fact[i])), len(str(fact[-1 - i])))
ans = min(ans, f)
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
ans = len(str(N))
for a in divisors(N):
b = N // a
ans = min(ans, max(len(str(a)), len(str(b))))
print(ans)
|
p03775
|
N=int(eval(input()))
for i in range(int(N**0.5),N+1):
if N%i==0:
print((len(str(i))))
exit(0)
|
N=int(eval(input()))
for i in range(int(N ** 0.5 + 1),-1,-1):
if N % i == 0:
print((len(str(N // i))))
exit(0)
|
p03775
|
N = int(eval(input()))
ans1 = 0
A = '1'
B = str(N)
if len(A)>=len(B):
ans = len(A)
else:
ans = len(B)
for i in range(2,N+1):
A = i
if N%A==0:
B = int(N / A)
A = str(A)
B = str(B)
#print(A, B)
if len(A)>=len(B):
ans1 = len(A)
else:
ans1 = len(B)
if ans1 <= ans:
ans = ans1
if len(str(A))==len(str(B)):
break
print(ans)
|
import math
N = int(eval(input()))
ans1 = 0
A = '1'
B = str(N)
if len(A)>=len(B):
ans = len(A)
else:
ans = len(B)
for i in range(2,int(math.sqrt(N))+1):
A = i
if N%A==0:
B = int(N / A)
A = str(A)
B = str(B)
if len(A)>=len(B):
ans1 = len(A)
else:
ans1 = len(B)
if ans1 <= ans:
ans = ans1
if len(str(A))==len(str(B)):
break
print(ans)
|
p03775
|
import math
N = int(eval(input()))
for n in range(int(math.sqrt(N)), N+1):
if N % n == 0:
print((int(math.log10(n)) + 1))
exit()
print((int(math.log10(N))))
|
import math
N = int(eval(input()))
ans = int(math.log10(N))
for n in range(1, int(math.sqrt(N))+1):
if N % n == 0:
ans = int(math.log10(N // n)) + 1
print(ans)
|
p03775
|
n=int(eval(input()))
halfn=int(2+n**0.5)
for i in range(1,halfn):
if n%i==0:
memo = i
ans = max(len(str(n//memo)), len(str(memo)))
print(ans)
|
N = int(eval(input()))
ans = 0
for i in range(1,int(N**0.5)+1):
if N%i==0:
ans = i
ans_len = max(len(str(ans)), len(str(N//ans)))
print(ans_len)
|
p03775
|
def F(a,b):
a=len(str(a))
b=len(str(b))-2#float型のため
return a if a>b else b
n=int(eval(input()))
o=[]
k=100000000
c=0
m=10000000000
for i in range(1,n):
if c>0:
c-=1
continue
s=n/i
if s.is_integer():
k=F(i,s)
o.append(k)
if k>m:
break
m=k
i=int("1"+"0"*len(str(i)))-i#iを次の位にする
try:
print((min(o)))
except:
print((1))
|
from math import sqrt
def F(A,B):
A=len(str(A))
B=len(str(B))-2
return A if A>B else B
n=int(eval(input()))
o=[]
for a in range(1,int(sqrt(n))+1):
b=n/a
if b.is_integer():
o.append(F(a,b))
print((o[-1]))
|
p03775
|
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力を取得
N = int(eval(input()))
def F(A: int, B: int) -> int:
return max(len(str(A)), len(str(B)))
# 求解処理
ans = len(str(N))
for a in range(1, int(math.sqrt(N)) + 1):
if N % a != 0:
continue
b = int(N / a)
ans = min(ans, F(a, b))
# 結果出力
print(ans)
|
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
N = int(eval(input()))
return N
def F(A: int, B: int) -> int:
"""
10進表記における、Aの桁数とBの桁数のうち大きい方を返す.
Args:\n
A (int): 整数
B (int): 整数
Returns:\n
int: 10進表記における、Aの桁数とBの桁数のうち大きい方
"""
digits_A = len(str(A))
digits_B = len(str(B))
return max(digits_A, digits_B)
def main(N: int) -> None:
"""
メイン処理.
Args:\n
N (int): 整数（1 <= N <= 10^10）
"""
# 求解処理
# 全探索を行い、F(A, B)の最小値を求める
# a <= bとして、sqrt(N)まで探索を行うことで、時間を節約する
ans = len(str(N)) # 初期値として、Nの桁数を入力
for a in range(1, int(math.sqrt(N)) + 1):
# bが整数でない場合、何もしない
if N % a != 0:
continue
# bが整数である場合、a, bのうち桁数が大きい方を求める
b = int(N / a)
ans = min(ans, F(a, b))
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N = get_input()
# メイン処理
main(N)
|
p03775
|
import math
n = int(eval(input()))
ans = float('inf')
i = 1
while i <= math.sqrt(n):
if n % i == 0:
a = int(len(str(i)))
b = int(len(str(n // i)))
ans = min(ans,max(a,b))
i += 1
print(ans)
|
n = int(eval(input()))
i = 1
ans = 0
while i * i <= n:
if n % i == 0:
ans = max(len(str(i)), len(str(n // i)))
i += 1
print(ans)
|
p03775
|
N = int(eval(input()))
ans = 100000
for i in range(1, 2 * 10 ** 7):
if N % i == 0:
ans = min(ans, max(len(str(i)), len(str(N // i))))
print(ans)
|
N = int(eval(input()))
ans = 100000
for i in range(1, 13 * 10 ** 6):
if N % i == 0:
ans = min(ans, max(len(str(i)), len(str(N // i))))
print(ans)
|
p03775
|
def resolve():
n = int(eval(input()))
arr = []
for i in range(1, int(n**0.5+1)):
if n % i == 0:
arr.append(max(i, n/i))
print((len(str(int(min(arr))))))
resolve()
|
def div(n):
a = []
for i in range(1, int(n**0.5+1)):
if n % i == 0:
a.append(i)
a.append(n//i)
return sorted(a)
def resolve():
n = int(eval(input()))
d = div(n)
v = len(str(max(d[len(d)//2], d[len(d)//2-1])))
print(v)
resolve()
|
p03775
|
n = int(eval(input()))
f = float('inf')
for a in range(1, int(n**0.5)+1):
if n % a == 0:
b = n // a
x = max(len(str(a)), len(str(b)))
if f > x:
f = x
print(x)
|
n = int(eval(input()))
sqrt = round(n ** 0.5) + 1
f_min = float('inf')
for i in range(1, sqrt + 1):
if not n % i:
a = str(i)
b = str(n // i)
f = max(len(a), len(b))
f_min = min(f_min, f)
print(f_min)
|
p03775
|
import math
n = int(eval(input()))
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
if is_prime(n):
print((len(str(n))))
exit()
rtn = math.floor(math.sqrt(n))
for i in range(rtn,n+1):
if n % i == 0:
print((len(str(i))))
exit()
|
import math
n = int(eval(input()))
# def is_prime(n):
# if n == 1:
# return False
# for i in range(2,int(n**0.5)+1):
# if n % i == 0:
# return False
# return True
# if is_prime(n):
# print(len(str(n)))
# exit()
# rtn = math.floor(math.sqrt(n))
# for i in range(rtn,n+1):
# if n % i == 0:
# print(len(str(i)))
# exit()
# n = a * b = b * aでなのでa<=bのaの方を求めてその時のbの桁数出力すれば間に合う。
# 上記のようにbの方から求めるとぎり間に合わない。
rtn = math.ceil(math.sqrt(n))
for i in reversed(list(range(1, rtn + 1))):
if n % i == 0:
b = n // i #求めるのはa(=i)ではなくbの方
print((len(str(b))))
exit()
|
p03775
|
from math import sqrt
def F(t):
return max(len(str(t[0])), len(str(t[1])))
N = int(eval(input()))
m = list(map(F,[(r,int(N / r)) for r in range(2, int(sqrt(N)) + 1) if N % r == 0]))
print((min(m) if len(m) != 0 else len(str(N))))
|
N = int(eval(input()))
m = list([max(len(str(t[0])), len(str(t[1]))) for t in [(r,int(N / r)) for r in range(2, int(N ** 0.5) + 2) if N % r == 0]])
print((min(m) if len(m) != 0 else len(str(N))))
|
p03775
|
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)
return divisors
def digit(n):
for i in range(15):
if n>=10**i and n<10**(i+1):
return i+1
break
list = make_divisors(n)
ans = 2345
for i in list:
if max(digit(i), digit(n/i)) < ans:
ans = max(digit(i), digit(n/i))
print(ans)
|
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)
return divisors
def digit(n):
for i in range(11):
if n>=10**i and n<10**(i+1):
return i+1
break
list = make_divisors(n)
ans = 12
for i in list:
if max(digit(i), digit(n/i)) < ans:
ans = max(digit(i), digit(n/i))
print(ans)
|
p03775
|
import math
N = int(eval(input()))
n = int(math.sqrt(N))
while n<= N:
if(N % n == 0):
break
else:
n += 1
print((len(str(n))))
|
import math
N = int(eval(input()))
n = 1
divisor = []
while n*n<= N:
if(N % n == 0):
divisor.append(n)
n+= 1
max_divisor = divisor[-1]
print((len(str(N// max_divisor))))
|
p03775
|
def make_divisors(n):
ans = float("inf")
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
div1 = i
div2 = n // i
res = max(len(str(div1)), len(str(div2)))
ans = min(ans, res)
return ans
if __name__ == '__main__':
n = int(eval(input()))
print((make_divisors(n)))
|
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
def f(a, b):
return max(len(str(a)), len(str(b)))
res = f_inf
for a in range(1, int(pow(n, 0.5)) + 1):
if n % a == 0:
b = n // a
t = f(a, b)
res = min(res, t)
print(res)
if __name__ == '__main__':
resolve()
|
p03775
|
n = int(eval(input()))
start = int(n**0.5 + 1)
for a in range(start,0,-1):
if n%a == 0:
b = n//a
print((len(str(b))))
exit()
|
n = int(eval(input()))
start = int(n**0.5)
for i in range(start,0,-1):
if n%i == 0:
s = str(n//i)
keta = len(s)
print(keta)
break
|
p03775
|
N = int(eval(input()))
def F(a, b):
return max(len(str(a)), len(str(b)))
ans = 100
i = 1
while i <= N**0.5:
if N%i == 0:
ans = min(ans, F(i, N//i))
i += 1
print(ans)
|
N = int(eval(input()))
def f(a, b):
return max(len(str(a)), len(str(b)))
ans = N
i = 1
while i <= N**0.5:
if N%i == 0:
ans = min(ans, f(i, N//i))
i += 1
print(ans)
|
p03775
|
N = int(eval(input()))
# F(A, B)を定義する
def F(A, B):
A = str(A)
B = str(B)
if len(A) >= len(B):
return len(A)
else:
return len(B)
minimumList = []
for a in range(1, int(N**0.5) + 1):
if N % a == 0:
b = N // a
minimumList.append(F(a, b))
print((min(minimumList)))
|
N = int(eval(input()))
# F(A, B)を定義する
def F(A, B):
A = str(A)
B = str(B)
if len(A) >= len(B):
return len(A)
else:
return len(B)
minimumList = []
for a in range(1, int(N**0.5) + 1):
if N % a == 0:
b = N // a # 商
minimumList.append(F(a, b))
print((min(minimumList)))
|
p03775
|
N = int(eval(input()))
for i in range(0,int(N**0.5)):
if N % (int(N**0.5) - i) == 0:
A = (int(N**0.5) - i)
B = N//(int(N**0.5) - i)
break
print((len(str(B))))
|
n = int(eval(input()))
ans = 10**100
for a in range(1,int(n**(0.5))+2):
if n%a == 0:
b = n//a
f = len(str(b))
ans = min(ans,f)
print(ans)
|
p03775
|
def m_c_d(x, y):
if x == 0:
return y
elif y == 0:
return x
else:
return m_c_d(y, x % y)
a = int(eval(input()))
b = 0
for i in range(int(a ** 0.5 + 1), 1, -1):
b = max(m_c_d(a, i), b)
print((max(len(str(b)), len(str(a // b)))))
|
a = int(eval(input()))
b = 10 ** 10
for i in range(1, int(a ** 0.5) + 1):
if a % i == 0:
b = min(b, max(len(str(i)), len(str(a // i))))
print(b)
|
p03775
|
num = int(eval(input()))
def function(a,b):
return (max(len(str(a)),len(str(b))))
d = len(str(num))
for i in range(1,num+1):
if num % i == 0:
b = int(num // i)
c = function(i,b)
if d >= c:
d = c
else:
print(d)
exit()
print(d)
|
num = int(eval(input()))
digits = len(str(num))
ans = digits
for i in range(1,10 ** (digits // 2 + 1)):
if num % i == 0:
target = max(len(str(i)), len(str(num//i)))
if ans >= target:
ans = target
else:
print(ans)
exit()
print(ans)
|
p03775
|
num = int(eval(input()))
digits = len(str(num))
ans = digits
for i in range(1,10 ** (digits // 2 + 1)):
if num % i == 0:
target = max(len(str(i)), len(str(num//i)))
if ans >= target:
ans = target
else:
print(ans)
exit()
print(ans)
|
n=int(eval(input()))
x=int(n**0.5)
for i in range(x):
if n%(x-i)==0:
print((len(str(n//(x-i)))))
break
|
p03775
|
n = int(eval(input()))
dv = []
dved = []
for i in range(1,n//2):
if n%i==0 and not(i in dved):
dv.append(i)
dved.append(n//i)
if i in dved:
break
print((len(str(dved[-1]))if len(dv)>0 else 1))
|
import math
n = int(eval(input()))
dv = []
dved = []
for i in range(1,int(math.sqrt(n)+1)):
if n%i==0 and not(i in dved):
dv.append(i)
dved.append(n//i)
if i in dved:
break
print((len(str(dved[-1]))if len(dv)>0 else 1))
|
p03775
|
# 入力 : 自然数 ex) 12
# 出力 : 約数リスト ex) [2, 2, 3]
def factorization(n):
R = int(n)
s = 0
L = []
div = 2
while s == 0:
for i in range(div, R + 1):
if n % i == 0:
n = n / i
div = i
if n == 1:
s = 1
L.append(i)
break
return L
n = int(eval(input()))
if n == 1:
print((1))
exit()
divs = factorization(n)
N = [i for i in divs] # N = bit探索する桁数
maxDigit = n
# Nの要素の全組み合わせが出力
for i in range(1, 1 << len(N)):
output = []
nonout = []
outNum = 1
nonOutNum = 1
for j in range(len(N)):
if ((i >> j) & 1) == 1:
output.append(N[j]) # このjが今回探索するindexの1つ
outNum *= N[j]
else:
nonout.append(N[j])
nonOutNum *= N[j]
# print("{} vs {}".format(outNum, nonOutNum))
digitOut = 0
digitNonOut = 0
while outNum > 0:
digitOut += 1
outNum = int(outNum / 10)
while nonOutNum > 0:
digitNonOut += 1
nonOutNum = int(nonOutNum / 10)
if max(digitOut, digitNonOut) < maxDigit:
maxDigit = max(digitOut, digitNonOut)
print(maxDigit)
|
# 入力 : 自然数 ex) 12
# 出力 : 約数リスト ex) [(2,2),(3,1)]
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.append((b, e))
b, e = b + 1, 0
if n > 1:
fct.append((n, 1))
return fct
def divisorize(fct):
b, e = fct.pop() # base, exponent
pre_div = divisorize(fct) if fct else [[]]
suf_div = [[(b, k)] for k in range(e + 1)]
return [pre + suf for pre in pre_div for suf in suf_div]
def num(fct):
a = 1
for base, exponent in fct:
a = a * base ** exponent
return a
n = int(eval(input()))
if n == 1:
print((1))
exit()
fct = factorize(n)
maxDigit = n
for div in divisorize(fct):
outNum = num(div)
nonOutNum = int(n/outNum)
digitOut = 0
digitNonOut = 0
while outNum > 0:
digitOut += 1
outNum = int(outNum / 10)
while nonOutNum > 0:
digitNonOut += 1
nonOutNum = int(nonOutNum / 10)
if max(digitOut, digitNonOut) < maxDigit:
maxDigit = max(digitOut, digitNonOut)
print(maxDigit)
|
p03775
|
import math
N = int(eval(input()))
ans = 10
for i in range(1, math.floor(math.sqrt(N))+1):
if N % i == 0:
ans = min(ans, len(str(max(N // i, i))))
print(ans)
|
N = int(eval(input()))
ans = 10
for i in range(1, int(N ** 0.5) + 1):
if N % i == 0:
ans = min(ans, len(str(max(N // i, i))))
print(ans)
|
p03775
|
N = int(eval(input()))
def gk(n):
ans = 0
while n:
ans += 1
n//=10
return ans
if int(N**(1/2)) ** 2 == N:
print(( gk( int(N**(1/2)) )))
else:
for i in range( int(N**(1/2)), N+1):
if N % i == 0:
print(( gk(i) ))
exit(0)
|
N = int(eval(input()))
def gk(n):
ans = 0
while n:
ans += 1
n //= 10
return ans
ans = float("inf")
for i in range(1, int(N**(1/2))+1):
if N % i == 0:
ans = min(ans,gk( N//i))
print(ans)
exit(0)
lst = []
for i in range(2,int(N**(1/2))+1):
if N % i == 0:
ans = 0
while N % i == 0:
ans += 1
N //= i
lst.append( (i,ans) )
cand = [1]
while lst:
p,cnt = lst.pop()
nl = []
# for p ==
|
p03775
|
def f(a, b):
str_a = str(a)
len_a = len(str_a)
str_b = str(b)
len_b = len(str_b)
return len_a if len_a > len_b else len_b
N = int(eval(input()))
min = 10**10
for i in range(1, 10 ** len(str(N))//2):
a = i
if N % a == 0:
b = int(N / a)
else:
continue
if len(str(a)) > len(str(N)) // 2 + 1:
break
ret = f(a, b)
if min > ret:
min = ret
print(min)
|
def f(a, b):
str_a = str(a)
len_a = len(str_a)
str_b = str(b)
len_b = len(str_b)
return len_a if len_a > len_b else len_b
N = int(eval(input()))
min = 10**10
max_iter = 10 ** (len(str(N))//2 + 1)
for i in range(1, max_iter):
a = i
if N % a == 0:
b = int(N / a)
else:
continue
ret = f(a, b)
if min > ret:
min = ret
if min <= len(str(N))//2:
break
print(min)
|
p03775
|
def I(): return int(eval(input()))
N = I()
ans = float('INF')
for i in range(1,int(N**0.5)+1):
if N%i==0:
temp = max(len(str(i)),len(str(N//i)))
ans = min(temp,ans)
print(ans)
|
def I(): return int(eval(input()))
N = I()
ans = float('INF')
for i in range(1,int(N**0.5)+1):
if N%i==0:
ans = min(len(str(N//i)),ans)
print(ans)
|
p03775
|
N = int(eval(input()))
ans = 1<<60
for a in range(1, int(N**0.5)+1):
if N%a==0:
b = N//a
max_len = max(len(str(a)), len(str(b)))
ans = min(ans, max_len)
print(ans)
|
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()))
print((len(str(make_divisors(N)[-1]))))
|
p03775
|
# -*- coding: utf-8 -*-
N = int(eval(input()))
aN = []
i = 1
# かけ合わせる数の左右逆はやる意味ない
while i <= N//i:
if N % i == 0:
aN.append([i, N//i])
i += 1
# 末尾に格納されたペアの右側の数値
print((len(str(aN[-1][1]))))
|
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def divisors(N: int) -> set:
""" 約数の列挙・個数 """
from math import sqrt
# 1とその数はデフォで入れとく
s = {1, N}
# 終点はルート切り捨て
for i in range(2, int(sqrt(N))+1):
# 割り切れるなら、iとN/iを追加
if N % i == 0:
s.add(i)
s.add(N // i)
return s
def compare(a, b):
return max(len(str(a)), len(str(b)))
N = INT()
ans = INF
for div1 in divisors(N):
div2 = N // div1
ans = min(ans, compare(div1, div2))
print(ans)
|
p03775
|
import math
n = int(eval(input()))
nn = int(math.sqrt(n))
for i in range(nn,n+1):
if n%i==0:
print((len(str(i))))
break
|
import math
n = int(eval(input()))
nn = int(math.sqrt(n))
for i in range(nn,0,-1):
if n%i==0:
print((len(str(n//i))))
break
|
p03775
|
from collections import Counter
from itertools import product
n = int(eval(input()))
def prime_factrize(a):
ret = []
while a%2 == 0:
ret.append(2)
a//=2
f = 3
while f * f <= a:
if a % f == 0:
ret.append(f)
a//=f
else:
f+=2
if a != 1:
ret.append(a)
return ret
f = prime_factrize(n)
def func(a, b):
a = len(str(a))
b = len(str(b))
return max(a, b)
ans = float('inf')
for bit in product([0, 1], repeat=(len(f))):
a = 1
b = 1
for i, v in enumerate(bit):
if v == 0: a*=f[i]
else: b*=f[i]
ans = min(ans, func(a, b))
print(ans)
|
n = int(eval(input()))
def func(a, b):
a = len(str(a))
b = len(str(b))
return max(a, b)
ans = float('inf')
for i in range(1, int(n**0.5)+1):
if n%i==0: ans = min(ans, func(i, n//i))
print(ans)
|
p03775
|
import math
n = int(eval(input()))
ans = 10
a = int(math.sqrt(n))
for i in range(a, n+1):
q, mod = divmod(n, i)
if mod == 0:
print((max(list(map(len, list(map(str, [i, q])))))))
exit()
|
n = int(eval(input()))
m = int(n**0.5)
while n%m:
m -= 1
print((len(str(n//m))))
|
p03775
|
def func(a, b):
return max(list(map(len, list(map(str, [a, b])))))
N = int(eval(input()))
min_dig = 10 ** 18
for i in range(1, N + 1):
if not N % i:
j = N // i
if j < i:
break
min_dig = min(min_dig, func(i, j))
print(min_dig)
|
def func(a, b):
return max(list(map(len, list(map(str, [a, b])))))
N = int(eval(input()))
min_dig = 10 ** 18
for i in range(1, int(N ** 0.5) + 1):
if not N % i:
j = N // i
min_dig = min(min_dig, func(i, j))
print(min_dig)
|
p03775
|
import math
N = int(eval(input()))
ans = 1000
for k in range(1,math.floor(math.sqrt(N))+1):
if N % k == 0:
ans = min(ans,max(len(str(k)),len(str(N//k))))
print(ans)
|
import math
N = int(eval(input()))
ans = len(str(N))
for k in range(2,math.floor(math.sqrt(N))+1):
if N % k == 0:
ans = min(ans,max(len(str(k)),len(str(N//k))))
print(ans)
|
p03775
|
# -*- coding: utf-8 -*-
from math import sqrt,ceil,log10
n = int(eval(input()))
nsr = sqrt(n)
for i in range(ceil(nsr),n+1):
if n%i==0:
ret = ceil(log10(i))
if 10**ret==int(i):
print((ret+1))
else:
print(ret)
exit()
|
# -*- coding: utf-8 -*-
n = int(eval(input()))
def cntd(x):
digits = 0
while x/10>0:
x = x//10
digits += 1
return digits
ans = cntd(n)
a = 1
while a*a<=n:
if n%a!=0:
a += 1
continue
b = n//a
cur = max(cntd(a), cntd(b))
if ans>cur:
ans = cur
a += 1
print(ans)
|
p03775
|
n=int(eval(input()))
ans=len(str(n))
for i in range(1,n+1):
if n%i==0:
if n//i<i:
break
else:
ans=min(ans,max(len(str(i)),len(str(n//i))))
print(ans)
|
n=int(eval(input()))
ans=len(str(n))
for i in range(1,int(n**(1/2))+1):
if n%i==0:
ans=min(ans,max(len(str(i)),len(str(n//i))))
print(ans)
|
p03775
|
N = int(eval(input()))
mn=100
for A in range(1,int(N**(0.5))+1):
cnta=0
cntb=0
if N%A==0:
B=N/A
while A>0:
A//=10
cnta+=1
while B>0:
B//=10
cntb+=1
cnt=max(cnta,cntb)
mn=min(mn,cnt)
print(mn)
|
n=int(eval(input()))
for i in range(int(n**(0.5)),0,-1):
if n%i==0:
print((len(str(n//i))))
exit()
|
p03775
|
def F(x,y):
return max(len(str(x)),len(str(y)))
N = int(eval(input()))
dmin = 100
for i in range(1,int(N**0.5)+1):
if N%i==0:
n = N//i
dmin = min(dmin,F(i,n))
print(dmin)
|
N = int(eval(input()))
cmin = 1000
for i in range(1,int(N**0.5)+1):
if N%i==0:
a = str(i)
b = str(N//i)
cmin = min(cmin,max(len(a),len(b)))
print(cmin)
|
p03775
|
from math import sqrt
def solve():
N = int(eval(input()))
mn = float('inf')
for A in range(int(sqrt(N))+1,0,-1):
if N % A == 0:
B = N // A
mn = min(f(A,B), mn)
print(mn)
def f(A,B):
return max(len(str(A)), len(str(B)))
if __name__ == '__main__':
solve()
|
from math import sqrt
def solve():
N = int(eval(input()))
ans = float('inf')
for A in range(1,int(sqrt(N))+1):
if N % A == 0:
ans = min(ans, len(str(N//A)))
print(ans)
if __name__ == '__main__':
solve()
|
p03775
|
import math
def read_input():
n = int(eval(input()))
return n
def submit():
n = read_input()
factor_cand = int(math.ceil(math.sqrt(n)))
while n % factor_cand:
factor_cand += 1
a = int(n / factor_cand)
b = int(factor_cand)
al = len([c for c in str(a)])
bl = len([c for c in str(b)])
print((max(al, bl)))
if __name__ == '__main__':
submit()
|
import math
def read_input():
n = int(eval(input()))
return n
def submit():
n = read_input()
factor_cand = int(math.ceil(math.sqrt(n)))
while n % factor_cand:
factor_cand -= 1
if factor_cand == 1:
nl = len([c for c in str(n)])
print(nl)
return
a = int(n / factor_cand)
b = int(factor_cand)
al = len([c for c in str(a)])
bl = len([c for c in str(b)])
print((max(al, bl)))
if __name__ == '__main__':
submit()
|
p03775
|
import math
N=int(eval(input()))
a=math.ceil(math.sqrt(N))
for i in range(a,((N+1)//10+1)):
if N%i==0:
r=N//i
print((max(len(str(i)),len(str(r)))))
exit()
print((len(str(N))))
|
import math
N=int(eval(input()))
a=math.floor(math.sqrt(N))
for i in range(a,0,-1):
if N%i==0:
r=N//i
print((max(len(str(i)),len(str(r)))))
exit()
print((len(str(N))))
|
p03775
|
N = int(eval(input()))
A = 2
for i in range(int(N**(1/2)), 0, -1):
if N % i == 0:
print((len(str(N//i))))
exit()
|
N = int(eval(input()))
for i in range(int(N**(1/2)), 0, -1):
if N % i == 0:
print((len(str(N//i))))
exit()
|
p03775
|
import math
N = int(eval(input()))
n = int(math.sqrt(N))
if N/n == n:
print((int(math.log10(n)+1)))
else:
while N%n != 0:
n+=1
print((int(math.log10(n) + 1)))
|
import math
N = int(eval(input()))
n = int(math.sqrt(N)) + 1
if N / n == n:
print((int(math.log10(n) + 1)))
else:
while N % n != 0:
n -= 1
print((int(math.log10(N/n) + 1)))
|
p03775
|
import math
N=int( eval(input()))
for r in range (int(math.sqrt(N)),N+1):
if N%r==0:
count=1
for i in range (0,9):
r=r/10
if r<1:
print(count)
break
count+=1
break
|
import math
N=int( eval(input()))
for r in range (int(math.sqrt(N)),0,-1):
if N%r==0:
count=1
l=N/r
for i in range (0,10):
l=l/10
if l<1:
print(count)
break
count+=1
break
|
p03775
|
n=int(eval(input()))
if all(n%i for i in range(2,int(n**.5)+1)):
print((len(str(n))))
exit()
for i in range(int(0-n**.5//-1),n+1):
if n%i==0:
print((len(str(i))))
exit()
|
n=int(eval(input()))
for i in range(int(0-n**.5//-1),1,-1):
if n%i==0:
print((len(str(n//i))))
exit()
print((len(str(n))))
|
p03775
|
# from pprint import pprint
import math
# import collections
n = int(eval(input()))
# n, k = map(int, input().split(' '))
# a = list(map(int, input().split(' ')))
def f(a, b):
return max(math.floor(math.log10(a)) + 1, math.floor(math.log10(b)) + 1)
a = 1
ans = 11
while a <= math.sqrt(n):
if n % a == 0 and f(a, n // a) <= ans:
# print('test', a, n // a, f(a, n // a))
ans = f(a, n // a)
a += 1
print(ans)
|
# from pprint import pprint
import math
# import collections
n = int(eval(input()))
# n, k = map(int, input().split(' '))
# a = list(map(int, input().split(' ')))
def f(a, b):
return max(math.floor(math.log10(a)+1), math.floor(math.log10(b))+1)
a = 1
ans = 11
while a <= math.sqrt(n):
if n % a == 0 and f(a, n // a) <= ans:
ans = f(a, n // a)
a += 1
print(ans)
|
p03775
|
N = int(eval(input()))
ans = float("inf")
c = 1
while c <= int(N**(1/2)//1):
if N%c == 0:
ans = min(ans,max(len(str(c)),len(str(N//c))))
c += 1
print(ans)
|
N = int(eval(input()))
ans = float("inf")
for i in range(1,int(N**(1/2)//1)+1):
if N%i == 0:
ans = min(ans,len(str(N//i)))
print(ans)
|
p03775
|
N = int(eval(input()))
def divisor(n):
cd = []
i = 1
while i*i <= n:
if n%i==0:
cd.append(i)
if i != n//i:
cd.append(n//i)
i+=1
return cd
cd = divisor(N)
ans = len(str(cd[-1]))
print(ans)
|
def solve():
N = int(eval(input()))
n = int(N**0.5)+1
for i in range(n,0,-1):
if N%i==0:
ans = len(str(N//i))
break
return ans
print((solve()))
|
p03775
|
# coding: utf-8
# Your code here!
import math
N=int(eval(input()))
n=int(math.sqrt(N))
dev=0
for i in range(1,n+1):
if N%i==0:
dev=i
print((max(len(str(dev)),len(str(N//dev)))))
|
#codng utf-8
import math
N=int(eval(input()))
n=int(math.sqrt(N))
for i in range(n,0,-1):
if N%i==0:
ans=max(len(str(i)),len(str(N//i)))
break
print(ans)
|
p03775
|
n = int(eval(input()))
jud = []
for i in range(1, int(n**0.5) + 1):
x = n // i
if x * i == n:
jud.append(len(str(x)))
print((min(jud)))
|
def yaku(n):
yalu_l = []
for j in range(1, int(n ** 0.5) + 1):
if n % j == 0:
yalu_l.append([n // j, j])
else:
continue
return yalu_l
ans = 10 ** 9
n = int(eval(input()))
for i in yaku(n):
p = len(str(i[0]))
q = len(str(i[1]))
ans = min(max(p, q), ans)
print(ans)
|
p03775
|
n=int(eval(input()))
for i in range(int((n**0.5+1)//1),0,-1):
if n/i%1==0:
f=max(len(str(i)),len(str(n//i)))
break
print(f)
|
n=int(eval(input()))
s=10**11
for i in range(1,int(n**0.5)+1):
if n%i==0:
s=min(s,max(i,n//i))
print((len(str(s))))
|
p03775
|
n = int(eval(input()))
min_digits = 100
for i in range(int(n ** 0.5) + 1):
a = i + 1
if n % a != 0:
continue
b = n // a
x = max([a, b])
digits = len(str(x))
if digits < min_digits:
min_digits = digits
print(min_digits)
|
def main():
n = int(eval(input()))
m = int(n ** 0.5)
if n < 4:
m += 1
min_f = len(str(n))
for i in reversed(list(range(1, m + 1))):
if n % i == 0:
b = n // i
db = len(str(b))
di = len(str(i))
f = max(db, di)
if f < min_f:
min_f = f
print(min_f)
if __name__ == '__main__':
main()
|
p03775
|
N = int(eval(input()))
a = 100
for n in range(1,1+10**5):
if N%n==0:
a = min(a,max(len(str(n)),len(str(N//n))))
print(a)
|
N = int(eval(input()))
n = int(N**0.5)
while N%n:
n-=1
print((len(str(N//n))))
|
p03775
|
import math
N = int(eval(input()))
sqrt_N = int(math.sqrt(N))
min_F = float('inf')
for i in range(1,sqrt_N + 1):
if N % i == 0:
A = i
B = N // i
if min_F > max(len(str(A)),len(str(B))):
min_F = max(len(str(A)),len(str(B)))
print(min_F)
|
import math
N = int(eval(input()))
N_sqrt = math.floor(math.sqrt(N))
ans = float('inf')
for i in range(1, N_sqrt + 1):
if N % i == 0:
if ans > max(len(str(i)), len(str(N // i))):
ans = max(len(str(i)), len(str(N // i)))
print(ans)
|
p03775
|
from math import sqrt
N = int(eval(input()))
root_N = int(sqrt(N)) + 1
def F(a, b):
return max(len(str(a)), len(str(b)))
min_F = 10**6
for a in range(1, root_N + 1):
if N % a == 0:
b = N // a
min_F = min(min_F, F(a, b))
print(min_F)
|
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
def F(a, b):
return max(len(str(a)), len(str(b)))
N = int(eval(input()))
min_num = 10**9
for divisor in make_divisors(N):
min_num = min(min_num, F(divisor, N // divisor))
print(min_num)
|
p03775
|
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append((i, n//i))
divisors.sort()
return divisors
from math import log10
N = int(eval(input()))
div = make_divisors(N)
def F(A, B):
return max(log10(A)+1, log10(B)+1)
ans = 10**9
for a, b in div:
ans = min(ans, F(a, b))
print((int(ans)))
|
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5) + 1):
if n % i == 0:
divisors.append((i, n//i))
divisors.sort()
return divisors
from math import log10
N = int(eval(input()))
div = make_divisors(N)
def F(A, B):
return max(int(log10(A))+1, int(log10(B))+1)
ans = 10**9
for a, b in div:
ans = min(ans, F(a, b))
print(ans)
|
p03775
|
import math
N = int(eval(input()))
ans = float("inf")
for i in range(1, math.ceil(math.sqrt(N)) + 1):
if N % i == 0:
tmp = max(len(str(i)), len(str(N // i)))
ans = min(ans, tmp)
print(ans)
|
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
return divisors
def F(A, B):
return max(len(list(map(int, str(A)))), len(list(map(int, str(B)))))
N = int(eval(input()))
divs = make_divisors(N)
ans = 10**10
for A in divs:
B = N//A
ans = min(ans, F(A, B))
print(ans)
|
p03775
|
N=int(eval(input()))
M=int((N**(1/2)))
mult=0
while 1:
for i in [-1,1]:
x=M+i*mult
if not N%x:
print((max([len(str(x)),len(str(int(N/x)))])))
exit()
mult+=1
|
N=int(eval(input()))
M=int((N**(1/2)))
print((min([max([len(str(i)),len(str(int(N/i)))]) for i in range(1,M+1) if N%i==0])))
|
p03775
|
N = int(eval(input()))
for i in range(int(0 - N ** .5 // -1),1,-1):
if N % i == 0:
print((len(str(N // i))))
exit()
print((len(str(N))))
|
N = int(eval(input()))
for i in range(int(N**0.5//1+1),1,-1):
if N % i == 0:
print((len(str(N // i))))
exit()
print((len(str(N))))
|
p03775
|
import math
n = int(eval(input()))
ans = int(math.sqrt(n))
while True:
if n % ans == 0:
break
else:
ans += 1
print((len(str(ans))))
|
import math
n = int(eval(input()))
ans = int(math.sqrt(n))
while True:
if n % ans == 0:
ans = n // ans
break
else:
ans -= 1
print((len(str(ans))))
|
p03775
|
n = int(eval(input()))
def cal(a):
return len(str(a))
m = 11
for j in range(1,10**6+1):
if n%j==0:
m = min(m,max(cal(j),cal(n//j)))
# print(m)
print(m)
|
n = int(eval(input()))
def cal(a):
return len(str(a))
m = 11
for j in range(1,10**5+1):
if n%j==0:
m = min(m,max(cal(j),cal(n//j)))
# print(m)
print(m)
|
p03775
|
import math
n=int(eval(input()))
f=[]
for a in range(1,math.floor(n**(1/2))+1):
if n%a==0:
b=n//a
f.append(len(str(b)))
print((min(f)))
|
import math
n=int(eval(input()))
f=[]
for a in range(1,math.floor(n**(1/2))+1):
if n%a==0:
f.append(len(str(n//a)))
print((min(f)))
|
p03775
|
n = int(eval(input()))
ans = 10
def F(a,b):
return max(len(str(a)),len(str(b)))
i = 1
while i * i <= n:
if n%i == 0:
ans = min(ans,F(i,n//i))
#print(i,n//i)
i += 1
print(ans)
|
import math
n = int(eval(input()))
s = int(math.sqrt(n))
ans = 10**11
for i in range(1,s+1):
if n%i == 0:
z = n//i
ans = min(ans,len(str(z)))
print(ans)
|
p03775
|
n = int(eval(input()))
ans = 11
for i in range(1, int(-(-n**.5//1))+1):
x, r = divmod(n, i)
if r == 0:
ans = min(ans, max([len(str(x)) for x in (i, x)]))
print(ans)
|
n = int(eval(input()))
INF = 10**18
ans = INF
def F(a, b):
return max(len(str(a)), len(str(b)))
for i in range(1, int(n**.5)+1):
if n % i == 0:
x = F(i, n//i)
if x < ans:
ans = x
print(ans)
|
p03775
|
N = int(eval(input()))
def f(a, b):
return len(list(a)) if len(list(a)) > len(list(b)) else len(list(b))
min_x = len(list(str(N)))
for i in range(1, N // 2 + 1):
if N % i == 0:
min_x = min(min_x, f(str(i), str(N // i)))
if len(str(i)) >= len(str(N // i)):
break
print(min_x)
|
import math
def f(a, b):
return len(list(str(max(a, b))))
N = int(eval(input()))
ans = len(str(N))
for i in range(1, int(math.sqrt(N)) + 1):
if N % i == 0:
ans = min(ans, f(i, N // i))
print(ans)
|
p03775
|
import math
def divisor(div, N):
# 約数
i = 1
n = N
while i <= math.sqrt(n):
if n % i == 0:
div.append([i, n // i])
i += 1
def main():
N = int(eval(input()))
div = []
divisor(div, N)
print((max(int(math.log10(div[-1][0]) + 1),
int(math.log10(div[-1][1]) + 1))))
return
main()
|
import math
def divisor(div, n):
# 約数
ini = 1 if n % 2 else 2
for i in range(ini, int(math.sqrt(n)) + 1, 2):
if n % i == 0:
div.append([i, n // i])
def main():
N = int(eval(input()))
div = []
divisor(div, N)
print((max(int(math.log10(div[-1][0]) + 1),
int(math.log10(div[-1][1]) + 1))))
return
main()
|
p03775
|
import math
n=int(eval(input()))
for i in range(int(math.sqrt(n)),n+1):
if n%i==0:print((max(len(str(i)),len(str(n//i)))));break
|
import math
n=int(eval(input()))
for i in range(int(math.sqrt(n)),0,-1):
if n%i==0:print((max(len(str(i)),len(str(n//i)))));break
|
p03775
|
import math
N = int(eval(input()))
ans = len(str(N))
for i in range(2, int(math.sqrt(N)) + 1):
if N % i == 0:
ans = min(ans, len(str(N // i)))
print(ans)
|
from math import ceil
def divisors(n):
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
res.append(i)
if i != n // i:
res.append(n // i)
return res
n = int(eval(input()))
divs = divisors(n)
divs.sort()
lim = ceil(len(divs) / 2)
ans = 11
for i in range(lim):
a = divs[i]
b = divs[(-1) * (i + 1)]
f = max(len(str(a)), len(str(b)))
ans = min(ans, f)
print(ans)
|
p03775
|
N = int(eval(input()))
ans = N
pred = N
for i in range(1, N//2):
d = 0
if N % i == 0:
d = max(len(str(i)), len(str(N//i)))
ans = min(ans, d)
if d > pred:
break
pred = d
print(ans)
|
N = int(eval(input()))
ans = N
for i in range(1, N):
if i**2 > N:
break
d = 0
if N % i == 0:
d = max(len(str(i)), len(str(N//i)))
ans = min(ans, d)
print(ans)
|
p03775
|
import math
def F(A,B):
if A > B:
return len(str(A))
else:
return len(str(B))
N = int(eval(input()))
min = F(1,N)
rt = int(math.sqrt(N))
for i in range(rt,N+1):
if N % i != 0:
continue
f = F(i,int(N/i))
if f < min:
min = f
break
print(min)
|
import math
def F(A,B):
if A > B:
return len(str(A))
else:
return len(str(B))
N = int(eval(input()))
min = F(1,N)
rt = int(math.sqrt(N))
for i in range(2,rt+1):
if N % i != 0:
continue
f = F(i,int(N/i))
if f < min:
min = f
print(min)
|
p03775
|
N = int(eval(input()))
def is_square(n):
m = int(n**.5)
return True if abs(m*m - n) < 1e-6 else False
divs = []
f = False
if is_square(N):
divs = [int(N**.5)]*2
f = True
for i in range(int(N**.5),0,-1):
if f: break
if N % i == 0: divs += [i, N//i]
if len(divs) >= 2: break
print((max([len(str(x)) for x in divs])))
|
n = int(eval(input()))
sn = int(n**.5)
if (sn)*(sn)==n:
print((len(str(sn))))
quit()
divisors = []
c = 0
for i in range(int(n**.5)+1, 0, -1):
if n % i == 0:
divisors.append(i)
c += 1
if i != n // i:
divisors.append(n//i)
c += 1
if c >= 2:
break
print((len(str(max(divisors)))))
|
p03775
|
import sys
import math
n = int(sys.stdin.readline().strip())
a = math.ceil(math.sqrt(n))
for i in range(a, n+1):
if n % i == 0:
m1 = i
m2 = int(n/i)
break
else:
continue
ord1 = int(math.log10(m1) + 1)
ord2 = int(math.log10(m1) + 1)
ans = max(ord1, ord2)
print(ans)
|
import sys
import math
n = int(sys.stdin.readline().strip())
a = math.ceil(math.sqrt(n))
ans = 10
i = a
while i > 0:
if n % i == 0:
m1 = i
m2 = int(n/i)
m = max(m1, m2)
ord_m = int(math.log10(m) + 1)
ans = min(ans, ord_m)
i -= 1
print(ans)
|
p03775
|
n = int(eval(input()))
lis = []
for a in range(1, n+1):
if n % a == 0:
if len(str(a)) <= len(str(int(n/a))):
lis.append(max(a, int(n/a)))
else:
break
print((len(str(min(lis)))))
|
n = int(eval(input()))
lis = []
for a in range(1, int(n**0.5)+1):
if n % a == 0:
lis.append(max(a, int(n/a)))
print((len(str(min(lis)))))
|
p03775
|
import math
N = int(eval(input()))
for i in range(math.ceil(N**.5), N+1):
if N%i == 0:
print((len(str(i))))
break
|
N = int(eval(input()))
P = [i for i in range(1, int(N**.5)+1)][::-1]
for i in P:
if N%i == 0:
print((len(str(N//i))))
break
|
p03775
|
import math
N = int(eval(input()))
n = math.floor(math.sqrt(N))
i=0
while True:
if N%(n+i) == 0:
print((len(str((n+i)))))
exit()
else: i+=1
|
import math
N = int(eval(input()))
n = math.floor(math.sqrt(N))
for i in range(n):
if N%(n-i) == 0:
print((len(str(N//(n-i)))))
exit()
|
p03775
|
N = int(eval(input()))
min_len = len(str(N))
for i in range(1, int(N ** (1/2)) + 1) :
if N % i == 0 :
min_len = min(min_len, max(len(str(i)), len(str(int(N/i)))))
print(min_len)
|
import math
N = int(eval(input()))
def f(a, b):
return max(len(str(a)), len(str(b)))
max_len = 0
for i in range(1, int(math.sqrt(N)) + 1) :
if N % i == 0 :
max_len = f(i, N // i)
print(max_len)
|
p03775
|
N=int(eval(input()))
count=0
lis=[]
for i in range(1,N+1):
if N/i==N//i:
if N/i < i:
break
lis.append(i)
llis=[]
for x in lis:
y = N / x
mm=max([x,y])
ketasuu=len(str(int(mm)))
llis.append(ketasuu)
print((min(llis)))
|
N=int(eval(input()))
count=0
lis=[]
for i in range(1,N+1):
if N/i < i:
break
if N/i==N//i:
lis.append(i)
llis=[]
for x in lis:
y = N / x
mm=max([x,y])
ketasuu=len(str(int(mm)))
llis.append(ketasuu)
print((min(llis)))
|
p03775
|
import math
N=int(eval(input()))
# rootを求める
root_n = int(math.sqrt(N))
up_n = root_n
up_ans = 0
keta = lambda x: len(str(x))
while up_n <= N:
if N % up_n == 0:
pair = int(N/up_n)
# 桁数を求める
up_ans = max(keta(pair), keta(up_n))
break
else:
up_n+=1
print(up_ans)
|
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
import math
N=int(eval(input()))
INF = 3000000
# rootを求める
# 二分探索すればいいのか！！！
ans = INF
pairs = make_divisors(N)
keta = lambda x: len(str(x))
for pair in pairs:
tmp_ans = max(keta(pair), keta(int(N/pair)))
ans = min(ans,tmp_ans)
print(ans)
# root_n = int(math.sqrt(N))
# up_n = root_n
# up_ans = 0
# while up_n <= N:
# if N % up_n == 0:
# pair = int(N/up_n)
# # 桁数を求める
# break
# else:
# up_n+=1
# print(up_ans)
|
p03775
|
import math
n = int(eval(input()))
if n < 10:
print((1))
else:
a = 0
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
a = i
b = n//a
j = 1
while True:
m = b / (10**j)
if m>=1 and m<10:
ans = j+1
break
j+=1
print(ans)
|
import math
n = int(eval(input()))
a = 0
for i in range(1, int(math.sqrt(n))+1):
if n % i == 0:
a = i
b = n//a
j = 0
while True:
m = b / (10**j)
if m>=1 and m<10:
ans = j+1
break
j+=1
print(ans)
|
p03775
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.