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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int fun(int a,int b)
{
    int sun=0,sum=0,su;
    sun=a/10%10*10+a%10;
     sum=a/10000+a/1000%10*10;
     su=b/10%10*10+b%10;
    //printf("%d %d %d\n",sun,sum,su);
    if(sum>=sun)
      return 1;
    return 0;
}
int main()
{
   int a,b;
    scanf("%d%d",&a,&b);
        //fun(a);
        int sum=0,j=1;
        if(fun(a,b))
        {
            sum=1;a=a/100*100+a/10000+a/1000%10*10;
        }
        for(int i=a;i<=b;)
        {
               i=(a/100+j)*100+a/10000+a/1000%10*10;
               sum++;
               j++;
        }
        if(sum==0)
            printf("%d\n",0);
        else
           printf("%d\n",--sum);
   return 0;
}