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 com.g0414.c;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;

public class Problem {
	public final String FILE_PATH = "C:/data/workspace/googleCodeJam/src/" + "com/g0414/c/";
	// public final String FILE_BASE = "B-large";
	public final String INPUT_FILE = FILE_PATH + "C-large.in";
	public final String OUTPUT_FILE = 
			INPUT_FILE.substring(0, INPUT_FILE.lastIndexOf('.')) + ".txt";
	
	long testN = -1;
	ArrayList<Test> testList = new ArrayList<Test>();
	
	public static void main(String[] args) {
		try {
			Problem p = new Problem();
			p.init();
			p.printResult();
			p.end();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	public void printResult() throws ProblemException {
		long i = 1;
		for (Test p : testList) {
			print("Case #" + i + ": " + p.check());
			i++;
		}
	}
	
	public static boolean flag = true;
	FileWriter outputFile = null;
	public void print(String str) throws ProblemException {
		try {
			// t@CÌíAt@CÌVKI[v
			if (flag) {
				flag = false;
				File fw01 = new File(OUTPUT_FILE);
				fw01.delete();
				outputFile = new FileWriter(OUTPUT_FILE, true);
			}
			outputFile.write(str + "\r\n");
			System.out.println(str);
		} catch (IOException e) {
				throw new ProblemException(e.getMessage(),e);
		}
	}
	
	public void end() throws ProblemException {
		try {
			outputFile.close();
		} catch (IOException e) {
			throw new ProblemException(e.getMessage(),e);
		}
	}
	
	public void init() throws ProblemException {
		try {
			FileReader in = new FileReader(INPUT_FILE);
			BufferedReader br = new BufferedReader(in);
			String line;
			testN = Long.parseLong(br.readLine());
			while ((line = br.readLine()) != null) {
				String[] ch = line.split(" ");
				System.out.println(line);
				ch = line.split(" ");
				long a = Long.parseLong(ch[0]);
				long b = Long.parseLong(ch[1]);
				Test test = new Test(a,b);
				testList.add(test);
			}
			br.close();
			in.close();
		} catch (IOException e) {
			System.out.println(e);
			throw new ProblemException(e.getMessage(),e);
		}
	}
	
	public class ProblemException extends Exception {
		private static final long serialVersionUID = 2080823058826051635L;
		public ProblemException(String message) {
			super(message);
		}
		public ProblemException(String message, Throwable e) {
			super (message, e);
		}
	}

	// ±±æèãÍú»Æ©t@CB
	// ±±æèºÍASY
	
	public class Test {
		long a = -1;
		long b = -1;
		
		public Test (long a, long b) {
			this.a = a;
			this.b = b;
		}
		
		public String check () {
			HashMap<Long, AB> map = new HashMap<Long, AB> ();
			for (long i = a; i <= b; i++) {
				long small = getSmall(i);
				AB newAB = new AB(small);
				AB ab = map.get(small);
				if (ab == null){
					map.put(small, newAB);
				} else {
					ab.plus();
				}
			}
			long result = 0;
			for (long small : map.keySet()) {
				AB ab = map.get(small);
				if (ab.getN() == 1) {
					continue;
				}
				long kumi = ab.getN() * (ab.getN() - 1) / 2;
				result += kumi;
				/*
				System.out.println("ab=" + ab.getN() + ", " + ab.getSmall() +
						", kumi=" + kumi);
				*/
			}
			return "" + result;
		}

		private long getSmall (long hoge) {
			long ret = 0;
			long keta = getKeta(hoge);
			ret = hoge;
			for (int i = 0; i < keta; i++) {
				hoge = hoge % 10 * kaijo10(keta-1) + hoge / 10;
				if (hoge < ret) {
					ret = hoge;
				}
			}
			
			return ret;
		}
		
		/**
		 * @param keta
		 * @return output = 10 ^ input
		 */
		private long kaijo10 (long keta) {
			long ret = 1;
			for (int i = 0; i < keta; i ++) {
				ret *= 10;
			}
			return ret;
		}
		
		/**
		 * @param hoge
		 * @return ^¦çê½ÌðÔ·B
		 */
		private long getKeta (long hoge) {
			if (hoge == 0){
				return 0;
			} else {
				return getKeta(hoge / 10) + 1;
			}
		}
		
		@Override
		public String toString() {
			// String list = " ";
			return "(" + a + "," + b + ")";
		}
	}
	
	public class AB {
		long small;
		long n = 1;
		public AB (long small) {
			this.small = small;
		}
		public long getSmall() {
			return small;
		}
		public long getN() {
			return n;
		}
		public void plus() {
			n ++;
		}
		
		@Override
		public boolean equals(Object o) {
			AB ab = (AB) o;
			return (small == ab.getSmall());
		}
		
		@Override
		public int hashCode () {
			return (int)small;
		}
	}
	/*
	 * 
Case #1: 1
Case #2: 256
Case #3: 4
Case #4: 674
Case #5: 461
	 * 
	 */
}
