Submission #10122704

Source Code Expand

N = int(input())

M = int(N**(1/2))
min_ans = len(str(N))
ans = 0

for i in range(1,M+1):
    a, b = divmod(N, i)
    if b==0:
        ans = max(len(str(a)),len(str(i)))
        if min_ans >= ans:
            min_ans = ans

print(min_ans)

Submission Info

Submission Time
Task C - Digits in Multiplication
User shinkoizumi0033
Language Python (3.4.3)
Score 300
Code Size 251 Byte
Status AC
Exec Time 49 ms
Memory 3188 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 17 ms 3188 KB
sample_02.txt AC 17 ms 2940 KB
sample_03.txt AC 46 ms 3060 KB
subtask_1_1.txt AC 17 ms 3060 KB
subtask_1_10.txt AC 43 ms 3060 KB
subtask_1_11.txt AC 20 ms 3060 KB
subtask_1_12.txt AC 21 ms 2940 KB
subtask_1_2.txt AC 17 ms 2940 KB
subtask_1_3.txt AC 46 ms 3060 KB
subtask_1_4.txt AC 29 ms 2940 KB
subtask_1_5.txt AC 29 ms 2940 KB
subtask_1_6.txt AC 34 ms 3060 KB
subtask_1_7.txt AC 45 ms 3060 KB
subtask_1_8.txt AC 47 ms 3060 KB
subtask_1_9.txt AC 49 ms 3060 KB