代码

//Zory-2019
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<stack>
#include<bitset>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;

namespace mine
{
	typedef long long ll;
	// #define pr pair<int,int>
	// #define FR first
	// #define SE second
	// #define MP make_pair

	const int MAX_NUM=510000;
	bool no[MAX_NUM];int mu[MAX_NUM];
	int pr=0,prime[MAX_NUM];
	void pre()
	{
		mu[1]=1;
		for(int i=2;i<MAX_NUM;i++)
		{
			if(!no[i]) prime[++pr]=i,mu[i]=-1;
			for(int j=1;j<=pr and (ll)i*prime[j]<MAX_NUM;j++)
			{
				int t=i*prime[j];no[t]=1;
				if(i%prime[j]==0) {mu[t]=0;break;}
				mu[t]=mu[i]*mu[prime[j]];
			}
		}
		// for(int i=2;i<MAX_NUM;i++) mu[i]+=mu[i-1];
		for(int i=2;i<MAX_NUM-4;i+=4)
		{
			mu[i]+=mu[i-1];
			mu[i+1]+=mu[i+1-1];
			mu[i+2]+=mu[i+2-1];
			mu[i+3]+=mu[i+3-1];
		}
	}


	const int MOD=1000000007;
	void main()
	{
		int n,m;scanf("%d%d",&n,&m);

	}
};
int main()
{
	srand(time(0));
	mine::main();
}

评测结果