/*
 * 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.eevoskos.codejam;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
	
	private static final boolean DEBUG = false;
	
	public static void main(String... args) {
		RecycledNumbers instance = new RecycledNumbers();
		
		try {
			BufferedReader c = new BufferedReader(new InputStreamReader(System.in));

			// Number of test cases
			int T = Integer.valueOf(c.readLine());

			System.out.println();

			// Do, for each test case
			for (int i = 0; i < T; i++) {

				// Read input string
				String input = c.readLine();

				// Process input
				String output = instance.solveCase(input);

				// Print the translated text
				System.out.println("Case #" + (i + 1) + ": " + output);

			}

		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	Set<Pair> allPairs = new HashSet<Pair>();
	Set<Pair> countPairs = new HashSet<Pair>();

	private String solveCase(String input) {
		// Init variables
		countPairs = new HashSet<Pair>();
		
		String[] split = input.split(" ");
		int A = Integer.valueOf(split[0]);
		int B = Integer.valueOf(split[1]);		
		return getTotalRecycledPairs(A, B);
	}

	private String getTotalRecycledPairs(int a, int b) {
		int numOfPairs = 0;
		for (int i = a; i <= b; i++) {
			numOfPairs += countRecycledPairs(i, a, b);
		}		
		return String.valueOf(numOfPairs);
	}

	private int countRecycledPairs(int num, int a, int b) {
		int count = 0;
		Set<Pair> pairs = getAllPairs(num);
		for (Pair p : pairs) {
			if (p.isIncludedIn(a, b) && p.isRecycled()) {
				if (!countPairs.contains(p)) {
					countPairs.add(p);
					count++;
					if (DEBUG) {
						System.out.println(p + ": counts!");
					}
				} else {
					if (DEBUG) {
						System.out.println(p + ": already count");
					}
				}
			} else {
				if (DEBUG) {
					System.out.println(p + ": does not count");
				}
			}
		}
		return count;
	}
	
	private Set<Pair> getAllPairs(int num) {
		HashSet<Pair> pairs = new HashSet<Pair>();
		String s = String.valueOf(num);
		for (int i = 0; i < s.length(); i++) {
			String s1 = s.substring(0, i);
			String s2 = s.substring(i);
			pairs.add(new Pair(Integer.valueOf(s1 + s2), Integer.valueOf(s2 + s1)));
		}
		return pairs;
	}

	class Pair {
		int n, m;
		
		Pair(int n, int m) {
			this.n = Math.min(n, m);
			this.m = Math.max(n, m);
		}
		
		@Override
		public String toString() {
			return "(" + n + ", " + m + ")";
		}
		
		boolean isRecycled() {
			String N = String.valueOf(n);
			String M = String.valueOf(m);
			
			if (N.length() != M.length()) {
				return false;
			}
			
			for (int i = 0; i < N.length(); i++) {
				String n1 = N.substring(0, i);
				String n2 = N.substring(i);
				if ((n2 + n1).matches(M)) {
					return true;
				}
			}
			
			return false;
		}
		
		boolean isIncludedIn(int a, int b) {
			return a <= n && n < m && m <= b;
		}
		
		@Override
		public boolean equals(Object another) {
			if (another == null)
				return false;

			if (!(another instanceof Pair))
				return false;

			return (this.m == ((Pair) another).m && this.n == ((Pair) another).n)
					|| (this.m == ((Pair) another).n && this.n == ((Pair) another).m);
		}
		
		@Override
		public int hashCode() {
			return String.valueOf(n).hashCode() + String.valueOf(m).hashCode();
		}
	}

}
