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

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

string int_to_string(int x)
{
    string s;
    while(x!=0)
    {
        s.push_back(48+x%10);
        x/=10;
    }
    return s;
}
int main()
{
    int a, b,i,cnt=0,l,j,k,flag;
    cin >>a >> b;
    string x, y;
    for(i=a;i<=b;i++)
    {
       x= int_to_string(i);
       l=x.size();
       flag=1;
       for(j=0,k=l-1; j<=l-1/2;j++,k--) if(x[j]!=x[k]){flag=0;break;}
       if(flag==1) cnt++;
    }
    cout <<cnt;
}