/*
 * 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 luis.miguel.serrano.utilities;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

import luis.miguel.serrano.settings.GlobalSettings;

/**
 * Data class for processing input and generating output
 * @author Luis Miguel Serrano
 *
 */
public class DataC {

	private File inputFile;
	private File outputFile;

	public DataC(String inputFilePath, String outputFilePath) {
		this.inputFile = new File(inputFilePath);
		outputFile = new File(outputFilePath);
	}

	public DataC(File inputFile) {
		this.inputFile = inputFile;
		outputFile = new File(GlobalSettings.OUTPUT_FILE_PATH);
	}

	/**
	 * Processes the file passed as argument in the constructor
	 * @throws FileNotFoundException
	 */
	public void processFile() throws FileNotFoundException {
		if(outputFile.exists())
			outputFile.delete();

		Scanner scanner = new Scanner(inputFile);

		final int casesNumber = scanner.nextInt();
		scanner.nextLine();

		for(int i = 0; i!=casesNumber; ++i)
			processCase(scanner, i);

		System.out.println("Done processing file: "+inputFile);
	}

	//Format-specific
	private void processCase(Scanner scanner, int caseNumber) {
		//System.out.println("New Case");
		int a = scanner.nextInt();
		int b = scanner.nextInt();
		
		int solution;
		solution = getSolution(a, b);

		//Write solution to file
		try {
			FileWriter fw = new FileWriter(outputFile, true);
			fw.write("Case #"+(caseNumber+1)+": "+solution+"\r\n");	
			fw.flush();
			fw.close();
		} catch (IOException e) {
			e.printStackTrace();
		}	
	}

	//Problem-specific
	private int getSolution(int a, int b){
		int solution = 0;

		for(int i = b; i!=a; --i) {
			for(int j = a; j<i; ++j) {
				if(isRecycled(j, i))
					++solution;
			}
		}

		return solution;
	}

	private boolean isRecycled(int n, int m) {
		String number = n+"";
		String recycled;
		
		//For each index of the string counting from the end, try switching it around in multiple attempts to obtain "m"
		for(int i = number.length()-1; i!=0; --i){
			recycled = number.substring(i)+number.substring(0, i);
			if(Integer.parseInt(recycled) == m)
				return true;
		}
		
		return false;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {

		//DataC dataSample = new DataC(GlobalSettings.PROJECT_PATH+"\\input\\input_sample.in", GlobalSettings.PROJECT_PATH+"\\output\\input_sample.out");
		DataC dataSmall = new DataC(GlobalSettings.PROJECT_PATH+"\\input\\C-small-attempt0.in", GlobalSettings.PROJECT_PATH+"\\output\\C-small-attempt0.out");
		//DataB dataLarge = new DataB(GlobalSettings.PROJECT_PATH+"\\input\\B-large.in", GlobalSettings.PROJECT_PATH+"\\output\\B-large.out");

		try {
			//dataSample.processFile();
			dataSmall.processFile();
			//dataLarge.processFile();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		System.out.println("Finished processing all input!");
	}

}
