#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.path.append("../lib")
from OwnMemoize import Memoize
upperLimit = 10**6
# copy-paste from 114
def solve(callee, length):
#print length
result = 1
for start in range(length-50+1):
for end in range(start+50, length+1):
#print length, start, end
result += callee(callee, length - end - 1)
return result
m = Memoize()
i = 1
while m.run(solve, i) < upperLimit:
i += 1
print i
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.path.append("../lib")
from OwnMemoize import Memoize
upperLimit = 50
def solve(callee, length):
#print length
result = 1
for start in range(length-3+1):
for end in range(start+3, length+1):
#print length, start, end
result += callee(callee, length - end - 1)
return result
m = Memoize()
print m.run(solve, upperLimit)
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.path.append("../lib")
from OwnMemoize import Memoize
minTile = 2
maxTile = 4
upperLimit = 50
def rgb_n_tiles(callee, number, r):
if not r > number:
return callee(callee, number - r)
else:
return 0
def rgb_tiles(callee, number):
result = 1
if number<minTile:
return result
for i in range(0, number):
result += sum(map(lambda e: rgb_n_tiles(callee, number, i + e), range(minTile, maxTile + 1)))
return result
m = Memoize()
print m.run(rgb_tiles, upperLimit)
