bzoj3288【线性筛】【结论题】

首先答案就是phi(1)*phi(2)*phi(3)* *** * phi(n)，搜下题解打个表就能看出来

然后直接线性筛就行了

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline int read()
{
	int x=0;bool f=0;char c=getchar();
	for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
	for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
	return f?-x:x;
}
const int N=1000010,mod=1000000007;
int n,phi[N],pr[N],pc;
bool nq[N];LL ans=1;

int main()
{
	n=read();
	for (int i=2;i<=n;i++)
	{
		if (!nq[i]) pr[++pc]=i,phi[i]=i-1;
		for (int j=1,k=i<<1;j<=pc&&k<=n;k=i*pr[++j])
		{
			nq[k]=1;
			if (i%pr[j]==0) {phi[k]=phi[i]*pr[j];break;}
			phi[k]=phi[i]*(pr[j]-1);
		}
	}
	for (int i=2;i<=n;i++) ans=ans*phi[i]%mod;
	printf("%lld\n",ans);
	return 0;
}