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

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;

import loader.InputReader;
import loader.OutPutWriter;

public class RecycledNumber {

	static String inputName = "C-small-attempt0.in";
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
//		List<Integer> list = new LinkedList<Integer>();
//		list.add(1);
//		list.add(2);
//		System.out.println(listToInt(list));
//		int a = 4009;
//		System.out.println(intToList(a));
		start();
	}

	private static void start(){
		InputReader reader = new InputReader();
		reader.read(inputName);
		List<String> inputs = reader.getInputs();
		List<String> outputs = new ArrayList<String>();
		for(String in: inputs){
			String[] aLine = in.split(" ");
			int a = Integer.parseInt(aLine[0]);
			int b = Integer.parseInt(aLine[1]);
			int amount = findPairs(a,b);
			outputs.add(new Integer(amount).toString());
		}
		
		OutPutWriter writer = new OutPutWriter();
		writer.write("question3.out", outputs);
	}
	
	private static int findPairs(int a, int b) {
		Set<Pair> resultSet = new HashSet<Pair>();
		
//		int res = 0;
		if(a == b) return 0;
		for(int n=a; n<b; n++){
			List<Integer> nList = intToList(n);
			int shiftTimes = nList.size()-1;
			for(int i=1; i<=shiftTimes; i++){
				int m = shift(i, nList);
				if(n < m && m <= b){
					Pair pair = new Pair(n, m);
//					res += 1;
					if(!resultSet.contains(pair))
						resultSet.add(pair);
				}
			}
		}
		List view = new ArrayList(resultSet);
		Collections.sort(view);
		System.out.println(view);
		
		return resultSet.size();
//		return res;
	}

	private static int shift(int shiftTimes, List<Integer> list){
		
		List<Integer> copyList = new ArrayList<Integer>();
		copyList.addAll(list);
		for(int i=0; i<shiftTimes; i++){
			Integer moved = copyList.remove(0);
			copyList.add(moved);
		}
		
		return listToInt(copyList);
	}

	
	private static List<Integer> intToList(int a){
		List<Integer> l = new LinkedList<Integer>();
		
		while(a > 0){
			int digit = a%10;
			l.add(0, digit);
			a /= 10;
		}
		
		return l;
	}
	
	private static int listToInt(List<Integer> list){
		int res = 0;
		int length = list.size();
		
		int pow = 0;
		for(int i=length-1; i>=0; i--){
			int digit = list.get(i);
			int value = (int) (digit * Math.pow(10.0, pow));
			res += value;
			pow++;
		}
		return res;
	}
}
