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;
	cin >> a >> b;

	int ans = 0;
	int tmp = 0;

	for (int i = a; i <= b; i++)
	{
		string s1 = to_string(i);
		string s2;

		for (int l = 5 - 1; l >= 0; l--)
		{
			s2 += s1[l];
		}

		if (s1 == s2)
		{
			ans++;
		}
	}

	cout << ans << endl;

	return 0;
}