HDOJ 3746 Cyclic Nacklace
2015-09-10 16:51
295 查看
Cyclic Nacklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4466 Accepted Submission(s): 2033
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.
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
).
Output
For each case, you are required to output the minimum count of pearls added to make a CharmBracelet.
Sample Input
3
aaa
abca
abcde
Sample Output
0
2
5
Author
possessor WC
Source
HDU 3rd “Vegetable-Birds Cup” Programming
Open Contest
Recommend
lcy | We have carefully selected several similar problems for you: 3336 1358 2222 2896 3744
#include <cstdio>
#include <cstring>
const int N = 100010;
char str
;
int next
;
void get_next() {
int i = 0, j = -1;
next[i] = j;
while (str[i]) {
if (j == -1 || str[i] == str[j])
next[++i] = ++j;
else
j = next[j];
}
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%s", str);
get_next();
int len = strlen(str);
int cir = len - next[len];
if (len != cir && len % cir == 0)
puts("0");
else
printf("%d\n", cir * (1 + len / cir) - len);
}
return 0;
}
相关文章推荐
- socket通信
- Dell R810 + Centos5 + MD3200
- [顶]Different ways of loading a file as an InputStream
- power的介绍
- linux命令——cat
- 转载:天涯——散文天下——《一个老笑话》——作者:南方孤驴
- 非ARC情况下---用GCD实现单例模式
- 算法系列--寻找Single Number
- C++Primer 第五版 1.1节练习
- .net程序员工作两年总结
- 4.2 Context-Free Grammars
- nginx php-fpm安装配置
- 党的第三代领导集体对邓小平理论的运用和发展
- iOS 9 分屏多任务:入门(中文版)
- 刷openwrt
- js获取表单文本框中的值
- linux下的FIFO机制
- no JSTAF in java.library.path
- PHP substr()截取字符串时,中文出现乱码的问题解决【转】
- 关于字符设备驱动程序的一个样例