2011年10月22日

hdu Computer Transformation

摘要： 直播入口——欢迎围观ACM/ICPC北京现场赛~ Computer TransformationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2921Accepted Submission(s): 1111Problem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each succes 阅读全文

posted @ 2011-10-22 20:01 Goal 阅读(271) 评论(0) 推荐(0) 编辑

hdu Ignatius and the Princess II

摘要： 直播入口——欢迎围观ACM/ICPC北京现场赛~ Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1873Accepted Submission(s): 1129Problem DescriptionNow our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is a 阅读全文

posted @ 2011-10-22 18:17 Goal 阅读(324) 评论(0) 推荐(0) 编辑

hdu Train Problem I

摘要： 杭电2010和2011级同学如何加入ACM集训队？ 2010-10月赛参赛名单/地点公布~ 直播入口——欢迎围观ACM/ICPC北京现场赛~ Train Problem ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7424Accepted Submission(s): 2712Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy 阅读全文

posted @ 2011-10-22 15:29 Goal 阅读(257) 评论(0) 推荐(0) 编辑

hdu train Problem

摘要： 直播入口——欢迎围观ACM/ICPC北京现场赛~ Train Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2375Accepted Submission(s): 1359Problem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains co 阅读全文

posted @ 2011-10-22 14:33 Goal 阅读(211) 评论(0) 推荐(0) 编辑

hdu A Mathematical Curiosity

摘要： A Mathematical CuriosityTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12085Accepted Submission(s): 3745Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a^2+b^2 +m)/(a 阅读全文

posted @ 2011-10-22 11:41 Goal 阅读(158) 评论(0) 推荐(0) 编辑

导航