output_description: Print the number of _palindromic numbers_ among the integers between A and B
  (inclusive).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: #include <bits/stdc++.h>
  using namespace std;
  typedef long long ll;
  
  int A, B;
  
  bool kaibun_5(int n) {
      bool ret = true;
  
      string str_n = to_string(n);
      for (int i = 0; i < 2; i++) {
          if (str_n[i] != str_n[4-i]) {
              ret = false;
          }
      }
  
      return ret;
  }
  
  int main() {
      cin >> A >> B;
  
      int ans = 0;
      for (int i = A; i <= B; i++) {
          if (kaibun_5(i)) {
              ans++;
          }
      }
  
      cout << ans << endl;
      
      return 0;
  }
  
problem_description: 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.
samples: [{"input": "11009 11332", "output": "4\n    \n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and\n11311.\n\n* * *"}, {"input": "31415 92653", "output": "612"}]