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

}

/**
 * Copyright 2012 Christopher Schmitz. All Rights Reserved.
 */

package com.isotopeent.codejam;

import com.isotopeent.codejam.lib.SolverBase;
import com.isotopeent.codejam.lib.Utils;
import com.isotopeent.codejam.lib.converters.IntArrayLine;

public class Solver extends SolverBase<int[]> {

	private static final String FILE_PATH = "C:\\codejam\\";
	private static final String FILE_NAME = "C-large";
	private static final int INIT_PARAM_COUNT = 1;

	private static final int MAX_DIGITS = 8;
	// digits go from low to high place in array
	private static final int[] tempNumberArr = new int[MAX_DIGITS];

	public static void main(String [] args) {
		Utils.solve(FILE_PATH, FILE_NAME, new IntArrayLine(2), new Solver());
	}

	public Solver() {
		super(INIT_PARAM_COUNT);
	}

	@Override
	protected String solve(int[] input) {
		int[] min = getNumberArr(input[0]);
		int[] max = getNumberArr(input[1]);

		int length = min.length;
		int leadDigit = length - 1;
		int minLeadDigit = min[leadDigit];
		int maxLeadDigit = max[leadDigit];

		int permutationCount = 0;
		for (int shift = 1; shift < length; shift++) {
			for (int lead = minLeadDigit; lead <= maxLeadDigit; lead++) {
				int[] n = new int[length];
				int[] m = new int[length];
				int mLockStart = shift - 1;
				n[leadDigit] = lead;
				m[mLockStart] = lead;
				for (int shiftLead = lead; shiftLead <= maxLeadDigit; shiftLead++) {
					int nLockStart = leadDigit - shift;
					n[nLockStart] = shiftLead;
					m[leadDigit] = shiftLead;
					permutationCount += permutate(min, max, shift, n, nLockStart, m, mLockStart, leadDigit - 1, shiftLead > lead);
				}
			}
		}

		return Integer.toString(permutationCount);
	}

	private static int permutate(int[] min, int[] max, int shift, int[] n, int nLockStart,
			int[] m, int mLockStart, int digit, boolean onlyCheckBounds) {
		int permutationCount = 0;
		int nMin;
		int nMax;
		if (digit <= nLockStart) {
			nMin = n[digit];
			nMax = nMin;
		} else {
			// TODO: optimization possible
			nMin = 0;
			nMax = 9;
		}
		int mMin;
		int mMax;
		// TODO: optimization possible
		if (digit <= mLockStart) {
			mMin = m[digit];
			mMax = mMin;
		} else {
			mMin = 0;
			mMax = 9;
		}
		int compareSize = n.length - digit;
		for (int i = nMin; i <= nMax; i++) {
			n[digit] = i;
			int shiftDigit = shift - n.length + digit;
			if (shiftDigit >= 0) {
				m[shiftDigit] = i;
			}
			if (compare(n, min, compareSize) >= 0) {
				// still in range, so continue
				int j;
				if (!onlyCheckBounds && mMin < i) {
					j = i;
				} else {
					j = mMin;
				}
				for (/*j = mMin*/; j <= mMax; j++) {
					m[digit] = j;
					shiftDigit = digit - shift;
					if (shiftDigit >= 0) {
						n[shiftDigit] = j;
					}
					if (compare(m, max, compareSize) <= 0) {
						if (digit > 0) {
							permutationCount += permutate(min, max, shift, n, nLockStart, m, mLockStart, digit - 1,
									onlyCheckBounds || j > i);
						} else if (onlyCheckBounds || j > i) {
							// check for repetition (which causes duplicate results), can ignore if shift <= repetition size (count first instance)
							int start = n[0];
							for (int k = 2; k < shift; k++) {
								if (n[k] == start) {
									boolean repeated = true;
									for (int offset = n.length - 1 - k; repeated && offset > 0; offset--) {
										repeated = (n[offset] == n[offset + k]);
									}
									if (repeated) {
										permutationCount--;
									}
								}
							}
							permutationCount++;
						}
					}
				}
			}
		}
		return permutationCount;
	}

	private static int[] getNumberArr(int number) {
		int length = 0;
		tempNumberArr[length++] = number % 10;
		while (number >= 10) {
			number /= 10;
			tempNumberArr[length++] = number % 10;
		}
		int[] numberArr = new int[length];
		System.arraycopy(tempNumberArr, 0, numberArr, 0, length);
		return numberArr;
	}

	private static int compare(int[] n, int[] m, int digits) {
		int result = 0;
		int min = n.length - digits;
		for (int i = n.length - 1; i >= min && result == 0; i--) {
			result = n[i] - m[i];
		}
		return result;
	}

}
