A + B for you again
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5114 Accepted Submission(s): 1286
Problem Description
Genera...
分类:
其他好文 时间:
2015-08-08 20:01:05
阅读次数:
132
PeriodTime Limit:3000MSMemory Limit:30000KTotal Submissions:14657Accepted:6967DescriptionFor each prefix of a given string S with N characters (each c...
分类:
编程语言 时间:
2015-08-08 17:58:18
阅读次数:
275
OulipoTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7384Accepted Submission(s): 2965Problem Desc...
分类:
其他好文 时间:
2015-08-08 17:52:49
阅读次数:
96
本题题意:
输入一个长度不超过200,数值不超过100的循环小数,求出小数点后的循环节,循环节长度,循环次数。
解题思路:
本题为KMP算法的较全面的考察,首先将小数点后的数存放到一个数组中,并求出next数组,然后,由KMP算
法可知,循环节长度为:【k-next[k]】;循环次数为【k/(k-next[k])】,知此,循环节也不难求了,按循环长度直接输
...
分类:
编程语言 时间:
2015-08-08 16:35:23
阅读次数:
127
Seek the Name, Seek the FameTime Limit:2000MSMemory Limit:65536KTotal Submissions:14172Accepted:7055DescriptionThe little cat is so famous, that many ...
分类:
编程语言 时间:
2015-08-08 16:16:51
阅读次数:
161
2b青年的说法;先去匹配,如果失败,可能失败的前一部分长度的字符串的前缀和后缀相同,那就可以直接把前缀移到后缀那一块,省去了很多没用的时间。关键就是求next数组。根据递归的思想;next[0]=-1;next[j]=k;p[0...k-1]=p[j-k...j-1];1.如果p[j]==p[k],...
分类:
编程语言 时间:
2015-08-08 11:40:22
阅读次数:
106
Power Strings
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 37564
Accepted: 15532
Description
Given two strings a and b we define a*b to be their concatena...
分类:
其他好文 时间:
2015-08-07 22:28:09
阅读次数:
92
Seek the Name, Seek the Fame
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 14154
Accepted: 7049
Description
The little cat is so famous, that many couples ...
分类:
其他好文 时间:
2015-08-07 22:26:59
阅读次数:
99
欢迎参加——每周六晚的BestCoder(有米!)剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11258Accepted Submiss...
分类:
其他好文 时间:
2015-08-07 22:13:52
阅读次数:
111
PeriodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4437Accepted Submission(s): 2145Problem Desc...
分类:
其他好文 时间:
2015-08-07 21:53:10
阅读次数:
109