/*
 * 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;
    }
}

package com.google.codejam;

import java.util.ArrayList;

public class RecycledNumber {
	private static ArrayList<String> getRandomCombinations(String number) {
		ArrayList<String> combinations = new ArrayList<String>();
		String temp = null;
		for (int i = 1; i < number.length(); i++) {
			temp = String.valueOf(number.charAt(i));
			if (temp.equals("0")) {
				continue;
			}
			temp = temp + number.substring(i+1, number.length()) + number.substring(0, i);
			combinations.add(temp);
		}
		return (combinations);
	}
	
	private static boolean checkAllCharactersSame(String s) {
		char charToCheck = s.charAt(0);
		boolean oneCharactersSame = true;
		for (int i=1; i < s.length(); i++) {
			if (charToCheck != s.charAt(i)) {
				oneCharactersSame = false;
				break;
			}
		}
		
		return (oneCharactersSame);
	}
	
	public static long countRandomNumbers(long A, long B) {
		long randomNumberCount = 0;
		ArrayList<String> combinations = null;
		ArrayList<String> mnMap = new ArrayList<String>();
		String temp = null, reverseTemp = null;
		for (long i = A; i <= B; i++) {
			if (checkAllCharactersSame(String.valueOf(i))) {
				continue;
			}
			combinations = getRandomCombinations(String.valueOf(i));
			if (combinations.size() == 0) {
				continue;
			}
			for (String number: combinations) {
				if ((Long.parseLong(number) >= A) && (Long.parseLong(number) <= B)) {
					temp = String.valueOf(i)+"-"+number;
					reverseTemp = number+"-"+String.valueOf(i);
					if ((! number.equals(String.valueOf(i))) && (! mnMap.contains(temp)) && (! mnMap.contains(reverseTemp))) {
						mnMap.add(temp);
						randomNumberCount++;
					}
				}
			}
		}
		
		return (randomNumberCount);
	}
	
	public static void main(String[] args) {
		ArrayList<String> testCases = ContentReader.getContents("RecycledNumber.txt");
		long A, B;
		for (int i = 1; i <= Integer.valueOf(testCases.get(0)); i++) {
			A = Integer.valueOf(testCases.get(i).split(" ")[0]);
			B = Integer.valueOf(testCases.get(i).split(" ")[1]);
			System.out.println("Case #"+i+": "+countRandomNumbers(A, B));
		}		
	}
}