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

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;

public class ProblemC {

	public static void main(String [ ] args){
		try{
			FileInputStream fstream = new FileInputStream("input_problemC.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String input = new String();
			String line;
			while ((line = br.readLine()) != null)
				input += line + '\n';
			System.out.println(input);
			System.out.println(solveProblemC(input));
		}catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
		}
		
	}


	private static String solveProblemC(String input) {
		String result = new String();
		String[] lines = input.split("\n"), numbers;
		int len = Integer.parseInt(lines[0]);
		int A, B, qt, current, aux, counterTemp = 0;
		String currentString;
		int[] temp = new int[10];
		for(int i = 1; i <= len; i++){
			result += "Case #" + i + ": ";
			numbers = lines[i].split(" ");
			A = Integer.parseInt(numbers[0]);
			B = Integer.parseInt(numbers[1]);
			qt = 0;
			for(current = A; current <= B; current++){
				currentString = String.valueOf(current);
				check: for(int j = 1; j < currentString.length(); j++){
					if(current < (aux = Integer.parseInt(currentString.substring(j) + currentString.substring(0, j))) && aux <= B){
						for(int l = 0; l < counterTemp; l++)
							if(temp[l] == aux)
								continue check;
						qt++;
						temp[counterTemp] = aux;
						counterTemp++;
						//System.out.println(current +","+aux);
					}
				}
				counterTemp = 0;
			}
			result += qt + "\n";
		}
		return result;
	}
}
