/*
 * 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.qualification;

import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		String file = "input3small";
		Scanner in = new Scanner(new File(file));
		int tot = Integer.parseInt(in.nextLine());
//		System.out.println(tot);
		for(int i=0;i<tot;i++) {
			String line = in.nextLine();
			String[] data = line.split(" ");
			int A = Integer.parseInt(data[0]);
			int B = Integer.parseInt(data[1]);
			
			int output = 0;
			for(int j=A; j<=B; j++) {
//				System.out.println("("+j+")");
				String s = j+"";
				output += countRecycled(s, B);
			}
			
			System.out.println("Case #"+(i+1)+": "+output);			
		}

}

	private static int countRecycled(String s, int B) {
		ArrayList<String> rec = new ArrayList<String>();
		int count = 0;
		
		for(int i=s.length()-1; i>0; i--) {
			String r = s.substring(i) + s.substring(0, i);
//			System.out.println(r);
			int s_int = Integer.parseInt(s);
			int r_int = Integer.parseInt(r);
			if(r.charAt(0) != 0 && s_int < r_int && r_int <= B && !isIn(r,rec)) {
//				System.out.println("ok: "+s+"\t"+r);
				count++;
				rec.add(r);
			}
		}

		return count;
	}

	private static boolean isIn(String r, ArrayList<String> rec) {
		for(String r2 : rec)
			if(r.equals(r2))
				return true;
		return false;
	}
}