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

import java.io.*;
import java.util.HashSet;

public class Qualification_C {

	private static String inFile = "C://CodeJam/QCin.txt";
	private static String outFile = "C://CodeJam/QCout.txt";
	private static BufferedWriter writer;

	public static void main(String[] args) {
		try{
			writer = new BufferedWriter(new FileWriter(outFile));
			readInput();
			writer.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	}
	
	private static void readInput(){
		try{
			FileInputStream fstream = new FileInputStream(inFile);
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			// test num
			strLine = br.readLine();
			int numTest = Integer.parseInt(strLine);
			
			for (int i = 0; i<numTest; i++){
				strLine = br.readLine();
				String[] num = strLine.split(" ");
				int a = Integer.parseInt(num[0]);
				int b = Integer.parseInt(num[1]);
				int count = 0;
				for (int j=a; j<b; j++){
					String str = Integer.toString(j);
					HashSet<Integer> list = swap(str);
					for (int x : list){
						if (x >j && x<=b){
							count ++;
						}
					}
				}
				println("Case #" + (i+1) + ": " + count);
			}
			
			//Close the input stream
			in.close();
		}catch (Exception e){
			e.printStackTrace();
		}
	}

	private static HashSet<Integer> swap(String str){
		HashSet<Integer> list = new HashSet<Integer>();
		for (int i=1; i<str.length(); i++){
			String x = str.substring(i, str.length()) + str.substring(0, i);
			list.add(Integer.parseInt(x));
		}
		return list;
	}

	public static void println(String msg) throws IOException {
		System.out.println(msg);
        writer.write(msg);
		writer.newLine();   // Write system dependent end of line.
    }
}
