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: Wrong Answer)

#include<stdio.h>
#include<math.h>
int inverse(int x)
{
	int w=4,b=1,i;
	for(i=w;i>=0;i--)
	{
	    b+=(x%10)*pow(10,i);
    	x=x/10;
	}
	//printf("%d\n",b);
	return b;
}
int main()
{
    int a,b,sum=0;
    scanf("%d %d",&a,&b);
    for(int i=a;i<=b;i++)
    {
        int h=inverse(i);
        //printf("%d\n",h);
        if(i==h)
        {
          sum++;
          //printf("%d\n",i);
        }

    }
    printf("%d\n",sum);
    return 0;
}