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 (Clang 3.8.0) (judge verdict: Accepted)

#include<stdio.h>
int fun(int c)
{
    int t,d=0;
    t=c;
    while(t>0)
    {
       d=d*10+t%10;
       t=t/10;
    }
    if(c==d)
        return 1;
    else
        return 0;
}
int main()
{
    int a,b,i,n=0;
    scanf("%d%d",&a,&b);
    for(i=a;i<=b;i++)
    {
        if(fun(i))
            n++;
    }
    printf("%d\n",n);
    return 0;
}