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.IOException;
import java.math.BigDecimal;
import java.util.Arrays;
import java.util.List;

public class MinimumScalar extends JamProblem {
    public static void main(String[] args) throws IOException {
        MinimumScalar p = new MinimumScalar();
        p.go();
    }
    @Override
    String solveCase(JamCase jamCase) {
        MSCase c= (MSCase) jamCase;
        Arrays.sort(c.a);
        Arrays.sort(c.b);

        BigDecimal b = new BigDecimal(0);
        for (int i=0; i< c.lengh; i++) {
            BigDecimal aaa = new BigDecimal(c.a[i]);
            BigDecimal bbb = new BigDecimal(c.b[c.lengh - i - 1]);
            b = b.add(aaa.multiply(bbb));
        }
        return "" + b;
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        MSCase c= new MSCase();
        c.lineCount=3;
        int i = line;
        c.lengh = Integer.parseInt(file.get(i++));
        c.a = JamUtil.parseIntList(file.get(i++),c.lengh);
        c.b = JamUtil.parseIntList(file.get(i++),c.lengh);
        return c;
    }
}

class MSCase extends JamCase {
    int lengh;
    int[] a;
    int[] b;
}

