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

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author administrator
 */
public class RecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        String input = "c:\\input.in";
        String output = "c:\\output.txt";
        System.out.println("Hello World");
        RecycledNumbers code1 = new RecycledNumbers();
        File in = new File(input);
        File out = new File(output);
        code1.getFileContents(in, out, "UTF-8");
    }

    public void getFileContents(File input, File output, String charSet) {
        String temp = "";
        try {
            Scanner scanner = new Scanner(input, charSet);
            PrintWriter out = new PrintWriter(output);

            int count = 0;
            int test_case = 0;

            while (scanner.hasNext()) {
                int A = 0, B = 0;
                String test = scanner.nextLine();
                if (count == 0) {
                    test_case = Integer.parseInt(test);
                    count++;
                } else {
                    String[] line_data = test.split("\\s");
                    A = Integer.parseInt(line_data[0]);
                    B = Integer.parseInt(line_data[1]);
                    int result = 0;
                    if (A > B) {
                        int t = A;
                        A = B;
                        B = t;
                    }
                    for (int i = A; i < B; i++) {
                        int list[] = getCycledNumbers(i);
                        for (int j = 0; j < list.length; j++) {
                            if (list[j] > i && list[j] <= B) {
                                result++;
                            }
                        }

                    }
                    
                    System.out.println("Case #" + count + ": " + result);
                    if (count == test_case) {
                        out.print("Case #" + count + ": " + result);
                    } else {
                        out.println("Case #" + count + ": " + result);
                    }
                    count++;
                    
                }

                temp = temp + "\n" + test;
            }
            out.close();
            scanner.close();
        } catch (Exception e) {
            System.out.println("File read/write error");

            return;
        }

    }

    private int[] getCycledNumbers(int number) {
        int cycled[];
        int recycled[];
        String num = String.valueOf(number);
        cycled = new int[num.length()];
        for (int i = 0; i < num.length(); i++) {
            int part1 = number / (int) Math.pow(10, i);
            int part2 = number % (int) Math.pow(10, i);
            cycled[i] = part2 * (int) Math.pow(10, num.length() - i) + part1;
        }

        for (int i = 0; i < (num.length() - 1); i++) {
            for (int j = 0; j < (num.length() - (i + 1)); j++) {
                if (cycled[j] > cycled[j + 1]) {
                    int temp = cycled[j];
                    cycled[j] = cycled[j + 1];
                    cycled[j + 1] = temp;
                }
            }
        }

        int save = cycled[0];
        int final_len = num.length();
        for (int i = 1; i < (num.length()); i++) {
            if (cycled[i] == save) {
                final_len--;
            }
            save = cycled[i];
        }

        if (final_len == num.length()) {
            return cycled;
        }


        recycled = new int[final_len];
        save = recycled[0] = cycled[0];
        int ctr = 0;
        for (int i = 1; i < (num.length()); i++) {
            if (cycled[i] != save) {
                ctr++;
                recycled[ctr] = cycled[i];
            }
            save = cycled[i];
        }
        return recycled;
    }
}
