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 codeJam;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

public class RecycledNumbers {
	private static int inputLength = 1;

	/**
	 * @param args the command line arguments
	 */
	public static void main(String[] args) {
		String filename = "RecycledNumbers/input.txt";
		if (args.length > 0) {
			filename = args[0];
		}
		
		try {
			Scanner sc = new Scanner (new File(filename));
		
			String input;
			int testCount = Integer.parseInt(sc.nextLine());
			String out = "";
			
			// Split the input into separate tests and collect the output.
			for (int i = 0; i < testCount; i++) {
				input = "";
				for (int row = 0; row < inputLength; row++) {
					input += sc.nextLine() + System.lineSeparator();
				}
				out += "Case #" + (i+1) + ": ";
				out += runTest(input);
				out += System.lineSeparator();
			}
			System.out.println(out);
			BufferedWriter output = new BufferedWriter(new FileWriter(
							"RecycledNumbers/output.txt"));
			output.write(out);
			output.close();
		} catch (FileNotFoundException ex) {
			System.err.println("Input file not found");
			System.exit(1);
		} catch (IOException ex) {
		}
	}


	public static String runTest(String input) {
		boolean[] found = new boolean[2000000];
		Scanner sc = new Scanner(input);
		int lowest = sc.nextInt();
		int highest = sc.nextInt();
		int recycled = 0;
		int length = 0;
		long current = 0;
		int inRange = 0;
		ArrayList<Integer> permutations = new ArrayList<Integer>();
		for (long i = lowest; i <= highest; i++) {
			if(found[(int)i] == true) {
				continue;
			}
			length = getLength(i);
			permutations.clear();
			current = i;
			inRange = 1;
			found[(int)current] = true;
			while (rotate(current, length) != i) {
				current = rotate(current, length);
				if (current <= highest && current >= lowest) {
					inRange++;
					found[(int)current] = true;
				}
			}
			recycled += combinations(inRange);
		}
		
		return String.valueOf(recycled);
	}
	
	public static long rotate(Long in, int length) {
		if (length < 2) {
			return in;
		}
		return in / 10 + ((in % 10) * (int)(java.lang.Math.pow(10.0, (double)length - 1)));
		
	}
	public static int getLength(Long in) {
		return (int)java.lang.Math.floor(java.lang.Math.log10((double)in))+ 1;
	}
	public static int combinations(int count) {
		if (2 == count) {
			return 1;
		}

		// We don't go high enough to worry about overflow (< 8)
		long answer = 1;
		for (int i = count - 2 + 1; i <= count; i++) {
			answer = answer * i;
		}
		for (int j = 2; j > 1; j--) {
			answer = answer / j;
		}
		return (int)answer;
	}
	
}
