#include <stdio.h>
#define s(b) (b - 3)
int main(void)
{
    long a[10][5], n = 9999999;
    long k, sum, t;
    int i, j, b[10], count = 0;
    for(i = 3; i <= 7; i++)   a[0][s(i)] = 0;           //求数字0的3、4、5、6、7的次方
    for(i = 3; i <= 7; i++)   a[1][s(i)] = 1;           //求数字1的3、4、5、6、7的次方
    for(i = 2; i <= 9; i++)  a[i][s(3)] = i * i * i;    //求数字2~9的3次方
    for(i = 2; i <= 9; i++)                             //求数字2~9的4~7次方
        for(j = 4; j <= 7; j++)
            a[i][s(j)] = a[i][s(j - 1)] * i;
    for(k = 100; k <= n; k++)                 //逐个枚举出100~n这一范围内所有的数
    {
        sum = 0;
        t = k; i = 0;
        while(t > 0)
        {
            b[i++] = t % 10;
            t =  t / 10;
        }
        for(j = 0; j < i; j++)
            sum += a[b[j]][s(i)];
        if(sum == k)            //检验是否为水仙花数
        {
            printf("%-10ld ", sum);
            count++;
            if(count % 5 == 0) putchar('\n');
        }
    }
    return 0;
}