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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;

public class RecycleNumbers {

	private static FileReader fr;
	private static BufferedWriter bw;
	private static List<String> output = new ArrayList<String>();
	private static Map<Integer, String> input;

	public static void main(String args[]) {

		try {
			RecycleNumbers.fileRead();
			RecycleNumbers.coreLogic();
			RecycleNumbers.fileWrite();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	private static void fileRead() throws IOException {
		try {
			fr = new FileReader("D:/data/C-small-attempt0.in");
			BufferedReader br = new BufferedReader(fr);
			input = new HashMap<Integer, String>();
			String line;
			int counter = 1;
			while ((line = br.readLine()) != null) {
				input.put(counter, line);
				counter++;
			}
			System.out.println(input);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}

		finally {
			fr.close();
		}

	}

	private static void fileWrite() throws IOException {
		int counter = 1;
		try {
			bw = new BufferedWriter(new FileWriter(new File("D:/data/output.txt"), true));
			for (String writeLine : output) {
				bw.write("Case #" + counter + ": ");
				bw.write(writeLine);
				bw.newLine();
				counter++;
			}
			bw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}

	}

	private static void coreLogic() {
		int noOfCases = Integer.valueOf(input.remove(Integer.valueOf("1")));
		System.out.println("Number of Cases: " + noOfCases);
		StringBuffer outputString;
		for (int counter = 2; counter <= noOfCases + 1; counter++) {
			outputString = new StringBuffer();
			String processLine = input.get(Integer.valueOf(counter));
			if (processLine != null) {
				while (processLine != null) {
					System.out.println("################Case #: " + (counter - 1) + "########################################");
					System.out.println("Processing line: " + processLine);
					outputString.append(processString(processLine));
					break;
				}
				output.add(outputString.toString());
			}

		}
	}

	private static String processString(String processLine) {
		StringTokenizer strToken = new StringTokenizer(processLine, " ");
		String start = "";
		String end = "";
		int output = 0;
		start = strToken.nextToken();
		end = strToken.nextToken();
		System.out.println("Start: " + start);
		System.out.println("End: " + end);
		int modulus = 10;
		int length = start.length();
		int counterLength = start.length();
		int startNumber = Integer.parseInt(start);
		int endNumber = Integer.parseInt(end);
		List<Integer> finalOutput = new ArrayList<Integer>();
		//Set<Integer> finalOutput = new HashSet<Integer>();
		if (startNumber >= 10) {
			while (true) {
				System.out.println("Length : " + length);
				System.out.println("Modulus Length : " + String.valueOf(modulus).length());
				if (length >= String.valueOf(modulus).length()) {
					for (int counter = startNumber; counter <= endNumber; counter++) {
						int numberA = counter;
						int calculation = (int) (((numberA % modulus) * Math.pow(10, counterLength -  1)) + (numberA / modulus));
						if ((calculation > numberA) && (calculation <= endNumber)) {
							System.out.println("@@@Number a: " + numberA + "  Calculation: " + calculation + "    Ouput: " + (output++));
							finalOutput.add(numberA);
						}
					}
				} else {
					break;
				}
				modulus = modulus * 10;
				counterLength = counterLength - 1;
			}

		}
		return String.valueOf(finalOutput.size());
	}
}
