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

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj_c;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author kay
 */
public class Arrange {

    private int first;
    private int last;
    private BufferedReader reader;
    private StringTokenizer token;

    public void do_processing(String filename) {
        String current_line;
        int no_of_cases;
        try {
            reader = new BufferedReader(new FileReader(filename));
            FileWriter fstream = new FileWriter("G:/cl_out.txt");
            BufferedWriter out = new BufferedWriter(fstream);
            no_of_cases = Integer.parseInt(reader.readLine());

            for (int i = 1; i <= no_of_cases; i++) {
                current_line = reader.readLine();
                out.write("Case #" + i + ": ");
                out.write(String.valueOf(do_arrange(current_line)));
                //out.write(String.valueOf(3));
                //System.out.println("outputttttttttttttttt " + do_arrange(current_line));
                out.newLine();
                //Close the output stream
            }
            out.close();
            reader.close();
        } catch (Exception ex) {
            Logger.getLogger(Arrange.class.getName()).log(Level.SEVERE, null, ex);
        }
    }

    public int do_arrange(String line) {
        int output = 0, temp,temp2, tens = 1, no_of_digits = 0, new_num = 0, mod = 1, add_tens = 1;
        token = new StringTokenizer(line);
        first = Integer.parseInt(token.nextToken());
        last = Integer.parseInt(token.nextToken());
        System.out.println(first + "" +last);
        temp = first;
        while (temp > 0) {
            temp /= 10;
            no_of_digits++;
        }
        
        if (no_of_digits == 1) {
            output = 0;
        } else {
           
            for (int i = first; i <= last; i++){
                temp = i;
                tens = 1;
                add_tens = 1;
                
                for (int j = 1; j < no_of_digits; j++){
                    add_tens = 1;
                    temp = i;
                    temp2 = i;
                    temp2 /= (tens * 10);
                    temp %= (tens * 10);
                    //System.out.println(temp);
                    for (int k=1; k<=(no_of_digits - j); k++){
                        add_tens *= 10;
                    }
                    //System.out.println("add tens" + add_tens);
                    tens *=10;
                    
                    new_num = (temp * add_tens) + temp2;
                    //System.out.println("newwwwwwwww " + new_num);
                    
                    //System.out.println("iiiiiiii "+ i);
                    if((new_num >= first) && (new_num > i) && (new_num <= last)){
                     //System.out.println("adddedd outtput");
                     output++;
                     
                 }
                }
                
                 
                
            }
        }
        System.out.println("output   " + output);
        return output;
    }
}
