摘要：EOJ382 Match MakerTime Limit: 2000MSMemory Limit: 65536KTotal Submits: 50Accepted: 6DescriptionIn Computer Science, pattern matching is the act of checking if a certain sequence conforms (matches) a given pattern. Patterns are usually specified using a language based on regular expression. In this p
阅读全文
摘要：EOJ201 Software Industry RevolutionTime Limit: 5000MS Memory Limit: 65536KTotal Submits: 34 Accepted: 12DescriptionMaking revolutions in the software industry is not an easy task. That’s why this problem is about something else. Stanescu has just invented a new super-cool way to develop software. It
阅读全文
摘要：POJ2185 Milking GridTime Limit:3000MSMemory Limit:65536KTotal Submissions:3220Accepted:1317DescriptionEvery morning when they are milked, the Farmer John's cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As we all know, Farmer John is quite
阅读全文
摘要：HDU1711 Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3852Accepted Submission(s): 1781Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N &
阅读全文
摘要：HDU1358 PeriodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 675Accepted Submission(s): 321Problem DescriptionFor 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 w
阅读全文
