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 br.com.softctrl.code.c;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Reader;
import java.io.Writer;

/**
 * @author timoshenko
 * 
 */
public class CRecycledNumbers {

	private static int A = 0;
	private static int B = 0;
	private static int T = 4;
	private static int c = 0;

	private static String fileInput = "/Users/timoshenko/Development/Projects/SoftCtrl.com/eclipse-jboss/workspaces/google-code-jam/GoogleCodeJam2012/src/br/com/softctrl/in/C-large.in";
	private static String fileOutput = "/Users/timoshenko/Development/Projects/SoftCtrl.com/eclipse-jboss/workspaces/google-code-jam/GoogleCodeJam2012/src/br/com/softctrl/out/C-large_out.txt";
	private static SCFileReader scFr = null;
	private static SCFileWriter scFw = null;

	public static boolean valid(int n, int m) {
		// A ² n < m ² B
		// System.out.println(String.format("A(%d)<=n(%d)<m(%d)<=B(%d)", A, n,
		// m,
		// B));
		return (String.valueOf(n).length() == String.valueOf(m).length() ? (A <= n
				&& n < m && m <= B)
				: false);

	}

	public static void main(String[] args) {

		try {
			scFr = new SCFileReader(fileInput);
			scFw = new SCFileWriter(fileOutput);
			if (scFr.ready()) {
				T = Integer.parseInt(scFr.readLine());
				for (int z = 0; z < T; z++) {
					String[] row = scFr.readLine().split(" ");
					A = Integer.parseInt(row[0]);
					B = Integer.parseInt(row[1]);
					scFw.writeLn(String.format("Case #%d: %d", z + 1, count()));
				}
			}
			scFr.close();
			scFw.save();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}

	}

	public static int count() {
		int count = 0;
		for (int i = A; i <= B; i++) {
			String n = String.valueOf(i);
			for (int length = n.length() - 1; (length >= 1); length--) {
				String m = n.substring(length, n.length())
						+ n.substring(0, length);
				if (valid(Integer.parseInt(n), Integer.parseInt(m))) {
					count++;
				}
			}
		}
		return count;
	}
}

class SCFileReader {
	private Reader reader = null;
	private BufferedReader bufferedReader = null;
	private File file = null;

	public SCFileReader(String fileName) throws FileNotFoundException {
		file = new File(fileName);
		reader = new FileReader(file);
		bufferedReader = new BufferedReader(reader);
	}

	public boolean ready() {
		try {
			return bufferedReader.ready();
		} catch (IOException e) {
			e.printStackTrace();
			return false;
		}
	}

	public String readLine() throws IOException {
		return bufferedReader.readLine();
	}

	public void close() {
		if (this.ready()) {
			try {
				bufferedReader.close();
				reader.close();

			} catch (IOException e) {
				e.printStackTrace();
			}
			bufferedReader = null;
			reader = null;
			file = null;
		}
	}

}

class SCFileWriter {
	private Writer writer = null;
	private BufferedWriter bufferedWriter = null;
	private File file = null;

	public SCFileWriter(String fileName) throws IOException {
		file = new File(fileName);
		if (file.exists()) {
			file.delete();
		}
		writer = new FileWriter(file);
		bufferedWriter = new BufferedWriter(writer);
	}

	public void write(String row) throws IOException {
		// System.out.println(row);
		bufferedWriter.write(row);
	}

	public void writeLn(String row) throws IOException {
		System.out.println(row);
		bufferedWriter.write(row + "\n");
	}

	public void save() {
		try {
			bufferedWriter.close();
			writer.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
		bufferedWriter = null;
		writer = null;
		file = null;

	}

}
