Description: An N-bit decimal integer, if each of its N-bit numbers on the power and is equal to the number itself, called it the number of flowers.
For example:
When N = 3, the 153 to meet the conditions, because 1 ^ 3+ 5 ^ 3+ 3 ^ 3 = 153, that figure is also known as Narcissus number (where "^" means power, 5 ^ 3 said 5 3 power, which is cubic).
When N = 4, the 1634 to meet the conditions, because 1 ^ 6 ^ 4+ 4+ 4+ 4 ^ 3 ^ 4 = 1634.
When N = 5, the 92,727 to meet the conditions.
In fact, for each N value, there may be multiple numbers to meet the conditions.
Program s mission is: find N = 21, all meet the conditions of flower number. Note: This integer has 21 bits, each digit of its 21 th power, and exactly equal to the number itself.
If the figures do not meet the conditions of only one, make small to large output of all eligible numbers, each number per line. Because of this high number, please note that the feasibility of solution time. Claims process has finished running in 3 m
To Search:
File list (Check if you may need any files):
HuaDuoTree_Algorithm.java
Download