摘要: 描述对于一个递归函数w(a,b,c)如果a20 or b>20 or c>20就返回w(20,20,20)如果a#include #include #define REP(i, s, n) for(int i = s; i = s; i --)#define MAX_N 20 + 10using n... 阅读全文
posted @ 2015-05-26 13:17 ALXPCUN 阅读(168) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 5513Accepted: 2495DescriptionA set of n 1-dimensional items have to be packed in identical bi... 阅读全文
posted @ 2015-05-26 08:28 ALXPCUN 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 25081Accepted: 13539DescriptionThere is a rectangular room, covered with square tiles. Each t... 阅读全文
posted @ 2015-05-26 08:02 ALXPCUN 阅读(115) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 14344Accepted: 7524DescriptionFor hundreds of years Fermat's Last Theorem, which stated simpl... 阅读全文
posted @ 2015-05-26 07:42 ALXPCUN 阅读(150) 评论(0) 推荐(0) 编辑