乐着过一辈子的专栏

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 33595 Accepted: 13956DescriptionGiven two strings a and b we define a*b to be their concate

/*最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8840 Accepted Submission(s): 3042Problem Description给出一个只由小写英文字符a,b,c...y,z组成的字符串S

/*Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5006 Accepted Submission(s): 2358Problem DescriptionIt is well known

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2

/*Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11778 Accepted Submission(s): 5375Problem DescriptionGiven two sequen

问题描述　　在年轻的时候，我们故事中的英雄——国王 Copa——他的私人数据并不是完全安全地隐蔽。对他来说是，这不可接受的。因此，他发明了一种密码，好记又难以破解。后来，他才知道这种密码是一个长度为奇数的回文串。　　Copa 害怕忘记密码，所以他决定把密码写在一张纸上。他发现这样保存密码不安全，于是他决定按下述方法加密密码：他选定一个整数 X ，保证 X 不小于 0 ，且 2X 严格小