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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.List;

public class RecycledNumbers {

	public static int pass(int n, int a, int b)
	{
		if(n < 10)
			return 0;
		
		int counter = 0;
		String s = Integer.toString(n);
		int m;
		List<Integer> passedValues = new ArrayList<Integer>();
		for(int i = s.length() - 1; i > 0; i--)
		{
			if(s.charAt(i) == '0')
				continue;
			m = Integer.parseInt(s.substring(i, s.length()) + s.substring(0, i));
			if(m > n && m <= b && !passedValues.contains(m))
			{
				counter++;
				passedValues.add(m);
			}
		}
		return counter;
	}
	
	public static int analyze(String line)
	{
		int counter = 0;
		String[] strs = line.split(" ");
		int a = Integer.parseInt(strs[0]);
		int b = Integer.parseInt(strs[1]);
		for(int i = a; i <= b; i++)
		{
			counter += RecycledNumbers.pass(i, a, b);
		}
		return counter;
	}
	
	public static void main(String[] args) throws Exception
	{
		File input = new File("c.txt");
		FileReader fr = new FileReader(input);
		BufferedReader br = new BufferedReader(fr);
		String line = null;
		line = br.readLine();
		int count = Integer.parseInt(line);
		for(int i = 0; i < count; i++)
		{
			line = br.readLine();
			System.out.println("Case #" + (i + 1) + ": " + RecycledNumbers.analyze(line));
		}
	}
}
