Submission #3271276

Source Code Expand

N,K=map(int, input().split())
A=[0]*(N+1)
count=0
for i in range(1, N+1):
	A[i]=int(N/i)
	
for i in range(K+1,N+1):
	count += A[i]*(i-K)
	if N-A[i]*i >= K :
		if K==0:
			count += N-A[i]*i
		else:
			count += N-A[i]*i-K+1

print(count)

Submission Info

Submission Time
Task D - Remainder Reminder
User akidaily
Language Python (3.4.3)
Score 400
Code Size 249 Byte
Status AC
Exec Time 112 ms
Memory 3828 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 110 ms 3828 KB
02.txt AC 89 ms 3572 KB
03.txt AC 74 ms 3700 KB
04.txt AC 87 ms 3572 KB
05.txt AC 112 ms 3828 KB
06.txt AC 88 ms 3572 KB
07.txt AC 42 ms 3828 KB
08.txt AC 55 ms 3700 KB
09.txt AC 90 ms 3572 KB
10.txt AC 17 ms 3060 KB
11.txt AC 17 ms 3064 KB
s1.txt AC 17 ms 3060 KB
s2.txt AC 17 ms 3064 KB
s3.txt AC 36 ms 3316 KB