有一个正整数对(x,y),x,y均不大于n,并且x除以y的余数大等于k;求可能有多少个可能的整数对;
输入两个整数n,k;n<=100000;k<n;
例子:
5 2
输出:
7
(2,3)(2,4)(2,5)(3,4)(3,5)(4,5)(5,3)
import java.util.Arrays;
import java.util.Scanner;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int k = s.nextInt();
long count = 0;
if(k==0) {
count =(long)n*(long)n;
}
else {
for (int y = k + 1; y <=n; y++) {
int t = n % y;
int ys = n / y;
int e = 0;
if (t >= k) {
e = t - k + 1;
}
count += ys * (y - k) + e;
}
}
System.out.println(count);
}
}