s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s153820525 | p03775 | u286422818 | 1593364918 | Python | Python (3.8.2) | py | Runtime Error | 49 | 9192 | 283 | N = int(input())
def digit(N):
d = 0
while N >= 1:
N /= 10
d += 1
return d
f = []
for i in range(1, N):
if i * i > N:
break
if N % i == 0:
d1 = digit(i)
d2 = digit(int(N/i))
f.append(max(d1, d2))
print(min(f))
|
s992591149 | p03775 | u515740713 | 1593342887 | Python | Python (3.8.2) | py | Runtime Error | 42 | 9288 | 564 | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
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
if i == 1:
return 1
else:
return upper_divisors[-1]
N = int(readline())
ans = make_divisors(N)
print(len(str(ans))) |
s142436151 | p03775 | u515740713 | 1593342739 | Python | Python (3.8.2) | py | Runtime Error | 45 | 9196 | 518 | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
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 upper_divisors[-1]
N = int(readline())
ans = make_divisors(N)
print(len(str(ans))) |
s594093456 | p03775 | u099300051 | 1593186188 | Python | Python (3.8.2) | py | Runtime Error | 43 | 9152 | 163 | import math
N=int(input())
frac=[]
result=len(str(N))
for i in range(1,math.ceil(math.sqrt(N))):
if N%i==0:
frac.append(len(str(int(N/i))))
print(min(frac)) |
s930345714 | p03775 | u750822433 | 1593006148 | Python | PyPy3 (7.3.0) | py | Runtime Error | 82 | 74268 | 155 | N=int(input())
for i in range(1,N):
if(N%i==0):
j=int(N/i)
ans=max(len(str(i)),len(str(j)))
if(N<i**2):
break
print(ans)
|
s653858748 | p03775 | u944731949 | 1592978742 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9168 | 659 | import sympy
N = int(input())
div_arr = sympy.divisors(N)
if len(div_arr) == 1:
print(1)
elif len(div_arr) == 2:
ans_num = max(div_arr)
print(len(str(ans_num)))
else:
memo = []
if len(div_arr) % 2 == 0:
last_idx = -1
count = 0
for i in range(len(div_arr)):
count += 1
if N == div_arr[i] * div_arr[last_idx] and count != len(div_arr) // 2:
last_idx -= 1
memo.append(len(str(div_arr[last_idx])))
else:
break
else:
target_index = len(div_arr) // 2
memo.append(len(str(div_arr[target_index])))
print(min(memo)) |
s909185284 | p03775 | u944731949 | 1592978592 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 657 | import sympy
N = int(input())
div_arr = sympy.divisors(N)
if len(div_arr) == 1:
print(1)
if len(div_arr) == 2:
ans_num = max(div_arr)
print(len(str(ans_num)))
else:
memo = []
if len(div_arr) % 2 == 0:
last_idx = -1
count = 0
for i in range(len(div_arr)):
count += 1
if N == div_arr[i] * div_arr[last_idx] and count != len(div_arr) // 2:
last_idx -= 1
memo.append(len(str(div_arr[last_idx])))
else:
break
else:
target_index = len(div_arr) // 2
memo.append(len(str(div_arr[target_index])))
print(min(memo)) |
s967723909 | p03775 | u944731949 | 1592978513 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9168 | 628 | import sympy
N = int(input())
div_arr = sympy.divisors(N)
if len(div_arr) == 1:
print(1)
if len(div_arr) == 2:
ans_num = max(div_arr)
else:
memo = []
if len(div_arr) % 2 == 0:
last_idx = -1
count = 0
for i in range(len(div_arr)):
count += 1
if N == div_arr[i] * div_arr[last_idx] and count != len(div_arr) // 2:
last_idx -= 1
memo.append(len(str(div_arr[last_idx])))
else:
break
else:
target_index = len(div_arr) // 2
memo.append(len(str(div_arr[target_index])))
print(min(memo)) |
s379481679 | p03775 | u944731949 | 1592978400 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9088 | 579 | import sympy
N = int(input())
div_arr = sympy.divisors(N)
if len(div_arr) == 1:
print(1)
else:
memo = []
if len(div_arr) % 2 == 0:
last_idx = -1
count = 0
for i in range(len(div_arr)):
count += 1
if N == div_arr[i] * div_arr[last_idx] and count != len(div_arr) // 2:
last_idx -= 1
memo.append(len(str(div_arr[last_idx])))
else:
break
else:
target_index = len(div_arr) // 2
memo.append(len(str(div_arr[target_index])))
print(min(memo)) |
s190504970 | p03775 | u944731949 | 1592978341 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9116 | 728 | import sympy
N = int(input())
div_arr = sympy.divisors(N)
if len(div_arr) == 1:
print(1)
if len(div_arr) == 2:
ans_num = max(div_arr)
else:
memo = []
if len(div_arr) % 2 == 0:
last_idx = -1
count = 0
for i in range(len(div_arr)):
print(div_arr)
print(div_arr[i] * div_arr[last_idx])
count += 1
if N == div_arr[i] * div_arr[last_idx] and count != len(div_arr) // 2:
last_idx -= 1
memo.append(len(str(div_arr[last_idx])))
else:
break
else:
print(div_arr)
target_index = len(div_arr) // 2
memo.append(len(str(div_arr[target_index])))
print(min(memo)) |
s652785575 | p03775 | u944731949 | 1592978299 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9180 | 757 | import sympy
N = int(input())
div_arr = sympy.divisors(N)
if len(div_arr) == 1:
print(1)
if len(div_arr) == 2:
ans_num = max(div_arr)
print(len(str(ans_num)))
else:
memo = []
if len(div_arr) % 2 == 0:
last_idx = -1
count = 0
for i in range(len(div_arr)):
print(div_arr)
print(div_arr[i] * div_arr[last_idx])
count += 1
if N == div_arr[i] * div_arr[last_idx] and count != len(div_arr) // 2:
last_idx -= 1
memo.append(len(str(div_arr[last_idx])))
else:
break
else:
print(div_arr)
target_index = len(div_arr) // 2
memo.append(len(str(div_arr[target_index])))
print(min(memo)) |
s937876914 | p03775 | u349765885 | 1592874084 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 74776 | 321 | import math
#N=int(input())
#考えるべき範囲
ans=11
#絶対ありえない数を定義しておく
for i in range(1,int(math.sqrt(N))+1):
if N%i !=0:
continue
else:
A=N//i
A=str(A)
i=str(i)
F=max(len(A),len(i))
if F<ans:
ans=F
print(ans)
|
s751797233 | p03775 | u486448566 | 1592576338 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9168 | 301 | n = int(input())
min_len = len(n)
for i in range(1,n+1):
for j in range(1,n+1):
if n%i != 0 or n%j !=0:
break
if i*j > n:
break
if n == i*j:
if max(len(str(i)),len(str(j))) < min_len:
min_len = max(len(str(i)),len(str(j)))
break
print(min_len) |
s537967288 | p03775 | u912650255 | 1592085162 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3060 | 162 | N = int(input())
count = []
for a in range(1,N//2+1):
if N % a == 0:
b = N // a
count.append(max(len(str(a)),len(str(b))))
print(min(count)) |
s919765503 | p03775 | u808585569 | 1591911748 | Python | Python (3.4.3) | py | Runtime Error | 33 | 3060 | 118 | N = int(input())
A = []
for i in range(int(N**0.5)):
if N%(i+1) == 0:
A.append(i)
print(len(str(int(N/A[-1]))))
|
s028158840 | p03775 | u347134705 | 1591797945 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 194 | N = int(input())
def m(A,B):
a = min(len(str(A)),len(str(B)))
return a
min_a = 0
for i in 1000:
for j in 1000:
if N == i*j:
min_a = m(i*j,min_a)
print(min_a)
|
s071601508 | p03775 | u227085629 | 1591644772 | Python | Python (3.4.3) | py | Runtime Error | 29 | 2940 | 139 | import math
n = int(input())
k = int(math.sqrt(n))
for i in range(k+2,1,-1):
if n%i == 0:
a = n//i
break
s = len(str(a))
print(s) |
s881317882 | p03775 | u227085629 | 1591644526 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 331 | import math
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
n = int(input())
if is_prime(n):
print(int(math.log(a,10))+1)
k = int(math.sqrt(n))
for i in range(k,n+1):
if n%i == 0:
a = i
break
s = int(math.log(a,10))+1
print(s) |
s104262098 | p03775 | u759412327 | 1591643915 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | N = int(input())
x = int(n**.5)
while N%x:
x-=1
print(len(str(N//x))) |
s386335562 | p03775 | u759412327 | 1591643858 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | N = int(input())
x = int(n**.5)
while n%x:
x-=1
print(len(str(n//x))) |
s279697992 | p03775 | u245960901 | 1591410588 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 258 | import math
s = list(map(int, input().split()))
n=s[0]
ans=math.inf
for a in range(1,int(math.sqrt(n))):
b=n/a
if b.is_integer():
b=int(b)
if max(len(str(a)),len(str(b)))<ans:
ans = max(len(str(a)), len(str(b)))
print(ans) |
s042215980 | p03775 | u245960901 | 1591410503 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 258 | import math
s = list(map(int, input().split()))
n=s[0]
ans=math.inf
for a in range(1,int(math.sqrt(n))):
b=n/a
if b.is_integer():
b=int(b)
if max(len(str(a)),len(str(b)))<ans:
ans = max(len(str(a)), len(str(b)))
print(ans) |
s679303817 | p03775 | u433515605 | 1591394405 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 155 | N = int(input())
sosuu = 1
for i in range(1,int(math.sqrt(N+1))):
if N % i == 0:
sosuu = i
B = N // i
print(len(str(max(sosuu, B))))
|
s993762854 | p03775 | u433515605 | 1591394328 | Python | Python (3.4.3) | py | Runtime Error | 30 | 2940 | 166 | import math
N = int(input())
sosuu = 1
for i in range(1,int(math.sqrt(N))):
if N % i == 0:
sosuu = i
B = N // i
print(len(str(max(sosuu, B))))
|
s393702094 | p03775 | u134019875 | 1591081158 | Python | Python (3.4.3) | py | Runtime Error | 26 | 3064 | 569 | def pfact(n):
d = {}
while n % 2 == 0:
d[2] = 1 if 2 not in d else d[2] + 1
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
d[f] = 1 if f not in d else d[f] + 1
n //= f
else:
f += 2
if n != 1:
d[n] = 1 if n not in d else d[n] + 1
return d
n = int(input())
d = pfact(n)
L = sorted(d, reverse=True)
a = L[0]
d[L[0]] -= 1
b = 1
for k in L:
while d[k] > 0:
if b > a:
a, b = b, a
b *= k
d[k] -= 1
print(max(len(str(a)), len(str(b))))
|
s549212319 | p03775 | u540290227 | 1590854761 | Python | Python (3.4.3) | py | Runtime Error | 46 | 3060 | 192 | n = int(input())
low, upper = [], []
i = 1
while i*i <= n:
if n % i == 0:
low.append(i)
if i != n//i:
upper.append(n//i)
i += 1
print(len(str(min(upper)))) |
s950355575 | p03775 | u262481526 | 1590766109 | Python | Python (3.4.3) | py | Runtime Error | 2103 | 3060 | 316 | N = int(input())
max_num = []
def yakusu(num):
cd = []
for i in range(1, int(num*0.5 + 1)):
if num % i ==0:
cd.append(i)
return cd
for A in yakusu(N):
for B in yakusu(N):
if A * B == N:
max_num.append(max(A, B))
print(len(str(max(max_num)))) |
s274927511 | p03775 | u538632589 | 1590363648 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3060 | 217 | from math import ceil, log10, sqrt
n = int(input())
ans = 0
for i in range(ceil(sqrt(n)))[::-1]:
if n % i == 0:
a = i
b = n//i
ans = max(len(str(a)), len(str(b)))
break
print(ans)
|
s815007902 | p03775 | u033963510 | 1590281423 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 220 |
N = int(input())
def checklen(A, B):
return max(len(str(A)), len(str(B)))
ans = float("inf")
for i in range(1,round(N/2):
if N % i == 0:
m = round(N/i)
ans = min(checklen(i, m), ans)
print(ans) |
s759487315 | p03775 | u630511239 | 1590114602 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3188 | 228 | N = int(input())
import math
n = int(math.sqrt(N))
s = 0
for i in range(1,n):
if N % i == 0:
s = i
a = s
b = N/s
A = math.log10(a)
B = math.log10(b)
A = int(math.ceil(A))
B = int(math.ceil(B))
ans = max(A,B)
print(ans)
|
s923085248 | p03775 | u630511239 | 1590114369 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3060 | 232 | N = int(input())
import math
n = int(math.sqrt(N))
s = 0
for i in range(1,n):
if N % i == 0:
s = i
a = s
b = N/s
A = math.log10(a)
B = math.log10(b)
A = math.ceil(A)
B = math.ceil(B)
ans = max(A,B)
ans = int(ans)
print(ans)
|
s105255700 | p03775 | u630511239 | 1590114196 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3064 | 208 | N = int(input())
import math
n = int(math.sqrt(N))
s = 0
for i in range(1,n):
if N % i == 0:
s = i
a = s
b = N/s
A = math.log10(a)
B = math.log10(b)
A = int(A) +1
B = int(B) +1
ans = max(A,B)
print(ans) |
s505692448 | p03775 | u630511239 | 1590114125 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3188 | 247 | N = int(input())
import math
n = int(math.sqrt(N))
s = 0
for i in range(1,n):
if N % i == 0:
s = i
a = s
b = N/s
A = math.log10(a)
B = math.log10(b)
A = math.floor(A) +1
B = math.floor(B) +1
A = int(A)
B = int(B)
ans = max(A,B)
print(ans)
|
s969028111 | p03775 | u630511239 | 1590113974 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3188 | 196 | N = int(input())
import math
n = int(math.sqrt(N))
s = 0
for i in range(1,n):
if N % i == 0:
s = i
a = s
b = N/s
A = int(math.log10(a)) +1
B = int(math.log10(b)) +1
ans = max(A,B)
print(ans) |
s778032245 | p03775 | u312078744 | 1590024744 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 596 | n = int(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
org = make_divisors(n)
div = sorted(org)
divNum = len(div)
if (divNum % 2 == 0):
indA = int(divNum / 2) - 1
indB = int(divNum / 2)
else:
indA = int((divNum - 1) / 2)
indB = indA
# print(div[indA])
A = len(str(div[indA]))
B = len(str(div[indB]))
ans = max(A, B)
print(ans)a
|
s754538878 | p03775 | u880480312 | 1590011506 | Python | Python (3.4.3) | py | Runtime Error | 2103 | 3060 | 127 | N=int(input())
a=[]
K=N//2
for i in range(1,K+1):
if N%i==0:
a.append(int(N/i))
print(len(str(a[int(len(a)/2)])))
|
s864634636 | p03775 | u189023301 | 1589982958 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3064 | 297 | n = int(input())
sqr = int(n**0.5)
l1 = len(str(sqr))
pf = {}
for i in range(2, int(n**0.5) + 1):
while not n % i:
pf[i] = pf.get(i, 0) + 1
n //= i
if n > 1:
pf[n] = 1
ls = sorted(pf.items(), key=lambda x: x[0], reverse=True)
l2 = len(str(ls[0][0]))
print(max(l1, l2))
|
s430027388 | p03775 | u857673087 | 1589940609 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 175 | import math
N = int(input())
end = int(math.sqrt(N))+1
ans = len(str(N))
for a in range(1,end):
if N%a == 0:
b = N//a
ans = min(ans, len(str(max(a,b)))
print(ans)
|
s870451394 | p03775 | u857673087 | 1589939770 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 175 | import math
N = int(input())
end = int(math.sqrt(N))+1
ans = len(str(N))
for a in range(1,end):
if N%a == 0:
b = N//i
ans = min(ans, len(str(max(a,b)))
print(ans)
|
s370060233 | p03775 | u673338219 | 1589853966 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38384 | 112 | n = int(input())
mx = 1
for i in range(2,n**(1/2)+1):
if n%i == 0:
mx = i
print(len(str(n//mx)))
|
s962118658 | p03775 | u840570107 | 1589689882 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3060 | 135 | n = int(input())
lis = []
for a in range(1, int(n**0.5)):
if n % a == 0:
lis.append(max(a, int(n/a)))
print(len(str(min(lis)))) |
s657209835 | p03775 | u996996256 | 1589501684 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 167 | n = int(input())
ans = float('inf')
temp = 0
for i in range(1,n**(1/2)):
if n%i == 0:
temp = max(i, n//i)
ans = min(temp, ans)
print(len(str(ans))) |
s169573555 | p03775 | u996996256 | 1589501034 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 176 | n = int(input())
ans = float('inf')
temp = 0
for i in range(1,(n/2)+1):
if n%i == 0:
temp = max(len(str(i)), len(str(n//i)))
ans = min(temp, ans)
print(ans) |
s341681771 | p03775 | u996996256 | 1589501006 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 174 | n = int(input())
ans = float('inf')
temp = 0
for i in range(1,n/2+1):
if n%i == 0:
temp = max(len(str(i)), len(str(n//i)))
ans = min(temp, ans)
print(ans) |
s619408161 | p03775 | u413632062 | 1589399115 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 424 | def F(a,b):
a=len(str(a))
b=len(str(b))-2#float型のため
return a if a>b else b
n=int(input())
o=[]
k=100000000
c=0
m=10000000000
for i in range(1,n):
if c>0:
c-=1
continue
if i>=n:
break
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を次の位にする
print(min(o)) |
s566714356 | p03775 | u409542115 | 1589241039 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 447 | import math
N = int(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)
|
s545548904 | p03775 | u409542115 | 1589241014 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 434 | N = int(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)
|
s343552601 | p03775 | u593934357 | 1588970582 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38256 | 684 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll digit_len(ll x){
ll ans = 0;
while (x>=10){
x /= 10;
ans++;
}
ans++;
return ans;
}
int main() {
ll N;
ll ans = 1000000000;
cin >> N;
for (ll i=1; i*i<=N; i++){
if (N%i == 0)chmin(ans, max(digit_len(N/i), digit_len(i)));
}
cout << ans << endl;
} |
s477476979 | p03775 | u357949405 | 1588961833 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 132 | N = int(input())
for i in range(N**0.5, 0, -1):
div, mod = divmod(N)
if not mod:
print(len(str(min(div, N//div))))
|
s607343366 | p03775 | u471503862 | 1588902784 | Python | Python (3.4.3) | py | Runtime Error | 35 | 3064 | 388 | n = int(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(10):
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) |
s095975646 | p03775 | u471503862 | 1588902362 | Python | Python (3.4.3) | py | Runtime Error | 43 | 3188 | 444 | n = int(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)
return divisors
def digit(n):
for i in range(10):
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)
|
s532435036 | p03775 | u785883180 | 1588788424 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38768 | 132 | import math
n=int(input())
l=[]
for a in range(1,math.ceil(n**(1/2))):
if n%a==0:
l.append(len(str(n//a)))
print(min(l)) |
s124244739 | p03775 | u785883180 | 1588787945 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38384 | 123 | n=int(input())
f=[]
for a in range(1,n+1):
if n%a==0:
b=n//a
f.append(max(len(a),len(b)))
print(min(f)) |
s296059658 | p03775 | u785883180 | 1588787762 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38768 | 132 | import math
n=int(input())
l=[]
for a in range(1,math.ceil(n**(1/2))):
if n%a==0:
l.append(len(str(n//a)))
print(min(l)) |
s355950288 | p03775 | u721425712 | 1588782747 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 242 | n = int(input())
def F(a, b):
return max(len(str(a)), len(str(b)))
ans = 10**10
for i in range(1, n**(1/2)+1):
j = n / i
if (n/i)%1 == 0:
j = n // i
if ans > F(i, j):
ans = F(i, j)
print(ans) |
s180890487 | p03775 | u074687136 | 1588701198 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3188 | 215 | import math
N = int(input())
res = []
num = []
for i in range(1, int(math.sqrt(N+1))):
if N % i == 0:
div = N // i
if div >= i:
str_num = str(div)
res.append(len(list(str_num)))
print(min(res)) |
s031816697 | p03775 | u390727364 | 1588627410 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38640 | 381 | import numpy as np
from sys import stdin
def main():
n = int(stdin.readline())
d = set()
ans = len(str(n))
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
d.add(i)
for a in d:
tmp = np.max([len(str(a)), len(str(int(n / a)))])
if tmp < ans:
ans = tmp
print(ans)
if __name__ == "__main__":
main()
|
s799790979 | p03775 | u739959951 | 1588392107 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3060 | 186 | import math
n=int(input())
n_sqrt=int(math.sqrt(n))
ans=[]
for i in range(1,n_sqrt):
if n%i==0:
x=int(max(math.log10(i)+1,math.log10(n//i)+1))
ans.append(x)
print(min(ans)) |
s627221445 | p03775 | u625495026 | 1588267871 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3060 | 264 | N = int(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)
divisors_sorted = sorted(divisors)
print(len(str(divisors_sorted[int((len(divisors_sorted)+1)/2)]))) |
s336704193 | p03775 | u625495026 | 1588267749 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3060 | 231 | N = int(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)
divisors.sort()
print(len(str(divisors[int((len(divisors)+1)/2)]))) |
s499668029 | p03775 | u625495026 | 1588267665 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3060 | 231 | N = int(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)
divisors.sort()
print(len(str(divisors[int((len(divisors)+1)/2)]))) |
s374067102 | p03775 | u519939795 | 1588100624 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2106 | 41884 | 156 | n=int(input())
m=(n+1)//2
l=[]
for i in range(m):
for j in range(m):
if i*j==n:
l.append(max(len(str(i)),len(str(j))))
print(min(l)) |
s832251598 | p03775 | u189326411 | 1587880241 | Python | Python (3.4.3) | py | Runtime Error | 32 | 2940 | 134 | n = int(input())
for i in reversed(range(int(n**0.5))):
if n%i==0:
print(max(len(str(i)), len(str(n//i))))
exit()
|
s988090453 | p03775 | u189326411 | 1587880093 | Python | Python (3.4.3) | py | Runtime Error | 31 | 2940 | 153 | import math
n = int(input())
for i in reversed(range(math.ceil(n**0.5))):
if n%i==0:
print(max(len(str(i)), len(str(n//i))))
exit()
|
s908778263 | p03775 | u189397279 | 1587757133 | Python | Python (3.4.3) | py | Runtime Error | 165 | 12488 | 198 | import numpy as np
N = int(input())
ans = len(str(N))
for i in range(2, int(np.sqrt(N)) + 2):
if not N % i:
a = max(len(str(i)), len(str(int(N / i))))
ans = min(ans, a)
print(a) |
s387344028 | p03775 | u189397279 | 1587756729 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 196 | import numpy as np
N = int(input())
ans = 10 ** 10
for i in range(2:int(np.sqrt(N)) + 2):
if not N % i:
a = max(len(str(i)), len(str(int(121 / 11))))
ans = min(ans, a)
print(a) |
s927346333 | p03775 | u492447501 | 1587297273 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3060 | 220 | N = int(input())
min = float('inf')
for i in range(1, int(N**0.5), 1):
if N%i==0:
A = i
B = N//i
keta = max(len(str(A)), len(str(B)))
if keta<min:
min = keta
print(keta) |
s230272142 | p03775 | u379716238 | 1587263107 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3064 | 214 | N = int(input())
M = int(N**0.5)
l = []
if N <= 3:
print(1)
else:
for a in range(1, M+1):
if N % a == 0:
b = int(N/a)
else:
continue
l.append(max(len(str(a)), len(str(b))))
print(min(l)) |
s415802154 | p03775 | u379716238 | 1587262373 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3060 | 174 | N = int(input())
M = int(N**0.5)
l = []
for a in range(1, M):
if N % a == 0:
b = int(N/a)
else:
continue
l.append(max(len(str(a)), len(str(b))))
print(min(l))
|
s411924949 | p03775 | u366185462 | 1586994513 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3064 | 242 | import math
n = int(input())
f = []
for i in range(1, int(math.sqrt(n + 1))):
if ((n % i) == 0):
a = int(i)
b = int(n / i)
alen = len(str(a))
blen = len(str(b))
maxlen = max(alen, blen)
f.append(maxlen)
print(min(f)) |
s882734171 | p03775 | u366185462 | 1586994111 | Python | Python (3.4.3) | py | Runtime Error | 163 | 12504 | 228 | import numpy as np
n = int(input())
f = []
for i in range(1, int(np.sqrt(n + 1))):
if ((n % i) == 0):
a = int(i)
b = int(n / i)
alen = len(str(a))
blen = len(str(b))
f.append(max(alen, blen))
print(min(f))
|
s730259848 | p03775 | u288430479 | 1586820037 | Python | Python (3.4.3) | py | Runtime Error | 31 | 2940 | 144 | n = int(input())
t = []
for i in range(1,int(n**0.5)):
if n%i==0:
t.append(max(len(str(int(n/i))),len(str(i))))
print(min(t))
|
s301359250 | p03775 | u931173291 | 1586668000 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 2940 | 135 | import sys
N=int(input())
ans=[]
for i in range(int(N**0.5)-1,N+1):
if N%i==0:
a=str(i)
print(len(a))
break |
s804357372 | p03775 | u787449825 | 1586551277 | Python | Python (3.4.3) | py | Runtime Error | 33 | 3064 | 341 | def f(x):
count_x = 1
while x/10>=1:
x = x//10
count_x += 1
return count_x
pf = {}
m = int(input())
root_m = int(m**0.5)
for i in range(2,root_m+1):
while m%i == 0:
pf[i] = pf.get(i,0) + 1
m//=i
if m>1:pf[m]=1
if root_m<max(pf.keys()):
print(f(max(pf.keys())))
else:
print(f(root_m)) |
s946842755 | p03775 | u992910889 | 1586395713 | Python | Python (3.4.3) | py | Runtime Error | 27 | 3188 | 583 | def resolve():
N=int(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: # 平方数の場合n**0.5を1つだけにしてる
divisors.append(n//i)
# divisors.sort() # ソートしたけりゃして
return divisors
l=make_divisors(N)
ls=len(l)
l1=l[-1]
l2=l[-2]
if len(l)%2==0:
print(max(len(str(l1)),len(str(l2))))
else:
print(len(str(l1)))
resolve() |
s248369657 | p03775 | u440129511 | 1586388827 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 143 | import math
n=int(input())
k=int(math.sqrt(n))
l=[]
for i in range(1,k+2):
if n%i==0:l.append(max(len(str(i),len(str(n//i))))
print(min(l)) |
s199962699 | p03775 | u440129511 | 1586388797 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 140 | import math
n=int(input())
k=int(math.sqrt(n))
l=[]
for i in range(1,k+2):
n%i==0:l.append(max(len(str(i),len(str(n//i))))
print(min(l)) |
s049432256 | p03775 | u721425712 | 1586305966 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 329 | # ABC 057 C - Digits in Multiplication
# 2020/04/07 20:6-
n = int(input())
def F(a, b):
A = len(str(a))
B = len(str(b))
return max(A, B)
ans = math.inf
for i in range(1, int(n**(1/2))+1):
j = n / i
if j%1 == 0:
j = n // i
if ans > F(i, j):
ans = F(i, j)
print(ans) |
s559596451 | p03775 | u085334230 | 1586123519 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 283 | for A in range(1, int((N / 2))):
if N % A == 0:
B = int(N / A)
if len(str(A)) <= len(str(B)):
res = len(str(B))
elif len(str(A)) >= len(str(B)):
res = len(str(A))
cont.append(res)
else:
continue
print(min(cont)) |
s344743803 | p03775 | u896741788 | 1586114239 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 138 | from math imoprt sqrt
n=int(input())
for i in range(int(sqrt(n)),0,-1):
if n%i==0:
print(max(len(str(i)),len(str(n//i))))
exit() |
s512651308 | p03775 | u969211566 | 1586040691 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3188 | 319 | 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 = int(input())
ans = make_divisors(a)
print(len(str(max(ans[-1],ans[-2])))) |
s039263422 | p03775 | u550061714 | 1585953719 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 104 | import math
N = int(input())
tmp = math.isqrt(N)
while N % tmp:
tmp -= 1
print(len(str(N // tmp)))
|
s790339719 | p03775 | u626467464 | 1585776315 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 271 | import math
n = int(input())
root = math.ceil(math.sqrt(n))
nums = []
for i in range(1,root+1):
if n % i == 0:
count_i = len(str(i))
count_j = len(str(j))
ans = max(count_i,count_j)
nums.append(ans)
nummm = sorted(nums,reverse = True)
print(nummm[0]) |
s209188665 | p03775 | u626467464 | 1585776217 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 308 | import math
n = int(input())
root = math.ceil(math.sqrt(n))
nums = []
for i in range(1,root+1):
for j in range(1,root + 1):
if i*j == n:
count_i = len(str(i))
count_j = len(str(j))
ans = max(count_i,count_j)
nums.append(ans)
nummm = sorted(nums,reverse = True)
print(nummm[0]) |
s614630327 | p03775 | u121192152 | 1585519624 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 571 | N = int(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
P = prime_factorize(N)
ans = len(str(N))
for i in range(2 ** (len(P) - 1)):
a = 1
b = 1
for j in range(len(P)):
if (i >> j) & 1 == 1:
a *= P[j]
else:
b *= P[j]
ans = min(ans, max(len(str(a)), len(str(b))))
print(ans)
|
s266349342 | p03775 | u888337853 | 1585504978 | Python | Python (3.4.3) | py | Runtime Error | 36 | 5164 | 1214 | import math
import copy
from copy import deepcopy
import sys
import fractions
# import numpy as np
from functools import reduce
# import statistics
import decimal
import heapq
import collections
import itertools
from operator import mul
sys.setrecursionlimit(100001)
# input = sys.stdin.readline
# sys.setrecursionlimit(10**6)
# ===FUNCTION===
def getInputInt():
inputNum = int(input())
return inputNum
def getInputListInt():
outputData = []
inputData = input().split()
outputData = [int(n) for n in inputData]
return outputData
def getSomeInputInt(n):
outputDataList = []
for i in range(n):
inputData = int(input())
outputDataList.append(inputData)
return outputDataList
def getSomeInputListInt(n):
inputDataList = []
outputDataList = []
for i in range(n):
inputData = input().split()
inputDataList = [int(n) for n in inputData]
outputDataList.append(inputDataList)
return outputDataList
# ===CODE===
n = int(input())
ans = sys.maxsize
for i in range(1, math.sqrt(n)+1, 1):
if n % i == 0:
b = n//i
tmp_ans = max(len(str(i)), len(str(b)))
ans = min(ans, tmp_ans)
print(ans)
|
s036086933 | p03775 | u517724953 | 1585461987 | Python | PyPy3 (2.4.0) | py | Runtime Error | 193 | 40556 | 265 | n = int(input())
# li = list(range(1, n+1))
ans = 10**10
for a in range(10**(len(str(n))//2-1), 10**(len(str(n))//2+1)):
if n % a == 0:
b = n//a
if ans > max(len(str(a)), len(str(b))):
ans = max(len(str(a)), len(str(b)))
print(ans)
|
s312993845 | p03775 | u163874353 | 1585427319 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 252 | N, Y = map(int, input().split())
for i in range(N + 1):
for j in range(N + 1 - i):
k = int((Y - 10000 * i - 5000 * j) / 1000)
if N - i - j >= k >= 0 and i + j + k == N:
print(i, j, k)
exit()
print(-1, -1, -1) |
s399693560 | p03775 | u260036763 | 1585000047 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 177 | import math
N = int(input())
ans = 10
for A in range(1, int(math.sqrt(N))):
if N % A == 0:
B = N//A
F = max(len(str(A)), len(str(B)))
ans = F if ans > F
print(ans) |
s489684862 | p03775 | u672898046 | 1584486590 | Python | Python (3.4.3) | py | Runtime Error | 59 | 2940 | 143 | N = int(input())
for i in range(1,N):
if N % i == 0:
ans = max(len(str(i)), len(str(N//i)))
if N//i and i > N//i:
break
print(ans) |
s704475438 | p03775 | u197968862 | 1584336132 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 236 | n = int(input())
ele = []
i = 1
while i * i <= n:
if n % i == 0:
ele.append([len(str(i)),len(str(n // i))])
i += 1
k = max(ele[0][1],ele[0][0])
for i in range(len(ele)):
k = min(max(ele[i][0],ele[i][1]),k)
print(k) |
s451763427 | p03775 | u197968862 | 1584335787 | Python | Python (3.4.3) | py | Runtime Error | 52 | 3064 | 234 | n = int(input())
ele = []
i = 1
while i * i < n:
if n % i == 0:
ele.append([len(str(i)),len(str(n // i))])
i += 1
k = min(ele[0][1],ele[0][0])
for i in range(len(ele)):
k = min(max(ele[i][0],ele[i][1]),k)
print(k) |
s069660148 | p03775 | u197968862 | 1584335702 | Python | Python (3.4.3) | py | Runtime Error | 45 | 3316 | 272 | n = int(input())
ele = []
ans = []
i = 1
while i * i < n:
if n % i == 0:
ele.append([len(str(i)),len(str(n // i))])
ans.append([i,n//i])
i += 1
k = max(ele[0][1],ele[0][0])
for i in range(len(ele)):
k = min(max(ele[i][0],ele[i][1]),k)
print(k) |
s205918783 | p03775 | u841623074 | 1584200789 | Python | Python (3.4.3) | py | Runtime Error | 397 | 3064 | 541 | N=int(input())
n=len(str(N))
m=(n//2)
def wari(x):
array=[]
for i in range(m):
if i==0:
for j in range(9,0,-1):
if N%j==0:
c=max(len(str(N//j)),len(str(j)))
array.append(c)
break
else:
for j in range((10**(m+1))-1,(10**m)-1,-1):
if N%j==0:
c=max(len(str(N//j)),len(str(j)))
array.append(c)
break
return min(array)
print(wari(N))
|
s588937566 | p03775 | u974792613 | 1583702336 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 276 | def f(a,b):
digit_a = digit_b=0
while a:
digit_a+=1
a//=10
while b:
digit_b+=1
b//=10
return max(digit_a, digit_b)
n = int(input())
ans = n
for i in range(1, int((n+1)**0.5)):
for n%i==0:
n = min(n, f(i, n//i))
print(ans)
|
s889561577 | p03775 | u998262711 | 1583682582 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 169 | import math
N=int(input())
a=0
for i in range(1,1+math.ceil(math.sqrt(N))):
if N%i==0 and i>a:
a=i
b=int(N/a)
print(max([len(str(a)),len(str(b))]))9876543210 |
s154550076 | p03775 | u731436822 | 1583111724 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3060 | 195 | # C - Digits in Multiplication
n = int(input())
import math
ans = []
for i in range(1,int(math.sqrt(n))):
if n%i == 0:
ans.append(max(len(str(i)),len(str(int(n//i)))))
print(min(ans)) |
s550194979 | p03775 | u072717685 | 1582406688 | Python | Python (3.4.3) | py | Runtime Error | 127 | 4188 | 614 | from itertools import combinations
from functools import reduce
from operator import mul
def prime_dec(n):
i = 2
table = []
while i * i <= n:
while n % i == 0:
n /= i
table.append(int(i))
i += 1
if n > 1:
table.append(n)
return table
n = int(input())
ps = prime_dec(n)
ps_com = []
for i in range(len(ps)):
ps_com += set(combinations(ps, i))
divs = [reduce(mul, k) for k in ps_com if not len(k) == 0]
divs_twin = [(k, int(n/k)) for k in divs]
divs_twin = set(divs_twin)
divs_twin_len = [max(len(str(k[0])) ,len(str(k[1]))) for k in divs_twin]
print(min(divs_twin_len))
|
s979013904 | p03775 | u735008991 | 1582355396 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 160 | import math
N = int(input())
ans = math.inf
for i in range(1, 1+math.floor(math.sqrt(N))):
if N % i == 0:
ans = min(ans, len(str(N//i)))
print(ans)
|
s453904547 | p03775 | u735008991 | 1582355347 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 159 | import math
N = int(input())
ans = math.inf
for i in range(1, 1+math.floor(math.sqrt(N))):
if N % i == 0:
ans = min(ans, len(str(N/i)))
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.