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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;

/**
 * 
 */

/**
 * @author Pandapotan Christian
 *
 */
public class RecycledNumbers {
	/*
	 * Write string to a file with specified path
	 */
	public static void writeFile(String filePath, String content){
		try{
			PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(filePath)));
			out.write(content);
			out.close();
		}
		catch(IOException e){
			e.printStackTrace();
		}
	}
	
	/*
	 * Return array that contains each lines of the input file, null if the reading process failed
	 */
	public static ArrayList<String> getLines(String filePath){
		ArrayList<String> lines = null;
		
		try{
			lines = new ArrayList<String>();
			
			String s;	    	   
		    BufferedReader in = new BufferedReader( new FileReader(filePath));
		    while ((s = in.readLine()) != null) {
		    	lines.add(s);	      
		    }	    
		    in.close();
		}catch(IOException e){
			e.printStackTrace();
		}
		
		return lines;
	}
	
	/**
	 * Replace value with the real path
	 */
	public static final String fileIn = "D:\\CodeJam\\RecycledNumbers-large.in";	
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {

		//get input from file						
		ArrayList<String> lines = getLines(fileIn);
		
		//process data
		if(lines!=null){			
			System.out.println("System Start");
			long systemStart = System.currentTimeMillis();
			
			String firstLine = lines.get(0);
			int T = Integer.parseInt(firstLine);				
					
			//Main Algorithm			
			StringBuffer result = new StringBuffer();
			for(int testIdx = 1; testIdx<=T; testIdx++){	
				System.out.println("Test Case Number: "+testIdx);
				long start = System.currentTimeMillis();    										
				
				String param[] = lines.get(testIdx).split(" ");
				int A = Integer.parseInt(param[0]);
				int B = Integer.parseInt(param[1]);							

				int total = countRecycle(A, B);
							
				long elapsedTime = System.currentTimeMillis() - start;
				System.out.println("Case #"+testIdx+" takes "+elapsedTime+"ms.");
				
				//Append the result with the previous testcase
				result.append("Case #"+testIdx+": "+ total+"\n");
			}
			
			//write the result to a file
			String fileOut = fileIn.replace(".in", ".out");
			writeFile(fileOut, result.toString());
			
			System.out.println("SUCCESS");
			long elapsedTimeSyetem = System.currentTimeMillis() - systemStart;
			System.out.println("Time Elapsed to run whole test case: "+elapsedTimeSyetem+"ms");
				
		}			
	}
	
	public static int countRecycle(int A, int B){
		int count = 0;
		for(int i = A; i<=B; i++){
			String number = i+"";
			HashMap<Integer, Boolean> checker = new HashMap<Integer, Boolean>();
			for(int charIdx = 1; charIdx<number.length(); charIdx++){
				String newNumberString = number.substring(charIdx) + number.substring(0, charIdx);
				int newNumber = Integer.parseInt(newNumberString);
				if(newNumber>i && newNumber<=B)
					checker.put(newNumber, true);			 			
			}				
			count += checker.size();
		}
		return count;
	}
}
