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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class RecycledNumbers {

	private static int noOfCases;
	private static String[] result;
	private static List<Integer> listOfNumbers;
	private static String inputFile = "C-small-attempt0.in";
	private static String outputFile = "C-small-attempt0.out";
	
	public static void main(String[] args) {
		
		readInputFile();
		
		
		writeToFile(result);
	}
	
	public static void writeToFile(String args[]) {
		try {
			FileWriter fstream = new FileWriter(outputFile);
			BufferedWriter out = new BufferedWriter(fstream);
			for (int i = 0; i < args.length; i++) {
				out.write(args[i]);
				if (i != args.length - 1)
					out.newLine();
			}
			out.close();
		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
		}
	}

	private static void readInputFile() {

		try {
			FileInputStream fstream = new FileInputStream(inputFile);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));

			noOfCases = Integer.parseInt(br.readLine());
			String strLine;
			result = new String[noOfCases];
			for (int i = 0; i < noOfCases; i++) {
				listOfNumbers = new ArrayList<Integer>();
				
				strLine = br.readLine();
				String[] temp = strLine.split(" ");
				int start = Integer.parseInt(temp[0]);
				int end = Integer.parseInt(temp[1]);
				System.out.println("start: "+start+".. end: "+end);
				
				int totalSum = getResult(start,end);
				System.out.println("Case #" + (i + 1) + ": " + totalSum);
				result[i] = "Case #" + (i + 1) + ": " + totalSum;
			}

			for(int x=0;x<listOfNumbers.size();x++){
				System.out.println(listOfNumbers.get(x));
			}
			in.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.err.println("Error: " + e.getMessage());
		}
	}

	private static int getResult(int start, int end) {
		int totalSum = 0;
		for(int i=start;i<=end;i++){
			if(listOfNumbers.contains(i)){
				continue;
			}
			String number = String.valueOf(i);
			char[] numberArray = number.toCharArray();
			if(sameDigit(numberArray)){
				continue;
			}
			//System.out.println(number);
			totalSum = totalSum + getCount (numberArray,i,start,end);
		}
		//System.out.println(totalSum);
		return totalSum;
	}

	private static boolean sameDigit(char[] numberArray) {
		
		if(numberArray.length <=1){
			return true;
		}
		for(int i=0;i<numberArray.length-1;i++){
			if(numberArray[i] != numberArray[i+1]){
				return false;
			}
		}
		return true;
	}

	private static int getCount(char[] arr, int currentNumber,int start, int end) {
		int count=0;
		int nc2Count=0;
		char[][] tempNumbers = new char[arr.length][arr.length];
		int[] numberArray = new int[arr.length];
		List<Integer> localList  = new ArrayList<Integer>();
		//System.out.println("current number: "+currentNumber);
		
		// Getting different combination of char arrays//
		// Duplicate the first array
		for(int i=0;i<arr.length;i++){
			for(int j=0;j<arr.length;j++){
				tempNumbers[i][j] = arr[j];
			}
		}
		
		// Rest of the combinations
		for(int i=1;i<arr.length;i++){
			char a = tempNumbers[i-1][0];
			int j = 0;
			for(j=0;j<arr.length-1;j++){
				tempNumbers[i][j] = tempNumbers[i-1][j+1];
				//System.out.println("temp["+i+"]["+j+"] = "+tempNumbers[i-1][j+1]);
			}
			tempNumbers[i][j] = a;
		}
		// End of combinations//
		
		//Converting the char array of diff combinations to String and then to Integer
		// Also add the number to the count of valid combinations
		for(int i=0;i<arr.length;i++){
			String num = String.valueOf(tempNumbers[i]);
			numberArray[i] = Integer.parseInt(num);
			System.out.println(numberArray[i]);
			if((numberArray[i]>=start && numberArray[i]<=end) && (!localList.contains(numberArray[i]))){
				localList.add(numberArray[i]);
				count++;
				listOfNumbers.add(numberArray[i]);
			}
		}
		
		
		//Calculate the nc2 for the numbers
		nc2Count = (count * (count-1))/2;
		if(nc2Count!=0){
			System.out.println("current number: "+currentNumber+". count: "+count+". nc2 count: "+nc2Count);
		}
		System.out.println();
		return nc2Count;
	}
}
