/*
 * 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 problem.c;

import java.io.File;
import java.io.IOException;
import java.util.List;
import java.util.Set;

import org.apache.commons.io.FileUtils;

import com.google.common.collect.Lists;
import com.google.common.collect.Sets;

public class RecycledNumbers {

	private static final String INPUT_FILE = "C-small-attempt0.in";

	public static void main(String[] args) throws IOException {
		File inputFile = new File(INPUT_FILE);
		List<String> inputLines = FileUtils.readLines(inputFile);
		Integer.parseInt(inputLines.remove(0));
		List<String> outputLines = Lists.newArrayList();
		for (int k = 0; k < inputLines.size(); k++) {
			String line = inputLines.get(k);
			int seperator = line.indexOf(' ');
			int a = Integer.valueOf(line.substring(0, seperator));
			int b = Integer.valueOf(line.substring(seperator + 1));
			Set<String> matches = Sets.newHashSet();
			for (int currentNumber = a; currentNumber < b; currentNumber++) {
				String stringA = String.valueOf(currentNumber);
				for (int j = 1; j < stringA.length(); j++) {
					String begin = stringA.substring(j);
					String end = stringA.substring(0, j);
					int generatedNumToCheck = Integer.valueOf(begin + end);
					if (generatedNumToCheck <= b && generatedNumToCheck >= a
							&& generatedNumToCheck != currentNumber
							&& generatedNumToCheck > currentNumber) {
						matches.add(currentNumber + " - " + generatedNumToCheck);
					}
				}
			}
			outputLines.add("Case #" + (k + 1) + ": " + matches.size());
		}
		System.out.println(outputLines);
		FileUtils.writeLines(new File("generated-recycled-numbers-output.txt"), outputLines);
	}

}
