2015年5月12日
humble number(hd1058)
摘要： Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15,... 阅读全文
posted @ 2015-05-12 22:53 御心飞行 阅读(214) 评论(0) 推荐(0) 编辑
FatMouse' Trade（hdoj1009）
摘要： Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.... 阅读全文
posted @ 2015-05-12 14:43 御心飞行 阅读(135) 评论(0) 推荐(0) 编辑
1021 Fibonacci Again （hdoj）
摘要： Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence o... 阅读全文
posted @ 2015-05-12 00:47 御心飞行 阅读(138) 评论(0) 推荐(0) 编辑
Elevator（hdoj 1008）
摘要： Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at wh... 阅读全文
posted @ 2015-05-12 00:14 御心飞行 阅读(224) 评论(0) 推荐(0) 编辑