一个N位的十进制正整数,如果它的每个位上的数字的N次方的和等于这个数本身,则称其为花朵数.
A positive base 10 integer with N digits,it is called a flower number if the sum of the number on each digit to the Nth power is equal to the number it self.
x05例如：
x05当N=3时,153就满足条件,因为 1^3 + 5^3 + 3^3 = 153,这样的数字也被称为水仙花数（其中,“^”表示乘方,5^3表示5的3次方,也就是立方）.
x05当N=4时,1634满足条件,因为 1^4 + 6^4 + 3^4 + 4^4 = 1634.
x05当N=5时,92727满足条件.
x05实际上,对N的每个取值,可能有多个数字满足条件.
e.g.
When N=3,153 satisfies all of the criteria,because 1^3 + 5^3 + 3^3 = 153,this sort of number is also called a daffodil number (here,“^”means "to the power of",5^3 means 5 to the power of 3,namely 5 cubed).
When N=4,1634 satisfies all the criteria,because 1^4 + 6^4 + 3^4 + 4^4 = 1634
When N=5,the flower number is 92727
In fact,for every value of N,there might be multiple possibilities for a flower number.
x05程序的任务是：求N=21时,所有满足条件的花朵数.注意：这个整数有21位,它的各个位数字的21次方之和正好等于这个数本身.
The aim of the program is:find all of the flower numbers when N=21.Note,this integer has 21 digits,the 21th power of each of its digit must be equal to the number itself.
x05如果满足条件的数字不只有一个,请从小到大输出所有符合条件的数字,每个数字占一行.因为这个数字很大,请注意解法时间上的可行性.要求程序在3分钟内运行完毕.
If there are more than one answer,please list all of them from the smallest to largest,with one number per line.
Due to the size of the number,please pay attention to the time taken to find it.The program must be able to finish calculation within 3 minutes.
这是人工翻译的,不是机器哦