/*
 * 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 y2012.Qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers extends IOStream {

	public RecycledNumbers(String fileName) {
		super(fileName);
	}

	private int runThisTestCase() throws IOException {
		Set<RecycledSet> recycledPairs = new HashSet<RecycledSet>();
		String[] limits = bufferedReader.readLine().split(" ");
		long a = Long.valueOf(limits[0]);
		long b = Long.valueOf(limits[1]);
		long num = a;

		while (num <= b) {
			String numString = String.valueOf(num);
			int numDigits = numString.length();
			for (int idx = 0; idx < numDigits; idx++) {
				String recycledString = numString.substring(idx)
				+ numString.substring(0, idx);

				long recycled = Long.valueOf(recycledString);
				if (recycled >= a && recycled <= b && num != recycled) {
					RecycledSet rs = new RecycledSet(num, recycled);
					recycledPairs.add(rs);
				}
			}
			num++;
		}
		
		return recycledPairs.size();
	}

	public static void main(String[] args) throws Exception {

		RecycledNumbers obj = new RecycledNumbers("/net/10.0.0.60/Users/454083/Desktop/Moshin/CodeJam/RecycledNumbers");
		try {
			obj.getReader();
			obj.getWriter();
			int testcases = Integer.parseInt(bufferedReader.readLine().trim());
			for (int testcase = 1; testcase <= testcases; testcase++) {
				int value = obj.runThisTestCase();
				bufferedWriter.write("Case #" + testcase + ": " + value + "\n");
				System.out.println("Case #" + testcase + ": " + value);
			}
			obj.close();
		} catch (IOException e) {
			e.printStackTrace();
		}

	}

}

class RecycledSet {

	long num1;
	long num2;

	public RecycledSet(long num1, long num2) {
		if (num1 < num2) {
			this.num1 = num1;
			this.num2 = num2;
		} else {
			this.num1 = num2;
			this.num2 = num1;
		}
	}

	public int hashCode() {
		return (int) (num1 & num2);
	}

	public boolean equals(Object o) {
		if (o instanceof RecycledSet) {
			RecycledSet rs = (RecycledSet) o;
			if (this.num1 == rs.num1 && this.num2 == rs.num2) {
				return true;
			}
		}
		return false;

	}

}

class IOStream {

	static public BufferedReader bufferedReader = null;
	static public BufferedWriter bufferedWriter = null;

	String fileName = "";

	public IOStream(String fileName) {
		this.fileName = fileName;
	}

	protected void getReader() throws IOException {
		bufferedReader = new BufferedReader(new FileReader(new File(fileName
				+ ".in")));
	}

	protected void getWriter() throws IOException {
		bufferedWriter = new BufferedWriter(new FileWriter(new File(fileName
				+ ".out")));
	}

	protected void close() throws IOException {
		if (bufferedReader != null)
			bufferedReader.close();
		if (bufferedWriter != null) {
			bufferedWriter.flush();
			bufferedWriter.close();
		}
	}

	protected int[] splitString2Int(String[] words) {
		int[] ints = new int[words.length];
		int i = 0;
		for (String str : words) {
			ints[i] = Integer.parseInt(str);
			i++;
		}

		return ints;
	}
}
