Calculating the number of daffodils in C language

“ Narcissistic number ” It means a n digit , Of its digits n The sum of the powers is exactly equal to the number itself , Such as :153＝1^3＋5^3＋3^3, be 153 It's a “ Narcissistic number ”.

Ideas ：

1. Find out how many digits this number is , Such as 153 It's a three digit number
2. Get every number that makes up this number , Such as 153 Medium 1、5、3
3. Put a single number of n The power is stored in the array , Such as sum[1]=1^3,sum[2]=5^3,sum[3]=3^3
4. Add all the elements of the array ,all=sum[1]+sum[2]+sum[3]
5. Judge whether the sum is equal to this number , Equal is the number of daffodils

#include<stdio.h>

int narcissus(int n)    // Determine whether the number of Narcissus 
{
	int num = 1;            //n Number of digits 
	int count = 1;
	int single = 0;         // Variable , Store n A single number in 
	int sum[7] = {};        // Used to store a single number n Power 
	int all = 0;            // Array sum Add all values of 
	int mun = num;          // take num Assign a value to mun, Such changes mun Will not change the original num Value 
	int m = n;              // take n The value is assigned to m, Such changes m When n Will not be changed 
	while ((n / count)>1)   // Judge n How many digits is it 
	{
		count *= 10;
		num++;
	}
	while (mun >= 0)              //n Is a few digits , Just cycle a few times , Find the num Power 
	{
		single = m % 10;
		sum[mun] = single;
		for (int i=0; i <= num; i++)
		{
			sum[mun] *= single;   // Find the num Power , And store it sum Array  
		}
		m /= 10;                  // take n Right shift to position , Such as 123->12
		mun--;     
	}
	for (int i = 0; i <= 6; i++)
	{
		all += sum[i];   // Calculation sum Array and 
	}
	if (all == n)
	{
		return n;        // If it's narcissus number , Then return to n, If not, return to 0
	}
	return 0;
}
int main()
{
	int n = 0;
	int i = 1;
	while (i <= 100000)       // from 1 To 100000 Number of daffodils in 
	{
		int ret;
		ret = narcissus(i);   // Get the return value 
		if (ret != 0)         // The return value is not 0 Then print 
		{
			printf("%d ", ret);
		}
		i++;
	}
	return 0;
}