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.mademoisellegeek.googlecodejam.y2012.qualround;

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

public class RecycledNumbers implements Runnable {

    BufferedReader in;
    BufferedWriter out;
    static String inputFile = "2012-qualround-C-small.in";
    static String outputFile = "2012-qualround-C-small.out";

    public void run() {

        try {
            in = new BufferedReader(new FileReader(inputFile));
            out = new BufferedWriter(new FileWriter(outputFile));
            try {
                String line = in.readLine();
                int nbCases = Integer.parseInt(line);
                for (int i=1; i<=nbCases; i++) {
                    line = in.readLine();
                    String [] lineArray = line.split(" ");
                    int min = Integer.parseInt(lineArray[0]);
                    int max = Integer.parseInt(lineArray[1]);
                    out.write("Case #" + i + ": " + solve(min, max) + "\n");
                }
            } finally {
                in.close();
            }
            out.flush();
        } catch (Exception ex) {
            ex.printStackTrace();
        }
    }

    private int solve(int min, int max) {
        HashMap recycled = new HashMap();
        for (int i=min; i<=max; i++) {
            for (int j=1; j< nbDigits(i); j++) {
                int result = move(i, j);
                if (result != i && result <= max && result >= min) {
                    int small = Math.min(result, i);
                    int big = Math.max(result, i);
                    if (!recycled.containsKey(small)) {
                        ArrayList empty = new ArrayList();
                        empty.add(big);
                        recycled.put(small,empty);
                    }
                    else {
                        ArrayList list = (ArrayList) recycled.get(small);
                        if (!list.contains(big))
                            list.add(big);
                        recycled.put(small,list);
                    }
                }
            }
        }
        int result = 0;
        for (Object list : recycled.values()) {
            result += ((ArrayList)list).size();
        }
        return result;
    }

    private int move(int i, int j) {
        String whole = String.valueOf(i);
        String suffix = whole.substring(whole.length()-j);
        String prefix = whole.substring(0, whole.length()-j);
        return Integer.parseInt(suffix+prefix);
    }

    private int nbDigits(int j) {
        return String.valueOf(j).length();

    }
}
