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;

bool is_palindrome(string s)
{
	bool equal = true;
	for (int i=0;i<s.length()/2;i++)
	{
		if (s[i]!=s[s.length()-1-i])
		{
			equal=false;
			break;
		}
	}
	return equal;
}
int main ()
{
//	ios_base::sync_with_stdio(false);
//	cin.tie(NULL);
	
//	freopen ("//specify file name","r",stdin);
//	freopen ("output.txt","w",stdout);
	
	int a,b;
	cin>>a>>b;
	
	int count=0;
	
	for (int i=a;i<=b;i++)
	{
		if (is_palindrome(to_string(i)))
			++count;
		
	}
	cout<<count;
	
	return 0;
	
}