import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
package com.bchetty.gcj2012;

import java.io.*;
import java.util.ArrayList;
import java.util.HashSet;

/**
 *
 * @author Babji Prashanth, Chetty
 */
public class RecycledNumbers {
    public static void main(String[] args) {
        RecycledNumbers recycledNums = new RecycledNumbers();
        LineNumberReader lineNumberReader = null;
        BufferedWriter bufferedWriter = null;

        try {
            lineNumberReader = new LineNumberReader(new FileReader("/Users/babjichetty/Downloads/C-small-attempt0.in"));
            bufferedWriter = new BufferedWriter(new FileWriter("/Users/babjichetty/Downloads/C-small.out.txt"));
            String line = null;
            int index = 0;
            int count = 0;

            while ((line = lineNumberReader.readLine()) != null) {
                if(index == 0) {
                    count = Integer.parseInt(line);
                    System.out.println("Count : " + count);
                    index++;
                    continue;
                }
                if(index > count) {
                    break;
                }
                String[] arr = line.split(" ");
                int A = Integer.parseInt(arr[0]);
                int B = Integer.parseInt(arr[1]);
                
                bufferedWriter.write("Case #" + index + ": " + recycledNums.findNumberOfPairs(A, B));
                bufferedWriter.newLine();
                index++;
                
            }
        } catch (FileNotFoundException ex) {
            ex.printStackTrace();
        } catch (IOException ex) {
            ex.printStackTrace();
        } finally {
            //Close the BufferedWriter
            try {
                if (lineNumberReader != null) {
                    lineNumberReader.close();
                }
                if (bufferedWriter != null) {
                    bufferedWriter.close();
                }
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }
    }
    
    public int findNumberOfPairs(int A, int B) {
        int res = 0;
        
        for(int i=A;i<=B;i++) {
            HashSet<Integer> partnerSet = new HashSet<Integer>();
            String input = "" + i;
            System.out.println("Num : " + input);
            int len = input.length();
            int count = len-1;
            
            for(int j=0;j<count;j++) {
                int partner = Integer.parseInt(input.substring(count-j) + input.substring(0, count-j));
                if(!partnerSet.contains(partner) && partner > i && partner <= B && ("" + partner).length() == len) {
                    System.out.println("Partner Found : " + partner);
                    res++;
                    partnerSet.add(partner);
                }
            }
        }
        
        System.out.println("Num of pairs : " + res);
        
        return res;
    }
}
