题解 | #变种水仙花#

#include <stdio.h>
#include<math.h>
int main()
{
    int n = 0;
    for(n = 10000; n <= 99999; n++)
    {
        //判断数字位数
        int count = 0;
        int k = n;
        int sum = 0;
        while(k)
        {
            count++;
            k /= 10;
        }
        int p = count - 1;
        while(p)
        {
            int a = pow(10, p);
            int b = n / a;
            int c = n % a;
            sum += b * c;
            p--;
        }
        if(n == sum)
        {
            printf("%d ", n);
        }
    }
    return 0;
}