版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/wxd1233/article/details/82559519
水仙花数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 238297 Accepted Submission(s): 67808 Problem Description 春天是鲜花的季节,水仙花就是其中最迷人的代表,数学上有个水仙花数,他是这样定义的: Input 输入数据有多组,每组占一行,包括两个整数m和n(100<=m<=n<=999)。 Output 对于每个测试实例,要求输出所有在给定范围内的水仙花数,就是说,输出的水仙花数必须大于等于m,并且小于等于n,如果有多个,则要求从小到大排列在一行内输出,之间用一个空格隔开; Sample Input 100 120 300 380 Sample Output no 370 371 |
#include<stdio.h>
int main(void)
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
if(n>m)
{
int t = n;
n = m;
m = t;
}
int flag = 0;
int a[100];
int count = 0;
for(int i = n; i <= m; i++)
{
if(i == (i%10)*(i%10)*(i%10)+(i/100)*(i/100)*(i/100)+(i%100/10)*(i%100/10)*(i%100/10))
{
flag = 1;
a[count++] = i;
}
}
if(flag)
{
for(int i = 0; i < count-1; i++)
{
printf("%d ",a[i]);
}
printf("%d\n",a[count-1]);
}
else
printf("no\n");
}
return 0;
}