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

import java.util.Map;
import java.util.Map.Entry;

public class Join {

	// TODO: write a join-of-joins (2D join) that joins lists-of-lists without the complexity of using a lambda. 
	
	public static <T> String join(Iterable<T> list, String delim) {
		if (list == null)
			return null;
		StringBuilder buf = new StringBuilder();
		int idx = 0;
		for (T item : list) {
			if (idx++ > 0)
				buf.append(delim);
			buf.append(item.toString());
		}
		return buf.toString();
	}

	public static <T> String join(Iterable<T> list, String delim, Lambda<T, String> customToString) {
		if (list == null)
			return null;
		StringBuilder buf = new StringBuilder();
		int idx = 0;
		for (T item : list) {
			if (idx++ > 0)
				buf.append(delim);
			buf.append(customToString.apply(item));
		}
		return buf.toString();
	}

	public static <T> String join(T[] array, String delim) {
		if (array == null)
			return null;
		StringBuilder buf = new StringBuilder();
		for (int i = 0, n = array.length; i < n; i++) {
			if (i > 0)
				buf.append(delim);
			buf.append(array[i].toString());
		}
		return buf.toString();
	}

	public static <T> String join(int[] array, String delim) {
		if (array == null)
			return null;
		StringBuilder buf = new StringBuilder();
		for (int i = 0, n = array.length; i < n; i++) {
			if (i > 0)
				buf.append(delim);
			buf.append(array[i]);
		}
		return buf.toString();
	}

	public static <T> String join(float[] array, String delim) {
		if (array == null)
			return null;
		StringBuilder buf = new StringBuilder();
		for (int i = 0, n = array.length; i < n; i++) {
			if (i > 0)
				buf.append(delim);
			buf.append(array[i]);
		}
		return buf.toString();
	}

	public static <T> String join(double[] array, String delim) {
		if (array == null)
			return null;
		StringBuilder buf = new StringBuilder();
		for (int i = 0, n = array.length; i < n; i++) {
			if (i > 0)
				buf.append(delim);
			buf.append(array[i]);
		}
		return buf.toString();
	}

	public static <T> String join(char[] array, String delim) {
		if (array == null)
			return null;
		StringBuilder buf = new StringBuilder();
		for (int i = 0, n = array.length; i < n; i++) {
			if (i > 0)
				buf.append(delim);
			buf.append(array[i]);
		}
		return buf.toString();
	}

	public static <T> String join(Iterable<T> list) {
		return join(list, "");
	}

	public static <T> String join(T[] array) {
		return join(array, "");
	}

	public static <T> String join(Iterable<T> list, String delim, String prefix, String suffix) {
		return prefix + join(list, "") + suffix;
	}

	public static <T> String join(T[] array, String prefix, String suffix) {
		return prefix + join(array, "") + suffix;
	}

	/** Recursively join an Iterable that may optionally consist of Iterables.  If the items within the Iterable are of type Entry, they are joined as "key : value".  If value is an Iterable, it is recursed upon. */ 
	@SuppressWarnings("rawtypes")
	public static String joinRecursive(Iterable iterable, String delim, String prefix, String suffix) {
		if (iterable == null)
			return null;
		StringBuilder buf = new StringBuilder();
		buf.append(prefix);
		int idx = 0;
		for (Object item : iterable) {
			if (idx++ > 0)
				buf.append(delim);
			if (item instanceof Iterable) {
				buf.append(joinRecursive((Iterable) item, delim, prefix, suffix));
			} else if (item instanceof Entry) {
				Entry ent = (Entry) item;
				buf.append(ent.getKey().toString());
				buf.append(" : ");
				Object val = ent.getValue();
				if (val instanceof Iterable)
					buf.append(joinRecursive((Iterable) val, delim, prefix, suffix));
				else
					buf.append(val.toString());
			} else {
				buf.append(item.toString());
			}
		}
		buf.append(suffix);
		return buf.toString();
	}

	/** Join a map and recursively join values in the map */
	public static <K, V> String joinRecursive(Map<K, V> map, String delim, String prefix, String suffix) {
		return joinRecursive(map.entrySet(), delim, prefix, suffix);
	}
}
