Dividing
题意:
题解:
代码:
///Dividing
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll n, k, ans = 0;
void calc(ll n, ll k)
{
for (ll l = 2, r; l <= min(n, k); l = r + 1)
{
r = min(n / (n / l), k);
ans = (ans + ((r - l + 1) % mod) * ((n / l) % mod) % mod) % mod;
}
}
int main()
{
scanf("%lld%lld", &n, &k);
ans = (n + k - 1) % mod;
calc(n, k);
calc(n - 1, k);
printf("%lld\n", ans);
return 0;
}