Herumw - 博客园

摘要： Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3712 Accepted Submission(s... 阅读全文

posted @ 2015-12-04 19:34 Herumw 阅读(111) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11496 Accepted: 2815DescriptionFacer's pet cat just gave birth to a brood of... 阅读全文

posted @ 2015-12-04 15:57 Herumw 阅读(181) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 18578 Accepted: 7858DescriptionGiven a n × n matrix A and a positive intege... 阅读全文

posted @ 2015-12-04 14:43 Herumw 阅读(94) 评论(0) 推荐(0) 编辑

摘要： ProblemGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or g... 阅读全文

posted @ 2015-12-04 12:45 Herumw 阅读(140) 评论(0) 推荐(0) 编辑

摘要： Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21752 Acce... 阅读全文

posted @ 2015-12-04 09:49 Herumw 阅读(144) 评论(0) 推荐(0) 编辑

摘要： Accept: 204 Submit: 627Time Limit: 1000 mSec Memory Limit : 65536 KB Problem Descriptionn个六边形排成一行，相邻两个六边形共用一条边，如下图所示：记这个图形的生成树个数... 阅读全文

posted @ 2015-12-03 20:03 Herumw 阅读(115) 评论(0) 推荐(0) 编辑

摘要：递推求值时间限制：1000 ms | 内存限制：65535 KB难度：4描述给你一个递推公式：f(x)=a*f(x-2)+b*f(x-1)+c并给你f(1),f(2)的值，请求出f(n)的值，由于f(n)的值可能过大，求出f(n)对1000007取模后的值。注意:... 阅读全文

posted @ 2015-12-02 15:40 Herumw 阅读(119) 评论(0) 推荐(0) 编辑

摘要： FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11510 Accepted: 8179DescriptionIn the Fibonacci integer sequence, F... 阅读全文

posted @ 2015-12-01 21:33 Herumw 阅读(88) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1284 Accepted Submission(s)... 阅读全文

posted @ 2015-11-30 11:34 Herumw 阅读(104) 评论(0) 推荐(0) 编辑

摘要： Alice is bored out of her mind by her math classes. She craves for something much more exciting. That is why she invented a new type o... 阅读全文

posted @ 2015-11-14 18:09 Herumw 阅读(156) 评论(0) 推荐(0) 编辑

Herumw's Blog