package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

package org.moriraaca.codejam;

import java.io.File;
import java.io.InputStream;
import java.io.PrintStream;

public abstract class AbstractSolver<TC extends TestCase> {
	protected final String RESOURCE_FOLDER = "src/main/resources/";

	/* Config */
	protected final String defaultInputFileName;

	protected final OutputDestination outputDestination;

	protected final DebugOutputLevel debugOutputLevel;

	protected final Class<? extends AbstractDataParser> dataParserClass;

	protected PrintStream output;

	protected PrintStream getOutput() {
		if (output == null) {
			try {
				switch (outputDestination) {
				case STDOUT:
					output = System.out;
					break;
				case FILE:
					output = new PrintStream(new File(
							defaultInputFileName.replaceAll("\\.in", "\\.out")));
				default:
					break;
				}
			} catch (Exception rethrow) {
				throw new Error("Fatal error on initialization of output",
						rethrow);
			}
		}

		return output;
	}

	public AbstractSolver() {
		try {
			SolverConfiguration config = getClass().getAnnotation(
					SolverConfiguration.class);
			debugOutputLevel = config.debugOutputLevel();
			outputDestination = config.outputDestination();
			defaultInputFileName = config.inputFileName();
			dataParserClass = config.parser();

		} catch (Exception log) {
			log.printStackTrace();
			throw new Error("Fatal error on initialization", log);
		}
	}

	public void write(String msg, DebugOutputLevel level) {
		if (level.ordinal() <= debugOutputLevel.ordinal()) {
			getOutput().print(msg);
		}
	}

	public final String solve() {
		return solve(defaultInputFileName);
	}

	@SuppressWarnings("unchecked")
	public final String solve(String fileName) {
		try {
			AbstractDataParser dataParser = dataParserClass.getConstructor(
					InputStream.class).newInstance(
					getClass().getClassLoader().getResourceAsStream(fileName));

			StringBuilder result = new StringBuilder();

			for (int i = 0; i < dataParser.getTestCases().length; i++) {
				result.append("Case #")
						.append(i + 1)
						.append(": ")
						.append(solveTestCase((TC) dataParser.getTestCases()[i]))
						.append("\n");
			}

			return result.toString();
		} catch (Exception e) {
			throw new Error("Fatal error on solve", e);
		}
	}

	public final void getSolution() {
		write(solve(), DebugOutputLevel.SOLUTION);
	}

	protected abstract String solveTestCase(TC testCase);
}
