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

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		String file = "C-small-attempt1";
		Scanner sc = new Scanner(new FileReader(file + ".in"));
		PrintWriter pw = new PrintWriter(new FileWriter(file + ".out"));
		int T = new Integer(sc.nextLine());
		Map<Map<String, String>, String> mapAll = new HashMap<Map<String, String>, String>();
		Map<String, String> map = new HashMap<String, String>();

		int h = 1;
		for (int t = 1; t <= T; t++) {
			String line = sc.nextLine();
			String[] numbers = line.split(" ");
			mapAll = new HashMap<Map<String, String>, String>();
			int A = new Integer(numbers[0]);
			int B = new Integer(numbers[1]);
			if ((String.valueOf(A)).length() > 1) {
				
				for (int i = B; i > A; i--) {
					for (int j = A; j < i; j++) {
						String auxA = String.valueOf(j);
						for (int m = 0; m < auxA.length(); m++) {
							if (auxA.charAt(0) != '0') {
								if (new Integer(auxA) == i) {
									map = new HashMap<String, String>();
									map.put(String.valueOf(j),
											String.valueOf(i));
									mapAll.put(map, "sucesso");
								}
							}
							StringBuilder sb = new StringBuilder();
							sb.append(auxA.charAt(auxA.length() - 1));
							sb.append(auxA.substring(0, auxA.length() - 1));
							auxA = sb.toString();
						}
					}
				}
			}			
			pw.print("Case #" + h + ": ");
			pw.println(mapAll.size());
			/*for(Map<String, String> m : mapAll.keySet()) {
				for(String s : m.keySet()) {
					pw.print(s + " - ");
					pw.println(m.get(s));
				}
			}
			pw.println("###########################");
			pw.println();*/
			h++;

		}
		pw.flush();
		pw.close();
		sc.close();
	}

}
