Ring Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2427    Accepted Submission(s): 753Problem DescriptionFor the hope of a forever

Searching the StringTime Limit: 7 Seconds      Memory Limit: 129872 KB Little jay really hates to deal with string. But moondy likes it very much, and she's so mischievous that she often g

Resource ArchiverTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 1928    Accepted Submission(s): 625Problem DescriptionGreat! Yo

BCD CodeTime Limit: 5 Seconds      Memory Limit: 65536 KB Binary-coded decimal (BCD) is an encoding for decimal numbers in which each digit is represented by its own binary sequence.To enc

Censored!Time Limit: 5000MS Memory Limit: 10000KTotal Submissions: 8108 Accepted: 2193DescriptionThe alphabet of Freeland consists of exactly N letters. Each sent

You are the computer whiz for the secret organization known as the Sneaky Underground Smug Perpetrators of Evil Crimes and Thefts. The target for SUSPECT's latest evil crime is their greatest foe, t

DNA SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11721 Accepted: 4471DescriptionIt's well known that DNA Sequence is a sequence only contains

DNA repairTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1476    Accepted Submission(s): 802Problem DescriptionBiologists finally i

考研路茫茫——单词情结Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3952    Accepted Submission(s): 1150Problem Description背单词，始终是复习英语的重要环节。在

Jisung is the student representative of the Department of Computer Engineering in ACM University. A few days later, the annual festival will be held for the students in the department. He is preparing

AC自动机是tire树和KMP的结合，若模版串长度为l，有n个模版串，文本串长度为s，则AC自动机复杂度为O（l*n+s）。  KMP是一个模版串和一个文本串，最常见的是问模版串在文本串中的出现次数。所以失配的时候就去找模版串和文本串当前后缀匹配最长的前缀，若再失配以此类推。  但是若有多个模版串，若和当前模版串失配，可能会和其他模版串匹配，或者其他模版串的前缀能比当前模版串的前缀和文本串

Problem HMatrix MatcherInput: Standard InputOutput: StandardOutput  Given an N * M matrix, your task is to find the number of occurences of an X * Y pattern. InputThe first line contai

Lost's revengeTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3128    Accepted Submission(s): 823Problem DescriptionLost and AekdyC

DanganronpaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 13    Accepted Submission(s): 1Problem DescriptionDanganronpa is a vide