题解 | #水仙花数#

#include <stdio.h>
#include<math.h>
#include<stdlib.h>
int isArmstrong(int num)
{
    int src,remain,n=0,result = 0;
    //保存原始数据
    src = num;
    while(src!=0)
    {
        src/=10;
        n++;
    }
    //重新初始化
    src = num;
    while(src!=0)
    {
        remain = src%10;
        result+=pow(remain,n);
        src/=10;
    }
    if(result==num)
    return 1;
    else
    return 0;

}
int main() {
    int m,n;
    int found = 0;//标记是否找到
    while(scanf("%d %d",&m,&n)!=EOF)
    {
        for(int i = m ;i<=n;i++)
        {
            if (isArmstrong(i)) {
            printf("%d ",i);
            found = 1;
            }
        }
        if(!found)
        {
        printf("no");
        }printf("\n");
    }
    return 0;
}