/*
 * 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 com.example;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class ProblemCSolver {

	private static boolean debug = false;

	private static List<TestCase> testCases;

	public static void main(String[] args) throws NumberFormatException,
			IOException {
		loadCase(new File(args[0]));
		for (int i = 0; i < testCases.size(); i++) {
			Solve(testCases.get(i));
		}
	}

	private static void Debug(String s) {
		if (debug) {
			System.out.println(s);
		}
	}

	private static class TestCase {
		int caseNo;

		// Test specific properties
		int A;
		int B;

		public TestCase(int caseNo, int A, int B) {
			super();
			this.caseNo = caseNo;
			this.A = A;
			this.B = B;
		}

		@Override
		public String toString() {
			return "TestCase [caseNo=" + caseNo + ", A=" + A + ", B=" + B + "]";
		}
	}

	private static void loadCase(File inputFile) throws NumberFormatException,
			IOException {
		BufferedReader r = null;

		try {
			r = new BufferedReader(new FileReader(inputFile));

			// Problem specific loading routine

			int count = Integer.parseInt(r.readLine());

			testCases = new ArrayList<TestCase>(count);

			for (int i = 1; i <= count; i++) {
				String line = r.readLine();
				StringTokenizer token = new StringTokenizer(line);

				TestCase thisCase = new TestCase(i, Integer.parseInt(token
						.nextToken()), Integer.parseInt(token.nextToken()));
				testCases.add(thisCase);

			}
		} finally {
			if (r != null) {
				r.close();
			}
		}
	}

	private static void Solve(TestCase t) {
		Debug("Solving:" + t);

		String res = null;
		// TODO: implement the test

		int count = 0;
		for (int i = t.A; i < t.B; i++) {
			for (int j = i + 1; j <= t.B; j++) {
				if (isRecycled(i, j)) {
					count++;
				}
			}
		}

		res = "" + count;

		// Standard output format
		System.out.printf("Case #%d: %s%n", t.caseNo, res);
	}

	private static boolean isRecycled(int A, int B) {
		String aString = String.valueOf(A);
		String bString = String.valueOf(B);

		for (int i = 1; i < aString.length(); i++) {
			if ((aString.substring(i) + aString.substring(0, i))
					.equals(bString)) {
				return true;
			}
		}
		return false;
	}
}
