import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

package com.google.codejam.recycle;

import java.util.List;

/**
 * Created by IntelliJ IDEA.
 * User: sushant
 * Date: 14 Apr, 2012
 * Time: 11:13:34 AM
 * To change this template use File | Settings | File Templates.
 */
public class RecycledNumbers {
    /**
     * Main method from where application start execution.
     *
     * @param args String []
     */
    public static void main(final String[] args) {
        if (args.length != 1)  {
            System.out.println("Problem with the command used for execution");
            System.out.println("Usage: java com.google.codejam.googlerese.RecycledNmbers <Path to input file>");
            System.exit(1);
        }

        final List<TestCase> testCases = InputReader.prepareTestCases(args[0]);
        if (testCases != null && testCases.size() != 0)  {
            long startTime = System.currentTimeMillis();
            System.out.println("Test Cases execution start time " + startTime);
            for (TestCase testcase : testCases) {
                executeTestCase(testcase);
            }
            OutputRecorder.generateTestReport(testCases, args[0] + ".out");
            long endTime = System.currentTimeMillis();
            System.out.print("Test cases execution end time " + endTime);
            System.out.println("Total Execution Time " + (endTime - startTime) + " milliseconds");
        }

    }

    /**
     * Method to execute test cases.
     *
     * @param testcase     TestCase
     */
    private static void executeTestCase(final TestCase testcase) {
        int recycleNumberCount = 0;
        final int low = testcase.getLow();
        final int high = testcase.getHigh();
        final int length = Integer.toString(low).length();
        for(int i = low; i <= high; i++) {
            int previoudNumber = 0;
            for(int j = 1; j < length; j++) {
                int divisor = getDivisor(length - j);
                int mod = i % divisor;
                int result = i / divisor;
                int recycleNumber = Integer.parseInt("" + mod + result);
                if(previoudNumber != recycleNumber && recycleNumber > i && recycleNumber <= high) {
                      previoudNumber = recycleNumber;
                    recycleNumberCount =  recycleNumberCount + 1;
                }
            }
        }
        testcase.setOutput(new TestResult(recycleNumberCount));
    }

    private static int getDivisor(int noOfZeros) {
        StringBuilder builder = new StringBuilder().append(1);
        for(int i = 0; i < noOfZeros; i++) {
            builder.append(0);
        }
        return Integer.parseInt(builder.toString());
    }
}


