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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Reader;
import java.io.StreamTokenizer;


public class MySolution {
	public static void main(String[] a) throws IOException {
		sumfile("C-large.in");
	}

	static void sumfile(String filename) throws IOException {
		int tests=0;
		int A=0;
		int B=0;
		int count=0;
		Reader r = new BufferedReader(new FileReader(filename));
		StreamTokenizer stok = new StreamTokenizer(r);
		stok.parseNumbers();
		stok.nextToken();
		if (stok.ttype == StreamTokenizer.TT_NUMBER) {
			tests=(int)stok.nval;
		}
		FileWriter fw = new FileWriter("result.txt");
		fw.write("");
		fw.close();
		for(int i=0;i<tests;i++){
			stok.nextToken();
			if (stok.ttype == StreamTokenizer.TT_NUMBER) {
				A=(int)stok.nval;
			}
			stok.nextToken();
			if (stok.ttype == StreamTokenizer.TT_NUMBER) {
				B=(int)stok.nval;
			}
			for(int ii=A;ii<=B;ii++){
				String tmp = ii+"";
				int size=tmp.length();
				int[] allchange=new int[size-1];
				for(int j=1;j<size;j++){
					String tmp2=tmp.substring(j, tmp.length())+tmp.substring(0, j);
					int change=Integer.parseInt(tmp2);
					allchange[j-1]=change;
					int sign=0;
					for(int k=0;k<j-1;k++){
						if(allchange[k]==change){
							//System.out.println("Bingo"+ii);
							sign=1;
						}
					}
					if(change>ii&&change<=B&&sign!=1){
						count++;
						//System.out.print("("+ii+","+change+") ");
					}
				}
				
				
			}
			
			fw = new FileWriter("result.txt",true);  
			String s ="Case #"+(i+1)+": "+count+"\n";  
			fw.write(s,0,s.length());  
			fw.flush();
			System.out.println("Case #"+(i+1)+": "+count);
			count=0;
		}
	}
}
