/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

package codejam2012;

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

public class ProblemC {
    
    public static void main(String[] args) throws FileNotFoundException, IOException {
        int T, n, A, B, recycle, lastN = 0, lastM = 1;
        
        ProblemC c = new ProblemC();
        
        Scanner sc = new Scanner(new FileReader("C-small-attempt3.in.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("outputPC.txt"));
        
        T = sc.nextInt();
        
        for(int i = 0; i < T; i++){
            
            A = sc.nextInt();
            B = sc.nextInt();
            recycle = 0;
            
            for(n = A; n < B; n++){
            
                int digits = Integer.toString(n).length();

                if(digits > 1){
                    
                    char[] num = new char[digits];
                    
                    for(int j = 0; j < digits; j++){
                        
                        num[j] = Integer.toString(n).charAt(j);
                        
                    }
                    
                    for(int j = 0; j < digits - 1; j++){
                        
                        c.rotateNum(num);
                        
                        if(Integer.parseInt(c.charToString(num)) <= B && Integer.parseInt(c.charToString(num)) > n){
                            
                            if(lastN == n && lastM == Integer.parseInt(c.charToString(num))){
                                recycle--;
                            }
                            
                            lastN = n;
                            lastM = Integer.parseInt(c.charToString(num));
                            
                            recycle++;
                            
                        }
                    }
                }
                
            }
            
            
            pw.print("Case #" + (i + 1) + ": ");
            pw.println(recycle);

        }
        
        pw.flush();
        pw.close();
        sc.close();
        
    }
    
    public String charToString(char[] c){
        String result = "";
        
        for(int i = 0; i < c.length; i++){
            result += c[i];
        }
        
        return result;
    }
    
    public void rotateNum(char[] c){
        char aux = c[c.length - 1];
        
        for(int i = c.length - 1; i > 0; i--){
            c[i] = c[i - 1];
        }
        
        c[0] = aux;
    }
    
}
