/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's say a pair of distinct positive integers (n, m) is recycled if you can
 * obtain m by moving some digits from the back of n to the front without
 * changing their order. For example, (12345, 34512) is a recycled pair since
 * you can obtain 34512 by moving 345 from the end of 12345 to the front. Note
 * that n and m must have the same number of digits in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

import java.io.*;
import java.util.ArrayList;

public class RecycledNumbers {

	static int caseNumber;
	static int totalCases;

	public static void main(String[] args) throws Exception {

		caseNumber = 1;

		File fileIn = new File("C:\\GCJ\\RecycledNumbers\\C-large.in");
		FileInputStream fileInputStream = null;
		BufferedInputStream inputStream = null;
		BufferedReader reader = null;
		Writer out;

		String newLine = System.getProperty("line.separator");

		String fileOutPath = "C:\\GCJ\\RecycledNumbers\\largeOutput.txt";
		File fileOut = new File(fileOutPath);
		if (!fileOut.createNewFile()) {
			fileOut.delete();
			fileOut.createNewFile();
		}

		out = new OutputStreamWriter(new FileOutputStream(fileOutPath), "US-ASCII");

		StringBuilder builder = new StringBuilder();

		try {
			fileInputStream = new FileInputStream(fileIn);

			// Here BufferedInputStream is added for fast reading.
			inputStream = new BufferedInputStream(fileInputStream);
			reader = new BufferedReader(new InputStreamReader(inputStream));

			totalCases = Integer.parseInt(reader.readLine());
			while (caseNumber <= totalCases) {
				builder.append(handleTestCase(reader));
				builder.append(newLine);
				caseNumber++;
			}

			// dispose all the resources after using them.
			fileInputStream.close();
			inputStream.close();
			reader.close();

		} catch (Exception e) {
			e.printStackTrace();
		}
		System.out.print(builder.toString());
		out.write(builder.toString());
		out.close();
	}

	public static String handleTestCase(BufferedReader reader) throws Exception {
		String[] numsAsStrings = reader.readLine().split(" ");
		int start = Integer.parseInt(numsAsStrings[0]);
		int end = Integer.parseInt(numsAsStrings[1]);
		int pairs = 0;
		int current = start;
		while (current <= end){
			pairs += getNumRecycledPairsInRange(current, start, end);
			current++;
		}
		return "Case #"+caseNumber+": "+pairs;
	}
	
	public static int getNumRecycledPairsInRange(int orig, int start, int end){
		int pairs = 0;
		ArrayList<Integer> options = getAllRotationsInRange(orig, start, end);
		for(int i = 0; i < options.size(); i++){
			if (orig < options.get(i)){
				pairs++;
			}
		}
		return pairs;
	}
	
	public static ArrayList<Integer> getAllRotationsInRange(int orig, int start, int end){
		if(orig < 10)
			return new ArrayList<Integer>(0);
		char[] origAsChars = String.valueOf(orig).toCharArray();
		ArrayList<Integer> allRotations = new ArrayList<Integer>(origAsChars.length-1);
		char[] curRotation = origAsChars;
		
		// i < length - 1 because I don't want to repeat the original by doing it the full time
		for(int i = 0; i < origAsChars.length - 1; i++){ 
			char temp = curRotation[0];
			for(int j = 1; j < origAsChars.length; j++){
				curRotation[j-1] = curRotation[j];
			}
			curRotation[curRotation.length-1] = temp;
			allRotations.add(new Integer(String.valueOf(curRotation)));
		}
		
		for(int i = 0; i < allRotations.size(); i++){
			if (allRotations.get(i) < start || allRotations.get(i) > end || allRotations.get(i) == orig){
				allRotations.remove(i);
				i--; //Because ArrayList shifts everything down an index
			}	
		}
		makeListUnique(allRotations);
		return allRotations;
	}
	public static void makeListUnique(ArrayList<Integer> list){
		for(int i = 0; i < list.size(); i++){
			for(int j = i+1; j < list.size(); j++){
				if(list.get(i).equals(list.get(j))){
					list.remove(j);
				}
			}
		}
	}
}
