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

import org.apache.commons.io.FileUtils;

import java.io.File;
import java.util.ArrayList;
import java.util.List;

/**
 * Hello world!
 *
 */
public class App 
{
    public static void main( String[] args ) throws Exception
    {
        String input = FileUtils.readFileToString(new File("/Users/adilmezghouti/Documents/codejam/src/main/java/codejam/input.txt"));
        String[] arr = input.split("\\n");
        String[] split;
        int size = Integer.parseInt(arr[0]);
        App app = new App();

        List<String> lines = new ArrayList<String>();
        for(int i=1;i <= size;i++){
            split = arr[i].split(" ");
            lines.add("Case #" + i + ": " + app.permute(split[0], split[1]));
        }

        FileUtils.writeLines(new File("output.txt"), lines);


    }

    public int permute(String a, String b){
        if(a.length() <= 1) return 0;

        int counter = 0;
        int floor = Integer.parseInt(a);
        int ceil = Integer.parseInt(b);
        int buffer = floor;

        while(buffer < ceil){
            String str = String.valueOf(buffer);
            for(int i=0;i < str.length() - 1;i++){
                try {
                    int result = Integer.parseInt(str.substring(str.length() - 1 - i,str.length()) + str.substring(0,str.length() - i - 1));
                    if( result > buffer && result <= ceil) {
                        counter++;
                        //System.out.println(buffer + "  " + result + "  " + counter);
                    }
                }catch(Throwable t){
                    System.out.println(buffer);
                }
            }
            buffer++;
        }
        return counter;
    }
}


