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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;




public class testapp {

	/**
	 * @param args
	 */
	
	public static void main(String[] args) {
		 StringBuilder contents = new StringBuilder();
		 int totalCase=0;
		 int aVar[]=null,bVar[]=null;
		 int loop=-1;
		 
		    
		    try {
		    String aFile="c:\\testapp.txt";
		      BufferedReader input =  new BufferedReader(new FileReader(aFile));
		      try {
		        String line = null; 
		        while (( line = input.readLine()) != null){
		          if(loop==-1)
		          {
		        	  System.out.println(line.trim());
		        	totalCase =Integer.parseInt(line);
		        	aVar =new int[totalCase];
		        	bVar =new int[totalCase];
		        	loop++;
		        	continue;
		          }
		          String[] result = line.split("\\s");
		          aVar[loop]=Integer.parseInt(result[0]);
		          bVar[loop]=Integer.parseInt(result[1]);
		          loop++;
		        }
		      }
		      finally {
		        input.close();
		      }
		    }
		    catch (IOException ex){
		      ex.printStackTrace();
		    }
		
		
		for(int caseid=0;caseid<totalCase;caseid++)
		{
			int a=aVar[caseid];
			int b=bVar[caseid];
			int num=a;
		
		ArrayList<String> matchlist=new ArrayList<String>();
	
		while(num<=b)
		{
			
		checkpairs(num,a,b,matchlist);
		num++;
			
		}
		
		System.out.println("Case #"+(caseid+1)+": "+matchlist.size());
		}

	}
	
	public static int checkpairs(int num,int a, int b,ArrayList<String> matchlist)
	{
		int count=0;
		int rnd=1;
		int m;
		double div;
		int size=String.valueOf(num).trim().length();
		while(rnd<size)
		{
			
			div=num/Math.pow(10, rnd);
			m=(int)(num%Math.pow(10, rnd)*Math.pow(10, size-rnd))+(int)(Math.floor(div));
	
			if(m>=a && m<=b && m!=num )
			{
				if(!(matchlist.contains(num+"-"+m)|| matchlist.contains(m+"-"+num)))
					matchlist.add(num+"-"+m);
			}
			
			rnd++;
		}
	
		return count;
	}

}
