Daffodil upgrade (self idempotent)

// Self idempotent 
int main()
{
	int i = 0;
	for(i=0;i<100000;i++)
	{
		// Judge whether it is self idempotent  
		//1. Calculate the number of digits  n digit 
		int n = 1;
		int sum = 0;
		int tmp = i;
		while(tmp/=10)
		{
			n++;
		}
		//2. Calculation i Everyone's n The sum of the powers 
		tmp = i;
		while(tmp)
		{
			sum += pow(tmp%10,n);// Power number  
			tmp/=10;
		}
		//3. Compare i and sum
		if(i==sum)
		{
			printf("%d ",sum);
		}
	}
	return 0;
 }