Submission #3778680


Source Code Expand

import math

N = int(input())

def factor(x):
    ind = []
    for i in range(2,x+1):
        if x == 1:
            break
        elif x % i > 0:
            continue
        ct = 0
        while(x % i == 0):
            x //= i
            ct += 1
        ind.append([i, ct])
    return ind

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

M = N
L = 1
ind = factor(N)
#print(ind)
if ind.__len__() == 1:
    print(digit(M))
else:
    for i in range(ind.__len__()):
        for j in range(ind[i][1]):
            L *= ind[i][0]
            M //= ind[i][0]
            if digit(L) >= digit(M):
                print(digit(L))
                exit()

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
WA × 1
AC × 4
WA × 8
TLE × 3
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 22 ms 3444 KB
sample_02.txt AC 130 ms 3064 KB
sample_03.txt WA 60 ms 3064 KB
subtask_1_1.txt WA 18 ms 3064 KB
subtask_1_10.txt WA 18 ms 3064 KB
subtask_1_11.txt AC 18 ms 3064 KB
subtask_1_12.txt WA 20 ms 3064 KB
subtask_1_2.txt WA 18 ms 3064 KB
subtask_1_3.txt AC 18 ms 3064 KB
subtask_1_4.txt WA 54 ms 3064 KB
subtask_1_5.txt WA 184 ms 3064 KB
subtask_1_6.txt TLE 2104 ms 3064 KB
subtask_1_7.txt TLE 2104 ms 3064 KB
subtask_1_8.txt WA 30 ms 3064 KB
subtask_1_9.txt TLE 2104 ms 3064 KB