【2019 ACM/ICPC徐州站 H function】【min25筛】

题意

题目链接
设$n=p_1^{a_1}\dots p_k^{a_k}$，则定义$f(n)=a_1+\cdots +a_k$。给出$n$，求$$\sum _{i=1}^{n}f(i!)$$
$n\le 10^{10}$

分析

显然要求的是$$\sum _{p\in \mathbb{P}}\sum _{k\ge 1}\sum _{i=1}^n\lfloor \frac{n}{p^k}\rfloor$$
$$=\sum _{p\in \mathbb{P}}\sum _{k\ge 1}(n+1)\lfloor \frac{n}{p^k}\rfloor -p^{k}sum(\lfloor \frac{n}{p^k}\rfloor )$$
其中$sum(x)=\frac{x(x+1)}{2}$
对于不超过$\sqrt{n}$的素数可以暴力计算贡献，剩下部分就是$$\sum _{p\in \mathbb{P}}(n+1)\lfloor \frac{n}{p}\rfloor -psum(\lfloor \frac{n}{p}\rfloor )$$
直接用min25筛分块即可。

代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>

typedef long long LL;

const int N=200005;
const int MOD=998244353;
const int B=100000;

LL n,w[N];
int tot,prime[N],s[N],m,g[N],h[N],id1[N],id2[N];
bool not_prime[N];

void get_prime(int n)
{
	for (int i=2;i<=n;i++)
	{
		if (!not_prime[i]) prime[++tot]=i,s[tot]=(s[tot-1]+i)%MOD;
		for (int j=1;j<=tot&&i*prime[j]<=n;j++)
		{
			not_prime[i*prime[j]]=1;
			if (i%prime[j]==0) break;
		}
	}
}

int sum(LL n)
{
	n%=MOD;
	return (LL)(MOD+1)/2*n%MOD*(n+1)%MOD;
}

int get(LL p)
{
	return ((LL)(n+1)%MOD*(n/p%MOD)-(LL)p*sum(n/p))%MOD;
}

int find1(LL x)
{
	return x<=B?h[id1[x]]:h[id2[n/x]];
}

int find2(LL x)
{
	return x<=B?g[id1[x]]:g[id2[n/x]];
}

int main()
{
	scanf("%lld",&n);
	get_prime(B);
	for (LL i=1,last;i<=n;i=last+1)
	{
		last=n/(n/i);w[++m]=n/i;
		g[m]=sum(n/i)-1;h[m]=n/i-1;
		if (n/i<=B) id1[n/i]=m;
		else id2[last]=m;
	}
	for (int j=1;j<=tot;j++)
		for (int i=1;i<=m&&(LL)prime[j]*prime[j]<=w[i];i++)
		{
			int k=w[i]/prime[j]<=B?id1[w[i]/prime[j]]:id2[n/(w[i]/prime[j])];
			(g[i]-=(LL)prime[j]*(g[k]-s[j-1])%MOD)%=MOD;
			h[i]-=h[k]-j+1;
		}
	int ans=0;
	for (int i=1;i<=tot;i++)
		for (LL j=(LL)prime[i]*prime[i];j<=n;j=(LL)j*prime[i])
			(ans+=get(j))%=MOD;
	for (LL i=2,last;i<=n;i=last+1)
	{
		last=n/(n/i);
		(ans+=(LL)(n+1)%MOD*(n/i%MOD)%MOD*(find1(last)-find1(i-1))%MOD)%=MOD;
		(ans-=(LL)sum(n/i)*(find2(last)-find2(i-1))%MOD)%=MOD;
	}
	printf("%d\n",(ans+MOD)%MOD);
	return 0;
}