/*
 * 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 qualification;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class C {
    private static abstract class Solver {
        public abstract String solveCase(String input);
    }

    public static void main(String[] args) throws IOException {
        solveTasks("C-small-attempt1", new Solver() {
            @Override
            public String solveCase(String input) {
                String[] parts = input.split(" ");
                int from = Integer.parseInt(parts[0]);
                int to = Integer.parseInt(parts[1]);
                int count = countRecycledBetween(from, to);
                return Integer.toString(count);
            }
        });
    }

    private static void solveTasks(String name, Solver bTest)
            throws FileNotFoundException, IOException {
        BufferedReader bufferedReader = new BufferedReader(new FileReader(name
                + ".in"));
        FileWriter outputWriter = new FileWriter(name + ".out");
        int inputLength = Integer.parseInt(bufferedReader.readLine());
        for (int i = 0; i < inputLength; i++) {
            String inputLine = bufferedReader.readLine();
            String output = bTest.solveCase(inputLine);
            String answer = "Case #" + (i + 1) + ": " + output;
            outputWriter.append(answer);
            outputWriter.append('\n');
            System.out.println(answer);
        }
        bufferedReader.close();
        outputWriter.close();
    }

    private static int countRecycledBetween(int a, int b) {
        int recycled = 0;
        for (int i = a; i < b; i++) {
            for (int j = i + 1; j <= b; j++) {
                if (isRecycled(i, j)) {
                    recycled++;
                }
            }
        }
        return recycled;
    }

    private static boolean isRecycled(int aInt, int bInt) {
        String aString = Integer.toString(aInt);
        String bString = Integer.toString(bInt);
        int lengthDiff = aString.length() - bString.length();
        if (lengthDiff > 0) {
            bString = appendZeroes(lengthDiff, bString);
        } else if (lengthDiff < 0) {
            aString = appendZeroes(-lengthDiff, aString);
        }
        for (int i = 1; i < aString.length(); i++) {
            String shifted = shiftString(bString, i);
            if (aString.equals(shifted)) {
                return true;
            }
        }
        return false;
    }

    private static String appendZeroes(int zeroes, String base) {
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = 0; i < zeroes; i++) {
            stringBuilder.append('0');
        }
        stringBuilder.append(base);
        return stringBuilder.toString();
    }

    private static String shiftString(String input, int steps) {
        StringBuilder builder = new StringBuilder();
        builder.append(input.substring(steps));
        builder.append(input.substring(0, steps));
        return builder.toString();
    }

    private static int[] splitDigits(int number) {
        String string = Integer.toString(number);
        int[] digits = new int[string.length()];
        for (int i = 0; i < digits.length; i++) {
            digits[i] = string.charAt(i) - '0';
        }
        return digits;
    }
}
