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>
using namespace std;

class figure{
public:
  	int a, b, c, d, e;
 	 void extract10000(int N){
      	this->a = N/10000;
    }
};

int main(){
  	int A0, B0, temp, counter = 0;
  	
  	cin >> A0 >> B0;
  
  	figure A, B;
  
  	A.extract10000(A0);	B.extract10000(B0);
  
  	for(int j = A.a;j <= B.a; j++){
      	for(int k = 0;k <= 9; k++){
        	for(int l = 0;l <= 9; l++){
            	temp = 10000*j+1000*k+100*l+10*k+j;
              	if(temp >= A0 && temp <= B0)	counter++;
            }
        }
    }
  
  	cout << counter << endl;
  
  	return 0;
}