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 <iostream>

using namespace std;

int f(int c)
{
    if ((c/1000)==(c%100))
        return 1;
    else return 0;
}
int main()
{
    int a,b,sum=0,cot=0;
    cin>>a>>b;
    int i,j;
    for (j=a;j<b;)
    {
        if (j+10000<b)
           {
               j+=10000;
               cot++;
           }
        else if (j+10000==b)
            {
                cot++;
                break;
            }
            else break;
    }
    sum+=cot*100;
    for (i=j;i<=b;i++)
        if (f(i))
            sum++;
        cout<<sum<<endl;
    return 0;
}