uva1363

<pre name="code" class="cpp">/**********author:chanjun2016email:[e-mail]***********/#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <vector>#include <string>#include <map>#include <set>#include <algorithm>using namespace std;#define INF = 0x3f3f3f3flong long n,k;int main(){while (~scanf("%lld%lld",&n,&k)){long long ans = 0;for (int i = 1;i <= n;){int p = k / i;if (p == 0){ans += k * (n - i + 1);break;}else{long long j = min(n,k / p); //这里的j不能为int，否则会wrans += (k - i * p) * (j - i + 1) - (j - i + 1) * (j - i) / 2 * p;i = j + 1;}}printf("%lld\n",ans);}return 0;}