package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

package com.google.codejam.p3;

import java.awt.Point;
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Problem3 {

	ArrayList<Point> cases = new ArrayList<Point>();

	public void loadInput() {
		try{
			FileInputStream fstream = new FileInputStream("input3.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine = br.readLine(); //read number of lines
			while ((strLine = br.readLine()) != null) {
				String[] info = strLine.split(" ");
				int A = Integer.parseInt(info[0]);
				int B = Integer.parseInt(info[1]);
				cases.add(new Point(A,B));
			}
			in.close();
		}
		catch (Exception e) { }
	}
	
	public static boolean isRecycled(int a, int b) {

		String s1 = Integer.toString(a);
		String s2 = Integer.toString(b);
		for (int i=0; i<s1.length(); i++) {
			String tmpS = s2.substring(0, s2.length()-1); 
			char lastC = s2.charAt(s2.length()-1);
			s2 = lastC + tmpS;
			if (s2.equals(s1))
				return true;
		}
		return false;
	}
	
	public void getOutput() {
		for (int x=0; x<cases.size(); x++) {
			int A = cases.get(x).x;
			int B = cases.get(x).y;
			int total = 0;
			for (int i=A; i<B; i++) 
				for (int j=i+1; j<=B; j++)
					if (isRecycled(i, j))
						total++;
			System.out.println("Case #" + (x+1) + ": " + total);
		}
	}
	
	
	public static void main(String[] args) {
		Problem3 p = new Problem3();
		p.loadInput();
		p.getOutput();
	}

}
