package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

package javaapplication2;

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

public class RecycledNumbers {

    private final static String INPUT_PATH = "resources/recycled_numbers.in";
    private final static String OUTPUT_PATH = "resources/recycled_numbers.out";
    private static int caseNumber = 0;
    private final static int[] TEN_POWS =
            new int[]{1, 10, 100, 1000, 10000, 100000, 1000000};

    public static void main(String[] args) throws FileNotFoundException, IOException {
        try (Scanner scanner = new Scanner(new File(INPUT_PATH))) {
            int T = scanner.nextInt();
            try (FileWriter out = new FileWriter(OUTPUT_PATH)) {
                for (int i = 0; i < T; ++i) {
                    processCase(scanner, out);
                }
            }
        }
    }

    private static void processCase(Scanner scanner, FileWriter out) throws IOException {
        out.write("Case #" + (++caseNumber) + ": ");
        Set<Pair> pairs = new HashSet<>();
        int A = scanner.nextInt();
        int B = scanner.nextInt();
        int result = 0;
        for (int n = A; n <= B; ++n) {
            int shiftCount = ((int) Math.floor(Math.log10(n)));
            for (int i = 1; i <= shiftCount; ++i) {
                int right = n / TEN_POWS[i];
                int left = n % TEN_POWS[i];
                int shifted = left * TEN_POWS[shiftCount + 1 - i] + right;
                if (shifted != n && shifted <= B && shifted >= A
                        && ((int) Math.floor(Math.log10(n))) == shiftCount) {
                    Pair pair = new Pair(n, shifted);
                    if (!pairs.contains(pair)) {
                        ++result;
                        pairs.add(pair);
                    }
                }
            }
        }
        out.write(result + "");
        out.write("\n");
    }

    private static class Pair {

        private int a, b;

        public Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }

        @Override
        public boolean equals(Object that) {
            if (that instanceof Pair) {
                Pair pair = (Pair) that;
                if (this.a == pair.a && this.b == pair.b) {
                    return true;
                }
                if (this.a == pair.b && this.b == pair.a) {
                    return true;
                }
            }
            return false;
        }

        @Override
        public int hashCode() {
            return new Integer(a).hashCode() + new Integer(b).hashCode();
        }
    }
}
