POJ2449 Let it Bead

Description

"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

For each test case output on a single line the number of unique bracelets. The figure below shows the 8 different bracelets that can be made with 2 colors and 5 beads.

Sample Input

1 1
2 1
2 2
5 1
2 5
2 6
6 2
0 0

Sample Output

1
2
3
5
8
13
21

题目大意:给出项链上的珠子个数与颜色数量,求不同染色方案数(俩条项链相同,当且仅当俩条项链通过旋转或者翻转能重合在一起,且对应珠子的颜色相同)

Polya计数。。。

1.将项链顺时针旋转 i 格后,其循环节为 gcd(n,i),即 n 与 i 最大公约数; 

2. n 为奇数时,共有 n 个循环节为(n+1)/2 的循环群。
当 n 为偶数时,共有 n/2 个循环节为(n+2)/2 的循环群,和 n/2 个循环节数为 n/2 的循环群。

综上,我们通过 Polya 定理就能计算出一共能做成多少种不同的项链。

附代码:

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,m;
inline int read(){
	int date=0,w=1;char c=0;
	while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
	while(c>='0'&&c<='9'){date=date*10+c-'0';c=getchar();}
	return date*w;
}
long long gcd(long long a,long long b){
    if(!b)return a;
    return gcd(b,a%b);
}
long long mexp(long long a,long long b){
    long long s=1;
    while(b){
        if(b&1)s*=a;
        a*=a;
        b>>=1;
    }
    return s;
}
int main(){
    while(1){
        n=read();m=read();
        if(n==0&&m==0)break;
        long long ans=0;
        for(int i=1;i<=m;i++)ans+=mexp(n,gcd(i,m));
        if(m&1)ans+=mexp(n,m/2+1)*m;
        else ans+=mexp(n,m/2)*(m/2)+mexp(n,m/2+1)*(m/2);
        ans/=m*2;
        printf("%lld\n",ans);
    }
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值