POJ1286--Necklace of Beads

Description

Beads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 24 ). If the repetitions that are produced by rotation around the center of the circular necklace or reflection to the axis of symmetry are all neglected, how many different forms of the necklace are there?

Input

The input has several lines, and each line contains the input data n.
-1 denotes the end of the input file.

Output

The output should contain the output data: Number of different forms, in each line correspondent to the input data.

Sample Input

4
5
-1

Sample Output

21
39

#include<stdio.h>
int m,n;
long long ans;
long long pw(int x,int y)x的y次幂
{
	if(y==0)
	return 1;
	return x*pw(x,y-1);
}
int gcd(int a,int b)
{
	if(b==0)		return a;
	return gcd(b,a%b);
}
int main()
{
	//freopen("in.txt","r",stdin);
	while(scanf("%d",&n)!=EOF && n!=-1)/m是那个颜色数目，n是珠子数
	{
		if(n == 0)	
		{	printf("0\n");	continue;	}
		ans=0;
		for(int i=1;i<=n;i++)
		ans+=pw(3,gcd(n,i));
		if((n&1) == 1)	ans+=n*pw(3,(n+1)>>1);
		else		
		{
			ans+=(n>>1)*pw(3,(n+2)>>1);
			ans+=(n>>1)*pw(3,n>>1);
		}
		printf("%I64d\n",ans/2/n);
	}
	return 0;
}