graphs/piscine/int_palindrome/int_palindrome.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

int int_palindrome(int n)
{
    if (n < 0)
    {
        return 0;
    }

    int reversed = 0;
    int m = n;

    while (m > 0)
    {
        reversed = reversed * 10 + m % 10;
        m /= 10;
    }

    return n == reversed;
}