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.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.Hashtable;
import java.util.Arrays;

import com.sun.xml.internal.bind.v2.runtime.unmarshaller.IntArrayData;



public class Recycler {
	
	private static int transpose(int num, int numDigits) { 
		//System.out.println("Input number " + num);
		//System.out.println("Number digits to be transposed " + numDigits);
		String inputString = Integer.toString(num);
		String truncatedString1 = inputString.substring(0,inputString.length()-numDigits);
		//System.out.println("Truncated String1 " + truncatedString1);
		String truncatedString2 = inputString.substring(inputString.length()-numDigits);
		//System.out.println("Truncated String2 " + truncatedString2);
		//System.out.println("Output string " +  truncatedString2 + truncatedString1);
		return Integer.valueOf(truncatedString2 + truncatedString1);
		
	}

	public static void main(String[] args) throws IOException{
		
		/* transpose(3234,2);
		transpose(323423242,5);
		transpose(100,1); */
		
 		 if (args.length != 1) {
			System.out.println("Error: incorrect number of arguments.");
			System.out.println("Usage: Recycler <input-filename>");
		} else {
			BufferedReader inputStream = null;
			try {
				 inputStream = new BufferedReader(new FileReader(args[0]));
				 int totalCases = Integer.valueOf(inputStream.readLine()).intValue();
				 //System.out.println("Total number of cases is: "+totalCases);
				 for (int i=0;i<totalCases;i++) {
					System.out.print("Case #"+(i+1)+": ");
					String numbersLine = inputStream.readLine();
					//System.out.println("Numbers line is: "+numbersLine);
					String[] theNumbers = numbersLine.split(" ");
					int lower = Integer.valueOf(theNumbers[0]);
					int higher = Integer.valueOf(theNumbers[1]);
					//System.out.println("Lower number is " +  theNumbers[0]);
					//System.out.println("Higher number is " +  theNumbers[1]);
					int numDigits = Integer.toString(lower).length();
					int output=0;
					Set<String> done = new HashSet<String>();
					for (int l=1;l<numDigits;l++) {
						//each iteration transposes l digits
						for (int k=lower;k<=higher;k++) {
							//System.out.println("Number is " + k);
							//k is the number under consideration;
							
							int otherNumber = transpose(k,l);
							//System.out.println("Other number is " + otherNumber);
							if ((otherNumber>k) &&
								(otherNumber<=higher) &&
								Integer.toString(k).length() == Integer.toString(otherNumber).length() &&
								!done.contains(String.valueOf(new Integer(k)) + String.valueOf(new Integer(otherNumber)))
								) {
								//System.out.println(k+" "+ otherNumber + " Incrementing");
									output++;
									done.add(String.valueOf(new Integer(k)) + String.valueOf(new Integer(otherNumber)));
								}
						}

					}
					System.out.println(output);
				}
			} catch (IOException e) {
				System.out.println("Error in reading file");
			} finally {
				if (inputStream != null) {
					inputStream.close();
				}
			}
		}  
	} 
}