/*
 * 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 gcj2012;

import java.io.File;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * @author Gaurav Prabhu Gaonkar 
 * @date   Apr 13, 2012 
 *
 */
public class RecycledNumbers {

	public static void main(String[] args) {
		String inputDir = "C:\\GcjFiles\\2012\\Qualification";
		String fileName = "C-small-attempt0";
		
		File inputFile = new File(inputDir + "\\" + fileName + ".in");
		File outputFile = new File(inputDir + "\\" + fileName + ".out.txt");

		try
		{
			PrintWriter out = new PrintWriter(outputFile);			
			Scanner scanner = new Scanner(inputFile);			
			//Read the first line
			String metadata   = scanner.nextLine();
			int numOfCases = Integer.parseInt(metadata);
			//System.out.println(numOfCases);
			
			for(int i = 1; i <= numOfCases; i++)
			{
				String input = scanner.nextLine();
				//System.out.println(input);						
				String[] params = input.split(" ");
								
				int answer = solve(Integer.parseInt(params[0]), Integer.parseInt(params[1]));
				System.out.println("Case #"+i+": " + answer);
				out.println("Case #"+i+": " + answer);
			} // process next test case
			
			out.flush();
			out.close();
		}
		catch(Exception e)
		{
			System.out.println("Exception Occured: "  + e);
		}		
	}

	private static int solve(int a, int b) {
		int result = 0;
		
		if (a < 10) {
			a = 10;
		}
		
		Set<String> candidates = new HashSet<String>();		
		for (int i = a; i <= b; i++) {
			
			StringBuilder sb = new StringBuilder();
			sb.append(i).append(i);
			
			int len = sb.length()/2;
			
			String str = sb.toString();
			
			for (int j = 1; j <= len; j++) {
				candidates.add(str.substring(j,j+len));				
			}			
			for (String candidate : candidates) {
				int test = Integer.parseInt(candidate);
				if (test > i && (test >= a && test <= b)) {
					result++;
				}
			}
			candidates.clear();
		}
		
		return result;
	}
}
