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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

import java.util.ArrayList;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Recycle {
    public Recycle() {
        super();
    }

    public static void main(String[] args) throws FileNotFoundException,
                                                  IOException {
        Recycle recycle = new Recycle();
       // FileReader fr = new FileReader("B-large.in");
         FileReader fr = new FileReader("C-small-attempt0.in");
           BufferedReader br = new BufferedReader(fr);
           String noofT = br.readLine();
           int noOfTestCases = Integer.parseInt(noofT);
           BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));
           for (int i=0;i < noOfTestCases;i++ ){
               StringTokenizer st = new StringTokenizer(br.readLine()," ");
               String sA = st.nextToken();
               int A = Integer.parseInt(sA);
               String sB = st.nextToken();
               int B = Integer.parseInt(sB);
               int cnt = 0;
               int count = 0;
               int[] numArray = new int[30000];
               TreeSet a1 = new TreeSet();
               for (int j = A; j<=B ;j++){
                   String jS = Integer.valueOf(j).toString();
                   char[] jS1 = new char[jS.length()];
                   for (int m = 0; m < jS.length() - 1;m++){
                   for (int k = jS.length() - 1; k >0 ; k--){
                       char temp = jS.charAt(jS.length() - 1);
                       jS1[k] = jS.charAt(k-1);
                       jS1[0] = temp;
                       
                       
                       
                   }
                       String jS2 = "";
                       for (int n=0;n < jS1.length; n++){
                           jS2 = jS2 + Character.valueOf(jS1[n]).toString();
                       }
                        
                    int newNum = Integer.parseInt(jS2);
                       boolean flag = false;
                       boolean flagR = false;
                    if (( newNum >= A) && (newNum <= B) && (newNum != j)) {
                        if (a1.contains(newNum)== true){
                            
                            flag = true;
                           // System.out.println("flag = " + flag);
                            //break;
                        }
                       // numArray[cnt++] = newNum;
                        else{
                            String reverseNum = "";
                            for (int l= jS1.length - 1;l >= 0;l--){
                                 reverseNum = reverseNum + Character.valueOf(jS1[l]).toString();
                            }
                            if (jS1.length == 2){
                            if (!a1.contains(new Integer(reverseNum))){       
                        a1.add(newNum);
                        cnt++;
                            }
                            }
                            else{
                                a1.add(newNum);
                                cnt++;
                            }
                           
                        }
                        //System.out.println("newNum = " + newNum);
                    }
                       
                       
                          
                           
                       
                       
                      /* if (flag == false){
                           //System.out.println("count = " + count);
                           count++;
                       }*/
                   }
               }
               String out = "Case #" + (i+1) + ": " + cnt;
               bw.write(out);
               bw.newLine();
               System.out.println("Case #" + (i+1) + ": " + cnt);
           }
           bw.close();

    }
}
