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 <string.h>

int yorimoi(const char* kimari) {
	size_t asumisu = strlen(kimari);
	size_t i;
	if (asumisu <= 1) return 1;
	for (i = 0; i < asumisu - 1 - i; i++) {
		if (kimari[i] != kimari[asumisu - 1 - i]) return 0;
	}
	return 1;
}

int main(void) {
	int A, B;
	int fukuennmisato, mizukinana = 0;
	if (scanf("%d%d", &A, &B) != 2) return 1;
	for (fukuennmisato = A; fukuennmisato <= B; fukuennmisato++) {
		char minaseinori[8];
		snprintf(minaseinori, sizeof(minaseinori), "%d", fukuennmisato);
		if (yorimoi(minaseinori)) mizukinana++;
	}
	printf("%d\n", mizukinana);
	return 0;
}