最大的回文产品-程序未运行，已编写解决方案，但无法理解问题

Question

I knew the code for finding out a palindrome in case of a given number, and I tried to generalize it for finding the largest palindrome made from the product of two 3-digit numbers like this :-

#include<stdio.h>
#include<conio.h>
void main()
{
    int i,no,d,j,temp;
    int sum=0;
    clrscr();
for(i=1;i<1000;i++)
{
    for(j=1;j<1000;j++)
    {       
           sum=0;
           no=i*j;
           temp=no;
           while(no>0)
           {
                 d=no%10;
                 sum=sum*10 + d;
                 no=no/10;
           }
           if(sum==temp)
           {
                 printf("number is Palindrome %d\n",sum);
           }
    }
}
getch();
}

But, I am not getting the solution, can anyone Help?

Answer 1

int sum=0 should be inside the inner for loop, just before the line no=i*j : For each new number, the value of the sum should be started from zero. If it is placed at the very beginning, it will take the value of sum generated from the previous no for all coming no .

If you place sum=0 inside the j loop before while loop then for each new combination of i*j the sum will start from 0 and you will 100% get all the desired palindromes