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.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace abc_090b
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] input = Console.ReadLine().Split(' ');
            int begin = int.Parse(input[0]);
            int end =  int.Parse(input[1]);
            int count = 0;
            for(int i = begin; i <= end; i++)
            {
                int A = i / 10000;
                int B = (i - A*10000) / 1000;
                int C = (i - A * 10000 - B * 1000) / 100;
                int D = (i - A * 10000 - B * 1000 - C * 100) / 10;
                int E = i % 10;
                if (A == E && B == D)
                {
                    count++;
                }
            }
            Console.WriteLine(count);
        }
    }
}