package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

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

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

package qC;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

import qB.B.Pair;

//Letfs say a pair of distinct positive integers (n, m) is recycled 
//if you can obtain m by moving some digits from the back of n to the 
//front without changing their order. For example, (12345, 34512) is a 
//recycled pair since you can obtain 34512 by moving 345 from the end 
//of 12345 to the front. Note that n and m must have the same number 
//of digits (excluding leading zeros) in order to be a recycled pair.

//Given integers A and B with the same number of digits, how many distinct
//recycled pairs (n, m) are there with A ? n < m ? B?

public class C2 {

	static int solve(int number, int b) {
		int numDigi = number;
		int orgNumber = number;
		int c = 1;
		int p = 1;
		int counter = 0;

		do {
			numDigi = numDigi / 10;
			p = p * 10;
			c++;
		} while (numDigi != 0);
		int k = c - 1;
		p = p / 10;

		for ( int i = 1; i <= k; i++) {
			number = number % p * 10 + number / p;
			if (number > orgNumber && number <= b) {
				// System.out.println( "no: " + number + ", " + check);
				counter++;
			}
		}
		return counter;
	}

	public static void main(String[] args) throws FileNotFoundException {
		if (args.length == 0) {
			throw new IllegalArgumentException("no file given");
		}
		String filename = args[0];
		Scanner scanner = new Scanner(new File(filename));
		int numOfLines = scanner.nextInt();
		scanner.nextLine();

		for (int lineIdx = 0; lineIdx < numOfLines; lineIdx++) {
			final int start = scanner.nextInt();
			final int end = scanner.nextInt();
			int ans = 0;
			for (int l = start; l <= end; l++) {
				ans += solve(l, end);
			}
			System.out.printf("Case #%d: %d\n", lineIdx + 1, ans);
		}
	}
}
