Problem:
Score : 400 points

Problem Statement

Takahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.
He remembers that the remainder of a divided by b was greater than or equal to K.
Find the number of possible pairs that he may have had.

Constraints

1 \leq N \leq 10^5

0 \leq K \leq N-1

All input values are integers.

Input

Input is given from Standard Input in the following format:

N K

Output

Print the number of possible pairs that he may have had.

Sample Input 1

5 2

Sample Output 1

7

There are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).

Sample Input 2

10 0

Sample Output 2

100

Sample Input 3

31415 9265

Sample Output 3

287927211

Solution in C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Text;
using System.Linq;
using System.Collections;
using System.Collections.Generic;
using static System.Console;
using static System.Math;
using System.Numerics;

namespace AtCoder
{
    public class Program
    {
        public static void Main(string[] args)
        {
            new Program().Solve(new ConsoleInput(Console.In, ' '));
        }

        public void Solve(ConsoleInput cin)
        {
            var N = cin.ReadInt;
            var K = cin.ReadInt;

            var ans = 0L;
            for (int b = 1; b < N+1; b++)
            {
                ans += Max(b - K, 0) * (N / b) + Max(N % b + 1 - K, 0) - 1; 
            }
            WriteLine(ans);
        }

        private BigInteger Lcm(BigInteger a, BigInteger b) 
        {
            return (a * b) / Gcd(a, b);
        }

        /// <summary>
        /// 最大公約数計算
        /// </summary>
        /// <param name="a"></param>
        /// <param name="b"></param>
        /// <returns></returns>
        private BigInteger Gcd(BigInteger a, BigInteger b) 
        {
            if (a < b) return Gcd(b, a);
            
            while (b != 0) 
            {
                var mod = a % b;
                a = b;
                b = mod;
            }
            return a;
        }
    }

    public class ConsoleInput
    {
        private readonly System.IO.TextReader _stream;
        private char _separator = ' ';
        private Queue<string> inputStream;
        public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
        {
            this._separator = separator;
            this._stream = stream;
            inputStream = new Queue<string>();
        }

        public string Read
        {
            get
            {
                if (inputStream.Count != 0) return inputStream.Dequeue();
                string[] tmp = _stream.ReadLine().Split(_separator);
                for (int i = 0; i < tmp.Length; i++)
                    inputStream.Enqueue(tmp[i]);
                return inputStream.Dequeue();
            }
        }

        public string ReadLine { get { return _stream.ReadLine(); } }
        public int ReadInt { get { return int.Parse(Read); } }
        public long ReadLong { get { return long.Parse(Read); } }
        public double ReadDouble { get { return double.Parse(Read); } }
        public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
        public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
        public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
    }

    /// <summary>
    /// Mod計算用クラス
    /// </summary>
    struct ModInt
    {
        const int M = 1000000007;
        public long V;
        public ModInt(long v) { V = (v %= M) < 0 ? v + M : v; }

        public static implicit operator ModInt(long v) => new ModInt(v);
        public static ModInt operator +(ModInt x) => x;
        public static ModInt operator -(ModInt x) => -x.V;
        public static ModInt operator +(ModInt x, ModInt y) => x.V + y.V;
        public static ModInt operator -(ModInt x, ModInt y) => x.V - y.V;
        public static ModInt operator *(ModInt x, ModInt y) => x.V * y.V;
        public static ModInt operator /(ModInt x, ModInt y) => x.V * y.Inv();

        public ModInt Pow(int i) => MPow(V, i);
        public ModInt Inv() => MPow(V, M - 2);
        public override string ToString() => $"{V}";

        static long MPow(long b, int i)
        {
            for (var r = 1L; ; b = b * b % M)
            {
                if (i % 2 > 0) r = r * b % M;
                if ((i /= 2) < 1) return r;
            }
        }

        public static long MFactorial(int n) { for (long x = 1, i = 1; ; x = x * ++i % M) if (i >= n) return x; }
        public static long MNpr(int n, int r)
        {
            if (n < r) return 0;
            for (long x = 1, i = n - r; ; x = x * ++i % M) if (i >= n) return x;
        }
        public static ModInt MNcr(int n, int r) => n < r ? 0 : n - r < r ? MNcr(n, n - r) : (ModInt)MNpr(n, r) / MFactorial(r);
    }
}