Submission #2734760
Source Code Expand
import math n = int(input()) m = int(math.sqrt(n)) ans = int(999999999999999) for i in range(1, m) : if n%i!=0 : continue j = int(n/i) ans = min(ans, max(len(str(j)), len(str(i)))) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | parkbearpark |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 232 Byte |
Status | WA |
Exec Time | 29 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 17 ms | 3060 KB |
subtask_1_10.txt | AC | 29 ms | 3060 KB |
subtask_1_11.txt | AC | 18 ms | 2940 KB |
subtask_1_12.txt | AC | 18 ms | 3060 KB |
subtask_1_2.txt | WA | 17 ms | 3064 KB |
subtask_1_3.txt | AC | 29 ms | 2940 KB |
subtask_1_4.txt | AC | 22 ms | 2940 KB |
subtask_1_5.txt | AC | 22 ms | 3060 KB |
subtask_1_6.txt | AC | 24 ms | 3060 KB |
subtask_1_7.txt | AC | 29 ms | 3060 KB |
subtask_1_8.txt | WA | 29 ms | 3060 KB |
subtask_1_9.txt | AC | 29 ms | 3060 KB |