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 com.google.codejam.qualrnd.recyclednums;

import java.io.BufferedOutputStream;
import java.io.FileOutputStream;
import java.io.IOException;

public class RecycledNumbers {

	public void resolve() {
		
		RecycledNumbersInputReader inputReader = new RecycledNumbersInputReader();
		RecycledNumbersInput input = inputReader.read();
		
		int noOfCases = input.getNoOfCases();
		long[][] valuePairs = input.getNumPairs();
		
		long start = 0;
		long end = 0;
		BufferedOutputStream outputStream = null;
		try {
			outputStream = new BufferedOutputStream(new FileOutputStream("out.txt"));

			for (int caseIndex = 0; caseIndex < noOfCases; caseIndex++) {
				start = valuePairs[caseIndex][0];
				end = valuePairs[caseIndex][1];
				long output = findNoOfRecycledNumsBetween(start, end, 0);
			
				outputStream.write(String.format("Case #%d: %s\n", caseIndex+1, output).getBytes());
				System.out.printf("Case #%d: %s\n", caseIndex+1, output);
			}
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			if (outputStream != null) {
				try {
					outputStream.flush();
					outputStream.close();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
		}
	}
	
	private long findNoOfRecycledNumsBetween(long start, long end, long recycledNumsCount) {
		recycledNumsCount = countNoOfRecycledNums(start, end, start+1, recycledNumsCount);
		if (start < end) {
			recycledNumsCount = findNoOfRecycledNumsBetween(start+1, end, recycledNumsCount);
		}
		return recycledNumsCount;
				
	}
	
	private long countNoOfRecycledNums(long minLimit, long maxLimit, long nextNum, long recycledNumsCount) {
		if (nextNum > maxLimit) {
			return recycledNumsCount;
		}
		if (areCycleable(minLimit, nextNum)) {
			recycledNumsCount++;
		}
		recycledNumsCount = countNoOfRecycledNums(minLimit, maxLimit, nextNum+1, recycledNumsCount);
		return recycledNumsCount;
	}
	
	private boolean areCycleable(long a, long b) {
		
		if (a < b) {
			String num1 = String.valueOf(a);
			String num2 = String.valueOf(b);
			
			char[] digits = num1.toCharArray();
			
			if (num1.length() == num2.length()) {
				for (int index = 0; index < digits.length; index++) {
					// rotating the number
					char lastDigit = digits[digits.length-1];
					for (int rotateIndex = digits.length-1; rotateIndex > 0; rotateIndex--) {
						digits[rotateIndex] = digits[rotateIndex-1];
					}
					digits[0] = lastDigit;
					
					String rotatedNum = new String(digits);
					if (Integer.parseInt(rotatedNum, 10) == b) {
//						System.out.printf("Numbers %d and %d are recyclable.%n", a, b);
						return true;
					}
				}
			}
		}
//		System.out.printf("Numbers %d and %d are not recyclable.%n", a, b);
		return false;
	}
	
	public static void main(String[] args) {
		new RecycledNumbers().resolve();
	}
}
