AtCoder Beginner Contest 057
C
Digits in Multiplication
AtCoder
⌀ 904
原题
← BD →
翻译中…

Problem Statement

翻译中…

You are given an integer $N$. For two positive integers $A$ and $B$, we will define $F(A,B)$ as the larger of the following: the number of digits in the decimal notation of $A$, and the number of digits in the decimal notation of $B$. For example, $F(3,11) = 2$ since $3$ has one digit and $11$ has two digits. Find the minimum value of $F(A,B)$ as $(A,B)$ ranges over all pairs of positive integers such that $N = A \times B$.

翻译中…

Constraints

翻译中…
  • $1 \leq N \leq 10^{10}$
  • $N$ is an integer.
翻译中…

Input

翻译中…

The input is given from Standard Input in the following format:

翻译中…

N

翻译中…

Output

翻译中…

Print the minimum value of $F(A,B)$ as $(A,B)$ ranges over all pairs of positive integers such that $N = A \times B$.

翻译中…

样例

Input #1
10000
Output #1
3
$F(A,B)$ has a minimum value of $3$ at $(A,B)=(100,100)$.
Input #2
1000003
Output #2
7
There are two pairs $(A,B)$ that satisfy the condition: $(1,1000003)$ and $(1000003,1)$. For these pairs, $F(1,1000003)=F(1000003,1)=7$.
Input #3
9876543210
Output #3
6
题目信息
题号
abc057_c
时间限制
2 s
内存限制
256 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。