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

import java.util.*;

public class RecycledNumbers {
  
  private static int cases;
  
  public static void main(String[] args) {
    Scanner input = new Scanner(System.in);
    if (input.hasNextInt()) {
      cases = input.nextInt();
    }
    
    for (int i = 0; i < cases; i++) {
      System.out.println("Case #" + (i+1) + ": " + findRecycled(input));
    }
  }
  
  public static int findRecycled(Scanner input) {
    int startingPoint = 0;
    int endingPoint = 0;
    int counter = 0;
    
    if (input.hasNextInt()) {
      startingPoint = input.nextInt();
    }
    
    if (input.hasNextInt()) {
      endingPoint = input.nextInt();
    }
    
   
    //for each item from start->end..
    for (Integer i = startingPoint; i < endingPoint; i++) {
      
      //cast that item to a string..
      String value = i.toString();
      ArrayList<Integer> thisItem = new ArrayList<Integer>();
      //for each character in the string..
      for (int z = 0; z < value.length(); z++) {
        
        //shuffle the characters along one
        String rotate = value.substring(z);
        rotate += value.substring(0, z);
        
        //cast to an int
        int shuffledInt = Integer.parseInt(rotate);
        
        //make sure it is within the boundaries..
        if (shuffledInt <= endingPoint && shuffledInt >= startingPoint) {
          
          //if it is greater than the original then it is a duplicate
          if (Integer.parseInt(value) < shuffledInt) {
            //make sure if we've looked at this item before that it's not a duplicate..
            if (!thisItem.contains(shuffledInt)) {
              counter++;
              thisItem.add(shuffledInt);
            }
          }
        }
       
      }
    }
    
    return counter;
  }
}