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

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package code_jam_3;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;

/**
 *
 * @author Neo
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        
          int line_counter=0;
      try{
  // Open the file that is the first
  // command line parameter
  FileInputStream fstream = new FileInputStream("textfile.txt");
  DataInputStream in = new DataInputStream(fstream);
  BufferedReader br = new BufferedReader(new InputStreamReader(in));
  FileWriter ostream = new FileWriter("output.txt");
  BufferedWriter out = new BufferedWriter(ostream);

  String strLine;
  //Read File Line By Line
  while ((strLine = br.readLine()) != null)   {
  // Print the content on the console
    if(line_counter==0){  
  } else{  
        String delims = "[ ]+";
        String[] tokens = strLine.split(delims);
        int a =Integer.parseInt(tokens[0]);
        int b = Integer.parseInt(tokens[1]);
        if(a<10){
        out.write("Case #"+line_counter+": "+0);
        out.newLine();       
        }else{
            int output = 0;
            int a_lenght = String.valueOf(a).trim().length();
            if(a_lenght==2){
                for(int i =a;i<b+1;i++){
                    int n= i;
                    int b0 = n%10;
                    int m = b0*10+((n-b0)/10);
                    if(m>n&&m<b+1){
                    output = output+1;
                    }
                }
                 out.write("Case #"+line_counter+": "+output);
                  out.newLine();

            }
            if(a_lenght==3){
                for(int i =a;i<b+1;i++){
                    int n= i;
                    int b0 = n%10;
                    int m = b0*100+((n-b0)/10);
                    if(m>n&&m<b+1){
                    output = output+1;
                    }
                    b0 = n%100;
                    m = b0*10+((n-b0)/100);
                    if(m>n&&m<b+1){
                    output = output+1;
                     
                    }
                }
               out.write("Case #"+line_counter+": "+output);
                 out.newLine();

            }
            if(a_lenght==4){
             
                int m1=0,m2=0,m3=0;
                 for(int i =a;i<b+1;i++){
                  int n= i;
                  int b0 = n%10;
                  int m = (b0*1000)+((n-b0)/10);
                 if(m>n&&m<b+1){
                    output = output+1;
                       
                       m1 = m;
                    }
                  b0 = n%100;
                  m = b0*100+((n-b0)/100);
              
                  if(m>n&&m<b+1){
                   
                    m2 = m;
                  
                    output = output+1;

                     
                    }
                  b0 = n%1000;
                  m = b0*10+((n-b0)/1000);
                 
                  if(m>n&&m<b+1){
                      m3 = m;
                    if(m3!=m1){
                    output = output+1;

                   
                      }
                    }
                }
                 out.write("Case #"+line_counter+": "+output);
                 out.newLine();

            }
            if(a_lenght==5){
                 int m1=0,m2=0,m3=0,m4=0;

                for(int i =a;i<b+1;i++){
                  int n= i;
                  int b0 = n%10;
                  int m = b0*10000+((n-b0)/10);
                   if(m>n&&m<b+1){
                       m1= m;
                    output = output+1;
                    }
                  b0 = n%100;
                  m = b0*1000+((n-b0)/100);

                   if(m>n&&m<b+1){
                       m2=m;
                    output = output+1;
                    }
                  b0 = n%1000;
                  m = b0*100+((n-b0)/1000);
                  if(m>n&&m<b+1){
                      m3=m;
                      if(m3!=m1){
                    output = output+1;
                      }
                    }
                  b0 = n%10000;
                  m = b0*10+((n-b0)/10000);

                  if(m>n&&m<b+1){
                      m4 = m;
                      if(m4!= m2){
                    output = output+1;
                     }
                    }
                }

                out.write("Case #"+line_counter+": "+output);
                 out.newLine();

            }
            if(a_lenght==6){
                int m1=0,m2=0,m3=0,m4=0,m5=0;
                 for(int i =a;i<b+1;i++){
                  int n= i;
                  int b0 = n%10;
                  int m = b0*100000+((n-b0)/10);

                  if(m>n&&m<b+1){
                      m1=m;
                    output = output+1;
                   
                    }
                   b0 = n%100;
                   m = b0*10000+((n-b0)/100);
                   if(m>n&&m<b+1){
                       m2=m;
                    output = output+1;
                    }
                   b0 = n%1000;
                   m = b0*1000+((n-b0)/1000);
                   if(m>n&&m<b+1){
                       m3=m;
                       if(m3!=m1){
                    output = output+1;
                     }
                    }
                   b0 = n%10000;
                   m = b0*100+((n-b0)/10000);
                   if(m>n&&m<b+1){
                       m4=m;
                       if(m4!=m2){
                    output = output+1;
                      }
                    }
                   b0 = n%100000;
                   m = b0*10+((n-b0)/100000);
                  if(m>n&&m<b+1){
                      m5=m;
                      if(m5!=m1&&m5!=m3){
                    output = output+1;
                     }
                    }

                }

                    out.write("Case #"+line_counter+": "+output);
                     out.newLine();

            }
            if(a_lenght==7){
                 int m1=0,m2=0,m3=0,m4=0,m5=0,m6=0;

                for(int i =a;i<b+1;i++){
                  int n= i;
                  int b0 = n%10;
                  int m = b0*1000000+((n-b0)/10);

                  if(m>n&&m<b+1){
                       m1=m;
                    output = output+1;
                    }
                   b0 = n%100;
                   m = b0*100000+((n-b0)/100);

                   if(m>n&&m<b+1){
                       m2=m;
                    output = output+1;
                    }

                   b0 = n%1000;
                   m = b0*10000+((n-b0)/1000);
                   if(m>n&&m<b+1){
                       m3 = m;
                       if(m3!=m1){
                    output = output+1;
                       }
                     }
                   b0 = n%10000;
                   m = b0*1000+((n-b0)/10000);
                   if(m>n&&m<b+1){
                       m4=m;
                       if(m4!=m2){
                    output = output+1;
                      }
                    }
                   b0 = n%100000;
                   m = b0*100+((n-b0)/100000);
                   if(m>n&&m<b+1){
                       m5 =m;
                       if(m5!=m1&&m5!=m3){
                    output = output+1;
                      }
                    }
                  b0 = n%1000000;
                   m = b0*10+((n-b0)/1000000);
                   if(m>n&&m<b+1){
                       m6=m;
                       if(m6!=m2&&m6!= m4)
                    output = output+1;
                    // System.out.println("n= "+n+"b="+b+"b0="+b0+"m="+m);

                    }

                }
                  out.write("Case #"+line_counter+": "+output);
                 out.newLine();

            }
            


        }
        
       
  }
      line_counter= line_counter+1;
  }
  //Close the input stream
  in.close();
  out.close();
    }catch (Exception e){//Catch exception if any
  System.err.println("Error: " + e.getMessage());
  }
    }

}
