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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


package com.google.codejam2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;



public class CRecycledNumbers {
	private void go() throws IOException {
		String fileIn = "resources/codejam2012/C-small-attempt0.in";
		String fileOut = fileIn.replace(".in", ".out");
		
		BufferedWriter w = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(fileOut))); 
		
		BufferedReader r = new BufferedReader(new InputStreamReader(new FileInputStream(fileIn)));
		int count = Integer.parseInt(r.readLine());
		for(int i = 0; i < count; i++) {
			String out = processCase(r.readLine());
			out = "Case #" + (i + 1) + ": " + out;
			System.out.println(out);
			w.write(out + "\n");
		}		

		w.close();
		r.close();
	}
	

	private Set<Integer> getRecycled(int n) {
		Set<Integer> recycled = new HashSet<Integer>();
		
		String sn = String.valueOf(n);

		for(int i = 1; i < sn.length(); i++) {
			String newN = sn.substring(i) + sn.substring(0, i);
			if (!newN.startsWith("0") && !newN.equals(sn)) {
				recycled.add(Integer.parseInt(newN));
			}
		}
		
		return recycled;
	}
	
	private String processCase(String text) {
		Scanner scanner = new Scanner(text);
		int a = scanner.nextInt();
		int b = scanner.nextInt();

		int out = 0;
		
		for(int i = a; i < b; i++) {
			Set<Integer> recycled = getRecycled(i);
			for(Integer rec : recycled) {
				int r = rec;
				if ((r >i) && (r <= b)) out++;
			}
		}
		
		return String.valueOf(out);
	}



	public static void main(String[] args) throws Exception {
		long now = System.currentTimeMillis();
		new CRecycledNumbers().go();
		System.out.println(String.valueOf(System.currentTimeMillis() - now) + "ms");
	}
}