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

/**
 *
 * @author eblanco
 */
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import javax.swing.JFileChooser;

public class RecycledNumbers {

    public static String DatosArchivo[] = new String[10000];

    public static int[] convertStringArraytoIntArray(String[] sarray) throws Exception {
        if (sarray != null) {
            int intarray[] = new int[sarray.length];
            for (int i = 0; i < sarray.length; i++) {
                intarray[i] = Integer.parseInt(sarray[i]);
            }
            return intarray;
        }
        return null;
    }

    public static boolean CargarArchivo(String arch) throws FileNotFoundException, IOException {
        FileInputStream arch1;
        DataInputStream arch2;
        String linea;
        int i = 0;

        if (arch == null) {
            //frame.setDefaultCloseOperation(JFrame.DISPOSE_ON_CLOSE);
            JFileChooser fc = new JFileChooser(System.getProperty("user.dir"));
            int rc = fc.showDialog(null, "Select a File");
            if (rc == JFileChooser.APPROVE_OPTION) {
                arch = fc.getSelectedFile().getAbsolutePath();
            } else {
                System.out.println("No hay nombre de archivo..Yo!");
                return false;
            }
        }
        arch1 = new FileInputStream(arch);
        arch2 = new DataInputStream(arch1);
        do {
            linea = arch2.readLine();
            DatosArchivo[i++] = linea;
            /* if (linea != null) {
            System.out.println(linea);
            }*/
        } while (linea != null);
        arch1.close();
        return true;
    }

    public static boolean GuardaArchivo(String arch, String[] Datos) throws FileNotFoundException, IOException {
        FileOutputStream out1;
        DataOutputStream out2;
        int i;
        out1 = new FileOutputStream(arch);
        out2 = new DataOutputStream(out1);

        for (i = 0; i < Datos.length; i++) {
            if (Datos[i] != null) {
                out2.writeBytes(Datos[i] + "\n");
            }
        }
        out2.close();
        return true;
    }

    public static void echo(Object msg) {
        System.out.println(msg);
    }

    public static void main(String[] args) throws IOException, Exception {
        String[] res = new String[10000], num = new String[2];
        int i, j, k, ilong;
        int ele = 1;
       ArrayList al = new ArrayList();
        String FName = "C-small-attempt0",  istr, irev, linea;
        if (CargarArchivo("C:\\eblanco\\Desa\\CodeJam\\Code Jam\\test\\" + FName + ".in")) {
            for (j = 1; j <= Integer.parseInt(DatosArchivo[0]); j++) {
                linea = DatosArchivo[ele++];
                num = linea.split(" ");
                   al.clear();
                // echo("A: "+num[0]+" B: "+num[1]);
                for (i = Integer.parseInt(num[0]); i <= Integer.parseInt(num[1]); i++) {
                    istr = Integer.toString(i);
                    ilong = istr.length();
                 
                    for (k = 1; k < ilong; k++) {
                        if (ilong > k) {
                            irev = istr.substring(istr.length() - k, istr.length()) + istr.substring(0, istr.length() - k);
                            //echo("caso: " + j + ": isrt: " + istr + " irev: " + irev);
                            if ((Integer.parseInt(irev) > Integer.parseInt(num[0])) && (Integer.parseInt(irev) > Integer.parseInt(istr)) && (Integer.parseInt(irev) <= Integer.parseInt(num[1]))) {
                                al.add("(" + istr + "," + irev + ")");
                            }
                        }
                    }
                }
                HashSet hs = new HashSet();
                hs.addAll(al);
                al.clear();
                al.addAll(hs);
                res[j] = "Case #" + j + ": " + al.size();
                echo(res[j]);
                LeerArchivo.GuardaArchivo("C:\\eblanco\\Desa\\CodeJam\\Code Jam\\test\\" + FName + ".out", res);
            }
        }
    }
}

package com.brianghig.gcj.recyclednumbers;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Date;
import java.util.List;

import org.apache.commons.io.IOUtils;
import org.apache.commons.lang3.StringUtils;


public class RecycledNumbers {

	public static void main(String[] args) throws Exception {

		Date start = new Date();
		
		RecycledNumbers rn = new RecycledNumbers();
	
		List<Pair> pairs = rn.readInput();
	
		// TODO Remove
		//rn.printPairs( pairs );
		
		List<Integer> uniqueRecycledNumbers = rn.getCountOfUniqueRecycledNumbers( pairs );
		
		rn.writeOutput( uniqueRecycledNumbers );
		
		System.out.println("Took " + (new Date().getTime() - start.getTime()) + "ms");
	}
	
	private void writeOutput(List<Integer> uniqueRecycledNumbers) throws FileNotFoundException, IOException {
		StringBuffer sb = new StringBuffer();
		
		for( int i=0; i < uniqueRecycledNumbers.size(); i++ ) {
			sb.append("Case #" + (i+1) + ": " + uniqueRecycledNumbers.get(i) + "\n" );
		}
		
		IOUtils.write(sb.toString(), new FileOutputStream("recycledNumbersOutput.txt"), "UTF-8" );
		
	}

	private void printPairs(List<Pair> pairs) {
		for( Pair p : pairs ) {
			System.out.println("n: " + p.getN() + "; m: " + p.getM());
		}
	}

	private List<Integer> getCountOfUniqueRecycledNumbers(List<Pair> pairs) {
		List<Integer> uniqueRecycledNumbers = new ArrayList<Integer>();
		
		for( Pair p : pairs ) {
			uniqueRecycledNumbers.add( getCountOfUniqueRecycledFromPair( p ) );
		}
		
		return uniqueRecycledNumbers;
	}

	private int getCountOfUniqueRecycledFromPair(Pair p) {
		
		assert( p != null );
		
		//TODO
		long n = p.getN();
		long m = p.getM();
		
		if( n == m ) {
			// Quick check to ensure they're not equal. If so, none in between since A <= n < m <= B
			return 0;
		}
		
		String nString = String.valueOf( n );
		String mString = String.valueOf( m );
		
		// ok to use int because 1 <= A <= B <= 2,000,000
		int length = nString.length();
		
		List<Pair> pairs = new ArrayList<Pair>();
		
		System.out.println("Solving for Pair: " + n + " and " + m);
		
		for( long x = n; x < m; x++ ) {
			
			String testString = String.valueOf(x);
			//System.out.println("Testing String: " + testString + " for Pair: " + n + " and " + m);
			
//			char[] ch = new char[ testString.length() ];
			
			for( int i=1; i < length; i++ ) {
				
				String begin = testString.substring(0, length - i);
				String end = testString.substring(length - i, length);
				
				String newnum = (end + begin);
//				System.out.println("Testing " + newnum + " from beginning: " + begin + " and ending: " + end);
				
				Long newlong = Long.valueOf(newnum);
				
				if( x < newlong &&
					//n < newlong &&
					newlong <= m ) {
					
					System.out.println("Pair: " + n + " and " + m + " has new pair: " + x + " and " + newlong + " from " + testString);
					pairs.add( new Pair(x, newlong) );
				}
				
			}
			
		}
		
		System.out.println("Pairs Size Before Parsing: " + pairs.size());
		
		removeDuplicatesFromPairs( pairs );
		
		System.out.println("Pairs Size After Parsing: " + pairs.size());
		
		return pairs.size();
		
	}

	private void removeDuplicatesFromPairs(List<Pair> pairs) {
		
		List<Pair> pairsToRemove = new ArrayList<Pair>();
		
		for( Pair a : pairs ) {
//			System.out.println("Checking for dupes of pair n: " + a.getN() + " and m: " + a.getM() );
			for( Pair b : pairs ) {
				//System.out.println("Comparing pair A: " + a.getN() + "," + a.getM() + " and B: " + b.getN() + "," + b.getM() );
//				System.out.println("Comparing a.n: " + a.getN() + " to b.m: " + b.getM());
				if( a != b && 
					( ( a.getN() == b.getM() && a.getM() == b.getN() ) || 
					( a.getN() == b.getN() && a.getM() == b.getM() )  ) ) {
					
					boolean remove = true;
					for( Pair r1 : pairsToRemove ) {
						if( r1.getN() == b.getN() && r1.getM() == b.getM() ) {
							// Skip removing the second iteration of this pair
							remove = false;
							break;
						}
						
					}
					
					if( remove ) {
						//System.out.println("Removing pair n: " + b.getN() + " and m: " + b.getM());
						System.out.println("Removing duplicate pair A: " + a.getN() + "," + a.getM() + " and B: " + b.getN() + "," + b.getM() );
						pairsToRemove.add(b);
					}
					
					break;
				}
			}
			
		}
		
		for( Pair r : pairsToRemove ) {
			pairs.remove(r);
		}
		
	}

	public List<Pair> readInput() throws FileNotFoundException, IOException {
		
		String inputFile = "recycledNumbersInput.txt";
		
		List<Pair> pairs = new ArrayList<Pair>();
		
		List<String> input = IOUtils.readLines(new FileInputStream( inputFile ));
		
		Long testCases = Long.valueOf( input.get(0) );
		
		// Start at line 1, assuming at least one test case, since 1 â¤ T â¤ 50.
		for( int t=1; t <= testCases; t++ ) {
			
			String pairLine = input.get( t );
			
			String[] pairTokens = StringUtils.split(pairLine, " ");
			
			pairs.add( new Pair( Long.valueOf(pairTokens[0]), Long.valueOf(pairTokens[1]) ) );
			
		}
		
		return pairs;
	}
	
}
