/*
 * 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();

    }

}

import java.util.*;
import java.io.*;

public class Recycler{

	//Vector<int> possibilities = new Vector<int>(0,0);
	private static int[] slider;
	private static String numString;
	private static int rotCounter;
	private static int pairCount;
	private static String elements, toPrint;
	private static int testNum;
	private static Stack stack = new Stack();
	
	
	
	public static void main(String args[]){
		int testCounter = 1;
		System.out.println("working .....");
		try{
		BufferedReader bf = new BufferedReader(new FileReader(args[0]));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("output.out")), true);
		testNum = Integer.parseInt(bf.readLine());
		while((elements=bf.readLine()) != null){
		pairCount = 0;
		int end = Integer.parseInt(elements.split(" ")[1]);
		int start = Integer.parseInt(elements.split(" ")[0]);
		
		START : for (int i = start; i<=end;i++){
			if(Integer.toString(i).length() < 2) continue;
			for(int j=i+1; j<=end; j++){
				stackDigits(j);
				if(stack.search(i%10) == -1){
					stack = new Stack();
					continue;
				}else{
					//System.out.println(i+" "+j+" - "+stack.search(i%10));
					stack = new Stack();
				}
				
				for(int a : rotations(j)){
					if(a == i) pairCount++; //System.out.println("We've got a pair heuston "+i+" "+j);
					}
				
			}
		}
		toPrint = "Case #"+testCounter+": "+pairCount;
		pw.println(toPrint);
		testCounter++;
		}
		}catch(Exception e){
			e.printStackTrace();
		}
		System.out.println("Done!");
	}
	
	private static void stackDigits(int num){
		if(num/10 > 0) stackDigits(num/10);
		stack.push(num%10);
	}
	private static int[] rotations(int num){
		//possibilities.clear();
		numString = Integer.toString(num);
		rotCounter = 0;
		slider = new int[numString.length()];
		
		numString = numString.charAt(numString.length()-1)+numString.substring(0, numString.length()-1);
		slider[rotCounter] = Integer.parseInt(numString);
		
		while(num != slider[rotCounter]){
			rotCounter++;
			numString = numString.charAt(numString.length()-1)+numString.substring(0, numString.length()-1);
			slider[rotCounter] = Integer.parseInt(numString);
		}
		
		return slider;
	}

}