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 google.code.jam.problem.c;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class MainClass {

	public static final String PATH_FILE = "C:/Temp/";

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		try {

			MainClass mainClass = new MainClass();
//			HashSet <String> recycledNumbersCollection = new HashSet <String>();
			List<String> recycled = new ArrayList<String>();
			
			// Open the file that is the first
			// command line parameter
			FileInputStream fstream = new FileInputStream(PATH_FILE
					+ "C-large.in");

			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));

			String strLine = br.readLine();

			int numOfTestCase = Integer.parseInt(strLine);

			
			if ((numOfTestCase >= 1) && (numOfTestCase <= 50)) {

				int i = 1;

				// Read File Line By Line
				while ((strLine = br.readLine()) != null) {

					StringTokenizer st = new StringTokenizer(strLine, " ");

					int numberA = Integer.parseInt(st.nextToken());
					int numberB = Integer.parseInt(st.nextToken());

					if ((1 <= numberA) && (numberA <= numberB)
							&& (numberB <= 2000000)) {

						int recycledPair = 0;

						for (int j = numberA; j < numberB; j++) {

							String rotateNumber = String.valueOf(j);
							
							int currentNumber = j;

//							System.out.println("currentNumber: " + currentNumber);
							
							for (int k = 1; k < String.valueOf(j).length(); k++) {

								String rotateNumberNew = mainClass
										.rotateNumber(rotateNumber);
								
//								System.out.println(rotateNumberNew);

								if ((!"-1".equals(rotateNumber))
										&& (Integer.valueOf(rotateNumberNew) > currentNumber)
										&& (Integer.valueOf(rotateNumberNew) <= numberB)
										&& (rotateNumber != rotateNumberNew)) {

									recycledPair++;
//									recycledNumbersCollection.add(rotateNumberNew);
									recycled.add(currentNumber + " , " + rotateNumberNew);
//									System.out.println(":: recycledPair :: " + rotateNumberNew);
								}
								
								rotateNumber = rotateNumberNew;
							}
						}

//						int temp = 0;
//						for (String string : recycled) {
//							System.out.println("number " + ++temp +": " + string);
//						}
						
						System.out.println("Case #" + i++ + ": " + recycledPair);

//						System.out.println(recycledNumbersCollection.size());
						
					} else {

						throw new Exception("Condition not 1 <= A <= B <= 1000");
					}
				}

			} else {

				throw new Exception("Number of test case is not valid");
			}
			// Close the input stream
			in.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}

	public String rotateNumber(String number) {

		String returnValue = "-1";
		
		try {

			if (Integer.parseInt(number) >= 10) {

				String lastDigit = number.substring(number.length() -1 , number.length());
				
				returnValue = lastDigit + number.substring(0, number.length() -1);
				
//				String firstDigit = number.substring(0, 1);

//				returnValue = number.substring(1) + firstDigit;
				

			} else {

				returnValue = "-1";
			}

		} catch (Exception e) {

			System.err.println("Error: " + e.getMessage());
		}

		return returnValue;
	}

}

//1111 2222
