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 mirror(int num) {
  return num*100+(num/10)%10*10+(num/100);
}

int main(void) {
  int a, b;
  char line[15];
  FILE* fp = stdin;
  if(!fgets(line, 15, fp)) return 0;
  sscanf(line, "%d %d", &a, &b);
  int a_100 = a/100;
  int b_100 = b/100;
  int res = 0;
  // printf("%d %d\n", mirror(a_100), mirror(b_100));
  if(b_100 == a_100) {
    int check = mirror(a_100);
    if( a <= check && check <= b) { res = 1; }
  } else {
    res = b_100 - a_100 + 1;
    if(mirror(a_100) < a) res--;
    if(mirror(b_100) > b) res--;
  }

  printf("%d\n", res);
  return 0;
}