/*
 * 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.google.codjam.utils;


import com.google.codjam.problems.ProblemInterface;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;

import java.io.PrintWriter;

import java.util.ArrayList;
import java.util.HashMap;

public class FileLoader {

        
    public static void processFile(FileDataAndSettings fileData,String fileName,int nlinesXCaseGlobal,ProblemInterface worker)
    {
        try  
        {
            PrintWriter p = new PrintWriter (new File( fileName.replace(".in",".out")));
            
            BufferedReader buf
                = new BufferedReader(new FileReader(new File (fileName)));
            
            String tmp = "";
            for(int i=0,nLinesXCase=0,nCase=1;true;i++) 
            { 
                tmp = buf.readLine();
                if (tmp == null) 
                    break;
                if(i==0)
                {
                    fileData.setNCases(Integer.parseInt(tmp)); 
                }else
                {
                    ArrayList<String> dataCase = null;
                    try  
                    {
                        dataCase =fileData.getInputCase().get(nCase  -1);
                    } catch (IndexOutOfBoundsException ex)  {
                        fileData.getInputCase().add(new ArrayList<String>(0));
                        dataCase =fileData.getInputCase().get(nCase - 1);
                    } 


                    dataCase.add(tmp);
                    nLinesXCase++;
                    
                    if(nlinesXCaseGlobal==nLinesXCase)
                    {
                        nCase++;
                        nLinesXCase = 0;
                        p.println("Case #"+(nCase - 1)+": "+worker.run(dataCase));
                    }
                    
                   
                }
    
            }
            
            p.flush();
            p.close();
        } catch (Exception ex)  {
            ex.printStackTrace();
        } finally  
        {
        
        }
        
    
    
    }
    

    

}
