hdu2609---How many
来源:互联网 发布:阿里云授权给分销商 编辑:程序博客网 时间:2024/05/07 06:21
Problem Description
Give you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell me
How many kinds of necklaces total have.(if two necklaces can equal by rotating ,we say the two necklaces are some).
For example 0110 express a necklace, you can rotate it. 0110 -> 1100 -> 1001 -> 0011->0110.
Input
The input contains multiple test cases.
Each test case include: first one integers n. (2<=n<=10000)
Next n lines follow. Each line has a equal length character string. (string only include ‘0’,’1’).
Output
For each test case output a integer , how many different necklaces.
Sample Input
4 0110 1100 1001 0011 4 1010 0101 1000 0001
Sample Output
1 2
Author
yifenfei
Source
奋斗的年代
Recommend
yifenfei | We have carefully selected several similar problems for you: 2608 1131 2572 1130 2610
把每一个串用最小表示法表示,然后统计出不同的字符串的个数
/************************************************************************* > File Name: hdu2609.cpp > Author: ALex > Mail: zchao1995@gmail.com > Created Time: 2015年02月17日 星期二 22时06分29秒 ************************************************************************/#include <map>#include <set>#include <queue>#include <stack>#include <vector>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const double pi = acos(-1);const int inf = 0x3f3f3f3f;const double eps = 1e-15;typedef long long LL;typedef pair <int, int> PLL;const int N = 10010;const int M = 110;char str[N][M];char s[M];set <string> st;void minway (char str[]){ int len = strlen (str); int i = 0; int j = 1; int k = 0; while (i < len && j < len && k < len) { int t = str[(i + k) % len] - str[(j + k) % len]; if (!t) { ++k; } else { if (t > 0) { i += k + 1; } else { j += k + 1; } k = 0; if (i == j) { ++j; } } } int start = min (i, j); for (int i = 0; i < len; ++i) { s[i] = str[(i + start) % len]; } s[len] = '\0'; st.insert(s);}int main (){ int n; while (~scanf("%d", &n)) { st.clear(); for (int i = 1; i <= n; ++i) { scanf("%s", str[i]); minway(str[i]); } int size = st.size(); printf("%d\n", size); } return 0;}
- hdu2609---How many
- hdu2609 How many (最小表示法)
- 最小表示法+hash hdu2609 How many
- HDU2609 How many(最小表示法)
- How many 杭电oj 2609 hdu2609 最小表示
- hdu2609-字符串最小表示法|模拟|二分+lcp-How many
- HDU2609 How many(字符串的最小表示+set)
- HDU2609 How many(字符串的最小表示法)
- hdu2609
- How many
- How many zeros and how many digits?
- How many zeros and how many digits?
- how many java objects?
- How many的用法
- How many N
- How many different numbers
- How many fibs
- hdu1978 How many ways
- ie下提示SCRIPT1028:缺少标识符、字符串或数字
- ubuntu 安装 Qt4.8.6
- Android按返回键退出程序但不销毁,程序后台运行,同QQ退出处理方式
- uva 1347 - Tour(双调欧几里得)
- Java的IO流系列: FileOutputStream/PipedOutputStream
- hdu2609---How many
- IE6-IE9不支持table.innerHTML的解决方法分享
- 中国这些行贿方式 打死你或许都想不到
- HDU 1301 Jungle Roads
- 串讲Apache OFBiz技术架构
- UVA 12563 Jin Ge Jin Qu hao(01背包变形:两个背包内容)
- Foreign Exchange
- 数据库查询优化的方法
- hdu变形课(dfs)