2013年7月27日
Poj 2853,2140 Sequence Sum Possibilities(因式分解)
摘要： 一、DescriptionMost positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance,6 = 1 + 2 + 39 =... 阅读全文
posted @ 2013-07-27 17:14 InkGenius 阅读(209) 评论(0) 推荐(0)
poj 1519 Digital Roots (计算根数字)
摘要： 一、DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that ... 阅读全文
posted @ 2013-07-27 17:03 InkGenius 阅读(189) 评论(0) 推荐(0)