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 com.vp.impl;

import java.util.HashSet;
import java.util.Set;

import com.vp.iface.Problem;

public class RecycledNumbers implements Problem {

	private static int iUpperLimit;
	private static int iLowerLimit;	
	private static int[] iVisited;

	private static Set <String> removeDuplicates;
	@Override
	public String solve(String[] dataset) {
		String strReturnValue ="";
		String strRecycledNos = dataset[0];
		String strRecycledNosArr[] = strRecycledNos.split(" ");
		
		
		iLowerLimit = Integer.parseInt(strRecycledNosArr[0]);
		iUpperLimit = Integer.parseInt(strRecycledNosArr[1]);
		iVisited = new int[iUpperLimit+1];		
		removeDuplicates = new HashSet<String>();
		
		for(int i=iLowerLimit;i<=iUpperLimit;i++)
		{
			if(iVisited[i] == 0 && i > 9)
			{
				 findMatchingNumbers(i);
			}
		}
		System.out.println("Output : " +removeDuplicates.size());
		
		 return strReturnValue + removeDuplicates.size();
	}
	
	private void findMatchingNumbers(int iVar)
	{
		String strVar = ""+iVar;
		for(int i=1; i < (strVar.length());i++)
		{
			String strSuffix = strVar.substring(0,strVar.length() -i);
			String strPrefix = strVar.substring(strVar.length() -i,strVar.length());
		
			int iNewNo = Integer.parseInt(strPrefix + strSuffix);
			
			if (iNewNo >= iLowerLimit && iNewNo <= iUpperLimit && iVar != iNewNo && iVisited[iNewNo] ==0 )
			{
				removeDuplicates.add(iVar + " : " + iNewNo);				
				iVisited[iVar] = 1;
			}
			
		}
	}
}
