import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Q3M {
	public static void main(String[] args) throws Exception {
		compute();
	}

	private static void compute() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(new File(
				"C:\\work\\Q3\\C-small-attempt0.in")));
		String line = null;
		int i = Integer.parseInt(br.readLine());
		List l = new ArrayList();
		for (int j = 0; j < i; j++) {
			line = br.readLine();
			String[] nums = line.split(" ");
			l.add(calculate(nums));
		}
		writeOutput(l);
	}

	private static int calculate(String[] nums) {
		int min = Integer.parseInt(nums[0]);
		int max = Integer.parseInt(nums[1]);
		int count = 0;
		List l = new ArrayList();
		for (int i = min; i <= max; i++) {
			for (int times = 1; times < countDigits(i); times++) {
				int res = shiftNum(i, times);
				if (res <= max && i < res) {
					if ((!l.contains((i + ":" + res)))) {
						l.add(i + ":" + res);
						l.add(res + ":" + i);
						count++;
					}
				}
			}
		}
		return count;
	}

	private static boolean checkZeros(int temp, int res) {
		if (temp % 10 == 0 || res % 10 == 0)
			return false;
		return true;
	}

	private static int shiftNum(int n, int times) {
		int base = (int) Math.pow(10, times);
		int temp2 = n / base;
		int placeHolder = (int) Math.pow((double) 10,
				(double) countDigits(temp2));
		int res = placeHolder * (n % base) + temp2;
		if (countDigits(res) == countDigits(n)) {
			return res;
		} else {
			return 2000001;
		}
	}

	public static int countDigits(int x) {
		if (x < 10)
			return 1;
		else {
			return 1 + countDigits(x / 10);
		}
	}

	private static void writeOutput(List l) throws Exception {
		StringBuffer b = new StringBuffer();
		int i = 1;
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(
				"C:\\work\\Q3\\ans.txt")));
		for (Iterator iterator = l.iterator(); iterator.hasNext();) {
			br.write("Case #" + i++ + ": " + iterator.next());
			br.newLine();
		}
		br.close();
	}

}
package recycledNumbers;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {

	private String inputPath;
	private String outputPath;
	private ArrayList<String> inputLines;
	private ArrayList<String> outputLines = new ArrayList<String>();
	
	public RecycledNumbers(String inputPath){
		
		try 
		{
			this.inputPath = inputPath;
			this.outputPath = inputPath.replace(".in", ".out");
			this.inputLines = openFile();
			
			findSolution();
			
			generateOutputFile();
		} 
		catch (IOException e) 
		{			
			e.printStackTrace();
		}	
	}
	
	private ArrayList<String> openFile() throws IOException
	{
		ArrayList<String> lines = new ArrayList<String>();
		FileReader fr = new FileReader(this.inputPath);
		BufferedReader br = new BufferedReader(fr);
		String zeile = null;
		
		while ((zeile = br.readLine()) != null)
		{
			lines.add(zeile);
		}
		br.close();
		
		return lines;
	}	
	
	private void generateOutputFile() throws IOException
	{
		FileWriter fw = new FileWriter(outputPath);
		PrintWriter pw = new PrintWriter(fw);
		
		for (String string : outputLines) {
			//System.out.println(string);	
			pw.println(string);
		}	
		
		pw.close();
	}
	
	private void findSolution()
	{
		
		
		for (int i=1; i<inputLines.size(); i++)
		{		
			Set<String> gefunden = new HashSet<String>();
			
			Integer m = 0;				
			String inp = inputLines.get(i);
			String outp = "Case #" + i + ": ";
			Integer A = Integer.parseInt( inp.split(" ")[0] );
			Integer B = Integer.parseInt( inp.split(" ")[1] );			
			
			for (Integer n=A; n<B; n++){					
				String N = n.toString();
				
				for (int j=1; j<N.length(); j++){
					String M = N.substring(j) + N.substring(0, j);
					if (!M.startsWith("0") && N.length() == M.length()) 
								m =  Integer.parseInt(M);					
										
					if (!M.startsWith("0") && m>n){
						if (m<=B){
							gefunden.add(n+"<->"+m);							
						}
					}					
				}
			}			
			outp += gefunden.size();
			outputLines.add(outp);
		}
	}
	
	public static void main(String[] args) {
		//new RecycledNumbers("src/recycledNumbers/sample.in");
		new RecycledNumbers("src/recycledNumbers/C-small-attempt0.in");

	}
}

