import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
package qualif.problem3;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

public class RecycledNumbers extends ProblemClass{

	public RecycledNumbers(Scanner input) {
		super(input);
	}

	protected String processLine(String line) {
		String[] inputs = line.split(" ");
		
		Integer lowNumber = new Integer(inputs[0]);
		Integer highNumber = new Integer(inputs[1]);
		
		Integer total = findRecycledNumberBetween(lowNumber,highNumber);
		return total.toString();
	}
	
	private Integer findRecycledNumberBetween(Integer lowNumber,Integer highNumber){
		
		int highNumberDigitsNumber = highNumber.toString().split("(?<=.)").length;
		Integer totalRecycled =0;

		lowNumber = Math.max(lowNumber, 10);
		for(Integer currentNumber=lowNumber ; currentNumber < highNumber ; currentNumber++  ){

			String[] digits = currentNumber.toString().split("(?<=.)");

			if(allDigitsTheSame(digits)){
				continue;
			}

			ArrayList<Integer> alreadyCheck = new ArrayList<Integer>();
			for(int permut = 1 ; permut<digits.length ; permut++){
				Integer newNumber  = createPermutation(digits,permut);
				if(newNumber!= null && !alreadyCheck.contains(newNumber) && currentNumber<newNumber && newNumber <= highNumber){
					totalRecycled+=1;
				}
				if(alreadyCheck.contains(newNumber) && newNumber!=null && currentNumber!=newNumber){
					//System.out.println(newNumber);
				}
				alreadyCheck.add(newNumber);
			}
		}

		return totalRecycled;
	}
//	
//	private int calculateNumberOfCorrectPerm(String[] digits) {
//		int nbOfPerm = digits.length-1;
//		int nbOfZero = 0;
//		int patern = 0;
//		for(String digit:digits){
//			if(digit.equals("0")){
//				nbOfZero+=1;
//			}
//		}
//		
//		if(digits.length%2==0){
//			
//			patern = 1;
//		}
//		return nbOfPerm - nbOfZero - patern;
//	}

	private boolean allDigitsTheSame(String[] digits){
		String value = digits[0];
		for(String item:digits){
			if(!value.equals(item)){
				return false;
			}
		}
		return true;
	}
	private Integer createPermutation(String[] digits,int permut){
		
		int lengh = digits.length;
		String newDigits = new String();
		for(int i = 0 ; i < lengh ; i ++){
			int newIndex = (i+permut)%lengh;
			if(i==0 && digits[newIndex].equals("0")){
				return null;
			}
			newDigits +=digits[newIndex];
		}

		return new Integer(newDigits);
	}
}
