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 qualification.c;

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

import common.ClockWatch;
import common.ISolver;
import common.QuestionHandler;

public class RecycledNumbers implements ISolver {

	private int addCountSign(Set<Integer> signatures, Set<Integer> tmpSig,
			int val, int min, int max) {
		String valStr = String.valueOf(val);
		int len = valStr.length();
		char[] chars = new char[len * 2];
		for (int i = 0; i < len; ++i) {
			chars[i] = valStr.charAt(i);
			chars[i + len] = valStr.charAt(i);
		}
		int presentSigCount = 0;
		tmpSig.clear();
		for (int i = 1; i < len; ++i) {
			if (chars[i] != '0') {
				Integer sig = Integer.valueOf(new String(chars, i, len));
				if (sig >= min && sig <= max) {
					if (tmpSig.add(sig) && signatures.contains(sig)) {
						++presentSigCount;
					}
				}
			}
		}
		signatures.add(val);
		return presentSigCount;
	}

	@Override
	public String solve(String problem) {
		Scanner scan = new Scanner(problem);
		int min = scan.nextInt();
		int max = scan.nextInt();

		Set<Integer> signatures = new HashSet<Integer>();
		Set<Integer> tmpSig = new HashSet<Integer>();
		int result = 0;
		for (int i = min; i <= max; ++i) {
			result += addCountSign(signatures, tmpSig, i, min, max);
		}

		return String.valueOf(result);
	}

	@Override
	public void addCase(String problem, String answer) {
		String myAnswer = solve(problem);
		if (!myAnswer.equals(answer)) {
			throw new RuntimeException("Invalid prediction for '" + problem
					+ "'. Expected '" + answer + "' got '" + myAnswer + "'");
		}

	}

	public static void main(String[] args) {
		ClockWatch watch = new ClockWatch();
		QuestionHandler questionHandler = new QuestionHandler(
				new RecycledNumbers());
		questionHandler.addResource("sample.in", "sample.out");

		watch.tic();
		// System.out.println("Sample input:");
		// questionHandler.solve("sample.in", "sample.out");

//		System.out.println("\nSmall input:");
//		questionHandler.solve("small.in", "small.out");

		 System.out.println("\nLarge input:");
		 questionHandler.solve("large.in", "large.out");
		watch.printTocSecs();
	}
}
