/*
 * 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 com.javanme.gcj.one.c;

import java.io.IOException;
import java.io.PrintWriter;
import java.nio.charset.Charset;
import java.nio.file.FileSystems;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.StandardOpenOption;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class RecycledNumbers {

    public static void main(String args[]) {
        String input = "C-small-attempt0";

        Path pathin = FileSystems.getDefault().getPath(input + ".in");
        Path pathout = FileSystems.getDefault().getPath(input + ".out");


        try (PrintWriter pout = new PrintWriter(Files.newOutputStream(pathout, StandardOpenOption.CREATE, StandardOpenOption.TRUNCATE_EXISTING, StandardOpenOption.WRITE))) {
            List<String> lines = Files.readAllLines(pathin, Charset.forName("UTF-8"));

            int countLines = lines.size();
            String str = null;
            int small = 0;
            int smallAux = 0;
            int big = 0;
            String[] split = null;
            String num = null;
            String numAux = null;
            StringBuffer backDigits = null;
            int countRecycled = 0;
            Map<Integer, Integer> mapDistinct = null;
            for (int i = 1; i < countLines; i++) {
                countRecycled = 0;
                str = lines.get(i);
                split = str.split(" ");
                small = Integer.parseInt(split[0]);
                big = Integer.parseInt(split[1]);
                for (int j = small; j < big; j++) {
                    num = "" + j;
                    backDigits = new StringBuffer();
                    mapDistinct = new HashMap<>();
                    for (int k = num.length() - 1; k > 0; k--) {
                        backDigits.insert(0, num.charAt(k));
                        numAux = backDigits.toString() + num.substring(0, num.length() - backDigits.length());
                        smallAux = Integer.parseInt(numAux);

                        if (j < smallAux && smallAux <= big) {
                            for (int m = j + 1; m <= big; m++) {
                                if (smallAux == m) {
                                    if (!mapDistinct.containsKey(m)) {
                                        mapDistinct.put(m,1);
                                        countRecycled++;
                                    }
                                    break;
                                }
                            }
                        }
                    }
                }
                pout.printf("Case #%d: %d\n", i, countRecycled);
            }

        } catch (IOException ex) {
            ex.printStackTrace();
        }
    }
}
