2014年8月3日
Number Sequence
摘要： Number Sequence Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N 阅读全文
posted @ 2014-08-03 17:42 Wurq 阅读(128) 评论(0) 推荐(0)
Count the string
摘要： Count the string Problem Description It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string 阅读全文
posted @ 2014-08-03 17:36 Wurq 阅读(195) 评论(0) 推荐(0)
Frogs' Neighborhood
摘要： Frogs' NeighborhoodTime Limit : 10000/5000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 27Accepted Submission(s) : 17Sp... 阅读全文
posted @ 2014-08-03 17:12 Wurq 阅读(458) 评论(0) 推荐(0)
Function Run Fun
摘要： Function Run FunTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 25Accepted Submission(s) : 17Proble... 阅读全文
posted @ 2014-08-03 16:31 Wurq 阅读(200) 评论(0) 推荐(0)
生日蛋糕
摘要： 生日蛋糕Time Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 11Accepted Submission(s) : 8Problem Description... 阅读全文
posted @ 2014-08-03 16:25 Wurq 阅读(362) 评论(2) 推荐(0)
Defragment
摘要： DefragmentTime Limit : 4000/2000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 6Accepted Submission(s) : 3Special JudgeP... 阅读全文
posted @ 2014-08-03 15:19 Wurq 阅读(500) 评论(0) 推荐(0)