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

#include <bits/stdc++.h>
using namespace std;

int main() {
  int A, B;
  int i1, i2, i3;
  int s1, s12;
  int i=0;
  cin >> A >> B;
  for (i1=1; i1<10; i1++) {
    s1=i1*10001;
//    cout <<s1 <<"+9990<?" <<A <<endl;/////////
    if (s1+9990<A) continue;
//    if (s1+9990<A) { cout <<s1 <<"+9990<" <<A <<endl; continue;}
//    cout << s1 << '>?' << B << endl;////////
    if (s1>B) break;
//    if (s1>B) { cout << s1 << '>' << B << endl; break; }////////
    for (i2=0; i2<10; i2++) {
      s12=s1+i2*1010;
      if (s12+900<A) continue;
      if (s12>B) continue;
      for (i3=0; i3<1000; i3+=100) {
        if ((s12+i3>=A) && (s12+i3<=B)) i++;
//        cout << s12+i3 << ' ' << i << endl;//////////////
      }
    }
  }
  cout <<i <<endl;
}