Submission #10369956
Source Code Expand
n = int(input()) def myfunc(a, b): len_a = len(str(a)) len_b = len(str(b)) return max(len_a, len_b) n_sqrt = n ** 0.5 i = 1 MIN = n while i <= n_sqrt: if n % i == 0: MIN = min(MIN, myfunc(i, n // i)) i += 1 print(MIN)
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | tiruka |
Language | PyPy3 (2.4.0) |
Score | 300 |
Code Size | 261 Byte |
Status | AC |
Exec Time | 170 ms |
Memory | 39024 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 | 168 ms | 38768 KB |
sample_02.txt | AC | 164 ms | 38256 KB |
sample_03.txt | AC | 169 ms | 38768 KB |
subtask_1_1.txt | AC | 162 ms | 38256 KB |
subtask_1_10.txt | AC | 170 ms | 39024 KB |
subtask_1_11.txt | AC | 164 ms | 38512 KB |
subtask_1_12.txt | AC | 166 ms | 38512 KB |
subtask_1_2.txt | AC | 165 ms | 38256 KB |
subtask_1_3.txt | AC | 170 ms | 38512 KB |
subtask_1_4.txt | AC | 166 ms | 38512 KB |
subtask_1_5.txt | AC | 168 ms | 38512 KB |
subtask_1_6.txt | AC | 169 ms | 38512 KB |
subtask_1_7.txt | AC | 169 ms | 38512 KB |
subtask_1_8.txt | AC | 167 ms | 38512 KB |
subtask_1_9.txt | AC | 168 ms | 38512 KB |