Submission #19910739


Source Code Expand

Copy
n = int(input())

def div(n):
    upper_divisors = []
    i = 1
    while i*i <= n:
      if n % i == 0:
        if i != n // i:
          upper_divisors.append(n//i)
      i += 1
    return upper_divisors
print(sum(div(n))-len(div(n)))

Submission Info

Submission Time
Task D - DivRem Number
User yasutakah
Language PyPy3 (7.3.0)
Score 0
Code Size 247 Byte
Status WA
Exec Time 79 ms
Memory 64116 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 23
WA × 2
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All hand_01.txt, hand_02.txt, hand_03.txt, rand_01.txt, rand_02.txt, rand_03.txt, rand_04.txt, rand_05.txt, rand_06.txt, rand_07.txt, rand_08.txt, rand_09.txt, rand_10.txt, rand_11.txt, rand_12.txt, rand_13.txt, rand_14.txt, rand_15.txt, rand_16.txt, rand_17.txt, rand_18.txt, rand_19.txt, rand_20.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
hand_01.txt AC 74 ms 61544 KB
hand_02.txt WA 53 ms 61452 KB
hand_03.txt AC 79 ms 64116 KB
rand_01.txt AC 71 ms 62436 KB
rand_02.txt AC 71 ms 62408 KB
rand_03.txt AC 77 ms 62512 KB
rand_04.txt AC 74 ms 62332 KB
rand_05.txt AC 79 ms 62500 KB
rand_06.txt AC 77 ms 62384 KB
rand_07.txt AC 70 ms 62436 KB
rand_08.txt AC 65 ms 62292 KB
rand_09.txt AC 71 ms 62420 KB
rand_10.txt AC 70 ms 62400 KB
rand_11.txt AC 53 ms 61584 KB
rand_12.txt AC 56 ms 61388 KB
rand_13.txt AC 53 ms 61572 KB
rand_14.txt AC 54 ms 62192 KB
rand_15.txt AC 54 ms 61604 KB
rand_16.txt AC 54 ms 62440 KB
rand_17.txt AC 50 ms 61560 KB
rand_18.txt WA 50 ms 61440 KB
rand_19.txt AC 52 ms 61488 KB
rand_20.txt AC 53 ms 62504 KB
sample_01.txt AC 51 ms 61576 KB
sample_02.txt AC 77 ms 62360 KB