组合数学专题:Polya计数原理及其应用,模板题【poj2409】
2015-02-12 23:04
253 查看
Polya定理参见:http://wenku.baidu.com/view/bf92a95f804d2b160b4ec0be.html?re=view
Polya定理练习题总结:/article/2565867.html
注意:算法思考可以参考,代码不要照搬。
POJ模板题:http://poj.org/problem?id=2409
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
Sample Output
Source
Ulm Local 2000
Polya定理练习题总结:/article/2565867.html
注意:算法思考可以参考,代码不要照搬。
POJ模板题:http://poj.org/problem?id=2409
Let it Bead
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 4758 | Accepted: 3139 |
"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
Source
Ulm Local 2000
相关文章推荐
- DFS及其应用 专题
- dedecms专题模板应用分析及解决方案
- OpenCV中的模板匹配方法及其应用
- IP地址专题九:子网掩码及其应用
- 数据结构与算法专题之线性表——队列及其应用
- OpenCV中的模板匹配方法及其应用
- 置换与Polya 计数原理-应用部分
- 扩展欧几里得、求乘法逆元及其应用、中国剩余定理(互质版和非互质版)、欧拉函数、快速判素数模板
- 拓扑排序模板及其应用
- 组合数学--Polya 原理及典型应用
- C语言专题(二):函数指针及其应用
- OpenCV中的模板匹配方法及其应用
- OpenCV中的模板匹配方法及其应用
- 数据结构与算法专题之线性表——栈及其应用
- 矩阵快速幂模板及其应用(洛谷3390)(洛谷1962)
- LCT 基本概念 模板 及其应用
- 组合数学:容斥原理及其应用
- 栈的类模板及其应用
- OpenCV中的模板匹配方法及其应用
- IP地址专题九:子网掩码及其应用