HDU3746-Cyclic Nacklace
来源:互联网 发布:php 读取文件夹 图片 编辑:程序博客网 时间:2024/05/16 15:41
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7126 Accepted Submission(s): 3117
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
#include <iostream>#include <stdio.h>#include <queue>#include <string.h>using namespace std;char a[1000009];int nt[1000009];int n;void get_next(){ nt[0]=-1; for(int i=0; i<n; i++) { int k=nt[i]; while(k>=0&&a[i]!=a[k]) k=nt[k]; nt[i+1]=k+1; }}int main(){ int t; scanf("%d",&t); while(t--) { scanf("%s",a); n=strlen(a); get_next(); int k=n-nt[n]; if(k!=n&&n%k==0) { printf("0\n"); continue; } printf("%d\n",k-nt[n]%k);//取余的作用:abcab,去掉abc } 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)
- 动态污点分析浅述
- flat network 原理与配置 - 每天5分钟玩转 OpenStack(86)
- Apache Tomcat 8_源码编译、安装及调试
- 特征值与特征向量的几何意义
- 01 戴尔混合云DHCS今生与前世
- HDU3746-Cyclic Nacklace
- HDU 4417 Super Mario(离线线段树)
- 自定义控件day02笔记
- 分治法,中途相遇法(Non-boring sequences,uva 1608)
- 顺序表应用6:有序顺序表查询
- Spark——SparkContext简单分析
- Oracle函数,按分隔符截取字符串
- httpurlconnection发送文件到服务端并接收
- light oj 1211 - Intersection of Cubes (计算几何)