/*
 * 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.google.jam.eaque.qualif.c;

import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;

import com.google.jam.eaque.stub.InputFileManager;
import com.google.jam.eaque.stub.Stub;
import com.google.jam.eaque.stub.Util;

public class StubImpl extends Stub {

	@Override
	public String runTestCase(InputFileManager ifm)
			throws NumberFormatException, IOException {
		
		long[] supremum = Util.stringsToLongs(ifm.readAndSplit());
		long res = 0;
		ArrayList<Long> rotations = null;
		
		ArrayList<String> test = new ArrayList<>();
		
		for (long i = supremum[0]; i <= supremum[1]; i++) {
			if (isUnique(i))
			{
				continue;
			}
			
			rotations = getRotations(i);
			for (Long rot : rotations) {
				if (rot > i && rot <= supremum[1])
				{
					res++;
					test.add(i + " " + rot);
				}
			}
		}
		for (int i = 0; i < test.size(); i++) {
			for (int j = i+1; j < test.size(); j++) {
				if (test.get(i).equals(test.get(j)))
				{
					System.out.println(test.get(i));
				}
			}
		}
		return " " + res;
	}
	
	private boolean isUnique(long l) {
		Byte[] ba = longToByteArray(l);
		boolean res = true;
		for (int i = 0; i < ba.length - 1; i++) {
			if (ba[i] != ba[i+1])
			{
				res = false;
				break;
			}
		}
		return res;
	}

	private Byte[] longToByteArray(long l)
	{
		ArrayList<Byte> res = new ArrayList<Byte>();
		while (l != 0)
		{
			res.add((byte) (l % 10));
			l /= 10;
		}
		Collections.reverse(res);
		return res.toArray(new Byte[0]);
	}
	
	private long byteArrayToLong(Byte[] b)
	{
		long res = 0;
		for (int k = 0; k < b.length; k++) {
			res += b[b.length - 1 - k] * (long)Math.pow(10, k);
		}
		return res;
	}
	private ArrayList<Long> getRotations(long l)
	{
		Byte[] ba = longToByteArray(l);
		Byte[] tmp = new Byte[ba.length];
		ArrayList<Long> res = new ArrayList<Long>();
		
		for (int i = 0; i < ba.length - 1; i++) {
			for (int j = 0; j < ba.length ; j++) {
				tmp[j] = ba[(ba.length - 1 + j - i) % ba.length];
			}
			if (tmp[0] != 0 && !res.contains(byteArrayToLong(tmp)))
			{
				res.add(byteArrayToLong(tmp));
			}
		}
		return res;
	}

}
