poj2409 Let it Bead

polya定理

讲解看前篇~~

贴代码

#include<stdio.h>
typedef unsigned long long ll;
int n,m;
ll gcd(int a,int b)
{
	if(b==0)return a;
	return gcd(b,a%b);
}
ll quick(int x,int y)
{
	ll sum=1;
	while(y)
	{
		if(y%2==1)
		{
			sum*=x;
		}
		x*=x;
		y/=2;
	}
	return sum;
}
ll opp()
{
	if(m%2==0)
	{
		return ((m/2)*(quick(n,m/2)+quick(n,(m-2)/2+2)))/m;
	}else
	{
		return quick(n,(m-1)/2+1);
	}
}
ll turn()
{
	ll ans=quick(n,m);
	for(int i=1;i<m;i++)
	{
		ans+=quick(n,gcd(i,m));
	}
	return ans/m;
}
int main()
{
	while(scanf("%d %d",&n,&m)!=EOF)
	{
		if(n==0&&m==0)return 0;
		printf("%llu\n",(opp()+turn())/2);
	}
}