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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {

	private String inputPath;
	private String outputPath;
	private ArrayList<String> inputLines;
	private ArrayList<String> outputLines = new ArrayList<String>();
	
	public RecycledNumbers(String inputPath){
		
		try 
		{
			this.inputPath = inputPath;
			this.outputPath = inputPath.replace(".in", ".out");
			this.inputLines = openFile();
			
			findSolution();
			
			generateOutputFile();
		} 
		catch (IOException e) 
		{			
			e.printStackTrace();
		}	
	}
	
	private ArrayList<String> openFile() throws IOException
	{
		ArrayList<String> lines = new ArrayList<String>();
		FileReader fr = new FileReader(this.inputPath);
		BufferedReader br = new BufferedReader(fr);
		String zeile = null;
		
		while ((zeile = br.readLine()) != null)
		{
			lines.add(zeile);
		}
		br.close();
		
		return lines;
	}	
	
	private void generateOutputFile() throws IOException
	{
		FileWriter fw = new FileWriter(outputPath);
		PrintWriter pw = new PrintWriter(fw);
		
		for (String string : outputLines) {
			//System.out.println(string);	
			pw.println(string);
		}	
		
		pw.close();
	}
	
	private void findSolution()
	{
		
		
		for (int i=1; i<inputLines.size(); i++)
		{		
			Set<String> gefunden = new HashSet<String>();
			
			Integer m = 0;				
			String inp = inputLines.get(i);
			String outp = "Case #" + i + ": ";
			Integer A = Integer.parseInt( inp.split(" ")[0] );
			Integer B = Integer.parseInt( inp.split(" ")[1] );			
			
			for (Integer n=A; n<B; n++){					
				String N = n.toString();
				
				for (int j=1; j<N.length(); j++){
					String M = N.substring(j) + N.substring(0, j);
					if (!M.startsWith("0") && N.length() == M.length()) 
								m =  Integer.parseInt(M);					
										
					if (!M.startsWith("0") && m>n){
						if (m<=B){
							gefunden.add(n+"<->"+m);							
						}
					}					
				}
			}			
			outp += gefunden.size();
			outputLines.add(outp);
		}
	}
	
	public static void main(String[] args) {
		//new RecycledNumbers("src/recycledNumbers/sample.in");
		new RecycledNumbers("src/recycledNumbers/C-large.in");

	}
}

