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 <map>
#include <vector>
#include <queue>
#include <functional>
#include <algorithm>
#include <cmath>
#include <string>
#define mp make_pair
#define pb push_back

using namespace std;

int main() 
{
	string a,b;
	cin >> a >> b;
	int sum = 0;
	if (a[0] == a[4] && a[1] == a[3])
			sum++;
	while (a != b) {
		int i = 4;
		while (1) {
			if (a[i] < '9') {
				a[i]++;
				break;
			}
			else {
				a[i] = '0';
				--i;
			}
		}
		if (a[0] == a[4] && a[1] == a[3])
			sum++;
	}
	cout << sum;
	return 0;
}