/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

package jam.qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader("file.in"));
			BufferedWriter out = new BufferedWriter(new FileWriter("file.out"));
			int n = Integer.parseInt(in.readLine());
			for (int i = 1; i <= n; ++i) {
				String[] ints = in.readLine().split(" ");
				char[] A = ints[0].toCharArray();
				char[] B = ints[1].toCharArray();
				
				int c = 0;
				try {
					c = count(A, B);
				}
				catch (Exception e) {
					System.err.println("Unexpected exception, I made a mistake...");
					e.printStackTrace();
					System.exit(1);
				}
				out.write("Case #" + i + ": " + c);
				if (i != n)
					out.newLine();
				out.flush();
			}
			out.close();
		}
		catch (Exception e) {
			System.err.println("Error occured while reading input!");
			e.printStackTrace();
			System.exit(1);
		}
	}
	
	private static int count(char[] A, char[] B) {
		char[][] buff = new char[A.length][A.length];
		int count = 0, ptr;
		do {
			ptr = 0;
			for (int n = 1; n < A.length; ++n) {
				swap(A, buff[ptr], n);
				if (compare(buff[ptr], A) > 0 && compare(buff[ptr], B) <= 0) {
					for (int i = 0; i < ptr; ++i)
						if (compare(buff[i], buff[ptr]) == 0) {
							--count;
							--ptr;
							break;
						}
					++count;
					++ptr;
				}
			}
			if (compare(A, B) >= 0)
				break;
			inc(A);
		} while (true);
		return count;
	}
	
	private static void swap(char[] src, char[] dst, int n) {
		System.arraycopy(src, 0, dst, n, src.length - n);
		System.arraycopy(src, src.length - n, dst, 0, n);
	}
	
	private static void inc(char[] N) {
		int i = N.length;
		while (N[--i] == '9')
			N[i] = '0';
		++N[i];
	}
	
	private static int compare(char[] X, char[] Y) {
		for (int i = 0; i < X.length; ++i)
			if (X[i] < Y[i])
				return -1;
			else if (X[i] > Y[i])
				return 1;
		return 0;
	}
}
