3469. Savrsen

单点时限: 3.0 sec

内存限制: 256 MB

A number is perfect if it is equal to the sum of its divisors, the ones that are smaller than it. For example, number 28 is perfect because 28=1+2+4+7+14.

Motivated by this definition, we introduce the metric of imperfection of number N, denoted with f(N), as the absolute difference between N and the sum of its divisors less than N. It follows that perfect numbers’ imperfection score is 0, and the rest of natural numbers have a higher imperfection score. For example:

  • f(6)=|6123|=0,
  • f(11)=|111|=10,
  • f(24)=|2412346812|=|12|=12.

Write a programme that, for positive integers A and B, calculates the sum of imperfections of all numbers between A and B: f(A)+f(A+1)++f(B).

输入格式

The first line of input contains the positive integers A and B (1AB107).

输出格式

The first and only line of output must contain the required sum.

样例

Input
24 24
Output
12
Input
1 9
Output
21

提示

Clarification of the first test case: 1+1+2+1+4+0+6+1+5.

27 人解决,40 人已尝试。

53 份提交通过,共有 155 份提交。

4.9 EMB 奖励。

创建: 7 年,4 月前.

修改: 7 年,4 月前.

最后提交: 3 年前.

来源: COCI 2017

题目标签