/*
 * 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 com.archu.contest;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;

public class RecycledNum
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		File inputFile = null;
		File outputFile = null;
		BufferedReader br = null;
		BufferedWriter bw = null;
		String str = null;
		int nTestCase = 0;

		try
		{
			inputFile = new File("C-small.in");
			outputFile = new File("C-small.out");
			br = new BufferedReader(new FileReader(inputFile));
			bw = new BufferedWriter(new FileWriter(outputFile));

			str = br.readLine();
			nTestCase = Integer.parseInt(str);

			for (int k = 0; k < nTestCase; k++)
			{
				if ((str = br.readLine()) != null)
				{
					String[] range = str.split(" ");
					int start = Integer.parseInt(range[0]);
					int end = Integer.parseInt(range[1]);
					int len = range[0].length();

					HashSet<String> setRecycled = new HashSet<String>();

					if (len > 1)
					{
						for (int i = start; i <= end; i++)
						{
							String numStr = String.valueOf(i);
							char[] numChar = numStr.toCharArray();

							HashSet set = new HashSet();
							for (char ch : numChar)
							{
								set.add(ch);
							}
							if (set.size() == 1)
							{
								continue;
							}
							int origNum = Integer.parseInt(numStr);
							for (int j = 0; j < len - 1; j++)
							{
								// System.out.println("numStr :: " + numStr);
								numStr = rotateNumber(numStr, len);
								// System.out.println("after rotating numStr :: "
								// + numStr);
								int num = Integer.parseInt(numStr);
								if (num != origNum && num >= start && num <= end)
								{
									// System.out.println("Pair :: (" + origNum
									// + " , " +
									// numStr + ")");
									// System.out.println("recycled no found... adding "
									// +
									// (origNum < num ? "" + origNum + num : ""
									// + num +
									// origNum) + " to set");
									setRecycled.add(origNum < num ? "" + origNum + "," + num : "" + num + "," + origNum);
									// System.out.println("size :: " +
									// setRecycled.size());
								}
							}
						}
					}
					System.out.println(setRecycled.size());
					bw.write("Case #" + (k + 1) + ": " + setRecycled.size() + "\n");

					// TreeSet<String> set = new TreeSet<String>(setRecycled);
					// System.out.println(set);
				}
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}

		try
		{
			if (br != null)
			{
				br.close();
			}
			if (bw != null)
			{
				bw.flush();
				bw.close();
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}

	}

	public static String rotateNumber(String num, int len)
	{
		return num.charAt(len - 1) + num.substring(0, len - 1);
	}
}
