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

import java.util.Arrays;
import java.util.Scanner;

public class CJ2012QualiCRecycled
{

	static int len(int n)
	{
		int c = 1;
		while ((n = n/10) > 0) c++;
		return c;
	}
	
	static boolean checkDigits(int a, int b)
	{
		if (len(a) != len(b)) return false;
		
		String sa = Integer.toString(a);
		String sb = Integer.toString(b);
		
		char []ca = sa.toCharArray();
		char []cb = sb.toCharArray();
		
		Arrays.sort(ca);
		Arrays.sort(cb);
		int len = ca.length;

		for(int i = 0; i < len; i++)
		  if(cb[i] != ca[i])
		    return false;

		return true;
		/*
		for (int i=0; i<sa.length();++i)
		{
			if (!sb.contains( sa.substring(i,i+1)  )) return false;
			if (!sa.contains( sb.substring(i,i+1)  )) return false;
		}
		
		return true;
		*/
	}
	
	static boolean permut(int a, int b)
	{
		String sa = ""+a;
		String sb = ""+b;
		
		for (int x = 1; x<sa.length()+1; x++)
		{
			String part1 = sa.substring(0, x);
			String part2 = sa.substring(x, sa.length());
			
			String n = part2+part1;
			if (n.equals(sb)) return true;
		}
		return false;
	}
	
	public static void main(String[] args)
	{
		final Scanner in = new Scanner(System.in);
		final int T = in.nextInt();
		for (int t = 0; t < T; t++)
		{
			int A = in.nextInt();
			int B = in.nextInt();			
			int x = 0;
			
			for (int i=A; i<B;++i) 
			{
				for (int j=i+1; j<=B;++j) 
				{
					if (checkDigits(i, j))
					{
						if (permut(i, j))
						{
							x++;
						}
					}
				}
			}
			

			System.out.format("Case #%d: %d\n", (t+1), x );
		}
	}

}
