/*
 * 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 com.codejam;

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;

public class RecycledNumbers {
	
	private static int lowRange = 0, highRange = 0;
	private static ArrayList<Integer> list = null;
	private static ArrayList<Integer> newList = null; 
	
	
	public static void main(String[] args) {
		try {
			
			FileInputStream fstream = new FileInputStream(
					"D:\\Softwares\\C-small-attempt0.in");
			
			DataInputStream in = new DataInputStream(fstream);
			
			FileOutputStream out = new FileOutputStream("D:\\Softwares\\C-small-attempt0.out");
			PrintStream p = new PrintStream(out);



			int lineNo = 1;
			while (in.available() != 0) {
				if (lineNo == 1) {
					cases(in.readLine(), in, p);
				}
				lineNo++;
			}

			in.close();
		} catch (Exception e) {
			e.printStackTrace();
		}

	}

	private static void cases(String firstLine, DataInputStream in, PrintStream p)
			throws IOException {
		int casesNo = Integer.parseInt(firstLine);
		for (int i = 0; i < casesNo; i++) {
			p.print("Case #" + (i + 1) + ": ");
			String line = in.readLine();
			numbers(line, p);
		}

	}

	private static void numbers(String line, PrintStream p) {
		String[] range = line.split(" ");
		lowRange = Integer.parseInt(range[0]);
		highRange = Integer.parseInt(range[1]);
		int[] numbers = new int[highRange - lowRange + 1];
		for (int i = 0; i < numbers.length; i++) {
			numbers[i] = lowRange + i;
		}
		list = new ArrayList<Integer>();
		newList = new ArrayList<Integer>();
		int total = recycled(numbers);
		p.println(total);
	}

	private static int recycled(int[] numbers) {
		int total = 0;
		int dupliTotal = 0;
		for (int i = 0; i < numbers.length; i++) {
			int num = numbers[i];
			int length = (int)(Math.log10(num)+1);
			int max = maxTen(length);
			int min = 10;
			while (num/min > 0){
				int rem = num%min;
				int remNum = num/min;
				max /= min;
				int newNum = rem*max + remNum;
				if(newNum>num){
					if (newNum <= highRange && newNum > lowRange) {

						if (list.contains(num))
							if (newList.get(list.indexOf(num))==newNum)
								dupliTotal++;
						list.add(num);
						newList.add(newNum);
						total++;
					}
				}
				min*=10;
				max = maxTen(length);
			}
		}
		return total-dupliTotal;
	}
	
	private static int maxTen(int length){
		int result = 1;
		int len = (int)(Math.log10(result)+1);
		while(len!=length){
			result*= 10;
			len = (int)(Math.log10(result)+1);
		}
		return result*10;
	}

}
