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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.StringTokenizer;

public class Recycle {
	
	static LinkedList<LinkedList<Integer>> db2 = new LinkedList<LinkedList<Integer>>();
public static void main(String [] args){
		
		BufferedReader br = null;
		String line="";
		if(args.length != 1){
			System.out.println("please input test file name as a command line argument");
			System.exit(0);
		}
		try{
			br = new BufferedReader(new FileReader(args[0]));
			line = br.readLine();
		} catch (IOException e) {
			e.printStackTrace();
		}
		int numOfTests = Integer.parseInt(line);
		BufferedWriter bw = null;
		try{
			FileWriter fw = new FileWriter("resultsM.txt");
			bw = new BufferedWriter(fw);
		}catch(IOException e){
			e.printStackTrace();
		}
		for(int i = 0; i < numOfTests ; i++){
			try{
				line = br.readLine();
				bw.write("Case #"+(i+1)+": ");
				bw.flush();
				bw.write(String.valueOf(checkPairs(line)));
				bw.flush();
				bw.newLine();
				bw.flush();
			}catch(IOException e){
				e.printStackTrace();
			}
		}
	}
	public static int checkPairs(String input){
		
		StringTokenizer tok = new StringTokenizer(input);
		int minRange = Integer.parseInt(tok.nextToken());
		int maxRange = Integer.parseInt(tok.nextToken());
		int digits=0;
		int tmp = minRange;
		while(tmp!=0){
			tmp/=10;
			digits+=1;
		}
		db2 = new LinkedList<LinkedList<Integer>>();
		int counter = 0;
		for(int i = minRange ; i <= maxRange ; i++){
			for(int j = 1; j < digits ; j++){
				tmp = rotate(i,j,digits);
				
				if(tmp <= maxRange && tmp >= minRange && tmp != i){
					if(checkExists2(i,tmp))
						counter++;
				}
			}
		}
		
		return counter;
	}
	public static int rotate(int toRotate, int times, int length){
		
		String rotation = String.valueOf(toRotate);
		for(int i=0;i<times;i++){
			
			rotation = rotation.charAt(length-1)+rotation.substring(0,length-1);
		}
		return Integer.parseInt(rotation);
	}
	
	public static boolean checkExists2(int base, int rotated){
		LinkedList<Integer> pair = new LinkedList<Integer>();
		if(base > rotated){
			pair.add(rotated);
			pair.add(base);
		}else{
			pair.add(base);
			pair.add(rotated);
		}
		if(db2.contains(pair)){
			return false;
		}else{
			db2.add(pair);
			return true;
		}
	}
	
	
}
