题解 | #变种水仙花#

#include<stdio.h>
#include<math.h>

int Check_Lily(int n)
{
    int sum = 0, Wei = 0;
    int tmp = n;
    //获取位数
    while (n)
    {
        Wei++;
        n = n / 10;
    }
    //拆分所有可能性
    for (int i = 1; i < Wei; i++)
    {
        sum += (tmp / ((int)pow(10, i))) * (tmp % ((int)pow(10, i)));
    }
    if (sum == tmp)
        return tmp;
    else
        return 0;
}

int main()
{
    int n = 10000, m = 99999;
    for (int i = n; i <= m; i++)
    {
        if (Check_Lily(i))
            printf("%d ", i);
    }
    return 0;
}