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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;

namespace Problem_B
{
    class MainClass
    {
        public static void Main(string[] args)
        {
            var count = 0;
            var input = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            for (var i = input[0]; i <= input[1]; i++)
            {
                var numStr = i.ToString();
                if (numStr.Equals(string.Concat(numStr.Reverse()))) count++;
            }
            Console.WriteLine($"{count}");
        }
    }
}