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 <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;

int sumOfEachDegit(int n){
  int sum = 0;
  while(n > 0){
    sum += n % 10;
    n /= 10;
  }
  return sum;
}

bool check(int n){
  vector<int> a(5);
  for(int i = 0; i < 5; i++){
    a.at(i) = n % 10;
    n /= 10;
  }
  if(a.at(0) == a.at(4) && a.at(1) == a.at(3)) return true;
  return false;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int A, B;
  cin >> A >> B;
  
  int count = 0;
  for(int i = A; i <= B; i++){
    if(check(i)) count++;
  }
  cout << count << endl;
}