import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Q3M {
	public static void main(String[] args) throws Exception {
		compute();
	}

	private static void compute() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(new File(
				"C:\\work\\Q3\\C-small-attempt0.in")));
		String line = null;
		int i = Integer.parseInt(br.readLine());
		List l = new ArrayList();
		for (int j = 0; j < i; j++) {
			line = br.readLine();
			String[] nums = line.split(" ");
			l.add(calculate(nums));
		}
		writeOutput(l);
	}

	private static int calculate(String[] nums) {
		int min = Integer.parseInt(nums[0]);
		int max = Integer.parseInt(nums[1]);
		int count = 0;
		List l = new ArrayList();
		for (int i = min; i <= max; i++) {
			for (int times = 1; times < countDigits(i); times++) {
				int res = shiftNum(i, times);
				if (res <= max && i < res) {
					if ((!l.contains((i + ":" + res)))) {
						l.add(i + ":" + res);
						l.add(res + ":" + i);
						count++;
					}
				}
			}
		}
		return count;
	}

	private static boolean checkZeros(int temp, int res) {
		if (temp % 10 == 0 || res % 10 == 0)
			return false;
		return true;
	}

	private static int shiftNum(int n, int times) {
		int base = (int) Math.pow(10, times);
		int temp2 = n / base;
		int placeHolder = (int) Math.pow((double) 10,
				(double) countDigits(temp2));
		int res = placeHolder * (n % base) + temp2;
		if (countDigits(res) == countDigits(n)) {
			return res;
		} else {
			return 2000001;
		}
	}

	public static int countDigits(int x) {
		if (x < 10)
			return 1;
		else {
			return 1 + countDigits(x / 10);
		}
	}

	private static void writeOutput(List l) throws Exception {
		StringBuffer b = new StringBuffer();
		int i = 1;
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(
				"C:\\work\\Q3\\ans.txt")));
		for (Iterator iterator = l.iterator(); iterator.hasNext();) {
			br.write("Case #" + i++ + ": " + iterator.next());
			br.newLine();
		}
		br.close();
	}

}
package RecycledNumbers;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			String userDir = System.getProperty("user.dir"); //get working directory
			userDir.replaceAll("['\']", "\\"); // replace all chars '\' with '\\' in the string
			File file = new File(System.getProperty("user.dir") + "\\QualificationRound\\RecycledNumbers\\in-out\\C-small-attempt0.in");
	        Scanner fileScanner = new Scanner(file);
	        //delimiter is how input text is set up in this case it's the new line char
	        fileScanner.useDelimiter(System.getProperty("line.separator")); 
	        //declared for file writing
	        BufferedWriter outFile = new BufferedWriter(new FileWriter(System.getProperty("user.dir") + "\\QualificationRound\\RecycledNumbers\\in-out\\C-small.out"));
			int counter, inCounter, masterCounter, numCases, startIndex, result, Amin, Bmax, numLength, ininCounter, deepCounter, passInt;
			String inputText;
			Amin = 0;
			Bmax = 0;
			String numConv;
			numCases = Integer.parseInt(fileScanner.nextLine());
			ArrayList<Integer> intList = new ArrayList<Integer>();
			ArrayList<Integer> intList2 = new ArrayList<Integer>();
			for(masterCounter = 1; masterCounter <= numCases; masterCounter++){
				inputText = fileScanner.nextLine();
				startIndex = 0;
				result = 0;
				for( counter = 0; counter < inputText.length(); counter ++){//parse A n B
					if (inputText.charAt(counter) == ' ') 
					{
						Amin = Integer.parseInt(inputText.substring(startIndex, counter)); 
						startIndex = counter + 1;
					}    			
				}
				Bmax = Integer.parseInt(inputText.substring(startIndex, counter)); 
				//get current length of numbers
				numLength = String.valueOf(Amin).length();
				for(counter = Amin; counter < Bmax; counter++){
					for(inCounter = counter + 1; inCounter <= Bmax; inCounter++){
						passInt = inCounter;
						while(passInt > 0){
								intList.add(passInt % 10); //get modulous
								passInt = passInt / 10;//div by 10
							}
						for(ininCounter = 0; ininCounter < numLength; ininCounter++){
							
							for(deepCounter = 0; deepCounter < intList.size() -1; deepCounter++)
								intList2.add(intList.get(deepCounter+1));
							
							intList2.add(intList.get(0));
							numConv = "";
							for(deepCounter = 0; deepCounter < intList2.size(); deepCounter++){
								numConv = intList2.get(deepCounter) + numConv;
							}
							passInt = Integer.parseInt(numConv);
							if(counter == passInt){
								result++; 
								//if(masterCounter == 4)
									//System.out.println(counter + " = " + passInt + " Actual #: " + inCounter);
							}
							intList = (ArrayList<Integer>) intList2.clone();
							intList2.clear();
						}
						intList.clear();
					}
				}
			
			System.out.println("Case #" + masterCounter + ": " + result);
        	outFile.write("Case #" + masterCounter + ": " + result + "\n");
			}
			
	        fileScanner.close();
	        outFile.close();
		}
		catch (FileNotFoundException e) {
			System.out.println("File not found"); e.printStackTrace();
		}
		catch (IOException e) {
			System.out.println("IOException");
		}

	}

}
