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.*;
import java.util.ArrayList;
import java.util.HashSet;

public class recycled {
    public static void main(String[] args) {
	String filename = args[0];
	ArrayList<String> input = new ArrayList<String>();
	ArrayList<String> output = new ArrayList<String>();
	try {
	    BufferedReader br = new BufferedReader(new FileReader(filename));
	    while (true) {
		String line = br.readLine();
		if (line == null) break;
		input.add(line);
	    }
	    br.close();
	    input.remove(0);
	} catch (IOException e) {
	    System.out.println("Input error. Try a different filename.");
	}
	for (String line: input) {
	    String out = ""+checkCondition(line);
	    System.out.println(out);
	    output.add(out);
	}
	try {
	    PrintWriter pr = new PrintWriter(new FileWriter("output.txt"));
	    for (int i = 0;i < output.size();i++) {
		String line = output.get(i);
		pr.println("Case #" + (i+1) + ": " + line);
	    }
	    pr.close();
	} catch (IOException e) {
	    System.out.println("Output error. Hmph.");
	}
	System.out.println("Process complete.");
    }
    private static int checkCondition(String line) {
	String[] numString = line.split(" ");
	int a = Integer.parseInt(numString[0]);
	int b = Integer.parseInt(numString[1]);
	int recycled = 0;
	/*
	for (int n = a;n <= b;n++) {
	    String N = ""+n;
	    for (int m = n+1;m <= b;m++) {
		String M = ""+m;
		if (areRecycled(M,N)) {
		    recycled++;
		    //System.out.println(M + " " + N);
		}
	    }
	}*/
	for (int n = a;n <= b;n++) {
	    String N = ""+n;
	    HashSet<Integer> perms = new HashSet<Integer>();
	    for (int i = 1;i < N.length();i++) {
		N = permute(N);
		int m = Integer.parseInt(N);
		if (n < m && m <= b) {
		    //recycled++;
		    //System.out.println("" + n + " " + m);
		    perms.add(m);
		}
	    }
	    recycled += perms.size();
	}
	return recycled;
    }
    private static boolean areRecycled(String M,String N) {
	String n = N;
	for (int i = 1;i < N.length();i++) {
	    n = permute(n);
	    if (M.equals(n)) {
		return true;
	    }
	}
	return false;
    }
    private static String permute(String n) {
	char q = n.charAt(0);
	return n.substring(1) + q;
    }
}
