【POJ 2409】 Let it Bead（置换、burnside引理）

Let it Bead

"Let it Bead" company is located upstairs at 700 Cannery Row in Monterey, CA. As you can deduce from the company name, their business is beads. Their PR department found out that customers are interested in buying colored bracelets. However, over 90 percent of the target audience insists that the bracelets be unique. (Just imagine what happened if two women showed up at the same party wearing identical bracelets!) It's a good thing that bracelets can have different lengths and need not be made of beads of one color. Help the boss estimating maximum profit by calculating how many different bracelets can be produced.

A bracelet is a ring-like sequence of s beads each of which can have one of c distinct colors. The ring is closed, i.e. has no beginning or end, and has no direction. Assume an unlimited supply of beads of each color. For different values of s and c, calculate the number of different bracelets that can be made.

Input

Every line of the input file defines a test case and contains two integers: the number of available colors c followed by the length of the bracelets s. Input is terminated by c=s=0. Otherwise, both are positive, and, due to technical difficulties in the bracelet-fabrication-machine, cs<=32, i.e. their product does not exceed 32.

Output

1 #include<cstdio>
2 #include<cstdlib>
3 #include<cstring>
4 #include<iostream>
5 #include<algorithm>
6 #include<cmath>
7 using namespace std;
8 #define Maxn 60
9 #define LL long long
10
11 LL pw[110];
12
13 int gcd(int a,int b)
14 {
15     if(b==0) return a;
16     return gcd(b,a%b);
17 }
18
19 int main()
20 {
21     int n,t;
22     while(1)
23     {
24         scanf("%d%d",&t,&n);
25         if(n==0&&t==0) break;
26         pw[0]=1;
27         for(int i=1;i<=n;i++) pw[i]=pw[i-1]*t;
28         LL a=0;
29         for(int i=0;i<n;i++) a+=pw[gcd(i,n)];
30         LL b=0;
31         if(n%2==1) b=n*pw[(n+1)/2];
32         else b=n/2*(pw[n/2+1]+pw[n/2]);
33         printf("%lld\n",(a+b)/2/n);
34     }
35     return 0;
36 }

View Code

2017-01-13 11:43:09