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>
#include <math.h>

int main(void) {
	int a, b, i, j, c[5], temp, cnt = 0;
	
	scanf("%d %d", &a, &b);
	
	for (i = a; i <= b; i++) {
		temp = i;
		for (j = 4; j >= 0; j--) {
			c[j] = temp / (int)pow(10, j);
			temp = temp % (int)pow(10, j);
		}
		if (c[0] == c[4] && c[1] == c[3])
			cnt++;
	}
	
	printf("%d\n", cnt);
	
	return 0;
}