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());
	}

}

import java.awt.datatransfer.*;
import java.awt.Toolkit;
public class Repeat
{
    private static String inp;
    public Repeat()
    {
        
    }

    public static void main(String[] args)
    {
        Transferable temp = (Toolkit.getDefaultToolkit().getSystemClipboard().getContents(null));
        try {
            inp = (String) temp.getTransferData(DataFlavor.stringFlavor);
        }
        catch (Exception e)
        {
            System.out.println(e);
        }
        System.out.println(inp);
        
        System.out.println("Breakdown >" + inp.substring(inp.indexOf("\n")));
        //int iterations = Integer.parseInt(inp.substring(inp.indexOf("\n")));
        String[] newlineSplit = inp.split("\n");
        int iterations = Integer.parseInt(newlineSplit[0]);
        System.out.println(iterations);
        System.out.println("Solutions:\n\n\n\n");
        //String cases = inp.substring(inp.indexOf("\n"));
        for(int i = 1; i < newlineSplit.length;i++)
        {
            String[] nums = newlineSplit[i].split(" ");
            
           getCount(Integer.parseInt(nums[0]) ,Integer.parseInt(nums[1]), i);
        }
    }
    
    public static void getCount(int a, int b, int caseNum)
    {
        int count = 0;
        while(a <= b)
        {
            String sA = "" + a;
            String sB = "" + b;
            //System.out.println(sA + "   " + sB);
            for(int i = 0; i < sA.length();i++)
            {
                String temp = sA.substring(sA.length() - i-1) + sA.substring(0,sA.length() - i - 1);
                int iT = Integer.parseInt(temp);
                int iA = Integer.parseInt(sA);
                
                //System.out.println(">>[" + temp + "]    " + (iT - iA) );
                if(iT - iA > 0 && iT <= b)
                {
                    count++;
                    //System.out.println(">>>>>>> " + sA + " " + temp + "    " + (iT - iA));
                } 
                //else
                    //System.out.println(">>[" + temp + "]    " + (iT - iA) );
            }
            a++;
        }
        System.out.println("Case #" + caseNum + ": " + count);
        
    }
}
