/*
 * 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 org.weiwei.recyclenumber;

import java.util.Date;
import java.util.HashSet;
import java.util.Set;

/**
 * Created with IntelliJ IDEA.
 * User: ding
 * Date: 12-4-14
 * Time: ä¸å1:03
 * To change this template use File | Settings | File Templates.
 */
public class RecyleBin {
    int lower;
    int higher;
    Set<Integer> retSet = new HashSet<Integer>();
    int length;

    public RecyleBin(int lower, int higher) {
        this.lower = lower;
        this.higher = higher;
        this.length = String.valueOf(lower).length();
    }

    public int exhaust(int i){
        int ret = 0;
        retSet.clear();
        if(length ==1 )
            return 0;
        else{
            for(int j = 1; j < length+1; j++){
                int temp = i/(int)Math.pow(10,j)+i%(int)Math.pow(10,j)*(int)Math.pow(10,length - j);
                if(temp >= (10^length)  && temp < i && temp >= lower && !retSet.contains(temp)){
                    ret++;
                    retSet.add(temp);
                }
            }
        }
        return ret;
    }

    public int exhaust(){
        int ret = 0;
        for(int i = higher; i >= lower; i--){
            ret+=exhaust(i);
        }
        return ret;
    }

    public static void main(String[] args) {
        System.out.println(new Date(System.currentTimeMillis()));
        RecyleBin bin = new RecyleBin(1111, 2222);
        System.out.println(bin.exhaust());
    }
}
