/*
 * 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 de.at.codejam.problem3.util;

import java.io.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.util.List;
import java.util.StringTokenizer;

import de.at.codejam.problem3.Problem3Case;
import de.at.codejam.util.AbstractInputFileParser;
import de.at.codejam.util.TaskStatus;

public class Problem3InputFileParser extends
		AbstractInputFileParser<Problem3Case> {

	private int nextCaseNumber = 1;
	private int nextCaseLine = 2;

	public Problem3InputFileParser(File inputFile) {
		super(inputFile);
	}

	@Override
	public Problem3Case getNextCase() throws IOException {

		Problem3Case problem3Case = new Problem3Case();

		TaskStatus taskStatus = getTaskStatus();
		BufferedReader bufferedReader = null;

		try {

			bufferedReader = checkoutBufferedReader();
			taskStatus.setNumberCurrentCase(nextCaseNumber);

			List<String> lineList = readLines(bufferedReader, nextCaseLine, 1);

			String stringCase = lineList.get(0);
			StringTokenizer stringTokenizer = new StringTokenizer(stringCase,
					" ");

			String numberA = stringTokenizer.nextToken().trim();
			String numberB = stringTokenizer.nextToken().trim();

			problem3Case.setNumberA(numberA);
			problem3Case.setNumberB(numberB);

			nextCaseNumber++;
			nextCaseLine += 1;

		} finally {
			if (null != bufferedReader) {
				try {
					checkinBufferedReader(bufferedReader);
				} catch (IOException e) {

				}
			}
		}

		return problem3Case;
	}

}
