Submission #3768089

Source Code Expand

n, k = list(map(int, input().split()))

sub = 0
for i in range(1, n+1):
    s = n//i
    sub += s*(min(i, k))
    sub += min(n%i, max(0, k-1))
print(n**2 - sub)

Submission Info

Submission Time
Task D - Remainder Reminder
User tomboftime
Language Python (3.4.3)
Score 400
Code Size 167 Byte
Status AC
Exec Time 120 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 14
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 112 ms 2940 KB
02.txt AC 95 ms 2940 KB
03.txt AC 104 ms 2940 KB
04.txt AC 92 ms 2940 KB
05.txt AC 110 ms 2940 KB
06.txt AC 90 ms 2940 KB
07.txt AC 120 ms 3060 KB
08.txt AC 106 ms 2940 KB
09.txt AC 96 ms 2940 KB
10.txt AC 18 ms 2940 KB
11.txt AC 18 ms 2940 KB
s1.txt AC 17 ms 2936 KB
s2.txt AC 18 ms 2940 KB
s3.txt AC 48 ms 2940 KB