/*
 * 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 fixjava;

import java.util.Iterator;

/**
 * Create an iterator that keeps track of the current index into the Iterable.
 * 
 * Usage:
 * 
 * <code>

	public static void main(String[] args) {
	
		// Iterate over a list:
		ArrayList<String> list = new ArrayList<String>();
		list.add("apple");
		list.add("banana");
		list.add("pear");
		for (IndexedItem<String> it : IndexedItem.iterate(list))
			System.out.println(it.getIndex() + ": " + it.getItem());
			
		// Iterate over an array:
		String[] arr = new String[] {"a", "b", "c"};
		for (IndexedItem<String> it : IndexedItem.iterate(arr))
			System.out.println(it.getIndex() + ": " + it.getItem());
	}

   </code>
 * 
 * @author (c) Luke Hutchison 2010. Covered under the BSD license.
 * 
 * @param <T>
 *            The type of the Iterable.
 */
public class IndexedItem<T> {
	private T item;
	private int index = -1;

	/** Get the current item in the iteration. */
	public T getItem() {
		return item;
	}

	/** Get the index of the current item (zero-indexed). */
	public int getIndex() {
		return index;
	}

	private static class IndexedIterator<U> implements Iterable<IndexedItem<U>>, Iterator<IndexedItem<U>> {

		private final Iterator<U> collectionIter;
		private final IndexedItem<U> currItem = new IndexedItem<U>();

		public IndexedIterator(Iterable<U> collection) {
			this.collectionIter = collection.iterator();
		}

		public IndexedIterator(final U[] array) {
			collectionIter = new Iterator<U>() {
				U[] arr = array;
				IndexedItem<U> it = currItem;

				@Override
				public boolean hasNext() {
					return it.index + 1 < arr.length;
				}

				@Override
				public U next() {
					return arr[it.index + 1];
				}

				@Override
				public void remove() {
					for (int i = it.index + 2; i < arr.length; i++)
						arr[i] = arr[i + 1];
				}
			};
		}

		@Override
		public Iterator<IndexedItem<U>> iterator() {
			return this;
		}

		@Override
		public boolean hasNext() {
			return collectionIter.hasNext();
		}

		@Override
		public IndexedItem<U> next() {
			currItem.item = collectionIter.next();
			currItem.index++;
			return currItem;
		}

		@Override
		public void remove() throws UnsupportedOperationException, IllegalStateException {
			collectionIter.remove();
			currItem.index--;
			currItem.item = null;
		}
	}

	/** Iterate over an Iterable<T> and keep track of the index */ 
	public static <T> Iterable<IndexedItem<T>> iterate(Iterable<T> collection) {
		return new IndexedIterator<T>(collection);
	}

	/** Iterate over an array T[] and keep track of the index */
	public static <T> Iterable<IndexedItem<T>> iterate(T[] array) {
		return new IndexedIterator<T>(array);
	}
}

