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 org.codejam.rn;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;
import java.util.Map;


/**
 * 
 * @author juanjo
 */
public class RecycledNumbersMain {
  
  public static String newline = System.getProperty("line.separator");
  
  
  private static void generateNumbers(Map<String, String> pairs, int A, int B, int n) {
    int m;
    String s = String.valueOf(n);
    String pair = null;
    int length = s.length() - 1;
    int[] data = new int[length];
    
    for (int i = 0; i < length; i++) {
      //s = s.charAt(length) + s.substring(0, length);   
      s = new StringBuilder().append(s.charAt(length)).append(s.substring(0, length)).toString();
      data[i] = Integer.parseInt(s);
      m = Integer.parseInt(s);
      
      if ((A <= n) && (n < m) && (m<=B)) {
        pair = new StringBuilder().append(n).append("-").append(m).toString();
        if (!pairs.containsKey(pair));
          pairs.put(pair, pair);
      }
    }   
  }
  
  private static int getRecyledPairsCount(int A, int B) {
    Map<String, String> pairs = new HashMap<String, String>();    
    for (int n = A; n <= B; n++) {
      generateNumbers(pairs, A, B, n);
    }
    return pairs.size();
  }

	/**
	 * @param args
	 */
	public static void main2(String[] args) {
	  long time = System.currentTimeMillis();
	  System.out.println("getRecyledPairsCount: " + getRecyledPairsCount(100,500));
	  System.out.println("Execution time ms.: " + (System.currentTimeMillis() - time) );
	}
	
	public static void main(String[] args) {
	  long time = System.currentTimeMillis();
    if (args.length != 2) {
      System.out.println("Usage: java " + RecycledNumbersMain.class  + " inputFile outputFile");
      System.exit(0);
    }

    int count = 0;
    BufferedReader in = null;
    FileWriter out = null;
    String line = null;
    int testCasesTotal = 0;
    int testCasesCount = 0;
    String result;
    
    int A, B;
    String s[];

    try {
      in = new BufferedReader(new FileReader(args[0]));
      out = new FileWriter(args[1]);
      
      while ( (line = in.readLine()) != null) {
        count++;
        if (count == 1) {
          testCasesTotal = Integer.valueOf(line);
          System.out.println("In file number of test cases: " + testCasesTotal + ".");
        } //if
        else {
          s = line.split(" ");
          A = Integer.parseInt(s[0]);
          B = Integer.parseInt(s[1]);    
          
          result = String.valueOf(getRecyledPairsCount(A, B));
          testCasesCount++;
          result = "Case #" + testCasesCount + ": " + result;
          System.out.println(result + " -- Line: " + testCasesCount + ": " + line);
          out.write(result + newline);
        }
      }
      if (out != null) {
        out.close();
      }
    } //try
    catch (Exception e) {
      e.printStackTrace();
    }
    finally {
      System.out.println("Execution time ms.: " + (System.currentTimeMillis() - time) );
    }
  } // Main

}
