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

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

final class RecycledNumbers {

	/**
	 * @param args
	 * @throws IOException
	 */
	static int solve(int upper, int value)
	{
		if (value < 12) return 0;
		String strNum = value + "";
	
		int length = strNum.length();
					
		Set<Integer> setNewNumber = new HashSet<Integer> ();	               	        
		for (int i = 1; i < length; i++) 
		{
		
				if (strNum.charAt(i) != '0')
				{	
					String first = strNum.substring(0, i);
					String last = strNum.substring(i, length);
					
					int newNum = Integer.parseInt(last + first);
					if (newNum <= upper && newNum > value ) setNewNumber.add(new Integer(newNum)) ;
				}
		
		}
		return setNewNumber.size();
	}
	
	public static void main(String[] args) throws IOException {

		String file = "C-small-attempt0";
		Scanner sc = new Scanner(new FileReader(file + ".in"));
		PrintWriter pw = new PrintWriter(new FileWriter(file + ".out"));
				
		
		int T = sc.nextInt();
		int A = 0;
		int B = 0;
		sc.nextLine();
		for (int i = 0; i < T; i++) {
			A = sc.nextInt();
			B = sc.nextInt();
			int result = 0;
			for (int ii = A; ii <= B; ii++)
			{
				result += solve(B, ii);
			}			
			pw.println("Case #" + (i + 1) + ": " + result);

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