Submission #2237887
Source Code Expand
from math import sqrt N = int(input()) NS = int(sqrt(N)) ret = len(str(N)) for i in range(1, NS + 1): if N % i == 0: an, bn = (len(str(i)), len(str(N // i))) ret = min(max(an, bn), ret) print(ret)
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | tyty0822 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 228 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 3188 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 29 ms | 3060 KB |
subtask_1_1.txt | AC | 17 ms | 2940 KB |
subtask_1_10.txt | AC | 28 ms | 3060 KB |
subtask_1_11.txt | AC | 18 ms | 3060 KB |
subtask_1_12.txt | AC | 18 ms | 3060 KB |
subtask_1_2.txt | AC | 17 ms | 3060 KB |
subtask_1_3.txt | AC | 29 ms | 2940 KB |
subtask_1_4.txt | AC | 23 ms | 2940 KB |
subtask_1_5.txt | AC | 22 ms | 2940 KB |
subtask_1_6.txt | AC | 24 ms | 3188 KB |
subtask_1_7.txt | AC | 29 ms | 3060 KB |
subtask_1_8.txt | AC | 29 ms | 3060 KB |
subtask_1_9.txt | AC | 29 ms | 3060 KB |