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

}

package tr0llhoehle.cakemix.utility.googleCodeJam;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.text.ParseException;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Scanner;

/**
 * {@link IOManager} is used to manage all input and output operations needed
 * for your java-solution of a Google codejam problem.
 * 
 * It uses the class/interface {@link Problem} and {@link Solver}.
 * 
 * @author Cakemix
 * 
 * @param <S>
 *            The type of your concrete Solver-implementation which solves the
 *            Problem P.
 * @param <P>
 *            The type of your concrete Problem.
 * @see Problem
 * @see Solver
 */
public class IOManager<S extends Solver<P>, P extends Problem> {

	private S solver;
	private Class<P> clazz;
	private LinkedList<P> problems;

	/**
	 * Creates a new IOManager.
	 * 
	 * @param solver
	 *            The solver-instance which is to be used for solving the
	 *            problems.
	 * @param clazz
	 *            A Class object of one exemplary concrete Problem P. This is
	 *            needed to correctly instantiate new concrete Problems.
	 */
	public IOManager(S solver, Class<P> clazz) {
		this.clazz = clazz;
		this.solver = solver;
	}

	private P createProblem() throws InstantiationException,
			IllegalAccessException {
		return clazz.newInstance();
	}

	/**
	 * Starts the IO-operations and solves the Problems contained in the file
	 * pointed to by the filePath.
	 * 
	 * @param filePath
	 *            A String describing the location of an input-file (usually
	 *            *.in)
	 * @throws IOException
	 * @throws ParseException
	 */
	public void start(String filePath) throws IOException, ParseException {
		int amountOfProblems;
		File out;
		Scanner lineScanner;
		File in = new File(filePath);
		Scanner scanner;
		FileWriter writer;

		System.out.print("Creating files... ");
		if (filePath.length() >= 3
				&& filePath.substring(filePath.length() - 3).equals(".in")) {
			filePath = filePath.substring(0, filePath.length() - 3);
		}
		filePath += ".out";

		out = new File(filePath);
		out.createNewFile();
		System.out.println("Done!");

		System.out.print("Creating file reader and writers... ");
		scanner = new Scanner(in);
		writer = new FileWriter(out);
		System.out.println("Done!");

		System.out.print("Parsing the input file... ");
		amountOfProblems = scanner.nextInt();
		scanner.nextLine();
		problems = new LinkedList<P>();
		for (int probID = 0; probID < amountOfProblems; probID++) {
			P problem = null;
			try {
				problem = createProblem();
				SupportedTypes[] probTypes = problem.getTypes();
				for (SupportedTypes t : probTypes) {
					switch (t) {
					case INT:
						lineScanner = new Scanner(scanner.nextLine());
						problem.addValue(lineScanner.nextInt());
						break;
					case DOUBLE:
						lineScanner = new Scanner(scanner.nextLine());
						problem.addValue(lineScanner.nextDouble());
						break;
					case BOOLEAN:
						lineScanner = new Scanner(scanner.nextLine());
						problem.addValue(lineScanner.nextBoolean());
						break;
					case STRING:
						problem.addValue(scanner.nextLine());
						break;
					case LIST_INT:
						lineScanner = new Scanner(scanner.nextLine());
						ArrayList<Integer> ints = new ArrayList<Integer>();
						while (lineScanner.hasNext()) {
							ints.add(lineScanner.nextInt());
						}
						problem.addValue(ints);
						break;
					case LIST_DOUBLE:
						lineScanner = new Scanner(scanner.nextLine());
						ArrayList<Double> doubles = new ArrayList<Double>();
						while (lineScanner.hasNext()) {
							doubles.add(lineScanner.nextDouble());
						}
						problem.addValue(doubles);
						break;
					case LIST_BOOLEAN:
						lineScanner = new Scanner(scanner.nextLine());
						ArrayList<Boolean> booleans = new ArrayList<Boolean>();
						while (lineScanner.hasNext()) {
							booleans.add(lineScanner.nextBoolean());
						}
						problem.addValue(booleans);
						break;
					case LIST_STRING:
						lineScanner = new Scanner(scanner.nextLine());
						ArrayList<String> strings = new ArrayList<String>();
						while (lineScanner.hasNext()) {
							strings.add(lineScanner.next());
						}
						problem.addValue(strings);
						break;
					default:
						System.err
								.print("Default case! This is not a good sign... ");
					}
				}
			} catch (IllegalAccessException e) {
				System.err.println("Couldn't instantiate the problem!");
				e.printStackTrace();
			} catch (InstantiationException e) {
				System.err.println("Couldn't instantiate the problem!");
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			if (problem != null) {
				problems.add(problem);
			}
		}
		System.out.println("Done!");

		System.out.print("Closing the input file... ");
		scanner.close();
		System.out.println("Done!");

		System.out.print("Solving the problems... ");
		for (int i = 0; i < problems.size(); i++) {
			writer.append("Case #" + (i+1) + ": " + solver.solve(problems.get(i))
					+ System.getProperty("line.separator"));
		}
		System.out.println("Done!");

		System.out.print("Closing the writer... ");
		writer.close();
		System.out.println("Done!");

		System.out.println("Shutting down, output lies here:");
		System.out.println(filePath);
	}
}
