[exercise C] number of varieties of daffodils

link ： Mutant daffodils __ Cattle from
source ： Cattle from

Number of mutant daffodils - Lily Number： Put any number , Split into two numbers from the middle , such as 1461 Can be broken down into （1 and 461）,（14 and 61）,（146 and 1), If the sum of all split products is equal to itself , It is a Lily Number.

for example ：

655 = 6 * 55 + 65 * 5

1461 = 1*461 + 14*61 + 146*1

Find out 5 All of the digits Lily Number.

#include<stdio.h>
#include<math.h>
int main()
{
	int ret = 0;
	for (int i = 10000; i <= 99999; i++)
	{
		ret = 0;
		for (int j = 1; j <= 4; j++)
		{
			ret += (i / ((int)pow(10, j))) * ((i % (int)pow(10, j)));
			//pow What I'm looking for is 10 Of j Power , The return is double type , A cast is required 
			// According to yes j The power can be obtained in turn i All kinds of combinations of 
		}
		if (ret == i)
			printf("%d ", i);
	}
	return 0;
}