Submission #19910779
Source Code Expand
Copy
n = int(input()) def div(n): upper_divisors = [] i = 1 while i*i < n: if n % i == 0: 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 | 219 Byte |
Status | WA |
Exec Time | 79 ms |
Memory | 64480 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||
Status |
|
|
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 | 70 ms | 61624 KB |
hand_02.txt | WA | 50 ms | 61564 KB |
hand_03.txt | AC | 79 ms | 64480 KB |
rand_01.txt | AC | 70 ms | 62436 KB |
rand_02.txt | AC | 69 ms | 62492 KB |
rand_03.txt | AC | 73 ms | 62604 KB |
rand_04.txt | AC | 72 ms | 62664 KB |
rand_05.txt | AC | 78 ms | 62504 KB |
rand_06.txt | AC | 75 ms | 62484 KB |
rand_07.txt | AC | 65 ms | 62456 KB |
rand_08.txt | AC | 61 ms | 62624 KB |
rand_09.txt | AC | 70 ms | 62448 KB |
rand_10.txt | AC | 65 ms | 62400 KB |
rand_11.txt | AC | 51 ms | 61476 KB |
rand_12.txt | AC | 51 ms | 61656 KB |
rand_13.txt | AC | 52 ms | 61740 KB |
rand_14.txt | AC | 53 ms | 62572 KB |
rand_15.txt | AC | 54 ms | 61612 KB |
rand_16.txt | AC | 52 ms | 62484 KB |
rand_17.txt | AC | 53 ms | 61704 KB |
rand_18.txt | WA | 51 ms | 61444 KB |
rand_19.txt | AC | 51 ms | 61740 KB |
rand_20.txt | AC | 52 ms | 62564 KB |
sample_01.txt | AC | 51 ms | 61724 KB |
sample_02.txt | AC | 76 ms | 62612 KB |