题目大意:给出正整数n和k,计算j(n, k)=k mod 1 + k mod 2 + k mod 3 + … + k mod n的值,其中k mod i表示k除以i的余数。例如j(5, 3)=3 mod 1 + 3 mod 2 + 3 mod 3 + 3 mod 4 + 3 mod 5=0+1+0+3+3=7
不难得到如下变换k%i=k-(k/i)*i;问题在于如何求得(k/i)*i,根据整除的性质,(k/i)共有根号k种取值,对于取值x,我们处理出它的左边界l和右边界r,则对答案的贡献为(l+l+1+…+r)*x,相当于将答案分块,共有根号K块,所以复杂度即为根号K。
Tips:SB题还WA了一次,只考虑到了n>k的情况,k也可以大于n,写边界的时候要取min…
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
long long ans;
int n,k;
int main()
{
//freopen("1257.in","r",stdin);
//freopen("1257.out","w",stdout);
scanf("%d%d",&n,&k);
ans=(long long)min(n,k)*(long long)k;
if(n>k) ans+=(long long)(n-k)*(long long)k;
int l=1;
while(l<=min(k,n))
{
int x=k/(k/l);x=min(x,n);
long long res=(long long)(l+x)*(long long)(x-l+1)/2*(long long)(k/x);
ans-=res;l=x+1;
}
printf("%lld\n",ans);
return 0;
}