HDOJ 2609How many

How many

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1687    Accepted Submission(s): 683

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  2612  1131  2572  1130 

#include <cstdio>
#include <cstring>
#include <string>
#include <map>

using namespace std;

int get_min(char *str, int len) {
	int i, j, k;
	i = k = 0, j = 1;

	while (i < len && j < len && k < len) {
		int t = str[(i + k) % len] - str[(j + k) % len];
		if (t == 0)
			++k;
		else {
			if (t < 0) j += k + 1;
			else i += k + 1;
			if (i == j) ++j;
			k = 0;
		}
	}
	return i < j ? i : j;
}

int main() {
	int T;

	while (~scanf("%d", &T)) {
		map<string, bool> mp;
		char str[110];
		while (T--) {
			scanf("%s", str);
			int len = strlen(str);
			int lct = get_min(str, len);
			string st(str + lct, str + len);
			st.append(str, str + lct);
			mp[st] = true;
		}
		printf("%ld\n", mp.size());
	}

	return 0;
}