/*
 * 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 C;

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

public class C {
	private ArrayList<Integer> shift1 = new ArrayList<Integer>(2000000);
	private ArrayList<Integer> shift2 = new ArrayList<Integer>(2000000);
	private ArrayList<Integer> shift3 = new ArrayList<Integer>(2000000);
	private ArrayList<Integer> shift4 = new ArrayList<Integer>(2000000);
	private ArrayList<Integer> shift5 = new ArrayList<Integer>(2000000);
	private ArrayList<Integer> shift6 = new ArrayList<Integer>(2000000);
	
	public static void main(String[] args) {
		C c = new C();
		c.run(args[0], "result");
	}
	
	public C() {
		for (int i = 0; i < 2000000; i++) {
			if (i > 9) {
				if (i > 999999) {
					shift1.add(i % 1000000 * 10 + i / 1000000);
				} else if (i > 99999) {
					shift1.add(i % 100000 * 10 + i / 100000);
				} else if (i > 9999) {
					shift1.add(i % 10000 * 10 + i / 10000);
				} else if (i > 999) {
					shift1.add(i % 1000 * 10 + i / 1000);
				} else if (i > 99) {
					shift1.add(i % 100 * 10 + i / 100);
				} else {
					shift1.add(i % 10 * 10 + i / 10);
				}
			} else {
				shift1.add(9999999);
			}
		}
		for (int i = 0; i < 2000000; i++) {
			if (i > 99) {
				if (i > 999999) {
					shift2.add(i % 100000 * 100 + i / 100000);
				} else if (i > 99999) {
					shift2.add(i % 10000 * 100 + i / 10000);
				} else if (i > 9999) {
					shift2.add(i % 1000 * 100 + i / 1000);
				} else if (i > 999) {
					shift2.add(i % 100 * 100 + i / 100);
				} else {
					shift2.add(i % 10 * 100 + i / 10);
				}
			} else {
				shift2.add(9999999);
			}
		}
		for (int i = 0; i < 2000000; i++) {
			if (i > 999) {
				if (i > 999999) {
					shift3.add(i % 10000 * 1000 + i / 10000);
				} else if (i > 99999) {
					shift3.add(i % 1000 * 1000 + i / 1000);
				} else if (i > 9999) {
					shift3.add(i % 100 * 1000 + i / 100);
				} else {
					shift3.add(i % 10 * 1000 + i / 10);
				}
			} else {
				shift3.add(9999999);
			}
		}
		for (int i = 0; i < 2000000; i++) {
			if (i > 9999) {
				if (i > 999999) {
					shift4.add(i % 1000 * 10000 + i / 1000);
				} else if (i > 99999) {
					shift4.add(i % 100 * 10000 + i / 100);
				} else {
					shift4.add(i % 10 * 10000 + i / 10);
				}
			} else {
				shift4.add(9999999);
			}
		}
		for (int i = 0; i < 2000000; i++) {
			if (i > 99999) {
				if (i > 999999) {
					shift5.add(i % 100 * 100000 + i / 100);
				} else {
					shift5.add(i % 10 * 100000 + i / 10);
				}
			} else {
				shift5.add(9999999);
			}
		}
		for (int i = 0; i < 2000000; i++) {
			if (i > 999999) {
				shift6.add(i % 10 * 1000000 + i / 10);
			} else {
				shift6.add(9999999);
			}
		}
	}
	
	public void run(String inputFile, String outputFile) {
		FileReader fileReader = null;
		BufferedReader bufferedReader = null;
		
		String directory = this.getClass().getResource("").getPath() + "\\";
		inputFile = directory + inputFile;
		outputFile = directory + outputFile;
		
		try {
			fileReader = new FileReader(inputFile);
			bufferedReader = new BufferedReader(fileReader);
		} catch (Exception e) {
			e.printStackTrace();
			return;
		}
		
		if (bufferedReader != null) {
			int testCount = 0;
			try {
				testCount = Integer.parseInt(bufferedReader.readLine());
			} catch (Exception e) {
				e.printStackTrace();
				return;
			}
			
			StringBuilder builder = new StringBuilder(3400);
			
			for (int i = 1; i <= testCount; i++) {
				if (i > 1) {
					builder.append("\r\n");
				}
				builder.append("Case #");
				builder.append(i);
				builder.append(": ");
				
				String input = null;
				try {
					input = bufferedReader.readLine();
				} catch (Exception e) {
					e.printStackTrace();
					return;
				}
				
				int count = 0;
				if (input != null) {
					String[] strs = input.split(" ");
					int start = 0;
					int end = 0;
					
					try {
						start = Integer.parseInt(strs[0]);
						end = Integer.parseInt(strs[1]);
						System.out.print(start);
						System.out.print(' ');
						System.out.println(end);
					} catch (Exception e) {
						e.printStackTrace();
						break;
					}
					
					for (int j = start; j < end; j++) {
						int test1 = shift1.get(j);
						int test2 = shift2.get(j);
						int test3 = shift3.get(j);
						int test4 = shift4.get(j);
						int test5 = shift5.get(j);
						int test6 = shift6.get(j);
						
						
						if (test1 > j && test1 <= end) {
							count++;
						} else {
							test1 = 0;
						}
						if (test2 > j && test2 <= end && test1 != test2) {
							count++;
						} else {
							test2 = 0;
						}
						if (test3 > j && test3 <= end && test1 != test3 && test2 != test3) {
							count++;
						} else {
							test3 = 0;
						}
						if (test4 > j && test4 <= end && test1 != test4 && test2 != test4 && test3 != test4) {
							count++;
						} else {
							test4 = 0;
						}
						if (test5 > j && test5 <= end && test1 != test5 && test2 != test5 && test3 != test5 && test4 != test5) {
							count++;
						} else {
							test5 = 0;
						}
						if (test6 > j && test6 <= end && test1 != test6 && test2 != test6 && test3 != test6 && test4 != test6 && test5 != test6) {
							count++;
						}
					}
				}
				builder.append(count);
			}
			
			//System.out.println(builder.toString());
			try {
				FileWriter writer = new FileWriter(outputFile);
				writer.append(builder.toString());
				writer.flush();
				writer.close();
			} catch (Exception e) {
				e.printStackTrace();
				return;
			}
			
			try {
				bufferedReader.close();
				fileReader.close();
			} catch (Exception e) {
				e.printStackTrace();
			}
		}
	}
}