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

public class Problem3CaseSolver extends AbstractCaseSolver<Problem3Case> {

	@Override
	public String solveCase(TaskStatus taskStatus, Problem3Case caseToSolve) {

		StringBuilder resultBuilder = new StringBuilder(" ");

		String numberA = caseToSolve.getNumberA();
		String numberB = caseToSolve.getNumberB();

		int length = numberA.length();

		Integer numberN = Integer.parseInt(numberA);
		Integer numberM = Integer.parseInt(numberB);

		int numberRecycled = 0;

		while (numberN.intValue() < numberM.intValue()) {

			while (numberN.intValue() < numberM.intValue()) {

				for (int i = 1; i < length; i++) {

					String substringStartNumberN = numberN.toString()
							.substring(length - i);
					String substringEndNumberM = numberN.toString().substring(
							0, (length - i));

					log(LOGLEVEL_TRACE, numberN + ", " + numberM + ", "
							+ substringStartNumberN + ", "
							+ substringEndNumberM);

					if (numberM.toString().startsWith(substringStartNumberN)
							&& numberM.toString().endsWith(substringEndNumberM)) {

						log(LOGLEVEL_TRACE, "Found: " + numberN + "," + numberM);
						numberRecycled++;
						break;
					}
				}
				numberM = numberM.intValue() - 1;
			}

			numberM = Integer.parseInt(numberB);
			numberN = numberN.intValue() + 1;
		}

		resultBuilder.append(numberRecycled);
		return getDefaultResultBegin(taskStatus) + resultBuilder.toString();
	}
}
