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

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;


public class RN {
	public static void main(String[] args) throws Exception 
	{
		new RN().run();
	}
	
	void run() throws Exception 
	{	
		Scanner sc = new Scanner(new FileReader("C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("CSmall.out"));
		
		int ntest = sc.nextInt();
		sc.nextLine();
	
		for(int test=1;test<=ntest;++test) 
		{
			String s = sc.nextLine();			
			String ss[] = s.split(" ");			
			int min = Integer.parseInt(ss[0]);
			int max = Integer.parseInt(ss[1]);	
			int count = num(min);	
			int cres = 1;
			int r = 0;
			String sres = "";
			int flag[] = new int[2000000];			
			for(int i=min;i<=max;i++){
				for(int j = 1; j<count;j++){	
					if(flag[i]==0){							
						sres = reverse(String.valueOf(i),j);	
						if(flag[Integer.parseInt(sres)]!=1 && Integer.parseInt(sres)!=i && min<=Integer.parseInt(sres) && Integer.parseInt(sres)<=max){							
							flag[Integer.parseInt(sres)] = 1;
							cres++;	
						}	
					}
				}
				flag[i]=1;
				r += cres*(cres-1)/2;
				cres = 1;
			}
			pw.print("Case #" + test + ": " + r);			
			pw.println();	
		}
		pw.close();
		sc.close();	
	}
	
	public String reverse(String s, int i){
		String s0 = s.substring(0,i);
		String s1 = s.substring(i,s.length());
		StringBuilder sb0 = new StringBuilder(s0);
		StringBuilder sb1 = new StringBuilder(s1);
		StringBuilder res = new StringBuilder((sb0.reverse().toString()+sb1.reverse().toString()));
		return res.reverse().toString();
	}
	
	public int num(int a){
		int count = 1;
		while(a/10!=0){
			a = a/10;
			count++;
		}
		return count;
	}
	
}
