Cyclic Nacklace
来源:互联网 发布:战舰世界 个人数据 编辑:程序博客网 时间:2024/06/13 23:55
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10220 Accepted Submission(s): 4378
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思路:求出字符串的长度-next[len]为l;如果l==len说明没有一个相同的。 如果len%l==0,已经是的了。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int f[1000000];char a[1000000];int len;void getnext(){ int i=0,j=0; f[1]=0; for(i=2;i<=len;i++) { while(j>0&&a[j+1]!=a[i]) j=f[j]; if(a[j+1]==a[i]) j++; f[i]=j; }}int main(){ int n,m,i,j; scanf("%d",&n); while(n--) { scanf("%s",a+1); len=strlen(a+1); getnext(); int l=len-f[len]; if(len==l) printf("%d\n",len); else { if(len%l==0) printf("0\n"); else printf("%d\n",l-len%l); } } return 0;}
阅读全文
0 0
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- Cyclic Nacklace
- hdu3746 Cyclic Nacklace
- HDU-3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdoj 3746 Cyclic Nacklace
- 【KMP】 hdu3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU3746:Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- hdu3476-Cyclic Nacklace
- 神奇6位数--蓝桥杯国赛j历年真题
- Ubuntu16.04安装redis和php的redis扩展
- 深入分析Docker镜像原理
- 斐波那契数列java实现
- 泛型与Class类
- Cyclic Nacklace
- 改坏了/etc/profile后的解决方法
- [笔记分享] [Display] LCD接口介绍
- java多线程什么时候释放锁—wait()、notify()
- Spring使用远程服务之Hessian
- JSON基础
- git merge 和 git rebase 小结
- android 各国语言对应的缩写
- css基础(2)