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: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
 
int main() {
  int n,k;
  cin>>n>>k;    
  
  int a=n/100,b=k/100;
  int c=b-a-1;
  
  int aaf=(a/10)/10,aab=(a/10)%10;
  int bbf=(b/10)/10,bbb=(b/10)%10;
  int af=(n%100)/10,ab=(n%100)%10;
  int bf=(k%100)/10,bb=(k%100)%10;
    
  
  if(af<aab||(af=aab&&ab<=aaf)){
    c+=1;
  }
  if(bf>bbb||(bf=bbb&&bb>=bbf)){
    c+=1;
  }
  cout<<c<<endl;
  
}