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

import java.util.Formatter;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumbers {	//Counting numbers within a given range, having same sequence of digits 

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();
		for(int i=1;i<=cases;i++){
			int a = in.nextInt();
			int b = in.nextInt();
			int digitCount = new Integer(a).toString().toCharArray().length;
			HashSet<String> pairs = new HashSet<String>();
			
			for(int num=a; num<b; num++){
				char[] numArray = new Integer(num).toString().toCharArray();
				for(int j=1; j<digitCount; j++){
					char[] tempIter = new char[digitCount];
					for(int k=0; k<digitCount; k++)
						tempIter[k] = numArray[(k+j)%digitCount];
					int tempNum = Integer.parseInt(String.valueOf(tempIter));
					if(tempNum > num && tempNum <=b)
						pairs.add(new Formatter().format("[%d, %d]", num,tempNum).toString());
				}
			}
			System.out.println("Case #"+i+": "+pairs.size());
		}
	}

}
