/*
 * Problem C. Recycled Numbers
 * 
 * Do you ever become frustrated with television because you keep seeing the
 * same things, recycled over and over again? Well I personally don't care about
 * television, but I do sometimes feel that way about numbers.
 * 
 * Let's 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 in order to be a recycled
 * pair. Neither n nor m can have leading zeros.
 * 
 * Given integers A and B with the same number of digits and no leading zeros,
 * how many distinct recycled pairs (n, m) are there with A â¤ n < m â¤ B?
 * 
 * Input
 * 
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing the integers A
 * and B.
 * 
 * Output
 * 
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1), and y is the number of recycled pairs (n, m)
 * with A â¤ n < m â¤ B.
 * 
 * Limits
 * 
 * 1 â¤ T â¤ 50.
 * 
 * A and B have the same number of digits.

Small dataset

1 â¤ A â¤ B â¤ 1000.

Large dataset

1 â¤ A â¤ B â¤ 2000000.

Sample


Input 
 	
Output 
 
4
1 9
10 40
100 500
1111 2222
Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287
 */

package google.codejam.y2012.qualifications;

import google.codejam.commons.Utils;

import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author Marco Lackovic <marco.lackovic@gmail.com>
 * @version 1.0, Apr 14, 2012
 */
public class RecycledNumbers {

	private static final String INPUT_FILE_NAME = "C-large.in";
	private static final String OUTPUT_FILE_NAME = "C-large.out";

	public static void main(String[] args) throws IOException {
		String[] input = Utils.readFromFile(INPUT_FILE_NAME);
		String[] output = new String[input.length];
		int x = 0;
		for (String line : input) {
			StringTokenizer st = new StringTokenizer(line);
			int a = Integer.valueOf(st.nextToken());
			int b = Integer.valueOf(st.nextToken());
			System.out.println("Computing case #" + (x + 1));
			output[x++] = "Case #" + x + ": " + recycledNumbers(a, b);
		}
		Utils.writeToFile(output, OUTPUT_FILE_NAME);
	}

	private static int recycledNumbers(int a, int b) {
		int count = 0;
		for (int n = a; n < b; n++) {
			count += getNumGreaterRotations(n, b);
		}
		return count;
	}

	private static int getNumGreaterRotations(int n, int b) {
		int count = 0;
		char[] chars = Integer.toString(n).toCharArray();
		for (int i = 0; i < chars.length; i++) {
			chars = rotateRight(chars);
			if (chars[0] != '0') {
				int m = Integer.valueOf(new String(chars));
				if (n == m) {
					break;
				} else if (n < m && m <= b) {
					count++;
				}
			}
		}
		return count;
	}

	private static char[] rotateRight(char[] chars) {
		char last = chars[chars.length - 1];
		for (int i = chars.length - 2; i >= 0; i--) {
			chars[i + 1] = chars[i];
		}
		chars[0] = last;
		return chars;
	}

}

package codejam2012.qualified;

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

public class ProblemC {
	static BitSet bit = new BitSet();

	static BufferedReader buffReader = null;
	static BufferedWriter buffWriter = null;
	static FileReader fileReader = null;
	static FileWriter fileWriter = null;
	static String input_test = "/home/qimeng/problemC.test";
	static String input_small =  "/home/qimeng/C-small-attempt0.in";
	static String input_large = "/home/qimeng/C-large.in";
	static int com = 0;
	static int result = 0;
	//	static int a = 0;
	//	static int b = 0;
	static HashMap<Integer, Integer> hashMap = new HashMap<Integer,Integer>();

	public static final void main(String[] args){
		try {
			//fileReader = new FileReader(input_test);
			//fileReader = new FileReader(input_small);
			fileReader = new FileReader(input_large);
			buffReader = new BufferedReader(fileReader);
			fileWriter = new FileWriter("/home/qimeng/problemC.out");
			buffWriter = new BufferedWriter(fileWriter);

			int total_size = Integer.parseInt(buffReader.readLine());
			//iterate through every input line
			for(int i=1; i<=total_size; i++){
				String[] str = buffReader.readLine().split(" ");
				int a = Integer.parseInt(str[0]);
				int b = Integer.parseInt(str[1]);


				System.out.println("Case #" +i+": " + recycleAlgorithm(a,b));
				buffWriter.write("Case #" +i+": " + recycleAlgorithm(a,b));
				buffWriter.newLine();
				buffWriter.flush();
			}


		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				buffWriter.flush();		
				buffWriter.close();
				buffReader.close();
				fileReader.close();
				fileWriter.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
	}

	public static int recycleAlgorithm(int a,int b){
		int count=0;
		for (int i=b;i>=a;i--){
			ArrayList<Integer> permutations = getPermutations(i+"");
			for (Integer ti : permutations){
				if (ti>=a && ti<=b && ti<i){
					count++;
				}
			}
		}
		return count;
	}

	public static ArrayList<Integer> getPermutations(String i){
		ArrayList<Integer> permutations = new ArrayList<Integer>();
		String shift=i.substring(1)+i.substring(0,1);
		while (!shift.equalsIgnoreCase(i)){
			int parsedInt=Integer.parseInt(shift);
			int digits=new String(parsedInt+"").length();
			if (digits==i.length()){
				permutations.add(parsedInt);
			}
			shift=shift.substring(1)+shift.substring(0,1);
		}
		return permutations;
	}



	//	private static int recycleAlgorithm(int a, int b){
	//		result = 0;
	//
	//		for(int i=a; i<=b; i++){
	//			com = 0;
	//			String str_i = Integer.toString(i);
	//			int len_i = str_i.length();
	//			// chars --> all combinations
	//			// all combinations --> numbers
	//			// 
	//			// for all numbers:
	//			// 		check each number if in range
	//			// 		if so, setbit(number), com++
	//			//
	//			//result + all pairs from com
	//			showPattern("", str_i);
	//
	//		}
	//
	//		return result;	
	//	}

	//	private static void showPattern(String st, String chars) {
	//		if (chars.length() <= 1){
	//			//System.out.println(st + chars);
	//			int num = Integer.parseInt(st+chars);
	//			if(num>= a && num<=b){
	//				bit.set(num);
	//			}
	//			com++;
	//		}
	//		else{
	//			for (int i = 0; i < chars.length(); i++) {
	//				try {
	//					String newString = chars.substring(0, i)
	//							+ chars.substring(i + 1);
	//					showPattern(st + chars.charAt(i), newString);
	//				} catch (Exception e) {
	//					e.printStackTrace();
	//				}
	//			}
	//		}
	//	}

	//	private static int permutation(int x){
	//		return fact(x) / fact(x-2);		
	//	}

	//	private static int fact(int x) {
	//		if(hashMap.containsKey(x)){ 
	//			return hashMap.get(x);
	//		}
	//		else {
	//			int re = 0;
	//			if(x == 0) return 0;
	//			else if(x == 1) return 1;
	//			else {
	//				re = x*fact(x-1);
	//				hashMap.put(x, re);
	//				return re;
	//			}		
	//		}
	//	}
}
