hdu 3746 Cyclic Nacklace
来源:互联网 发布:java官网下载jdk7 编辑:程序博客网 时间:2024/05/21 17:05
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.
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 ).
3aaaabcaabcde
025
题意: 寻找循环节长度,输出该字符串构成循环节所需要的最少字母个数。
解题思路:
一道水题,需要知道如何求循环节长度,当前字符串的循环节长度等于字符串长度减去next数组当前数值。
之后就是判断需要多少字母能构成循环字符串。
代码:
#include<stdio.h>#include<string.h>char s[100010];int next[100010];int i,j,k,lena,t,x;void fun(void){i=1;j=0;while(i<lena) { if(j==0&&s[i]!=s[j]) { next[i]=0;i++;}else if(j>0&&s[i]!=s[j]) j=next[j-1];else { next[i]=j+1; i++;j++; } }x=lena-next[i-1]; if(x == lena) printf("%d\n", lena); else{ if(lena % x == 0) printf("0\n"); else printf("%d\n", x-lena%x); }} int main(){scanf("%d",&t);while(t--){scanf("%s",s);lena=strlen(s); fun();}return 0;}
阅读全文
0 0
- 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-Cyclic Nacklace-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 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- hdu 3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- HDU 3746 Cyclic Nacklace
- Android开发之深入理解Android 7.0系统权限更改相关文档
- 闭包是什么,如何使用?
- Gensim 安装
- PAT1010 Radix
- HTTP中POST GET 本质区别详解
- hdu 3746 Cyclic Nacklace
- bzoj4964: 加长的咒语
- Binary Tree Traversals HDU
- liferay组件间通信
- CMakelists添加库
- Qt Creator下载和安装(详细教程)
- 数论在ACM中的应用
- JS URL传中文参数引发的乱码问题
- CSDN使用:使用CSDN的MarkDown编辑器,以及MarkDown编辑器的帮助文档