/*
 * 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;
    }
}

import java.util.TreeSet;


public class SolveThread implements Runnable{
	
	private TreeSet<Integer> nbs;
	int pairs = 0, casenb;
	private ThreadDispatcher td;
	private int A, B;
	
	public SolveThread(int A, int B, int casenb, ThreadDispatcher td){
		nbs = new TreeSet<Integer>();
		this.A = A;
		this.B = B;
		for(int i = A; i <= B; i++){
			nbs.add(i);
		}
		this.casenb = casenb;
		this.td = td;
	}
	
	public void solve(){
		while(!nbs.isEmpty()){
			int n = nbs.first();
			findAndRemoveRecycledOf(n);
		}
	}

	private void findAndRemoveRecycledOf(int n) {
		nbs.remove((Integer)n);
		String nstr = "" + n;
		if(nstr.length() == 1)
			return;
		int nbInPair = 1;
		for(int i = 0; i < nstr.length()-1;i++){
			String sstr = shiftRight(nstr,i);
			sstr.replaceFirst("^0+(?!$)", "");
			int sn = Integer.parseInt(sstr);
			if(nbs.contains(sn)){
				nbInPair++;
				nbs.remove((Integer)sn);
			}
		}
		pairs += nbInPair * (nbInPair - 1) / 2;
	}

	private String shiftRight(String nstr, int i) {
		return nstr.substring(nstr.length() - 1 - i, nstr.length()) +  nstr.substring(0, nstr.length() - 1 - i);
	}

	@Override
	public void run() {
		solve();
		td.finish(this);
	}

}
