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: Wrong Answer)

#include <stdio.h>
#include <math.h>

int main(void)
{
	char a[7],b[7];
	int x;
	int sum_a=0;
	int sum_b=0;
	int ans=0;
	
	scanf("%s %s",a,b);
	
	for(int i=4,j=0;i>=0;i--,j++){
		
		x=(int)pow(10,i);
		
		sum_a=sum_a+x*(a[j]-'0');
		sum_b=sum_b+x*(b[j]-'0');
	}
	
	
	ans=(sum_b-sum_a)/100;
	
	if(a[2]!=b[2]){
		ans=ans+1;
	}
	
	printf("%d\n",ans);
	
	return 0;
}