【POJ 1286】Necklace of Beads(Polya 定理)
来源:互联网 发布:linux smartctl 安装 编辑:程序博客网 时间:2024/05/16 05:56
Necklace of Beads
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7588 Accepted: 3159
Description
Beads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 24 ). 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.
-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
45-1
Sample Output
2139
Source
Xi'an 2002
[Submit] [Go Back] [Status] [Discuss]
[题意][一个手镯,用三种颜色图,可以旋转和翻转,求有多少方案。]
【题解】【Polya 定理】
本题可直接代入公式计算
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;long long p[110],ans,n;long long gcd(int a,int b){if(!(a%b)) return b;return gcd(b,a%b);}int main(){int i,j;while((scanf("%I64d",&n)==1)) { if(!n) {printf("0\n"); continue;} if(n==-1) return 0; p[0]=1; for(i=0;i<n;++i) p[i+1]=p[i]*3; if(!(n%2)) ans=(n/2)*(p[n/2+1]+p[n/2]); else ans=n*p[n/2+1];for(i=1;i<=n;++i) ans+=p[gcd(i,n)]; ans/=2*n;printf("%I64d\n",ans); }return 0;}
0 0
- POJ--1286[Necklace of Beads] Polya定理
- POJ 1286 Necklace of Beads Polya定理
- poj 1286 Necklace of Beads(Polya定理)
- POJ 题目1286 Necklace of Beads(Polya定理)
- poj Necklace of Beads 1286 (polya定理)置换群
- 【POJ 1286】Necklace of Beads(polya定理)
- poj 1286 Necklace of Beads(polya 定理)
- 【POJ 1286】Necklace of Beads(Polya 定理)
- POJ 1286 Necklace of Beads (Polya定理)
- POJ 1286 Necklace of Beads(polya)
- POJ 1286 Necklace of Beads (Polya)
- POJ 1286 Necklace of Beads(polya计数、burnside定理)
- poj1286 Necklace of Beads(polya定理)
- Polya 定理 (附POJ 1286 Necklace of Beads 解题报告)
- POJ 1286-Necklace of Beads(Polya定理-旋转+翻转 串项链)
- poj 1286 Necklace of Beads -----polya计数
- poj 1286 Necklace of Beads (polya)
- poj 1286 Necklace of Beads polya计数
- 寻找下一个结点
- JAVA之使用JDBC连接数据库-使用jtds 连接Sql Server 2005数据库
- 前端性能优化
- dpi对应图标分辨率
- odoo8 FormView的one2many中many记录删除权限精细控制
- 【POJ 1286】Necklace of Beads(Polya 定理)
- IOS FFMPEG的使用
- 序列模型-RNN
- 还在用ListView?!OutMan!RecyclerView!
- LeetCode 92. Reverse Linked List II(翻转链表)
- 扩展欧几里德求逆元,快速幂 hdoj 1211
- Objective-C ---代理和协议 (梳理整理)
- datetimepicker 插件用法及参数说明
- mongoVUE 连接MongoDB3.2.2不能正常显示collection的问题