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

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

package cycles;

import java.io.File;

import io.Reader;

public class CycloMatic {
	public static void main(String[] args){
		new CycloMatic();
	}
	
	public CycloMatic(){
		String[] lines = Reader.getInput(new File("C-small-attempt0.in"));
		
		
		for(int i = 0; i < lines.length; i++){
			String line = lines[i];
			String[] lineParts = line.split(" ");
			int bottom = Integer.parseInt(lineParts[0]);
			int top = Integer.parseInt(lineParts[1]);
			int sum = 0;
			for(int j = bottom; j<top; j++){
				int q = numCycles(j,top);
				if (q!=0){
					sum+=q;
				}
			}
			System.out.println("Case #"+(i+1)+": "+sum);
		}
			
		
	}
	
	public int numCycles(int original, int max){
		int counter = 0;
		String newIntS = cycle(original);
		int newInt = Integer.parseInt(newIntS);
		for (int i = 0; i < (original+"").length();i++){
			if(newInt>original && newInt<=max){
				counter++;
			}
			newIntS = cycle(newIntS);
			newInt = Integer.parseInt(newIntS);
		}
		return counter;
	}
	
	
	public String cycle(int j){
		return cycle(j+"");
	}
	
	public String cycle(String j){
		String s = j+"";
		char ss=s.charAt(s.length()-1);
		s = s.substring(0,s.length()-1);
		return ss+s;
	}
}
