Topic
Describe:
如果一个正整数等于其各个数字的立方和,则该数称为阿姆斯特朗数(亦称为自恋性数),1除外,如407 = 43+03+73就是一个阿姆斯特朗数。试编程求n(n ≤ 65536)以内的所有阿姆斯特朗数。
Interface description
Prototype:
int CalcArmstrongNumber(int n);
Input parameters:
int n: n ≤ 65536
return value:
n以内的阿姆斯特朗数的数量
Practice Stage:
Code
/* ---------------------------------------* Date: 2015-07-04* sjf0115* title: Armstrong number * Source: Huawei Machine Test Exercises--------------------- --------------------*/#include <iostream>#include "OJ.h"using namespace Std;/ * Function: For all Armstrong number prototypes within N (n≤65536): int calcarmstrongnumber (int n); input parameter: int n:n≤65536 return value: Number of Armstrong within N. */intCalcarmstrongnumber (intN) {if(N <=1){return 0; }//if int sum, M,tmp,Count=0; for(intI=2; I <= n;++i) {sum=0; TMP = i; while(TMP) {m = tmp%Ten;sum+ = m * m * m; TMP/=Ten; }//while if(sum= = i) {+ +Count; }//if}//if return Count;}
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
[Huawei Machine Test exercises]48. Armstrong number