http://acm.hdu.edu.cn/showproblem.php?pid=1817
Necklace of Beads
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 332 Accepted Submission(s): 112
Problem Description
Beads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 40 ). 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
Source
Recommend
yjf
解析:
根据ploay定理计数:
链子旋转n次,第i 次的循环节数为.gcd(i,n);
对折;
奇数:
n次对折,每次循环基恩数为,(n+1)/2;
偶数:
n/2次边对折:每个循环节数(n+2)/2,
n/2次点对折 :每个循环节数n/2;
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include <iostream>
using namespace std;
long long pow_m(long long a,long long b)
{
if(b==0)
return 1;
long long x=pow_m(a,b/2);
long long ans=x*x;
if(b%2==1)
ans=ans*a;
return ans;
}
long long gcd(long long a,long long b)
{
return b==0? a:gcd(b,a%b);
}
int main()
{ //freopen("1002in.txt","r",stdin);
//freopen("1002ourt.txt","w",stdout);
long long n,i;
long long ans;
while(scanf("%I64d",&n)!=EOF)
{
if(n==-1)
break;
if(n==0)
{printf("0\n");
continue;
}
ans=0;
for(i=1;i<=n;i++)
{long long t=gcd(i,n);
ans+=pow_m(3,t);
}
if(n%2==1)
ans+=pow_m(3,(n+1)/2)*n;
else
{
ans+=pow_m(3,n/2)*(n/2);
ans+=pow_m(3,n/2+1)*(n/2);}
ans=ans/2/n;
printf("%I64d\n",ans);
}
return 0;
}