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.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Recycled_Numbers {
	public static int recycled(int A, int B) {
		int n = 0, j = 0, m = 0, c = 0;
		String tmp = "", subB = "", subE = "", recycled = "";
		for (n = A; n <= B; n++) {
			// System.out.println("");
			tmp = String.valueOf(n);
			for (j = 0; j < tmp.length(); j++) {
				subB = tmp.substring(0, j + 1);
				subE = tmp.substring(j + 1);
				recycled = subE + subB;
				m = Integer.parseInt(recycled);
				if ((m > n) && (m <= B)) {
					c++;
					//System.out.println(n+","+m);
				}
				// System.out.println(recycled);
			}
		}
		return c;
	}

	public static void main(String[] args) {
		String filename = "/myown/developpement/Google_Code_Jam/recycled_numbers.in";
		String ligne = "";
		StringTokenizer st1;
		int i = 0, j = 0;
		int nbrLigne = 0;
		String tmp = "";
		int A = 0, B = 0;
		try {
			FileInputStream fStream = new FileInputStream(filename);
			BufferedReader in = new BufferedReader(new InputStreamReader(
					fStream));
			if (in.ready()) {
				ligne = in.readLine();
				nbrLigne = Integer.parseInt(ligne);
				for (j = 0; j < nbrLigne; j++) {
					ligne = in.readLine();

					st1 = new StringTokenizer(ligne, " ");
					A = Integer.parseInt(st1.nextToken());
					// tmp = "";
					B = Integer.parseInt(st1.nextToken());
					//System.out.println(A + "," + B);
					System.out.println("Case #"+(j+1)+": " + recycled(A, B));
				}
			}
		} catch (IOException e) {
			System.out.println("File input error");
		}
	}
}
