题目链接:
BZOJ 3994 约数个数和
题意:
求∑ni=1∑mj=1d(i∗j),定义d(i)为i的约数个数.n,m∈[1,50000]
分析:
ans=∑gcd(i,j)=1⌊ni⌋⌊mj⌋=∑i=1n⌊ni⌋∑j=1m⌊mj⌋
定义g(n)=∑ni=1⌊ni⌋=∑ni=1d(i) ,只需要预处理出 g(n) 就可以在 O(n−−√) 时间范围内解决问题。如果选择分步加速的话,预处理的复杂度是 O(nn−−√) ,但是其实我们考虑每个数 i 的约数个数,然后
亲测
g
如果分步加速预处理
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <string>
using namespace std;
typedef long long ll;
const int MAX_N = 50010;
int prime_cnt, prime[MAX_N], mu[MAX_N], num[MAX_N];
ll g[MAX_N], d[MAX_N], sum[MAX_N];
bitset<MAX_N> bs;
void GetMu()
{
bs.set();
prime_cnt = 0;
mu[1] = d[1] = 1;
for(int i = 2; i < MAX_N; ++i) {
if(bs[i]) {
prime[prime_cnt++] = i;
mu[i] = -1;
num[i] = 1;
d[i] = 2;
}
for(int j = 0; j < prime_cnt && i * prime[j] < MAX_N; ++j) {
bs[i * prime[j]] = 0;
if(i % prime[j]) {
mu[i * prime[j]] = -mu[i];
num[i * prime[j]] = 1;
d[i * prime[j]] = d[i] * d[prime[j]];
}else {
mu[i * prime[j]] = 0;
num[i * prime[j]] = num[i] + 1;
d[i * prime[j]] = d[i] / (num[i] + 1) * (num[i] + 2);
break;
}
}
}
for(int i = 1; i < MAX_N; ++i) {
sum[i] = sum[i - 1] + mu[i];
g[i] = g[i - 1] + d[i];
}
}
inline ll solve(int n, int m)
{
ll res = 0;
int top = min(n, m), last;
for(int i = 1; i <= top; i = last + 1) {
last = min(n / (n / i), m / (m / i));
res += (sum[last] - sum[i - 1]) * g[n / i] * g[m / i];
}
return res;
}
int main()
{
GetMu();
int T, n, m;
scanf("%d", &T);
while(T--) {
scanf("%d%d", &n, &m);
printf("%lld\n", solve(n, m));
}
return 0;
}