Problem:
Score : 200 points

Problem Statement

Find the number of palindromic numbers among the integers between A and B (inclusive).
Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

10000 \leq A \leq B \leq 99999

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

Solution in C (Clang 3.8.0) (judge verdict: Accepted)

#include <stdio.h>
#include <string.h>

int main (void)
{
    char a[6], b[6];
    char c[6];
    int x = 0;
    char i, j, k;

    scanf("%s %s", a, b);

    c[5] = '\0';

    for (i = '1'; i <= '9'; i++) {
        for (j = '0'; j <= '9'; j++) {
            for (k = '0'; k <= '9'; k++) {
                c[0] = i; c[1] = j; c[2] = k; c[3] = j; c[4] = i;
                if (strcmp(a, c) <= 0 && strcmp(b, c) >= 0) x++;
            }
        }
    }

    printf("%d\n", x);
}