/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.StringTokenizer;


public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		System.out.println("Problem A enter input file:");
		Scanner scan = new Scanner(System.in);
		String sFile = scan.nextLine();
		File f = new File(sFile);
		try {
			BufferedReader r  = new BufferedReader(new FileReader(sFile));
			String current;
			int cnum = 0;
			while((current = r.readLine())!=null) {
				if(cnum>0) {
					System.out.println("Case #"+cnum+": "+solve(current));
				}
				cnum ++;
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	private static int solve(String current) {
		StringTokenizer tok = new StringTokenizer(current);
		int a = 0, b = 0, i = 0, s=0;
		while(tok.hasMoreElements()){
			switch(i) {
			case 0: a = Integer.parseInt((String) tok.nextElement());
			break;
			case 1: b = Integer.parseInt((String) tok.nextElement());
			}
			i++;
		}
		for(int n = a; n<b; n++) {
			for(int m = b; m > n; m--) {
				int t = m;
				int digits = String.valueOf(t).length();
				for(i = 1; i<digits; i++) {
					t = (int) ((t % 10)*Math.pow(10, digits-1) + t/10);
					if(t == n)
						s++;
				}
			}
		}
		return s;
	}

}
