package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

package qualification.q3;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 * Created by IntelliJ IDEA.
 * User: ofer
 * Date: 14/04/12
 * Time: 20:31
 * To change this template use File | Settings | File Templates.
 */

public class Q3Solver {
    
    private Set<String> mapping;

    public Q3Solver(){
        mapping = new HashSet<String>();
    }
    
    public int solve(int a,int b){
        int res = 0;
        for (int i = a ; i <= b ; i++){
            res+= getNumberOfLegalRecycled(  b,  i);
        }
        return res;
    }

    private int getNumberOfLegalRecycled( int b, int num) {
        String numString = ""+num;
        int numDigits = numString.length();
        int res = 0;
        for (int i = 0 ; i < numDigits - 1 ; i++){
            String perm = numString.substring(numDigits - i - 1) + numString.substring(0,numDigits - i -1 );
            Integer newNum = Integer.parseInt(perm);
            String test = newNum+"";
            if (test.length() == numDigits){          //checks that there are no leading zeros
                if ( num != newNum  && newNum > num && newNum <= b){
                    if (!mapping.contains(newNum+","+num) && !mapping.contains(num+","+newNum))    {
                        res++;
                        mapping.add(num+ "," +newNum);
                        mapping.add(newNum +"," +num);
                    }

                }

            }
        }
    return res;
    }

}
