/*
 * 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 programminginjava;
import java.io.*;
import java.util.*;
import java.lang.Math;

class recycledNos {
    
    int factorial(int no){
        if (no == 1 || no == 0)
            return 1;
        else return (no*factorial(no-1));
    }
    
    public static void main(String [] args) throws IOException {
        BufferedReader f = new BufferedReader(new FileReader("recycledNos.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("recycledNos.out")));
        
        recycledNos recycledNosRef = new recycledNos();
        
        int T = Integer.parseInt(f.readLine());
        
        for(int i=0; i<T; i++){
            String line = f.readLine();
            String [] lines = line.split(" ");
            int A = Integer.parseInt(lines[0]);
            int B = Integer.parseInt(lines[1]);
            
            HashMap hm = new HashMap();
            HashMap local = new HashMap();
            long totalPairs = 0;
            for(int j=A; j<=B; j++){
                int no = j;
                //System.out.print("no is : "+no);
                if(hm.containsKey(no))
                    continue;
                
                String noStr = Integer.toString(no);
                int len = noStr.length();
                
                int newPairs;
                int rem, quo, newQuo, tenPow, iterCount, firstDigit;
                tenPow = (int) Math.pow(10, len-1);
                iterCount = 1; 
                local.put(no, true);
                for(int k=0; k<len-1; k++){
                    quo = no/10; 
                    rem = no % 10;
                    newQuo = rem * tenPow;
                    //firstDigit = no/tenPow;
                    no = newQuo + quo;
                    
                    if(local.containsKey(no) || (rem==0) || no<A || no>B)
                        continue;
                    iterCount++; 
                    local.put(no, true);
                   // System.out.println(" and the iterCount is : "+iterCount);
                }
                
                long noOfCombinations = 0;
                if(iterCount > 1)
                  noOfCombinations = recycledNosRef.factorial(iterCount)/(recycledNosRef.factorial(iterCount-2)*2);
                
                hm.putAll(local);
                local.clear();
                totalPairs += noOfCombinations;
            }
            
            out.println("Case #"+(i+1)+": "+totalPairs);
            
        }
        
        out.close();
        System.exit(0);
    }
}