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

int main(void){
    int a,b,counter = 0;
    scanf("%d %d",&a,&b);
    int i,j,val,ten = 10000;
    int s[5];
    for(i=a;i<=b;i++){
        val = i;
        for(j=0;j<5;j++){
            s[j] = val/ten;
            val = val-s[j]*ten;
            ten = ten/10;
        }
        ten = 10000;
        if(s[0]==s[4]&&s[3]==s[1]){
            counter++;
        }
    }
    printf("%d\n",counter);
    return 0;
}