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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;

import javax.sound.sampled.DataLine;

public class RecycleNumber {

    /**
     * @param args
     */
    public static void main(String[] args) {
        recycleNumbers(args[0]);
//        System.out.println("No. of recycled possibilities: " + recycleNumber("128 986"));
    }

    private static void recycleNumbers(String fileName) {
        File f = new File(fileName);
        BufferedReader fin;
        try {
            fin = new BufferedReader(new InputStreamReader(new FileInputStream(f)));

            int noOfInputs = Integer.valueOf(fin.readLine());
            String[] inputs = readSamplesFromFile(noOfInputs, fin);

            BufferedWriter fout = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("/Users/asachwani/Desktop/CodeJam/Output.txt")));

            for (int i = 0; i < noOfInputs; i++) {
                System.out.println(i + 1 + " " + inputs[i]);
                fout.write("Case #" + (i + 1) + ": " + recycleNumber(inputs[i]) + "\n");
            }

            fout.flush();
        } catch (FileNotFoundException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        } catch (NumberFormatException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        } catch (IOException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }

    }

    private static int recycleNumber(String input) {
        String[] data = input.split(" ");
        int minValue = Integer.valueOf(data[0]);
        int maxValue = Integer.valueOf(data[1]);
        int noOfPossibilities = 0;

        char[] minValueChar = String.valueOf(minValue).toCharArray();

        HashSet<String> uniquePairs = new HashSet<String>();

        if (minValueChar.length > 1) {

            for (int j = 0; j < minValueChar.length - 1; j++) {
                for (int k = minValue; k < maxValue; k++) {
                    int lastDigits = k % (int) Math.pow(10, j + 1);
                    int firstDigits = k / (int) Math.pow(10, j + 1);

                    int replacement = 0;
                    if (lastDigits != firstDigits) {
                        replacement = Integer.valueOf("" + lastDigits + firstDigits);
                    }

                    if (replacement > k && replacement <= maxValue) {

                        if (!uniquePairs.contains(k + " " + replacement) || uniquePairs.contains(replacement + " " + k)) {
                            noOfPossibilities++;
                            uniquePairs.add(k + " " + replacement);
                            System.out.println(k + "  " + j + "   " + lastDigits + "   " + firstDigits + "  " + replacement);
                        }
                    }
                }
            }

        }

        return noOfPossibilities;


    }

    private static String[] readSamplesFromFile(int noOfInputs, BufferedReader fin) throws IOException {
        String[] samples = new String[noOfInputs];

        for (int i = 0; i < noOfInputs; i++) {
            samples[i] = fin.readLine();
        }

        return samples;
    }
}
