/*
 * 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 er.dream.codejam.qual;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

import er.dream.codejam.helpers.ProblemSolver;

public class RecycledNumbers extends ProblemSolver{
	
	public static void main(String[] args) {
		new RecycledNumbers().execute();
	}

	@Override
	protected List<String> handleInput() {
		List<String> result = new ArrayList<String>();
		int[] settings = fileHandler.readIntArray();
		
		for(int line = 0;line<settings[0];line++){
			int transformations = 0;
			
			int[] fromTo = fileHandler.readIntArray();
			int from = fromTo[0];
			int to = fromTo[1];
			for(int i=from;i<=to;i++)
				transformations += getRecycledNumbers(i, to);
			
			result.add(""+transformations);
		}
		
		return result;
	}
	
	private int getRecycledNumbers(int number, int max){
		int transformations = 0;
		
		String numberString = ""+number;
		int stringLength = numberString.length();
		String newString; int transformedNumber;
		Set<Integer> foundTransformations = new HashSet<Integer>();
		for(int i=stringLength-1;i>0;i--){
			newString = numberString.substring(i)+numberString.substring(0, i);
			transformedNumber = Integer.parseInt(newString);
			if(transformedNumber > number && transformedNumber <= max && !foundTransformations.contains(transformedNumber)){
				transformations++;
				foundTransformations.add(transformedNumber);
			}
		}
		return transformations;
	}

}
