/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
package codejam2012;

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.concurrent.TimeUnit;

public class RecycledNumbers {

	private boolean[] data;
	private int min;
	private int max;
	private int digits;
	private int mask;

	public RecycledNumbers(int min, int max) {
		this.min = min;
		this.max = max;
		digits = (int) Math.ceil(Math.log10(max));
		mask = (int) Math.pow(10, digits);
		initData();
	}

	private void initData() {
		data = new boolean[max - min + 1];
	}

	public int eval() {
		int[] result = new int[digits];
		int total = 0;
		for (int number = min; number <= max; number++) {
			if (!isTested(number)) {
				int n = getRecycleNumbers(number, result);
				int real_n = setTested(result, n);
				if (real_n > 1) {
					total += real_n * (real_n - 1) / 2;
				}
			}
		}
		return total;
	}

	private int setTested(int[] result, int n) {
		int tested = 0;
		for (int i = 0; i < n; i++) {
			if (!data[result[i] - min]) {
				data[result[i] - min] = true;
				tested++;
			}
		}
		return tested;
	}

	private int getRecycleNumbers(int number, int[] result) {
		int count = 0;
		for (int i = 0; i < digits; i++) {
			if (number >= min && number <= max) {
				result[count++] = number;
			}
			int number10 = number * 10;
			number = (number10 % mask) + (number10 / mask);
		}
		return count;
	}

	private boolean isTested(int number) {
		return data[number - min];
	}

	public static void main(String[] args) throws Exception {
		PrintWriter output = new PrintWriter("output3.txt");
		Scanner scanner = new Scanner(new File("input3.txt"));
		try {
			int input_T = scanner.nextInt();
			for (int i = 0; i < input_T; i++) {
				int input_A = scanner.nextInt();
				int input_B = scanner.nextInt();
				RecycledNumbers testing = new RecycledNumbers(input_A, input_B);
				long start = System.nanoTime();
				int eval = testing.eval();
				output.printf("Case #%d: %d\n", i + 1, eval);
				System.out
						.printf("Case #%d: %d (%d)\n",
								i + 1,
								eval,
								TimeUnit.NANOSECONDS.toMillis(System.nanoTime()
										- start));
			}
		} finally {
			output.close();
			scanner.close();
		}
	}

}
