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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException, IOException{
		String nomeArquivo = "C-small-attempt0";
		
		BufferedReader br = new BufferedReader(new FileReader(nomeArquivo + ".in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(nomeArquivo + ".out"));
		int t = Integer.parseInt(br.readLine());
		for (int i=1; i<=t; i++){
			String campos[] = br.readLine().split(" ");
			int na = Integer.parseInt(campos[0]);
			int nb = Integer.parseInt(campos[1]);
			int total = 0;
			for (int m=na; m<nb; m++){
				for (int n=m+1; n<=nb; n++){
					String a = String.valueOf(m);
					String b = String.valueOf(n);
					int pb = b.indexOf(a.charAt(0));
					boolean achou = false;
					while (pb >= 0){
						int pa = 0;
						int x = pb;
						while (a.charAt(pa++) == b.charAt(pb++)){
							if (pb >= b.length()) pb = 0;
							if (pa >= a.length()){
								achou = true;
								break;
							}
						}
						if (achou){
							total++;
							break;
						}
						pb = b.indexOf(a.charAt(0), x+1);
					}
				}
			}
			bw.write("Case #" + i + ": " + total + "\n");
		}
		br.close();
		bw.close();
	}

}
