package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

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.io.Writer;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class RecycledNumbers {
	
	public static ArrayList<Double> palindroms = new ArrayList<Double>();

	public static void main(String[] args) throws FileNotFoundException, IOException {
		File inFile = new File("/Users/johannesvietze/Desktop/C-large.in");
	    
		
	    //read
	    StringTokenizer tok = new StringTokenizer(getContents(inFile),"\n");
	    tok.nextToken(); //delete first token
	    
	    String result = "";
	    int counter = 1;
	    
	    //compute
	    while(tok.hasMoreTokens()){
	    	String in = tok.nextToken(); //next line
	    	String[] current = in.split(" ");
	    	int a = Integer.parseInt(current[0]);
	    	int b = Integer.parseInt(current[1]);
	    	double res = 0;
	    	
	    	palindroms.clear();
	    	for(int n = a; n <= b; n++){
	    		if(n >= 10){
	    			res += getNumberOfRecycledNumbers(a, b, n);
	    		}
	    	}
	    	
	    	DecimalFormat df = new DecimalFormat("#");
	    	result += "Case #" + counter++ + ": ";
	    	result += df.format(res);
	    	result += "\n";
	    }
	    
	    //System.out.println(result);
	    
		//write
	    File outFile = new File("/Users/johannesvietze/Desktop/C-large.out");
	    setContents(outFile, result);
		
	}
	
	public static double getNumberOfRecycledNumbers(int min, int max, int in){
		double result = 0;
		
		String currentS = Integer.toString(in);
		int length = currentS.length();
		
		for (int i = 0; i < length; i++) {
			
			currentS = currentS.charAt(length-1) + currentS.substring(0, length-1);
			
			if(Integer.parseInt(currentS) <= max && Integer.parseInt(currentS) > min && in < Integer.parseInt(currentS)){
				if(isPalindrom(String.valueOf(in)  + currentS)){
					if(!palindroms.contains(Double.parseDouble((String.valueOf(in)  + currentS)))){
						palindroms.add(Double.parseDouble(String.valueOf(in)  + currentS));
						result++;
					}
				}else{
					result++;
				}
			}
		}
		
		return result;
	}
	
	public static boolean isPalindrom(String s){
		return s.equals(new StringBuffer(s).reverse().toString());
	}
	
	public static String getContents(File aFile) {
	    StringBuilder contents = new StringBuilder();
	    try {
	      BufferedReader input =  new BufferedReader(new FileReader(aFile));
	      try {
	        String line = null;
	        while (( line = input.readLine()) != null){
	          contents.append(line);
	          contents.append(System.getProperty("line.separator"));
	        }
	      }
	      finally {
	        input.close();
	      }
	    }
	    catch (IOException ex){
	      ex.printStackTrace();
	    }
	    
	    return contents.toString();
	  }

	public static void setContents(File aFile, String aContents) throws FileNotFoundException, IOException {
	    Writer output = new BufferedWriter(new FileWriter(aFile));
	    try {
	      output.write( aContents );
	    }
	    finally {
	      output.close();
	    }
	 }
}
