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

import java.io.File;
import java.io.IOException;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;

import javax.swing.JFileChooser;
import javax.swing.filechooser.FileNameExtensionFilter;

import com.google.common.base.Charsets;
import com.google.common.base.Splitter;
import com.google.common.io.Files;

public class Recycle2 {
	public static void main(String[] args) throws IOException{
		final JFileChooser fc = new JFileChooser(new File("C:\\Users\\munsey\\Documents\\jam"));
		FileNameExtensionFilter filter = new FileNameExtensionFilter("txt", "txt");
		fc.setFileFilter(filter);
		int returnVal = fc.showOpenDialog(null);
		if (returnVal == JFileChooser.APPROVE_OPTION) {
			File file = fc.getSelectedFile();
			List<String> lines = Files.readLines(file, Charsets.UTF_8);
			Iterator<String> itr = lines.iterator();
			itr.next();
			int caseNum = 0;
			while(itr.hasNext()) {
				caseNum++;
				Iterator<String> minMax = Splitter.on(" ").split(itr.next()).iterator();

				int min = Integer.parseInt(minMax.next());
				int max = Integer.parseInt(minMax.next());
				
				int size = 0;
				for(int k = min; k <= max ; k++){
					size += recycle(k, min, max);
				}
				System.out.println("Case #" + caseNum + ": " + (size/2));
			}
		}
	}
	
	public static int recycle(int input, int min, int max){
		Set<Integer> output = new HashSet<Integer>();
		String sInput = Integer.valueOf(input).toString();
		StringBuffer build;
		for(int i = 0; i < sInput.length(); i++){
			build = new StringBuffer();
			for(int j = 0; j < sInput.length(); j++){
				build.append(sInput.charAt((i + j) % sInput.length()));
			}
			if(build.charAt(0) != 0 && !build.toString().equals(sInput)){
				int x = Integer.parseInt(build.toString());
				if(x >= min && x <= max){
					output.add(x);
				}
			}
		}
		return output.size();
	}
}
