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: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
 
//例31115 → 31　→ 13を算出 
int calculate(int data)
{
  int ret;
  ret /= 1000;
  ret = (ret / 10) + (ret % 10) * 10;
  return ret;
}

int main(){
  int A, B, answer;
  cin >> A >> B;
  //100で割ったものを引いて、基本値を出す。
  //例 31415 92653→612
  answer = B/100 - A/100;
  //例 31315→31の逆13が範囲に入るか確認
  if((A % 100) <= calculate(A))
  {
    answer++;
  }
    if((B % 100) > calculate(B))
  {
    answer--;
  }
  cout << answer << endl;
}