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 me.stapel.kai.google.codejam2012.quali;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.SortedSet;
import java.util.TreeSet;

import me.stapel.kai.google.codejam2012.quali.C.Pair;

public class ProblemC {

	private static final String NL = System.getProperty("line.separator");

	public ProblemC() {
		// nothing to do here yet
	}
	
	public static void main(String[] args) {
		ProblemC problemC = new ProblemC();
		
		problemC.processFile("in/C-large.in", "out/C-large.txt");
	}

	private Object processFile(String inFileName, String outFileName) {
		Object obj = new Object();
		
		File inFile = new File(inFileName);
		File outFile = new File(outFileName);

		String line = "";
		int T = 1;

		OutputStreamWriter output;
		BufferedReader br;
		try {
			br = new BufferedReader(new FileReader(inFile));
			output = new OutputStreamWriter(new BufferedOutputStream(
					new FileOutputStream(outFile)), "8859_1");

			line = br.readLine();
			
			// skipping first line
			line = br.readLine();

			while (line != null) {
				String[] split = line.split(" ");

				int A = Integer.parseInt(split[0]);
				int B = Integer.parseInt(split[1]);

				int numPairs = calcNumPairs(A, B);
				
				output.write("Case #" + T + ": " + numPairs + NL);
				System.out.println("Case #" + T + ": " + numPairs);
				
				line = br.readLine();
				T++;
			}
			
			
			output.flush();
			output.close();

		} catch (FileNotFoundException e) {
			System.err.println("File " + inFile.getName() + " not found. Nothing processed.");
			e.printStackTrace();
		} catch (IOException e) {
			System.err.println("Error when reading file " + inFile.getName() + " or writing file " + outFile.getName() + ".");
			e.printStackTrace();
		}
		
		return obj;
	}
	
	private int calcNumPairs(int A, int B) {
		SortedSet<Pair> pairs = new TreeSet<Pair>();
		
		for(int i = A; i <= B; i++){
			int[] n = toArray(i);

			calcRecycledPairs(n, B, pairs);
		}
		
		return pairs.size();
	}

	private int calcRecycledPairs(int[] n, int B, SortedSet<Pair> pairs) {
		int num = 0;
		int[] m = new int[n.length];
		int ni,mi;
		
		for (int i = 1; i < n.length; i++) {
			for(int j = 0; j < n.length-i; j++) {
				m[j+i] = n[j];
			}
			for(int j = n.length-i; j < n.length; j++) {
				m[j-n.length+i] = n[j];
			}
			
			ni = fromArray(n);
			mi = fromArray(m);
			
			if(mi <= B && ni < mi && isValidM(m)) {
				num++;
				pairs.add(new Pair(ni, mi));
//				System.out.println("("+ni+", "+mi+")");
			}
				
		}
		
		return num;
	}

	private boolean isValidN(int[] n) {
		int tmp = n[0];
		for (int i = 1; i < n.length; i++) {
			if(n[i] != tmp)
				return true;
			tmp = n[i];
		}
		return false;
	}

	private boolean isValidM(int[] m) {
		if(fromArray(m) < Math.pow(10,m.length-1))
			return false;
		return true;
	}

	private int[] toArray(int i) {
		int digits = (int)Math.ceil(Math.log10(i+1));
		int[] arr = new int[digits];
		
		for(int c = 1; c<=digits;c++) {
			arr[digits-c] = i % 10;
			i = i/10;
		}
		
		return arr;
	}
	
	private int fromArray(int[] arr) {
		int i = 0;
		for (int j = 0; j < arr.length; j++) {
			i = 10*i+arr[j];
		}
		return i;
	}
}
