3.4_回文数

问题描述：打印所有不超过n（n < 256）其平方具有对称性质的数。

代码如下：

#include<stdio.h>

#define SIZE 8

int is_palindrome(int num_2)
{
    int numa = num_2;
    int count = 0;
    int i = 0;

    int numb;


    int nump[SIZE];

    while(numa != 0)
    {
        numb = numa % 10;
        numa = numa / 10;
        nump[count] = numb;
        count++;
    }

    while(nump[i] == nump[count - i - 1] && i <= (count - 1) / 2)
    {
        i++;
    }

    if(i == (count - 1) / 2)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}

int main()
{
    int num;
    int num_2;

    for(num = 1; num <= 256; num++)
    {
        num_2 = num * num;

        if(is_palindrome(num_2) == 1)
        {
            printf("This %d is a palindrome number;\n",num);
        }
    }

    return 0;
}