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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class Recycled {
	public static void main(String[] args) {
		String line = null;
		BufferedReader reader = null;
		File file = new File("c:\\write.txt");
		BufferedWriter  output = null;
		try {
			output = new BufferedWriter(new FileWriter(file));
		} catch (IOException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		
		try {
			reader = new BufferedReader(new FileReader("c:\\temp1.txt"));
			line = reader.readLine();
			int n = Integer.parseInt(line);
			for (int i=0;i<n;i++){
				line = reader.readLine();
				output.write("Case #"+(i+1)+": ");

				String[]arr = line.split(" ");
				int intarr[]= new int[arr.length];
				for (int j=0;j<intarr.length;j++){
					intarr[j]= Integer.parseInt(arr[j]);
				}
				int count =0;
				int n1 = intarr[0];
				int n2= intarr[1];
				Set<Pair > set = new HashSet<Pair>();
				for (int number=n1;number<=n2;number++){
					int digitarr[] = new int[8];
					int numberOfDigits = 0;
					int no = number;
					while (no >0 ){
						int d = no%10;
						no = no/10;
						digitarr[numberOfDigits]=d;
						numberOfDigits++;
					}
					if (numberOfDigits==1){
						continue;
					}
					for (int j=0;j<numberOfDigits/2;j++){
						int temp = digitarr[j];
						digitarr[j]= digitarr[numberOfDigits-j-1];
						digitarr[numberOfDigits-j-1]=temp;
					}
					
					for (int j=0;j<numberOfDigits;j++){
						int sum =0;
						if (digitarr[j]==0){
							continue;
						}
						for (int k=0;k<numberOfDigits;k++){
							int pos = (j+k)%numberOfDigits;
							int d = digitarr[pos];
							sum=(int) (sum+ (Math.pow(10, (numberOfDigits-k-1))*d ));
							if (sum>n2){
								break;
							}
						}
						if (sum<=n2 && sum> number){
							if (set.contains(new Pair(sum,number))){
//								System.out.println(number +" "+ sum);
								continue;
							}
							
							set.add(new Pair(sum,number));
							count++;
						}
					}
				}
				output.write(count+"");
				
				if (i!=n-1)
				output.write("\n");
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}finally{
			try {
				reader.close();
				output.close();
			
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
				
	}
}
class Pair{
	int a;
	int b;
	public Pair(int sum, int number) {
		a = sum;
		b = number;
	}
	@Override
	public boolean equals(Object obj) {
		Pair p = (Pair)obj;
		if (p.a==a && p.b==b){
			return true;
		}
		if (p.b==a && p.a==b)
			return true;
		return false;
	}
	@Override
	public int hashCode() {
		return ((a+b)%13);
	}
}
