海岛Blog

摘要： Largest exponentialProblem 99Comparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would con... 阅读全文

摘要： 问题链接：HDU4506 小明系列故事——师兄帮帮忙。问题描述：参见上述链接。问题分析：（略）。程序说明：函数powermod()是快速模幂函数。AC的C++语言程序如下：/* HDU4506 小明系列故事——师兄帮帮忙 */#include using namesp... 阅读全文

摘要： Amicable numbersProblem 21Let d(n) be defined as the sum of proper divisors ofn (numbers less thann which divide evenly into n).If d(a... 阅读全文

摘要： 1000-digit Fibonacci numberProblem 25The Fibonacci sequence is defined by the recurrence relation:Fn = Fn−1 + Fn−2, where F1 = 1 and F... 阅读全文

摘要： Factorial digit sumProblem 20n! means n × (n − 1) × ... × 3 × 2 × 1For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,and the sum o... 阅读全文