Submission #3782661
Source Code Expand
import math n = int(input()) p = [] for i in range(1, int(math.sqrt(n+1))+1): if n % i == 0: p.append(i) ans = 11 for i in p: a, b = str(i), str(n//i) ans = min(ans, max(len(a), len(b))) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | hogeandfuga |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 235 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 3060 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 | 19 ms | 3060 KB |
sample_02.txt | AC | 18 ms | 3060 KB |
sample_03.txt | AC | 30 ms | 3060 KB |
subtask_1_1.txt | AC | 18 ms | 3060 KB |
subtask_1_10.txt | AC | 29 ms | 3060 KB |
subtask_1_11.txt | AC | 18 ms | 3060 KB |
subtask_1_12.txt | AC | 19 ms | 3060 KB |
subtask_1_2.txt | AC | 17 ms | 3060 KB |
subtask_1_3.txt | AC | 31 ms | 2940 KB |
subtask_1_4.txt | AC | 23 ms | 3060 KB |
subtask_1_5.txt | AC | 23 ms | 3060 KB |
subtask_1_6.txt | AC | 25 ms | 3060 KB |
subtask_1_7.txt | AC | 30 ms | 3060 KB |
subtask_1_8.txt | AC | 30 ms | 3060 KB |
subtask_1_9.txt | AC | 30 ms | 2940 KB |