/*
 * 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.codejam.two12.RecyledNumbers;

import java.util.HashSet;

import com.jp.common.Puzzle;

public class RecycledNumbers implements Puzzle {

  private HashSet<Integer> checkedElementSet = new HashSet<Integer>();
  private HashSet<Pair> ListOfPairs = new HashSet<Pair>();
  private int startNumber;
  private int endNumber;
  
  @Override
  public String[] solve(String[] dataSet) {
    processInput(dataSet);
    
    String result[] = new String[1];  
    result[0] = String.valueOf(ListOfPairs.size());
   // System.out.println(ListOfPairs);
    return result;
  
  }
  
  public void processInput(String[] dataSet){
      String data[] = dataSet[0].split(" ");
     startNumber = Integer.parseInt(data[0]);
     endNumber = Integer.parseInt(data[1]);
     
     for (int i = startNumber; i <= endNumber; i++){
       if(hasBeenProcessed(i)){
         continue;
       }
       
       if (i < 10 ){
         continue;
       }
       
       if (i >= 10 && i < 100 ){
         int reverse = reverseInt(i) ;
         checkedElementSet.add(i);
         checkedElementSet.add(reverse);
         
         checkAndCreatePair(i,reverse);
       }
       
       if (i >= 100 &&  i <= 1000 ){
         int reverse = reverseInt(i) ;
         int reverse1 = reverseInt(reverse);
         
         checkedElementSet.add(i);
         checkedElementSet.add(reverse);
         checkedElementSet.add(reverse1);
         
         checkAndCreatePair(i,reverse);
         checkAndCreatePair(i,reverse1);
         checkAndCreatePair(reverse,reverse1);
         checkAndCreatePair(reverse,i);
         checkAndCreatePair(reverse1,reverse);
         checkAndCreatePair(reverse1,i);
       }
       
       if (i > 1000 &&  i < 10000 ){
         int reverse = reverseInt(i) ;
         int reverse1 = reverseInt(reverse);
         int reverse2 = reverseInt(reverse1);
         
         checkedElementSet.add(i);
         checkedElementSet.add(reverse);
         checkedElementSet.add(reverse1);
         checkedElementSet.add(reverse2);
         
         checkAndCreatePair(i,reverse);
         checkAndCreatePair(i,reverse1);
         checkAndCreatePair(i,reverse2);
         checkAndCreatePair(reverse,i);
         checkAndCreatePair(reverse,reverse1);
         checkAndCreatePair(reverse,reverse2);
         checkAndCreatePair(reverse1,i);
         checkAndCreatePair(reverse1,reverse);
         checkAndCreatePair(reverse1,reverse2);
         checkAndCreatePair(reverse2,i);
         checkAndCreatePair(reverse2,reverse);
         checkAndCreatePair(reverse2,reverse1);
         
       }


     }
     
  }
  
  
  public void checkAndCreatePair(int i, int reverse){
    if(i>= startNumber && reverse >= startNumber && i <= endNumber && reverse <= endNumber && i < reverse){
      Pair p = new Pair(i,reverse);
      ListOfPairs.add(p);
    }
  }
  
  public int reverseInt(int input){
    String strInput = String.valueOf(input);
    char lastNum = strInput.charAt(strInput.length()-1);
    String strOutput = lastNum + strInput.substring(0, strInput.length() -1 );
    int output = Integer.parseInt(strOutput);
    return output;
  }
  
  public boolean hasBeenProcessed(int input){
    if (checkedElementSet.contains(input)){
      return true;
    }
    return false;
  }
  
}
