l01 - dynamic programmingweb.mit.edu/sp.268/www/2010/dynamicprogramming.pdf · 2011. 2. 2. · l01...
TRANSCRIPT
http://erikdemaine.org/papers/AlgGameTheory_GONC3/
k = {}for n in range(0, 1000): k[n] = mex ([k[i] ^ k[n-i-1] for i in range(n)] + [k[i] ^ k[n-i-2] for i in range(n-1)]) print n, "-", k[n]
def mex(nimbers): nimbers = set(nimbers) n = 0 while n in nimbers: n = n + 1 return n
972 - 4973 - 1974 - 2975 - 8976 - 1977 - 4978 - 7979 - 2980 - 1981 - 8982 - 2983 - 7
984 - 4985 - 1986 - 2987 - 8988 - 1989 - 4990 - 7991 - 2992 - 1993 - 8994 - 2995 - 7
960 - 4961 - 1962 - 2963 - 8964 - 1965 - 4966 - 7967 - 2968 - 1969 - 8970 - 2971 - 7