/*
 * 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 com.cj.rn;

import com.cj.utils.*;
import java.io.*;
import java.util.Scanner;

public class RecycledNumbers {

	int from;
	int to;
	public String getResult(int caseNo, int from, int to){
		int tempFrom = from;
		int result = 0;
		while(tempFrom<to){
			for(int count=1;(tempFrom+count)<=to;count++){
				int n = tempFrom; 
				String nS = Integer.toString(n);
				int m = tempFrom+count;
				String mS = Integer.toString(m);
				boolean flag = true;
				for(int i=0;i<nS.length();i++){
					if(countOccurrences(mS, nS.charAt(i))!=countOccurrences(nS, nS.charAt(i))){
						flag = false;
					}
				}
				if(flag){
					for(int i=1; i<nS.length(); i++){
						String temp = nS.substring(i)+nS.substring(0, i);
						if(temp.equals(mS)){
							flag = true;
							break;
						}
						else
							flag = false;
					}
				}
				if(flag){
					result++;
					//System.out.println(nS+"<>"+mS);
					}
			}
		tempFrom++;
		}
		return "Case #"+caseNo+": "+result;
	}
	public static int countOccurrences(String haystack, char needle)
	{
	    int count = 0;
	    for (int i=0; i < haystack.length(); i++)
	    {
	        if (haystack.charAt(i) == needle)
	        {
	             count++;
	        }
	    }
	    return count;
	}
	public static void main(String[] args){
		RecycledNumbers obj = new RecycledNumbers();
		System.out.println(obj.getResult(1, 1111, 2222));
		InputReader ir = new InputReader();
        Scanner input = ir.loadInput("C-small-attempt0.in");
        int cases = ir.cases;
        OutputWriter ow = new OutputWriter("C-small-attempt0.out");
        for(int count=0 ; count<cases ; count++){
            //object
        	
        	int n = input.nextInt();
        	int m = input.nextInt();
            String output = obj.getResult(count+1, n, m);

            ow.writeLine(output);
            System.out.println(output);
        }
        ow.closeFile(); 
	}
}
