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: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace B___Palindromic_Numbers
{
    class Program
    {
        static void Main(string[] args)
        {
            int A = int.Parse(Console.ReadLine());
            int B = int.Parse(Console.ReadLine());
            int count = 0;

            for (int i = A; i <= B; ++i)
            {
                string s = i.ToString();

                System.Globalization.StringInfo si = new System.Globalization.StringInfo(s);

                string s1 = si.SubstringByTextElements(0, 1);

                string s2 = si.SubstringByTextElements(1, 1);

                string s4 = si.SubstringByTextElements(3, 1);

                string s5 = si.SubstringByTextElements(4, 1);

                if (s1 == s5 && s2 == s4)
                {
                    count += 1;
                }

                i = int.Parse(s);
            }

            Console.Write(count);
            Console.Read();
        }
    }
}