2011年5月31日
（HDOJ 1013）Digital Roots
摘要： Digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Problem 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 digit is the digital root. If the resulting value co 阅读全文
posted @ 2011-05-31 00:59 cpoint 阅读(544) 评论(0) 推荐(2)
（HDOJ 1060）Leftmost Digit
摘要： Leftmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of the input is a single integer T which is the number of 阅读全文
posted @ 2011-05-31 00:00 cpoint 阅读(487) 评论(0) 推荐(1)
浏览次数：travelocity promotion codes