/*
 * 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 RecycledNumber;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;

public class RecycledNumber 
{
	public static void main(String[] args) throws IOException
	{
		//open the file
		FileReader reader = new FileReader(args[0]);	   		
		BufferedReader input = new BufferedReader(reader);
		
		FileWriter fOut = new FileWriter("out.txt", false);
		BufferedWriter out = new BufferedWriter(fOut);
			
		//first line is the number of test cases
		int testCases = Integer.parseInt(input.readLine());
					
		for(int i = 0; i < testCases; i++)
		{			
			String line = input.readLine();
			System.out.println(line);
			
			int answer = 0;
			
			String[] ab = line.split(" ");

			int a = Integer.parseInt(ab[0]);	
			int b = Integer.parseInt(ab[1]);
			
			int n = a;
			int m = b;
			
			//figure out the length we are dealing with
			int length = (int)(Math.log10(a)+1);
			
			HashMap<Integer,Integer> matches = new HashMap<Integer,Integer>();
			
			for(int j = n; j < m; j++)
			{
				for(int k = m; k > j; k--)
				{
					//now, shift digits from back of j and compare to k
					String shifter = String.valueOf(j);
					for(int shift = 1; shift < length; shift ++)
					{						
						String front = shifter.substring(0,shift);
						String back = shifter.substring(shift, shifter.length());
						
						//no leading zeroes after shift
						if(!back.startsWith("0"))
						{							
							int shiftedInt = Integer.parseInt(back + front);
							
							//match!
							if(shiftedInt == k 
									&& (!matches.containsKey(shiftedInt) || matches.get(shiftedInt) != j)
									)
							{
								answer++;
								matches.put(shiftedInt, j);							
							}
						}
					}				
				}
			}
						
			out.write("Case #" + (i + 1) + ": " + answer + "\n");
			System.out.println(answer);			
		}
		
		out.close();
	}
}
