HDU3746:Cyclic Nacklace
来源:互联网 发布:淘宝开店一件代发经验 编辑:程序博客网 时间:2024/06/05 16:13
Problem Description
CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to tide over the last days. Being inspired by the entrepreneurial spirit of "HDU CakeMan", he wants to sell some little things to make money. Of course, this is not an easy task.
As Christmas is around the corner, Boys are busy in choosing christmas presents to send to their girlfriends. It is believed that chain bracelet is a good choice. However, Things are not always so simple, as is known to everyone, girl's fond of the colorful decoration to make bracelet appears vivid and lively, meanwhile they want to display their mature side as college students. after CC understands the girls demands, he intends to sell the chain bracelet called CharmBracelet. The CharmBracelet is made up with colorful pearls to show girls' lively, and the most important thing is that it must be connected by a cyclic chain which means the color of pearls are cyclic connected from the left to right. And the cyclic count must be more than one. If you connect the leftmost pearl and the rightmost pearl of such chain, you can make a CharmBracelet. Just like the pictrue below, this CharmBracelet's cycle is 9 and its cyclic count is 2:
Now CC has brought in some ordinary bracelet chains, he wants to buy minimum number of pearls to make CharmBracelets so that he can save more money. but when remaking the bracelet, he can only add color pearls to the left end and right end of the chain, that is to say, adding to the middle is forbidden.
CC is satisfied with his ideas and ask you for help.
As Christmas is around the corner, Boys are busy in choosing christmas presents to send to their girlfriends. It is believed that chain bracelet is a good choice. However, Things are not always so simple, as is known to everyone, girl's fond of the colorful decoration to make bracelet appears vivid and lively, meanwhile they want to display their mature side as college students. after CC understands the girls demands, he intends to sell the chain bracelet called CharmBracelet. The CharmBracelet is made up with colorful pearls to show girls' lively, and the most important thing is that it must be connected by a cyclic chain which means the color of pearls are cyclic connected from the left to right. And the cyclic count must be more than one. If you connect the leftmost pearl and the rightmost pearl of such chain, you can make a CharmBracelet. Just like the pictrue below, this CharmBracelet's cycle is 9 and its cyclic count is 2:
Now CC has brought in some ordinary bracelet chains, he wants to buy minimum number of pearls to make CharmBracelets so that he can save more money. but when remaking the bracelet, he can only add color pearls to the left end and right end of the chain, that is to say, adding to the middle is forbidden.
CC is satisfied with his ideas and ask you for help.
Input
The first line of the input is a single integer T ( 0 < T <= 100 ) which means the number of test cases.
Each test case contains only one line describe the original ordinary chain to be remade. Each character in the string stands for one pearl and there are 26 kinds of pearls being described by 'a' ~'z' characters. The length of the string Len: ( 3 <= Len <= 100000 ).
Each test case contains only one line describe the original ordinary chain to be remade. Each character in the string stands for one pearl and there are 26 kinds of pearls being described by 'a' ~'z' characters. The length of the string Len: ( 3 <= Len <= 100000 ).
Output
For each case, you are required to output the minimum count of pearls added to make a CharmBracelet.
Sample Input
3aaaabcaabcde
Sample Output
025
还是最小循环姐问题 如果珠子数除得劲循环节 那就正好
除不尽的时候 比如 循环节是5 剩3 个 那就再配两个 所以是 循环节-len%循环节
#include <iostream>#include<cstdio>#include<cstring>using namespace std;char a[1000005];int n[1000005];void kmp(int len){ n[0]=-1; int k=-1; int j=0; while(j<=len) { if(k==-1||a[j]==a[k]) { k++; j++; n[j]=k; } else k=n[k]; }}int main(){ int t; cin>>t; while(t--) { scanf("%s",a); int len=strlen(a); kmp(len); int ans; ans=len-n[len]; if(ans!=len&&len%ans==0) cout <<"0"<< endl; else cout<<ans-n[len]%ans<<endl; } return 0;}
阅读全文
0 0
- hdu3746 Cyclic Nacklace
- 【KMP】 hdu3746 Cyclic Nacklace
- HDU3746:Cyclic Nacklace
- hdu3746(Cyclic Nacklace)
- hdu3746 Cyclic Nacklace
- HDU3746 Cyclic Nacklace
- HDU3746-Cyclic Nacklace(KMP)
- HDU3746 Cyclic Nacklace 【KMP】
- HDU3746 Cyclic Nacklace
- hdu3746 Cyclic Nacklace(KMP)
- hdu3746 Cyclic Nacklace--KMP
- hdu3746 Cyclic Nacklace
- HDU3746 Cyclic Nacklace
- HDU3746-Cyclic Nacklace
- HDU3746 Cyclic Nacklace(KMP)
- HDU3746:Cyclic Nacklace
- HDU3746--Cyclic Nacklace (Kmp)
- HDU3746 Cyclic Nacklace (KMP)
- Ubuntu16.04下搭建开发环境及编译tiny4412 Android系统
- 关于集合
- gerrit及git的基本安装使用
- XML+DTD+SAX+DOM4j+Schema
- SpringBoot搭建Java web工程
- HDU3746:Cyclic Nacklace
- 状压DP<旅行商问题>
- Vue.js自定义下拉列表,如何实现在下拉列表区域外点击即可关闭下拉列表的功能
- 初学-HTML
- PCL_超体聚类实现
- (一) CentOS7下RPM安装MYSQL-5.7.18
- C++中子类构造函数写法总结
- 排序算法C++ && Python实现---堆排序
- 计蒜客 商汤科技的行人检测(困难)