HDU 2609 How many(最小表示法)
来源:互联网 发布:linux网络书籍 编辑:程序博客网 时间:2024/06/06 00:16
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.
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.
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').
4011011001001001141010010110000001
12
题解:
题意:
给一堆字符串,题目如果一位位整体循环移动可以相同就算同一种串,问你有多少种串
思路:
用最小表示法把该串表示出来存起来,最后排一下序,如果和前面的串相同就跳过,不同就计数
代码:
#include<algorithm>#include<iostream>#include<cstring>#include<stdio.h>#include<math.h>#include<string>#include<stdio.h>#include<queue>#include<stack>#include<map>#include<vector>#include<deque>using namespace std;#define lson k*2#define rson k*2+1#define M (t[k].l+t[k].r)/2#define INF 1008611111#define ll long long#define eps 1e-15struct node{ char s[105];}a[10005];int cmp(node x,node y)//按照字典序排好{ return strcmp(x.s,y.s)<0;}int getminmax(char word[])//最小表示法模板{ int i=0,j=1,k=0; int wlen=strlen(word); while(i<wlen&&j<wlen&&k<wlen) { int t=word[(i+k)%wlen]-word[(j+k)%wlen]; if(!t) k++; else { if(t>0) i=i+k+1; else j=j+k+1; if(i==j) j++; k=0; } } return i<j?i:j;}int main(){ char p[105]; int i,j,ans,n,k,d; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) { scanf("%s",p); d=getminmax(p); for(j=d,k=0;j<strlen(p);j++,k++)//储存该串 a[i].s[k]=p[j]; for(j=0;j<d;j++,k++) a[i].s[k]=p[j]; a[i].s[k]='\0'; } sort(a,a+n,cmp); ans=1; for(i=1;i<n;i++) { if(strcmp(a[i].s,a[i-1].s)==0)//排序后对比 continue; ans++; } printf("%d\n",ans); } return 0;}
阅读全文
0 0
- hdu 2609 How many(最小表示法)
- [最小表示法] hdu 2609 How many
- [最小表示法] HDU 2609 How many
- HDU - 2609 How many(最小表示法)
- HDU 2609 How many(最小表示法)
- HDU-2609 How many (最小表示法)
- HDU 2609 How many [最小表示法]
- hdu 2609 How many(最小表示法)
- hdu 2609 How many (最小表示法+map)
- hdu 2609 How many(字符串的最小表示法)
- HDU 2609 How many(最小表示法)
- HDU 2609 How many (最小表示法)
- HDU 2609 How many(字符串同构,最小表示法)
- HDU 2609 How many(最小表示法)
- HDU 2609 How Many [最小表示法] [字符串处理]
- HDU 2609 How Many最大最小表示法的模板
- HDU 2609 How many(最小表示法+set判重两种写法)
- hdu 2609 How many(最小表示法模板+set判重)
- 面对对象--回顾初识
- Java汉字转换成拼音利用pinyin4j的jar包实现
- HNUST 1747: 硬币翻转(简单博弈)
- springboot【25】定时任务@Scheduled
- spring 返回值类型是String
- HDU 2609 How many(最小表示法)
- 生成csv文件并下载
- BZOJ 2457: [BeiJing2011]双端队列 贪心
- 剑指offer(二)替换字符
- RMQ (Range Minimum/Maximum Query)算法
- Python 不换行输出
- Spring 四种切面技术(拦截)、获取Spring容器的两种办法
- eclipse快捷键设置大全
- Lisview下item添加阴影效果