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

#include <stdio.h>

int main(void){
  int A, B, i, count = 0, digit_A[5], digit_B[5];
  scanf("%d %d", &A, &B);
  for(i=0; i<5; i++){
    digit_A[i] = A % 10;
    A = A / 10;
    digit_B[i] = B % 10;
    B = B / 10;
  }
  count = (digit_B[4] - digit_A[4]) * 100 + 
          (digit_B[3] - digit_A[3] - 1) * 10 +
          9 - digit_A[2] + digit_B[2];
  if(digit_A[1] * 10 + digit_A[0] <= digit_A[3] * 10 + digit_A[4])
    count++;
  if(digit_B[1] * 10 + digit_B[0] >= digit_B[3] * 10 + digit_B[4])
    count++;
  printf("%d",count);
  return 0;
}