/*
 * 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 lt.kasrud.gcj.common;


import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class IO {
  public static Data readFile(String filename) throws IOException {
    Data results = new Data();

    BufferedReader reader = new BufferedReader(new FileReader(filename));
    String line = null;
    while ((line = reader.readLine()) != null) {
      results.add(new Record(line));
    }

    reader.close();
    return results;
  }

  private static String formatCase(int caseNr, String output) {
    return String.format("Case #%d: %s", caseNr, output);
  }

  public static void writeFile(String filename, List data) throws IOException {
    BufferedWriter writer = new BufferedWriter(new FileWriter(filename));
    for (int i = 0; i < data.size(); i++) {
      String output = formatCase(i + 1, data.get(i).toString());
      writer.write(output + "\n");
    }
    writer.close();
  }

  public static class Data {
    List<Record> records = new ArrayList<Record>();

    public void add(Record record){
      records.add(record);
    }

    public String getString(int recNr, int i){
      Record record = records.get(recNr);
      return record.getString(i);
    }

    public Integer getInt(int recNr, int i){
      Record record = records.get(recNr);
      return record.getInt(i);
    }

    public List<Record> getRecords(int from){
      return getRecords(from, records.size());
    }

    public List<Record> getRecords(int from, int to){
      return records.subList(from, to);
    }

  }

  public static class Record {
    String raw;
    String[] tokens;

    Record(String raw) {
      this(raw, " ");
    }

    Record(String raw, String separator) {
      this.raw = raw;
      tokens = raw.trim().split(separator);
    }

    public String getRaw() {
      return raw;
    }

    public String getString(int i) {
      return tokens[i];
    }

    public int getInt(int i) {
      return Integer.valueOf(getString(i));
    }

    public List<String> getStringList(int from){
      return getStringList(from, tokens.length);
    }

    public List<String> getStringList(int from, int to){
      return Arrays.asList(tokens).subList(from, to);
    }

    public List<Integer> getIntList(int from){
      return getIntList(from, tokens.length);
    }

    public List<Integer> getIntList(int from, int to){
      List<String> strings = Arrays.asList(tokens).subList(from, to);
      List<Integer> ints = new ArrayList<Integer>(strings.size());
      for (String s : strings){
        ints.add(Integer.valueOf(s));
      }
      return ints;
    }
  }
}
