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 (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
int main (){

    int A = 0 , B = 0 , number = 0 ;
    int answer = 0;
    int D[5];


    scanf("%d %d",&A,&B);

    for (int i = A; i <= B ; ++i ){
        number = i;
        for (int j = 4; j >= 0;--j){
            D[j] = number % 10;
            number /= 10;
            }
        if (D[0] == D[4] && D[1]== D[3] )
            ++answer;
    }

    printf("%d\n",answer );

return 0;
}