水仙花数是指一个N位正整数(N≥3),它的每个位上的数字的N次幂之和等于它本身。例如:153=13+53+33。 本题要求编写两个函数,一个判断给定整数是否水仙花数,另一个按从小到大的顺序打印出给定区间(m,n)内所有的水仙花数。
int narcissistic( int number );
void PrintN( int m, int n );
函数narcissistic
判断number
是否为水仙花数,是则返回1,否则返回0。
函数PrintN
则打印开区间(m
, n
)内所有的水仙花数,每个数字占一行。题目保证100≤m
≤n
≤10000。
#include
int narcissistic( int number );
void PrintN( int m, int n );
int main()
{
int m, n;
scanf("%d %d", &m, &n);
if ( narcissistic(m) ) printf("%d is a narcissistic number\n", m);
PrintN(m, n);
if ( narcissistic(n) ) printf("%d is a narcissistic number\n", n);
return 0;
}
/* 你的代码将被嵌在这里 */
153 400
153 is a narcissistic number
370
371
法一:
#include
int narcissistic( int number );
void PrintN( int m, int n );
int main() {
int m, n;
scanf("%d %d", &m, &n);
if ( narcissistic(m) ) printf("%d is a narcissistic number\n", m);
PrintN(m, n);
if ( narcissistic(n) ) printf("%d is a narcissistic number\n", n);
return 0;
}
int narcissistic( int number ) {
int count, digit, item, n, sum, ret, k, i;
n = number, count = 0;
while ( n ) { //算出number是几位数。
n /= 10;
count++;
}
sum = 0, n = number;
while( n ) {
digit = n % 10;
item = 1;
for ( i = 0; i < count; i++ )
item *= digit;
sum += item;
n /= 10;
}
if ( sum == number ) ret = 1;
else ret = 0;
return ret;
}
void PrintN( int m, int n ) {
int i;
for ( i = m+1; i < n; i++ )
if ( narcissistic(i) ) printf("%d\n", i);
}
法二:
int narcissistic( int number ) {
int count, sum, temp, ret;
count = 0, temp = number;
while (temp) {
count++;
temp /= 10;
}
sum = 0, temp = number;
while (temp) {
sum += pow(temp % 10, count);
temp /= 10;
}
if (sum == number) ret = 1;
else ret = 0;
return ret;
}
void PrintN( int m, int n ) {
int i;
for (i = m+1; i < n; i++)
if (narcissistic(i)) printf("%d\n", i);
}