hdu 3746
来源:互联网 发布:青海网络电视台 编辑:程序博客网 时间:2024/05/18 01:54
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1839 Accepted Submission(s): 810
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
Author
possessor WC
Source
HDU 3rd “Vegetable-Birds Cup” Programming Open Contest
Recommend
lcy
code:
#include<iostream>#include<cstring>using namespace std;int next[100005];char t[100005];int len;void get_next(){memset(next,0,sizeof(next));int i=0;int j=-1;next[0]=-1; len=strlen(t);while(i<len){if(j==-1||t[i]==t[j]){++i,++j;next[i]=j;}elsej=next[j];}}int main(){int cas;int len2;int minc;//cin>>cas;scanf("%d",&cas);while(cas--){//cin>>t;scanf("%s",&t);minc=0; len2=strlen(t);get_next(); minc=len2-next[len2];//最短循环节 if(len2%minc==0&&len2/minc!=1)cout<<0<<endl;else{printf("%d\n",minc-(len2-len2/minc*minc));}}return 0;}//这道题怎么说呢,把输入输出改成c就过了~~~~~~
- hdu 3746
- hdu 3746
- HDU 3746
- hdu 3746
- HDU 3746
- HDU 3746
- 【KMP】HDU 3746
- HDU-3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU 3746 珠子问题
- HDU-Cyclic Nacklace-3746
- hdu 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- Java中对象的序列化和反序列化方法
- USB转串口 FT232/PL2303/CH340 驱动以及使用体会
- gdal 工具创建金字塔
- CSS3教程:border-image属性
- 设计模式---责任链模式
- hdu 3746
- ASP.NET配合使用uploadify解决Session丢失问题
- MyEclipse快速安装Android ADT,sdk 方法
- 计算数据的平均值、方差和标准差
- 生成一组数据的累积分布
- uva 152 Tree's a Crowd(检索)
- 隐藏Nginx和PHP版本号
- 整理:FPGA选型
- Android ANR