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 com.paupicas.year2012.codejam.qr;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class C {

	public static void main(String[] args) throws Exception {
		String filename = "C-large";
		BufferedReader inputFile = new BufferedReader(new FileReader(filename + ".in"));
		FileWriter outputFile = new FileWriter(filename + ".out");

		int casesNumber = Integer.valueOf(inputFile.readLine());
		for (int cn = 1; cn <= casesNumber; cn++) {
			String result = "Case #" + cn + ": ";

			String[] tn = inputFile.readLine().split(" ");
			int a = Integer.valueOf(tn[0]);
			int b = Integer.valueOf(tn[1]);

			HashMap<String, Boolean> counted = new HashMap<String, Boolean>(b - a);

			int c = 0;
			for (int i = a; i <= b; i++) {
				String is = String.valueOf(i);
				for (int j = 1; j < is.length(); j++) {
					String ps = is.substring(j, is.length()) + is.substring(0, j);
					String pair = is + "," + ps;
					int p = Integer.valueOf(ps);
					if (p > i && p <= b && !counted.containsKey(pair)) {
						c++;
						counted.put(pair, true);
					}
				}
			}

			result = result + c;

			System.out.println(result);
			outputFile.write(result);
			if (cn < casesNumber) {
				outputFile.write("\n");
			}
		}

		inputFile.close();
		outputFile.close();
	}

}
