YBT高效进阶 6.2.5 余数之和

YBT高效进阶 6.2.5 余数之和

思路

$(n,k)$

$={\sum }_{i=1}^{n}k\mathrm{m}\mathrm{o}\mathrm{d}i$

$={\sum }_{i=1}^{n}k-\lfloor \frac{k}{i}\rfloor$

$=n\ast k-{\sum }_{i=1}^n\lfloor \frac{k}{i}\rfloor$

分块

$i\in [x,\lfloor \frac{k}{\lfloor \frac{k}{x}\rfloor }\rfloor ]时\lfloor \frac{k}{i}\rfloor 的值相等$

再用等差数列

$(x+\lfloor \frac{k}{\lfloor \frac{k}{x}\rfloor }\rfloor )/2$

$n\ast k-{\sum }_{i=1}^n\lfloor \frac{k}{i}\rfloor$

$=n\ast k-\sum (x+\lfloor \frac{k}{\lfloor \frac{k}{x}\rfloor }\rfloor )\ast (\lfloor \frac{k}{\lfloor \frac{k}{x}\rfloor }\rfloor -x+1)/2\ast \lfloor \frac{k}{x}\rfloor$

CODE

#include<iostream> 
#include<cstdio>
using namespace std;
int main()
{
	long long ans,n,k,i,x;
	scanf("%lld%lld",&n,&k);
	for(ans=n*k,i=1;i<=n;i=x+1)x=(k/i)?min(n,k/(k/i)):n,ans-=k/i*(i+x)*(x-i+1)/2;
	printf("%lld",ans);
	return 0;
}