Classic programming problem: finding the number of daffodils

What is narcissus number ？

Narcissistic number (Narcissistic number) It's also called super perfect number invariant (pluperfect digital invariant, PPDI)、 Narcissistic number 、 Self idempotent 、 Armstrong number or Armstrong number (Armstrong number), The number of Narcissus refers to a 3 digit , Of the numbers in each of its bits 3 The sum of the powers is equal to itself . for example :1^3 + 5^3+ 3^3 = 153.

---

use C How language is implemented ？

First , Let's think about our ideas first , Here are a few steps ：

1. So what we want is 0-10w The number of daffodils in the garden , Then you need to use a cycle
2. seek i The number of digits of this number
3. Decompose the number of each bit of this multi bit number, and then find the cubic power of each bit, and then find the sum
4. Judge

#include<stdio.h>
#include<math.h>
int main()
{
    
	for(i=0;i<100000;i++)
	{
    
		int n=i;
		int num=1;//num Is the number of digits of a multi digit number 
		while(n/10)
		{
    
			num++;// Calculate the number of digits 
			n=n/10;
		}
		n=i;// Reset n, Prevent a dead cycle 
		int sum=0;
		while(n)
		{
    
			sum=sum+pow(n%10,num);// Calculate the sum of each bit number to the power of three 
			n=n/10;
		}
		if(sum==i)
		printf("%d ",i);
	}
	return 0;
}

give the result as follows ：

0 1 2 3 4 5 6 7 8 9 153 370 371 407 1634 8208 9474 54748 92727 93084

---

In this way, we can calculate the number of daffodils ！ But this process does not use function calls , Readers are expected to optimize by themselves , If you like it, remember Sanlian ！