ＡＴＯＤ

A - Seek the Name, Seek the Fame Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatus Description The little cat is so famous, that many couples tramp over hill

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

给你一个由小写拉丁字母组成的字符串 ss。我们定义 ss 的一个子串的存在值为这个子串在 ss 中出现的次数乘以这个子串的长度。对于给你的这个字符串 ss，求所有回文子串中的最大存在值。 输入格式一行，一个由小写拉丁字母（a~z）组成的非空字符串 ss。 输出格式输出一个整数，表示所有回文子串中的最大存在值。

病毒侵袭 Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescription 当太阳的光辉逐渐被月亮遮蔽，世界失去了光明，大地迎来最黑暗的时刻。。。。在这样的时刻，人们却异常兴奋――我们能在有生之年看到500年一遇的世界奇观，那是多么幸福的事儿啊~~

Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26448 Accepted: 7972DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no numb

题目大意：定义一种前缀，这个前缀和后缀一样并且没有交集，num[i]为前i位有多少个这样的前缀;5. 【NOI2014】动物园描述提交自定义测试近日，园长发现动物园中好吃懒做的动物越来越多了。例如企鹅，只会卖萌向游客要吃的。为了整治动物园的不良风气，让动物们凭自己的真才实学向游客要吃的园长决定开设算法班，让动物们学习算法。 某天，园长给动物们讲解KMP算法。园长：“对于一个字符串SS它的长度

Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 40506 Accepted: 16854Description Given two strings a and b we define a*b to be their concatenation. For example,

#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int n;char s[4005][205];int nex[205];char c[205];void get_nex(char s[]){ int j=-1; nex[0]=-

DNA Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14224 Accepted: 5486Description It’s well known that DNA Sequence is a sequence only contains A, C, T and G, and i

Ring Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3083 Accepted Submission(s): 985Problem DescriptionFor the hope of a forever love, St

DNA repair Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1939 Accepted Submission(s): 1049Problem Description Biologists finally invent

void insert(char s[],int val){ if(val==0) return ; int now=0; for (int i=0;i<strlen(s);i++) { int x=s[i]-'a'; int tt=t[now].son[x]; if (tt==0) t[now].son[x]=++

D - T9 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u SubmitStatusDescriptionBackground A while ago it was quite cumbersome to create a message for the Short Message Ser

Milking Grid Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 7365 Accepted: 3153 DescriptionEvery morning when they are milked, the Farmer John’s cows form a rectangular grid tha

Cheapest Palindrome Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7884 Accepted: 3822DescriptionKeeping track of all the cows can be a tricky task so Farmer John has installed a