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

(a, b) = gets.chomp.split(' ').map(&:to_i)

def palindromic?(n)
  s = n.to_s
  
  (0..(s.size / 2)).each do |i|
    if s[i] != s[(s.size - 1) - i] then
      return false
    end
  end
  
  return true
end

c = 0

(a..b).each do |n|
  if palindromic?(n) then
    c += 1
  end
end

puts c.to_s