mirror of
https://github.com/renbaoshuo/202401-programming-assignments.git
synced 2024-11-23 21:58:41 +00:00
49 lines
1.2 KiB
Markdown
49 lines
1.2 KiB
Markdown
|
# 6-7 使用函数输出水仙花数
|
|||
|
|
|||
|
水仙花数是指一个$$N$$位正整数($$N\ge 3$$),它的每个位上的数字的$$N$$次幂之和等于它本身。例如:$$153 = 1^3 + 5^3+ 3^3$$。 本题要求编写两个函数,一个判断给定整数是否水仙花数,另一个按从小到大的顺序打印出给定区间$$(m,n)$$内所有的水仙花数。
|
|||
|
|
|||
|
### 函数接口定义:
|
|||
|
```c++
|
|||
|
int narcissistic( int number );
|
|||
|
void PrintN( int m, int n );
|
|||
|
```
|
|||
|
函数`narcissistic`判断`number`是否为水仙花数,是则返回1,否则返回0。
|
|||
|
|
|||
|
函数`PrintN`则打印开区间(`m`, `n`)内所有的水仙花数,每个数字占一行。题目保证100$$\le$$`m`$$\le$$`n`$$\le$$10000。
|
|||
|
|
|||
|
### 裁判测试程序样例:
|
|||
|
```c++
|
|||
|
#include <stdio.h>
|
|||
|
|
|||
|
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;
|
|||
|
}
|
|||
|
|
|||
|
/* 你的代码将被嵌在这里 */
|
|||
|
```
|
|||
|
|
|||
|
### 输入样例:
|
|||
|
```in
|
|||
|
153 400
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
### 输出样例:
|
|||
|
```out
|
|||
|
153 is a narcissistic number
|
|||
|
370
|
|||
|
371
|
|||
|
|
|||
|
```
|