题解 | #变种水仙花#
变种水仙花
https://www.nowcoder.com/practice/c178e3f5cc4641dfbc8b020ae79e2b71
#include <stdio.h>
int main()
{
int i = 0;
int j = 0;
int k = 100;
for (i = 10000; i <= 99999; i++)
{
int m = 10000;
int sum = 0;
while (m>=10)
{
j = i /m ;
k = i % m;
sum += j * k;
m = m / 10;
}
if (sum == i)
{
printf("%d ", i);
}
}
return 0;
}
