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 main(void) {
	int A,B,k,l,m;
	int mem = 0;
	int ans = 0;
	char s[6];
	scanf("%d %d", &A, &B);
	for(k=A;k<=B;k++)
	{
		mem = 0;
		sprintf(s,"%d",k);
		l=strlen(s);
		if(l%2 == 0)
		{
			for(m=1;m<=l/2;m++)	
			{	
				if(s[m-1] == s[l-m])
				mem++;
			}
			if(mem == l/2)
			ans++;
		}
		if(l%2 == 1)
		{
			for(m=1;m<=(l-1)/2;m++)
			{
				if(s[m-1] == s[l-m])
				mem++;
			}
			if(mem == (l-1)/2)
			ans++;
		}
	}
	printf("%d", ans);
}