组合数学专题:Polya计数原理及其应用,模板题【poj2409】
来源:互联网 发布:java教程博客 编辑:程序博客网 时间:2024/06/05 13:25
Polya定理参见:http://wenku.baidu.com/view/bf92a95f804d2b160b4ec0be.html?re=view
Polya定理练习题总结:http://blog.csdn.net/acm_cxlove/article/details/7453061
注意:算法思考可以参考,代码不要照搬。
POJ模板题:http://poj.org/problem?id=2409
Let it Bead
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4758 Accepted: 3139
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.
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 12 12 25 12 52 66 20 0
Sample Output
123581321
Source
Ulm Local 2000
0 0
- 组合数学专题:Polya计数原理及其应用,模板题【poj2409】
- Poj2409 polya计数
- poj_Necklace of Beads_组合数学polya计数
- Polya计数法总结 POJ2409&&2154&&SGU282
- poj2409(polya计数 套模版)
- poj2409 等价类计数问题 polya定理
- 组合数学:容斥原理及其应用
- (带讲解)poj2409&poj1286 polya模板
- 置换与Polya 计数原理-应用部分
- 组合数学 容斥原理 专题
- polya定理 poj1286 poj2409
- 组合计数问题中容斥原理的应用
- 组合数学-基本计数
- [BZOJ2839]集合计数(容斥原理+组合数学)
- BZOJ 2839: 集合计数 容斥原理 组合数学
- polya定理 和 置换 poj2409
- POJ2409--Let it Bead--Polya
- 数学模板 - 组合数学
- erlang开发经验谈:防坑指南
- 【Linux学习】epoll详解
- Android NDK 学习(5) 使用CDT特性 实现自动化编译
- C# 输出格式控制符
- Android new sdk black screen
- 组合数学专题:Polya计数原理及其应用,模板题【poj2409】
- epoll实现linux进程通信
- 【割桥】 HDU 4738 Caocao's Bridges 重边 割桥权值最小值
- Java-注解
- Nginx介绍和实例
- 兔子--bat文件
- 工作第一年
- linux下Epoll实现简单的C/S通信
- 一个epoll/aio/eventfd结合使用的简单例子