/*
 * 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();

    }

}

import java.io.IOException;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class SpeakingTongues extends JamProblem {


    Map<Character, Character> map = new HashMap<>();

    public static void main(String[] args) throws IOException {
        SpeakingTongues p = new SpeakingTongues();
        p.prepare();
        p.go();
    }


    void prepare() {
        map.put('y', 'a');
        map.put('e', 'o');
        map.put('q', 'z');

        String[] from = new String[3];
        String[] to = new String[3];

        to[0] = "ejp mysljylc kd kxveddknmc re jsicpdrysi";
        to[1] = "rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd";
        to[2] = "de kr kd eoya kw aej tysr re ujdr lkgc jv";
        from[0] = "our language is impossible to understand";
        from[1] = "there are twenty six factorial possibilities";
        from[2] = "so it is okay if you want to just give up";
        for (int i = 0; i < to.length; i++) {
            char[] t = to[i].toCharArray();
            char[] f = from[i].toCharArray();
            for (int j = 0; j < f.length; j++) {
                char fc = f[j];
                char tc = t[j];
                map.put(tc, fc);
            }
        }
        for (char c = 'a'; c <= 'z'; c++) {
            if (map.containsKey(c)) {
                continue;
            }

            for (char c2 = 'a'; c2 <= 'z'; c2++) {
                if (map.containsValue(c2)) {
                    continue;
                }
                map.put(c,c2);
            }

        }

    }


    @Override
    String solveCase(JamCase jamCase) {
        StringBuilder b = new StringBuilder();
        STCase ca = (STCase) jamCase;
        char[] chars = ca.str.toCharArray();

        for (int i = 0; i < chars.length; i++) {
            char c = chars[i];
            b.append(map.get(c));

        }
        return b.toString();
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        STCase ca = new STCase();
        ca.lineCount = 1;
        ca.str = file.get(line);
        return ca;
    }
}

class STCase extends JamCase {
    String str;
}