Ice Rain（区间数论优化）

ac代码

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
int main(){
	ll n,k;
    while(scanf("%lld %lld",&n,&k) != EOF)
	{
        ll ans = n * k;
        if(n > k)
			n = k;
        for(ll i = 1; i <= n;)
        {
            ll d = k / i;
            ll j = k / d;
            if(j > n)
				j = n;
            ans = ans - d * ((j - i + 1) * (i + j) / 2);
            i=j+ 1;
        }
        printf("%lld\n",ans);
    }
    return 0;
}