2011年12月3日

摘要: 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 & 阅读全文
posted @ 2011-12-03 16:10 Fatedayt 阅读(524) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2011-12-03 15:40 Fatedayt 阅读(951) 评论(0) 推荐(0)

导航