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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;

/**
 *
 * @author Nomeir
 */
public class GoogleJam3 {

    private String inputFile =
            "C-large.in";
//            ".\\C-small-attempt0.in";
//            ".\\test3.in";
    private String outputFile = ".\\out.txt";
    private String line = "start";
    private FileReader reader;
    private BufferedReader buffer;
    private FileWriter writer;
    private BufferedWriter printer;

    public GoogleJam3() {
        try {
            new File(outputFile).createNewFile();
            reader = new FileReader(inputFile);
            buffer = new BufferedReader(reader);
            new File(outputFile).createNewFile();
            writer = new FileWriter(outputFile);
            printer = new BufferedWriter(writer);
        } catch (IOException ex) {
            System.out.println("The file couldn't be created ...");
        }
    }

    public void endOperations() {
        try {
            if (reader != null) {
                reader.close();
            }
            if (buffer != null) {
                buffer.close();
            }
            if (printer != null) {
                printer.flush();
                printer.close();
            }
            if (writer != null) {
                writer.close();
            }
        } catch (IOException ex) {
            ex.printStackTrace();
        }

    }
    int lines;

    public void readInfo() {
        try {
            line = buffer.readLine();
            if (line != null) {
                lines = Integer.valueOf(line);
//                int i = 0, j = 0;
//                L = Integer.valueOf(line.substring(0, i = line.indexOf(" ")));
//                D = Integer.valueOf(line.substring(++i, j = line.indexOf(" ", i)));
//                N = Integer.valueOf(line.substring(++j, line.length()));
            }
        } catch (FileNotFoundException ex) {
            System.err.println("Source file not found .. !");
        } catch (IOException e) {
            e.printStackTrace();
        } catch (StringIndexOutOfBoundsException e) {
            e.printStackTrace();
        }
    }
    int aMinValue, bMaxValue, aMovingValue;
    int nMinValue, mMaxValue;
    String aStr, bStr;
    int t1, t2, searchIndex;
    ArrayList<Integer> keys, values;
    ArrayList<Integer> ab;

    private void readInfoLines() {
        try {
            for (int i = 0; i < lines;) {
                line = buffer.readLine();
                ab = new ArrayList<Integer>();
                recurser(line, ab);
                aMinValue = ab.get(0);
                aMovingValue = aMinValue;
                bMaxValue = ab.get(1);
                bStr = bMaxValue + "";
                keys = new ArrayList<Integer>();
                values = new ArrayList<Integer>();
                if (bStr.length() > 1 && aMinValue < bMaxValue) {
                    for (; aMovingValue <= bMaxValue; aMovingValue++) {
                        aStr = aMovingValue + "";
                        if (aStr.length() > 1) {
                            for (int j = 1; j < aStr.length(); j++) {
                                nMinValue = aMovingValue;
                                mMaxValue = Integer.parseInt(aStr.substring(j, aStr.length()) + aStr.substring(0, j));
                                if (mMaxValue > bMaxValue || mMaxValue < aMinValue) {
                                    continue;
                                }
                                if (nMinValue < mMaxValue) {
                                    searchIndex = Collections.binarySearch(keys, nMinValue);
                                    if (searchIndex >= 0 && values.get(searchIndex) == mMaxValue) {
                                    } else {
                                        keys.add(nMinValue);
                                        values.add(mMaxValue);
                                    }
                                }
                            }
                        }
                    }
                }
                printer.write("Case #" + ++i + ": " + keys.size());
                printer.newLine();
            }
        } catch (IOException ex) {
            ex.printStackTrace();
        }
    }

    public void recurser(String s, ArrayList<Integer> links) {
        int i = 0, k = 0;
        if (s != null) {
            if ((i = s.indexOf(" ")) >= 0) {
                if (links.size() == 0) {
                    links.add(Integer.valueOf("" + s.substring(0, i)));
                }
                if ((k = s.indexOf(" ", ++i)) >= 0) {
                    links.add(Integer.valueOf("" + s.substring(i, k)));
                    s = s.substring(k);
                    recurser(s, links);
                } else {
                    links.add(Integer.valueOf(s.substring(i, s.length())));
                }
            }
        }
    }

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        long t = System.currentTimeMillis();
        GoogleJam3 obj = new GoogleJam3();
        obj.readInfo();
        obj.readInfoLines();
//        obj.printTestCases();
        obj.endOperations();
        t = System.currentTimeMillis() - t;
        System.out.println("Time elapsed  " + t);
    }
}
