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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.Writer;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	
	public static void main(String[] args) throws Exception {
		
		Writer write = new FileWriter(new File("out.txt"));
		Writer writer = new BufferedWriter(write);
		
		Scanner scan = new Scanner(new File("C-small-attempt0.in.txt"));
		
		int num = scan.nextInt();
		for(int i = 1; i<=num; i++) {
			int lower = scan.nextInt();
			int upper = scan.nextInt();
			int count = 0;
			for(int j = lower; j<upper; j++) {
				Set<String> iterations = iterations(""+j);
				for(int k = j+1; k<=upper; k++) {
					String s = ""+k;
					if(iterations.contains(s)) count++;
				}
			}
			
			writer.write("Case #"+i+": "+count+"\n");
			
		}
		
		writer.close();
		write.close();
		
		
	}
	
	
	public static Set<String> iterations(String in) {
		Set<String> strings = new HashSet<String>();
		
		String current = new String(in);
		strings.add(current);
		for(int i = 0; i<current.length(); i++) {
			String start = current.substring(0, current.length()-1);
			String end = current.substring(current.length()-1);
			
			current = end+start;
			strings.add(current);
		}
		
		//System.out.println(strings);
		
		return strings;
	}

}
