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

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

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			String userDir = System.getProperty("user.dir"); //get working directory
			userDir.replaceAll("['\']", "\\"); // replace all chars '\' with '\\' in the string
			File file = new File(System.getProperty("user.dir") + "\\QualificationRound\\RecycledNumbers\\in-out\\C-small-attempt0.in");
	        Scanner fileScanner = new Scanner(file);
	        //delimiter is how input text is set up in this case it's the new line char
	        fileScanner.useDelimiter(System.getProperty("line.separator")); 
	        //declared for file writing
	        BufferedWriter outFile = new BufferedWriter(new FileWriter(System.getProperty("user.dir") + "\\QualificationRound\\RecycledNumbers\\in-out\\C-small.out"));
			int counter, inCounter, masterCounter, numCases, startIndex, result, Amin, Bmax, numLength, ininCounter, deepCounter, passInt;
			String inputText;
			Amin = 0;
			Bmax = 0;
			String numConv;
			numCases = Integer.parseInt(fileScanner.nextLine());
			ArrayList<Integer> intList = new ArrayList<Integer>();
			ArrayList<Integer> intList2 = new ArrayList<Integer>();
			for(masterCounter = 1; masterCounter <= numCases; masterCounter++){
				inputText = fileScanner.nextLine();
				startIndex = 0;
				result = 0;
				for( counter = 0; counter < inputText.length(); counter ++){//parse A n B
					if (inputText.charAt(counter) == ' ') 
					{
						Amin = Integer.parseInt(inputText.substring(startIndex, counter)); 
						startIndex = counter + 1;
					}    			
				}
				Bmax = Integer.parseInt(inputText.substring(startIndex, counter)); 
				//get current length of numbers
				numLength = String.valueOf(Amin).length();
				for(counter = Amin; counter < Bmax; counter++){
					for(inCounter = counter + 1; inCounter <= Bmax; inCounter++){
						passInt = inCounter;
						while(passInt > 0){
								intList.add(passInt % 10); //get modulous
								passInt = passInt / 10;//div by 10
							}
						for(ininCounter = 0; ininCounter < numLength; ininCounter++){
							
							for(deepCounter = 0; deepCounter < intList.size() -1; deepCounter++)
								intList2.add(intList.get(deepCounter+1));
							
							intList2.add(intList.get(0));
							numConv = "";
							for(deepCounter = 0; deepCounter < intList2.size(); deepCounter++){
								numConv = intList2.get(deepCounter) + numConv;
							}
							passInt = Integer.parseInt(numConv);
							if(counter == passInt){
								result++; 
								//if(masterCounter == 4)
									//System.out.println(counter + " = " + passInt + " Actual #: " + inCounter);
							}
							intList = (ArrayList<Integer>) intList2.clone();
							intList2.clear();
						}
						intList.clear();
					}
				}
			
			System.out.println("Case #" + masterCounter + ": " + result);
        	outFile.write("Case #" + masterCounter + ": " + result + "\n");
			}
			
	        fileScanner.close();
	        outFile.close();
		}
		catch (FileNotFoundException e) {
			System.out.println("File not found"); e.printStackTrace();
		}
		catch (IOException e) {
			System.out.println("IOException");
		}

	}

}
