Submission #2711690

Source Code Expand

n, k = map(int, input().split())
ans = 0

if k == 0:
	print(n ** 2)
else:
	for i in range(k + 1, n + 1):
		div = n // i
		ans += (i - k) * div
		if n % i != 0:
			ans += max(n + 1 - ((n // i) * i + k), 0)

	print(ans)

Submission Info

Submission Time
Task D - Remainder Reminder
User anagohirame
Language Python (3.4.3)
Score 400
Code Size 229 Byte
Status AC
Exec Time 102 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 17 ms 2940 KB
02.txt AC 17 ms 2940 KB
03.txt AC 74 ms 2940 KB
04.txt AC 80 ms 3060 KB
05.txt AC 102 ms 3060 KB
06.txt AC 83 ms 2940 KB
07.txt AC 17 ms 2940 KB
08.txt AC 53 ms 3060 KB
09.txt AC 84 ms 3060 KB
10.txt AC 17 ms 3060 KB
11.txt AC 17 ms 2940 KB
s1.txt AC 17 ms 2940 KB
s2.txt AC 17 ms 2940 KB
s3.txt AC 36 ms 3060 KB