package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

package qualification.q3;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 * Created by IntelliJ IDEA.
 * User: ofer
 * Date: 14/04/12
 * Time: 20:31
 * To change this template use File | Settings | File Templates.
 */

public class Q3Solver {
    
    private Set<String> mapping;

    public Q3Solver(){
        mapping = new HashSet<String>();
    }
    
    public int solve(int a,int b){
        int res = 0;
        for (int i = a ; i <= b ; i++){
            res+= getNumberOfLegalRecycled(  b,  i);
        }
        return res;
    }

    private int getNumberOfLegalRecycled( int b, int num) {
        String numString = ""+num;
        int numDigits = numString.length();
        int res = 0;
        for (int i = 0 ; i < numDigits - 1 ; i++){
            String perm = numString.substring(numDigits - i - 1) + numString.substring(0,numDigits - i -1 );
            Integer newNum = Integer.parseInt(perm);
            String test = newNum+"";
            if (test.length() == numDigits){          //checks that there are no leading zeros
                if ( num != newNum  && newNum > num && newNum <= b){
                    if (!mapping.contains(newNum+","+num) && !mapping.contains(num+","+newNum))    {
                        res++;
                        mapping.add(num+ "," +newNum);
                        mapping.add(newNum +"," +num);
                    }

                }

            }
        }
    return res;
    }

}
