2017.8.8 loli测试

太难了不会

#include<algorithm>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include  <stdio.h>
#include   <math.h>
#include   <time.h>
#include   <vector>
#include   <bitset>
#include    <queue>
#include      <set>
#include      <map>
using namespace std;

typedef long long LL;
const int N=17,M=1<<17,Mod=1e9+7;

int n,m,g[N][N],f[M],Num[M],p2[N*N],a[M],b[M];

int main()
{
#ifndef ONLINE_JUDGE
	freopen("obelisk.in","r",stdin);
	freopen("obelisk.out","w",stdout);
#endif
	cin>>n>>m;
	for(int i=1,u,v;i<=m;i++)
		cin>>u>>v,g[u-1][v-1]=1; 
	f[0]=1;Num[0]=-1;
	for(int i=1;i<(1<<n);i++) 
		Num[i]=Num[i>>1]*(i&1?-1:1); //容斥 
	p2[0]=1;
	for(int i=1;i<=n*n;i++)
		p2[i]=p2[i-1]*2%Mod; 
	for(int i=0;i<(1<<n)-1;i++)  
	{
		for(int j=0;j<n;j++)
			b[1<<j]=0; 
		for(int j=0;j<n;j++)
			if(i&(1<<j)) 
				for(int k=0;k<n;k++) 
					b[1<<k]+=g[j][k];   
		int t=(1<<n)-1-i;   
		a[0]=0; 
		for(int s=(t-1)&t;;s=(s-1)&t)
		{
			int Now=t^s,las=Now&-Now; 
			a[Now]=a[Now^las]+b[las];
			f[Now^i]=(f[Now^i]+Num[Now]*p2[a[Now]]*(LL)f[i])%Mod;
		//	cout<<t<<" "<<s<<" "<<i<<" "<<a[Now]<<" "<<(Now^i)<<" "<<Now<<" "<<las<<" "<<b[las]<<endl;
			if(!s)
				break;
		}
	//	cout<<i<<" "<<f[i]<<endl;
	}
	cout<<(f[(1<<n)-1]+Mod)%Mod;
	return 0;
}

#include<algorithm>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include  <stdio.h>
#include   <math.h>
#include   <time.h>
#include   <vector>
#include   <bitset>
#include    <queue>
#include      <set>
#include      <map>
using namespace std;

typedef long long LL;
const int N=10000000,Mod=1e9+7;

LL n;
int p[N/10+5],m,Num[N+5],f[N+5],F[N],Ans;
bool P[N+5];

void sieve(int n)
{
	for(int i=2;i<=n;i++)
	{
		if(!P[i])
			p[++m]=i,Num[i]=1;
		for(int j=1;j<=m&&i*p[j]<=n;j++)
		{
			int k=i*p[j];P[k]=1;
			if(i%p[j]==0)
			{
				Num[k]=Num[i];break;
			}
			Num[k]=Num[i]+1;
		}
	}
	for(int i=1;i<=n;i++)
		f[i]=(f[i-1]+(1<<Num[i]))%Mod;
}

int solve(LL x)
{
	if(x<=N)
		return f[x];
	if(F[n/x]!=-1)
		return F[n/x];
	F[n/x]=0;
	for(LL i=1;i<=x;)
	{
		LL j=x/(x/i);
		F[n/x]=(F[n/x]+x/i*(j-i+1ll))%Mod;i=j+1;
	}
	for(LL i=2;i*i<=x;i++)
		F[n/x]=(F[n/x]-solve(x/(i*i))+Mod)%Mod;
	return F[n/x];
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("ra.in","r",stdin);
	freopen("ra.out","w",stdout);
#endif
	sieve(N);memset(F,-1,sizeof F);
	cin>>n;
	for(LL i=1;i<=n;)
	{
		LL j=n/(n/i);
		Ans=(Ans+solve(n/i)*(j-i+1ll))%Mod;i=j+1;
	}
	cout<<(((n%Mod)*(n%Mod)-Ans)%Mod+Mod)%Mod;
	return 0;
}