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 (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
int judgeNumber(int number)
{
	int a, b, c, d;
	d = number % 10;
	number = number / 10;
	c = number % 10;
	number = number / 10;
	number = number / 10;
	b = number % 10;
	number = number / 10;
	a = number % 10;
	if (a == d)
	{
		if (b == c)
			return 1;
	}
	return 0;
}
int main()
{
	int a, b, count,n;
	count = 0;
	scanf("%d", &a);
	scanf("%d",&b);
	for (n = a; n <= b; n++)
	{
		if (judgeNumber(n))
			count++;
	}
	printf("%d",count);
	return 0;
}