#include<stdio.h>
int main()
{
long i,j,k,a,b,n;
printf("water flower's number is:\n");
for (n = 10000; n <= 99999; n++)
{
i = n % 10;
j = n % 100 / 10;
k = n % 1000 / 100;
a = n % 10000 / 1000;
b = n / 10000;
if (n == i*i*i*i*i + j*j*j*j*j + k*k*k*k*k + a*a*a*a*a + b*b*b*b*b) error:算法错误,水仙花数的位数与求和时的次方相同
printf("%-5d\t", n);
}
return 0;
}
int main()
{
long i,j,k,a,b,n;
printf("water flower's number is:\n");
for (n = 10000; n <= 99999; n++)
{
i = n % 10;
j = n % 100 / 10;
k = n % 1000 / 100;
a = n % 10000 / 1000;
b = n / 10000;
if (n == i*i*i*i*i + j*j*j*j*j + k*k*k*k*k + a*a*a*a*a + b*b*b*b*b) error:算法错误,水仙花数的位数与求和时的次方相同
printf("%-5d\t", n);
}
return 0;
}