思路:如下
代码:
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N=1e3+10;
typedef long long ll;
ll ans,l,r,n,k;
int main()
{
cin>>n>>k;
ans=n*k;
for(l=1;l<=n;l=r+1)
{
if(k/l==0) break;
r=min(k/(k/l),n);
ans-=(k/l)*(l+r)*(r-l+1)/2;
}
cout<<ans<<endl;
return 0;
}