摘要: EdgeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 346Accepted Submission(s): 214Problem DescriptionFor products that are wrapped in small packings... 阅读全文
posted @ 2010-05-14 15:04 にんじゃ 阅读(247) 评论(0) 推荐(0)
摘要: The 3n + 1 problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5146Accepted Submission(s): 1848Problem DescriptionProblems in Computer Science ar... 阅读全文
posted @ 2010-05-10 16:23 にんじゃ 阅读(691) 评论(0) 推荐(0)
摘要: Design T-ShirtTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 778Accepted Submission(s): 388Problem DescriptionSoon after he decided to design a T-s... 阅读全文
posted @ 2010-05-10 15:35 にんじゃ 阅读(465) 评论(0) 推荐(0)
摘要: Problem DescriptionA triangle field is numbered with successive integers in the way shown on the picture below. The traveller needs to go from the cell with number M to the cell with number N. The tra... 阅读全文
posted @ 2010-05-09 16:58 にんじゃ 阅读(516) 评论(0) 推荐(0)
摘要: [代码] 阅读全文
posted @ 2010-05-09 15:32 にんじゃ 阅读(1187) 评论(0) 推荐(1)
摘要: [代码]Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given an positive integer N, we define an eq... 阅读全文
posted @ 2010-04-19 10:46 にんじゃ 阅读(601) 评论(0) 推荐(0)
摘要: [代码] 阅读全文
posted @ 2010-04-19 10:36 にんじゃ 阅读(606) 评论(0) 推荐(0)
摘要: [代码] 阅读全文
posted @ 2010-04-15 23:26 にんじゃ 阅读(305) 评论(0) 推荐(0)
摘要: Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them rich citie... 阅读全文
posted @ 2010-04-15 23:25 にんじゃ 阅读(456) 评论(0) 推荐(0)
摘要: [代码] 阅读全文
posted @ 2010-04-15 23:24 にんじゃ 阅读(24921) 评论(0) 推荐(0)