Submission #399391

Source Code Expand

from math import sqrt

N = int(input())
res = 0
for i in range(1, int(sqrt(N)) + 1):
    if N % i == 0:
        res += i if N == i * i or i == 1 else i + N // i

print("Deficient" if N > res or N == 1 else "Abundant" if N < res else "Perfect")

Submission Info

Submission Time
Task B - 完全数
User yumechi
Language Python (3.2.3)
Score 100
Code Size 251 Byte
Status AC
Exec Time 173 ms
Memory 8816 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 4
AC × 28
AC × 49
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt
Subtask1 sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt
Subtask2 sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt
Case Name Status Exec Time Memory
sample_1.txt AC 136 ms 8712 KB
sample_2.txt AC 137 ms 8712 KB
sample_3.txt AC 134 ms 8712 KB
sample_4.txt AC 135 ms 8708 KB
subtask1_01.txt AC 138 ms 8716 KB
subtask1_02.txt AC 132 ms 8708 KB
subtask1_03.txt AC 133 ms 8716 KB
subtask1_04.txt AC 132 ms 8712 KB
subtask1_05.txt AC 136 ms 8712 KB
subtask1_06.txt AC 136 ms 8720 KB
subtask1_07.txt AC 135 ms 8816 KB
subtask1_08.txt AC 133 ms 8712 KB
subtask1_09.txt AC 133 ms 8716 KB
subtask1_10.txt AC 139 ms 8668 KB
subtask1_11.txt AC 134 ms 8708 KB
subtask1_12.txt AC 135 ms 8712 KB
subtask1_13.txt AC 133 ms 8716 KB
subtask1_14.txt AC 134 ms 8728 KB
subtask1_15.txt AC 133 ms 8684 KB
subtask1_16.txt AC 135 ms 8700 KB
subtask1_17.txt AC 134 ms 8688 KB
subtask1_18.txt AC 135 ms 8716 KB
subtask1_19.txt AC 138 ms 8716 KB
subtask1_20.txt AC 136 ms 8708 KB
subtask1_21.txt AC 137 ms 8716 KB
subtask1_22.txt AC 132 ms 8716 KB
subtask1_23.txt AC 133 ms 8712 KB
subtask1_24.txt AC 132 ms 8716 KB
subtask2_01.txt AC 138 ms 8708 KB
subtask2_02.txt AC 156 ms 8712 KB
subtask2_03.txt AC 154 ms 8712 KB
subtask2_04.txt AC 138 ms 8716 KB
subtask2_05.txt AC 155 ms 8712 KB
subtask2_06.txt AC 136 ms 8692 KB
subtask2_07.txt AC 146 ms 8724 KB
subtask2_08.txt AC 159 ms 8716 KB
subtask2_09.txt AC 156 ms 8716 KB
subtask2_10.txt AC 162 ms 8692 KB
subtask2_11.txt AC 138 ms 8696 KB
subtask2_12.txt AC 146 ms 8712 KB
subtask2_13.txt AC 147 ms 8712 KB
subtask2_14.txt AC 139 ms 8712 KB
subtask2_15.txt AC 173 ms 8724 KB
subtask2_16.txt AC 153 ms 8708 KB
subtask2_17.txt AC 157 ms 8716 KB
subtask2_18.txt AC 143 ms 8672 KB
subtask2_19.txt AC 153 ms 8712 KB
subtask2_20.txt AC 151 ms 8716 KB
subtask2_21.txt AC 136 ms 8804 KB