Problems > Sum of Remainders

Sum of Remainders

Difficulty: 1700 4000 ms 128 MB

number-theory

Print ∑i=1..M (N mod i).

Input: one line with two integers N and M.

Output: the sum of remainders.

Constraints:

  • 1 ≤ M ≤ N ≤ 1012

Sample Tests

Input 1
7 5
Output 1
7
Input 2
10 10
Output 2
13

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.