Submission #2238327

Source Code Expand

import math

N = int(input())

def get_divisor_list(N):
    divisor_list = []

    for i in range(1, int(math.sqrt(N)) + 1):
        if N % i == 0:
            divisor_list.append([i, N //i])

    return divisor_list

divisor_list_max = [max(x) for x in get_divisor_list(N)]


print(len(str(divisor_list_max)))

Submission Info

Submission Time
Task C - Digits in Multiplication
User iemon777
Language Python (3.4.3)
Score 0
Code Size 326 Byte
Status WA
Exec Time 27 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 17 ms 3060 KB
sample_02.txt WA 17 ms 2940 KB
sample_03.txt WA 27 ms 2936 KB
subtask_1_1.txt WA 17 ms 2940 KB
subtask_1_10.txt WA 26 ms 3188 KB
subtask_1_11.txt WA 18 ms 2940 KB
subtask_1_12.txt WA 18 ms 2940 KB
subtask_1_2.txt WA 17 ms 3060 KB
subtask_1_3.txt WA 27 ms 3188 KB
subtask_1_4.txt WA 21 ms 3060 KB
subtask_1_5.txt WA 21 ms 3060 KB
subtask_1_6.txt WA 22 ms 2940 KB
subtask_1_7.txt WA 27 ms 3060 KB
subtask_1_8.txt WA 27 ms 3060 KB
subtask_1_9.txt WA 27 ms 2940 KB