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 f(int x)
{
	int a[10],len=0,i,j;
	while(x>0){
		a[len++]=x%10;
		x=x/10;
	} 
	int y=1;
	for(i=0,j=len-1;i<j;i++,j--){
		if(a[i]==a[j]) y=1;
		else {
			y=0; break;
		}	
	}
	return y;
	

}
int main()
{
	int x,y,k,i;
	scanf("%d%d",&x,&y);
	int ans=0;
	for(i=x;i<=y;i++){
		k=f(i);
		if(k==1){
			ans++;
		}
	}
	printf("%d",ans);
	return 0;
}