output_description: Print the number of possible pairs that he may have had.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: #include <iostream>
  #include <string>
  #include <sstream>
  #include <vector>
  #include <iomanip>
  #include <iterator>
  #include <algorithm>
  #include <functional>
  #include <typeinfo>
  #include <utility>
  #include <tuple>
  #include <queue>
  #include <deque>
  
  using namespace std;
  
  #define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
  #define rep(i, n) repr(i, 0, n)
  #define reprrev(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
  #define reprev(i, n) reprrev(i, 0, n)
  #define mp(a, b) make_pair(a, b)
  #define all(vec) (vec).begin(), (vec).end()
  #define yn(formula) (formula) ? (cout << "Yes" << endl) : (cout << "No" << endl)
  #define YN(formula) (formula) ? (cout << "YES" << endl) : (cout << "NO" << endl)
  #define MIN(a, b) ((a) < (b)) ? (a) : (b)
  
  typedef long long ll;
  typedef pair<int, int> pii;
  typedef pair<ll, ll> pll;
  typedef vector<int> vi;
  typedef vector<ll> vll;
  typedef vector<bool> vb;
  typedef vector<char> vc;
  typedef vector<string> vs;
  typedef vector<pii> vp;
  typedef vector<pll> vpl;
  typedef vector<vi> vvi;
  typedef vector<vll> vvl;
  typedef vector<vb> vvb;
  typedef vector<vc> vvc;
  typedef vector<vs> vvs;
  typedef vector<vp> vvp;
  typedef vector<vpl> vvpl;
  
  constexpr double PI = 3.14159265358979323846;
  constexpr ll INF = 1 << 29;
  constexpr ll MOD = (ll)1e9 + 7;
  constexpr double EPS = 1e-7;
  constexpr int dy[4] = { 0, 1, 0, -1 };
  constexpr int dx[4] = { 1, 0, -1, 0 };
  
  struct edge { ll to; ll cost; };
  
  /*<ここから>***********************************************************/
  
  
  int main()
  {
  	int N, K;
  	cin >> N >> K;
  
  	int ans = 0;
  	repr(i, 1, N + 1) {
  		ans += N / i * max(0, i - K);
  		ans += max(0, N % i - K + 1);
  	}
  
  	cout << ans << endl;
  
  	return 0;
  }
problem_description: 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.
samples: [{"input": "5 2", "output": "7\n    \n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\n* * *"}, {"input": "10 0", "output": "100\n    \n\n* * *"}, {"input": "31415 9265", "output": "287927211"}]