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.lang.reflect.Array;
import java.util.*;

public class MBHappy extends JamProblem {


    Map<Integer, Integer> baseMap;
    Map<Long, Integer> minMap = new HashMap<>();
    int ile = 0;

    void prepare() {

        SetUtil.cycleSubsets(bases.size(), new SetUtil.SubsetCallBack() {
            @Override
            public void run(long subset, int size) {
                clearCache();
                System.out.println(minMap.size());
                if (size == 0) {
                    return;
                }
                List<Integer> list = SetUtil.getList(subset, bases.size());
                List<Integer> bas = ArrayUtil.fromIndexList(list, bases);
                long forList = SetUtil.getForList(baseMap, bas);
                int max = 2;
                for (int j = 0; j < bases.size(); j++) {
                    long without = subset ^ SetUtil.getOne(j);
                    Integer withMin = minMap.get(without);
                    if (withMin != null) {
                        max = Math.max(max, withMin);
                    }
                }
                int num = max;
                while (true) {
                    int tested = 0;
                    for (Integer base : bas) {
                        System.out.println("" + ca + "\t" + base + "\t" + num);
                        if (!isHappy(num, base)) {
                            break;
                        }
                        tested++;
                    }
                    if (tested == bas.size()) {
                        ca++;
                        minMap.put(subset, num);
                        return;
                    }
                    if (cache.size() > 100000) {
                        clearCache();
                    }
                    num++;
                }
            }

        });
    }

    private void clearCache() {
        cache.clear();
        for (Integer base : bases) {
            cache.put(new MBAddr(1, base), Happy.HAPPY);
        }
    }

    public MBHappy() {
        for (int i = 2; i <= 10; i++) {
            bases.add(i);
        }
        baseMap = ArrayUtil.listToMap(bases);
    }

    Map<MBAddr, Happy> cache = new HashMap<>();

    List<Integer> bases = new ArrayList<>();

    public static void main(String[] args) throws IOException {
        MBHappy h = new MBHappy();
        h.prepare();
        h.go();
    }

    boolean isHappy(int num, int base) {
        MBAddr addr1 = new MBAddr(num, base);
        Happy isHappy = cache.get(addr1);
        if (isHappy != null) {
            if (isHappy == Happy.HAPPY) {
                return true;
            }

            if (isHappy == Happy.UNHAPPY) {
                return false;
            }
        }

        List<Integer> integers = MathUtil.convertToBase(num, base);
        int sum = MathUtil.sumSquaredList(integers);

        isHappy = cache.get(new MBAddr(sum, base));
        if (isHappy != null) {
            if (isHappy == Happy.HAPPY) {
                cache.put(addr1, Happy.HAPPY);
                return true;
            }

            if (isHappy == Happy.UNHAPPY) {
                cache.put(addr1, Happy.UNHAPPY);
                return false;
            }

            if (isHappy == Happy.UNKNOWN) {
                cache.put(addr1, Happy.UNHAPPY);
                return false;
            }
        }
        cache.put(addr1, Happy.UNKNOWN);
        boolean happy = isHappy(sum, base);
        if (happy) {
            cache.put(addr1, Happy.HAPPY);
            return true;
        } else {
            cache.put(addr1, Happy.UNHAPPY);
            return false;
        }

    }

    int ca = 0;

    @Override
    String solveCase(JamCase jamCase) {
        int num = 2;
        MBHCase cas = (MBHCase) jamCase;

        return "" + minMap.get(SetUtil.getForList(baseMap, cas.bases));
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        MBHCase cas = new MBHCase();
        cas.lineCount = 1;
        cas.bases = JamUtil.parseIntList(file.get(line));
        return cas;
    }
}

class MBHCase extends JamCase {
    List<Integer> bases;
}

class MBAddr {
    int number;
    int base;

    MBAddr(int number, int base) {
        this.number = number;
        this.base = base;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        MBAddr mbAddr = (MBAddr) o;

        if (base != mbAddr.base) return false;
        if (number != mbAddr.number) return false;

        return true;
    }

    @Override
    public int hashCode() {
        int result = number;
        result = 31 * result + base;
        return result;
    }
}

class MBNum {
    int number;
    int base;
    boolean isHappy;

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        MBNum mbNum = (MBNum) o;

        if (base != mbNum.base) return false;
        if (isHappy != mbNum.isHappy) return false;
        if (number != mbNum.number) return false;

        return true;
    }

    @Override
    public int hashCode() {
        int result = number;
        result = 31 * result + base;
        result = 31 * result + (isHappy ? 1 : 0);
        return result;
    }
}

enum Happy {
    HAPPY, UNHAPPY, UNKNOWN;
}


