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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;

public class Jam3 {

    public static void main(String[] args) throws Exception {

        BufferedReader reader = new BufferedReader(new FileReader("C:/jam/input.txt"));
        BufferedWriter writer = new BufferedWriter(new FileWriter("C:/jam/output.txt"));
        int pow[] = new int[]{
            1,
            10,
            100, 
            1000,
            10000,
            100000,
            1000000,
            10000000,
            100000000,
            1000000000};
        int nr = new Integer(reader.readLine());
        
        for (int i = 0; i < nr; i++) {
            Set<String> set = new HashSet<String>();
          //  System.out.println("------------  ");
            String in = reader.readLine();
            int A = Integer.parseInt(in.split(" ")[0]);
            int B = Integer.parseInt(in.split(" ")[1]);
            //System.out.println("A = " + A);
            //System.out.println("B = " + B);
            int cyfr = 1+ (int) Math.log10(A);
            //System.out.println("cyfr = " + cyfr);
            int out = 0;
            for(int j = A; j<=B; j++){
               // System.out.println("j = " + j);
                for(int k =1 ; k<cyfr; k++){                    
                    int start = j / pow[k];
                    int end = j % pow[k];
                   // System.out.println("" + start + "||"+end);
                    int nowa = end * pow[cyfr - k] + start;
                   // System.out.println(k+ " nowa = " + nowa);
                    if((nowa < j )&&(nowa >=A) && (nowa <=B) ){
                        set.add(""+nowa+"_"+j);
                    }
                }
                
            }
            
            System.out.println("Case #"+(i+1)+": "+set.size());
           
            writer.write("Case #"+(i+1)+": "+set.size());
            writer.newLine();
                    
        }
        writer.close();
    }
}
