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;

namespace Sample101
{
    class Program
    {
        static bool IsPalindrome(int num)
        {
            bool result = true;

            string str = num.ToString();
            char[] c = str.ToCharArray();
            int end = c.Length / 2;
            for (int i = 0; i < end; ++i)
            {
                if (c[i] != c[c.Length - 1 - i])
                {
                    result = false;
                    break;
                }
            }

            return result;
        }
        static void Main(string[] args)
        {
            string[] str = Console.ReadLine().Split(' ');
            int A = int.Parse(str[0]);
            int B = int.Parse(str[1]);

            // A以上B以下の整数のうち、回文数となるものの個数を出力せよ
            int result = 0;
            for (int i = A; i <= B; i++)
            {
                if (IsPalindrome(i))
                {
                    ++result;
                }
            }
            Console.WriteLine(result);
        }
    }
}