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 at.jaki.codejam.qr2012.C;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class C {

	private static final String TEMPLATE = "Case #%d: %d";

	private static final String IN = "C-small-attempt0.in";
	private static final String OUT = "C-small-attempt0.out";

	private static Scanner sc;
	private static PrintWriter pw;

	public static void main(String[] args) throws FileNotFoundException {
		sc = new Scanner(new File(IN));
		pw = new PrintWriter(new File(OUT));
		int tests = sc.nextInt();
		for (int i = 1; i <= tests; i++) {
			resolve(i);
		}
		pw.flush();
		pw.close();
	}

	private static void resolve(int TT) {
		int A = sc.nextInt();
		A = Math.max(A, 10);
		int B = sc.nextInt();
		long total = 0;

		boolean[] used = new boolean[B + 1];

		for (Integer i = A; i <= B; i++) {
			if (!used[i]) {
				used[i] = true;
				List<Integer> res = turn(i.toString(), A, B);
				int n = res.size();
				total += (n * (n + 1) / 2);
				for (Integer j : res) {
					used[j] = true;
				}
			}
		}
		System.out.println(total);
		pw.println(String.format(TEMPLATE, TT, total));
	}

	private static final List<Integer> turn(String x, int min, int max) {
		StringBuilder sb = new StringBuilder(x);
		List<Integer> l = new LinkedList<Integer>();
		for (int i = 0; i < x.length() - 1; i++) {
			char ch = sb.charAt(0);
			sb.delete(0, 1);
			sb.append(ch);
			if (sb.charAt(0) != '0') {
				String string = sb.toString();
				if (!string.equals(x)) {
					Integer y = Integer.valueOf(string);
					if (y >= min && y <= max) {
						if (!l.contains(y))
							l.add(y);
					}
				}
			}
		}
		return l;
	}
}
