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

#define _CRT_SECURE_NO_WARNINGS

int main(int argc, char const *argv[])
{
	int a,b;
	int n,keta[5],cnt = 0;
	scanf("%d%d",&a,&b);
	for (int i = a; i <= b; ++i)
	{
	  n = i;
		for (int j = 4; j >= 0; --j)
		{
			keta[j] = n % 10;
		  n /= 10;
		}
		if(keta[0] == keta[4] && keta[1] == keta[3])	++cnt;
	}
	printf("%d\n", cnt);
	return 0;
}