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

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

package recycledNumbers;

import java.util.*;

public class RecycledNumbers 
{
	public int countRecylcedNumbers(int x, int y )
	{
		
		int count =0;
		int m=x+1;
		ArrayList<ArrayList<String>>  arrayList= new ArrayList<ArrayList<String>>();
		ArrayList<String> list = new ArrayList<String>();
		for(int i=0;i<y;i++)
		{
			
			arrayList.add(null);
		}
		boolean flag = true;;
		for(int i=m;i<=y;i++)
		{
			int[] array = recycledNumber(i);
			list = new ArrayList<String>();
			for(int j=0;j<array.length;j++)
			{
				
				if(array[j]<=y && array[j]!=i && array[j]!=0 && array[j]>=x)
				{
					flag = true;
					if(i==m)
					{
						System.out.println(i + "    " + array[j]);
						count++;
						list.add(new Integer(array[j]).toString());
					}
					else
					{
						ArrayList<String> searchList= arrayList.get(array[j]);
						if(searchList!= null)
						{
							for(int k=0;k<searchList.size();k++)
							{
								if(Integer.parseInt(searchList.get(k))==i)
								{
									flag = false;
								}
							}
						}
						if(flag != false)
						{
							System.out.println(i + "    " + array[j]);
							count++;
							list.add(new Integer(array[j]).toString());
						}
						
					}
				}
			}
			arrayList.add(i, list);
		}
		System.out.println(count);
		return count;
	}
	public int digitCount(int x)
	{
		int count=0;
		while(x!=0)
		{
			x/=10;
			count++;
		}
		return count;
		
	}
	
	public int[] recycledNumber(int x)
	{
		int y, count = 0;
		count = digitCount(x);
		y=count-1;
		int place;
		int lastInt;
		int[] array = new int[y];
		int i=0;
		while(y!=0)
		{
			place = (int) Math.pow(10, count-1);
			lastInt = x%10;
			x/=10;
			x=lastInt*place + x;
			if(digitCount(x)==count)
			{
				array[i++]=x;
			}
			y--;
		}
		return array;
	}
}
