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

//standard libraries potentially used:
//Apache commons http://http://commons.apache.org/
//Google Guava http://code.google.com/p/guava-libraries/

import java.util.ArrayList;


public class Template {

    public static void main(String[] args) {

        //test();
        //Utils.die("Done testing");

        String folder = "C:\\Users\\Paul Thomson\\Documents\\CodeJam\\RecycledNumbers\\";
        Utils.logfile = folder + "log.txt";
        String infile = folder + "data.in";
        String outfile = infile.substring(0, infile.lastIndexOf(".")) + ".out";
        ArrayList<TestCase> tcList = TestCaseIO.loadFromFile(infile);
        //ArrayList<TestCase> tcList = TestCaseIO.mockUp();

        int numThreads = 8;
        if (numThreads == 1) {
            TestCaseSolver tcSolver = new TestCaseSolver(tcList, 1);
            tcSolver.run();
        } else {
            //split into separate lists
            ArrayList<ArrayList<TestCase>> tcSubLists = new ArrayList<>();
            for (int i = 0; i < numThreads; i++) {
                tcSubLists.add(new ArrayList<TestCase>());
            }

            int i = 0;
            for (TestCase tc : tcList) {
                tcSubLists.get(i).add(tc);
                i++;
                if (i == numThreads) {
                    i = 0;
                }
            }

            //run each sublist in its own thread
            ArrayList<Thread> threadList = new ArrayList<>();
            int ref = 1;
            for (ArrayList<TestCase> tcl : tcSubLists) {
                TestCaseSolver tcs = new TestCaseSolver(tcl, ref);
                Thread h = new Thread(tcs);
                threadList.add(h);
                h.start();
                ref++;
            }

            //wait for completion
            for (Thread h : threadList) {
                try {
                    h.join();
                } catch (InterruptedException ex) {
                    Utils.die("InterruptedException waiting for threads");
                }
            }

        }

        TestCaseIO.writeSolutions(tcList, outfile);
        
        double totalTime = 0;
        for (TestCase tc : tcList) {
            totalTime += tc.getTime();
        }
        double avTime = totalTime / (double)tcList.size();
        Utils.sout("Total compute time " + String.format("%.2f", totalTime) + " secs.");
        Utils.sout("Average compute time " + String.format("%.2f", avTime) + " secs.");
        Utils.sout("Done.");
    }

    public static void test() {

    }
}
