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());
	}

}

package ggpackage;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class GgClass {


	private static String[] txt;
	private static String newtxt="";
	private static String oldtxt="";
	private static String[] oldtxt2;

	private static int numberC;


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

		try{
			FileInputStream fstream = new FileInputStream("C-large.in");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			while ((strLine = br.readLine()) != null)   {
				oldtxt+=strLine+"\n";
			}
			in.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
		oldtxt2=oldtxt.split("\n");
		numberC = Integer.parseInt(oldtxt2[0]);
		ArrayList dub = new ArrayList();
		for(int L=1;L<=numberC;L++){
			int A = Integer.parseInt(oldtxt2[L].split(" ")[0]);
			int B = Integer.parseInt(oldtxt2[L].split(" ")[1]);
			int count = 0;
			//loop from A to mid point
			if(B<10){}else{
				for(int i=A;i<=B;i++){

					txt = String.valueOf(i).split("");
					//check for possible combination of an integer
					for(int k=2;k<txt.length;k++){
						newtxt+=txt[k];
						for(int j=1;j<txt.length-1;j++){
							if(j+k>txt.length-1){
								newtxt+=txt[j+k-(txt.length-1)];
							}else{
								newtxt+=txt[j+k];
							}
						}

						while(newtxt.startsWith("0")==true){
							newtxt=newtxt.substring(1);
							//System.out.print(newtxt+"\n");
							//count if an integer is recyclable
						}

						if(newtxt.isEmpty()){}else{
							if(Integer.parseInt(newtxt)>i){
								//System.out.print(newtxt+"\n");
								if(Integer.parseInt(newtxt)<=B){
									count++;
									dub.add(newtxt);
								}


							}
							newtxt="";
						}
						if(dub.size()==0){}else{
							
						for(int z=0;z<=dub.size()-1;z++){
							for(int y=z+1;y<=dub.size()-1;y++){
								if(dub.get(z).toString().contentEquals((dub.get(y).toString()))){
									count=count-1;
									
								}
							}
						}
						}

						
						
					}
					
					dub.clear();
				}
				
			}
			System.out.print("Case #"+L+": "+count+"\n");
		}
	}
}
