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 kai(int a){
	int ke[5];
	ke[0]=a%10;a=(a-ke[0])/10;
	ke[1]=a%10;a=(a-ke[1])/10;
	ke[2]=a%10;a=(a-ke[2])/10;
	ke[3]=a%10;a=(a-ke[3])/10;
	ke[4]=a%10;a=(a-ke[4])/10;
	if(ke[0]==ke[4]&&ke[1]==ke[3])return 1;
	else return 0;
}

int main(){
	int a,b,i,ans=0;
	scanf("%d%d",&a,&b);
	for(i=a;i<=b;i++){
		if(kai(i)==1)ans++;
	}
	printf("%d\n",ans);
	return 0;
}