/*
 * 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 phase1.problemC;

import java.io.File;
import java.io.FileOutputStream;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		RecycledNumbers s = new RecycledNumbers();
		try {
			s.doIt();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	private void doIt() throws Exception {
		Scanner s = new Scanner(new File("C:\\Andre\\GCJInputs\\fase1\\p3\\C-large.in"));
		int T = Integer.valueOf(s.nextLine());
        int cont=1;
		
        Writer out = new OutputStreamWriter(new FileOutputStream("C:\\Andre\\GCJInputs\\fase1\\p3\\C-large.out"));
        
        while (cont<=T) {
        	out.write("Case #"+cont+": ");
        	String[] values = s.nextLine().split(" ");
        	out.write(String.valueOf(calculate(values[0], values[1])));
        	out.write("\n");
        	cont++;
        }
        
        out.flush();
        out.close();
	}
	
	
	private int calculate(String A, String B) {
		int r = 0;
		
		String c = A;
		
		if (c.length()==1) {
			return r;
		}
		
		int cont = Integer.parseInt(c)-1;
		int fim = Integer.parseInt(B);
		
		while (cont++<fim) {
			String nc = String.valueOf(cont);
			
			if (numerosIguais(nc)) continue;
									
			r = r+gira(String.valueOf(cont), B);
		}
		
		return r;		 
	}
	
	private int gira(String n, String B) {
		int len = n.length()-1;
		int qd = 0;
		int d1 = Integer.parseInt(n.substring(0, 1));
		int resp = 0;
		
		String linha = "";
		Set<String> linhas = new HashSet<String>();
		
		while (qd++<len){
			int pd = Integer.parseInt(n.substring(qd, qd+1));
			String m = n.substring(qd)+n.substring(0,qd);
			if (m.length()!=len+1) continue;
			
			linha = linha+ n + ", " + m;
			if (pd<d1) continue;
						
			if (Integer.parseInt(m) > Integer.parseInt(B)) continue;
			if (Integer.parseInt(n) < Integer.parseInt(m)) {
				linhas.add(linha);
			}
			linha="";
		}
		
		resp=linhas.size();
		return resp;
	}
	
	private boolean numerosIguais(String s) {
		int cont=10;
		cont = cont + s.indexOf('0') + s.indexOf('1') + s.indexOf('2') + s.indexOf('3') + s.indexOf('4') + s.indexOf('5')
			+ s.indexOf('6') + s.indexOf('7') + s.indexOf('8') + s.indexOf('9');
				
		if (cont>2) return false;
		return true;
	}

}













