/*
 * 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.google.codejam.Qualification2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Writer;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C {
	
	public static void main(String[] args) throws IOException {
		Scanner scanner = new Scanner(new BufferedReader(new FileReader(args[0] + ".in")));
		Writer writer = new BufferedWriter(new FileWriter(args[0] + ".out"));
		
		int T = scanner.nextInt();
		Set<Integer> set = new HashSet<Integer>();

		for (int x = 1; x <= T; ++x) {
			int A = scanner.nextInt();
			int B = scanner.nextInt();
			
			int y = 0;
			if (B >= 21) {
				for (int n = A; n < B; ++n) {
					set.clear();
					int nDigits = getDigits(n);
					
					int k1 = 10;
					int k2 = 1;
					for (int i = 0; i < nDigits - 1; ++i)
						k2 *= 10;
					
					int n1 = n / k1;
					int n2 = n % k1;										
					for (int i = 0; i < nDigits - 1; ++i) {
						int m = n2 * k2 + n1;
						if (n2 != 0 && m > n && m <= B && !set.contains(m)) {
							//System.out.println(n + ": " + n2 + " " + n1);
							set.add(m);
							++y;
						}
						
						k1 *= 10;
						k2 /= 10;
						n1 = n / k1;
						n2 = n % k1;
					}
				}
			}
			
			System.out.println("Case #" + x + ": " + y);
			writer.write("Case #" + x + ": " + y + "\n");
		}
		
		writer.close();
		scanner.close();
	}
	
	static int getDigits(int n) {
		if (n == 0)
			return 1;
		
		int result = 0;
		
		while (n > 0) {
			n /= 10;
			++result;
		}		
		
		return result;
	}

}
