Submission #3778749


Source Code Expand

import math

def alldiv(x):
    div = [[1,x]]
    for i in range(2,math.floor(math.sqrt(x))+1):
        if x % i == 0:
            div.append([i, x//i])
    return div


def digit(N):
    d = 0
    while(N > 0):
        N //= 10
        d += 1
    return d


N = int(input())
div = alldiv(N)
print(div)
F = [max(digit(i[0]),digit(i[1])) for i in div]
print(min(F))

Submission Info

Submission Time
Task C - Digits in Multiplication
User apigoflily
Language Python (3.4.3)
Score 0
Code Size 390 Byte
Status WA
Exec Time 29 ms
Memory 3188 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
WA × 3
WA × 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 WA 18 ms 3064 KB
sample_02.txt WA 18 ms 3064 KB
sample_03.txt WA 28 ms 3064 KB
subtask_1_1.txt WA 18 ms 3064 KB
subtask_1_10.txt WA 29 ms 3188 KB
subtask_1_11.txt WA 19 ms 3064 KB
subtask_1_12.txt WA 19 ms 3064 KB
subtask_1_2.txt WA 18 ms 3064 KB
subtask_1_3.txt WA 28 ms 3064 KB
subtask_1_4.txt WA 22 ms 3064 KB
subtask_1_5.txt WA 22 ms 3064 KB
subtask_1_6.txt WA 24 ms 3060 KB
subtask_1_7.txt WA 28 ms 3064 KB
subtask_1_8.txt WA 28 ms 3064 KB
subtask_1_9.txt WA 28 ms 3064 KB