"Narcissus number" refers to a three digit number whose cubic sum is exactly equal to the number itself, such as: 153 = 1 ^ 3 + 3 ^ 3 + 5 ^ 3. Please design an algorithm to find a "narcissus number" within 100
main()
{
int i,j,k,n;
printf("'water flower'number is:");
for(n=100;n