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 Java7 (OpenJDK 1.7.0) (judge verdict: Wrong Answer)

import java.util.*;
public class Main{
	public static void main(String[] args){
		//10000<=A<=B<=99999
		//
		//回文数とは逆から読んでも同じ数のこと
		//AからBまでを配列に入れていく
		//AからBまでは0から数えてB-A個ある
		//
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		String ba[] = new String[b-a+1];//b-a個に1をプラスしたのは０の時1個配列作られないから	 
		String mozireverse;
		int count = 0;
		for(int i = 0;i <= b-a+1;i++){

			ba[i] = String.valueOf(a);
			a++;

		}

		//５桁だから中身を逆にして比較
		for(int i = 0;i <= b-a+1;i++){
	
			 StringBuffer sb = new StringBuffer(ba[i]);
       			 mozireverse = sb.reverse().toString();
			 //System.out.println(ba[i]);
			 //System.out.println(mozireverse);
			 if(ba[i].equals(mozireverse)){//カウント
				 
				count++;

			 }
	
		}

		System.out.println(count*2);

	
	}
}