海岛Blog

摘要： Pandigital primeProblem 41We shall say that an n-digit number is pandigital if it makes use of all the digits 1 ton exactly once. For ... 阅读全文

摘要： Digit factorialsProblem 34145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.Find the sum of all numbers which are equal to... 阅读全文

摘要： 问题链接：UVA10079 Pizza Cutting。问题描述：参见上述链接。问题分析：参考《具体数学》一书。也可以参考：直线分平面公式_百度百科。程序说明：（略）。AC的C++语言程序如下：/* UVA10079 Pizza Cutting */#include ... 阅读全文

摘要： 问题链接：UVA100 POJ1207 HDU1032 The 3n + 1 problem。问题描述：参见上述链接。问题分析：根据给定的算法计算整数循环到1的次数，可以用一个函数来实现，可以使用记忆存储来加快计算速度。程序说明：数组cs[]用于存储已经算过的次数，极... 阅读全文

摘要： Non-abundant sumsProblem 23A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For e... 阅读全文

摘要： Lexicographic permutationsProblem 24A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation ... 阅读全文