def solve(): piter = allprimes() next(piter) i = 3 for node in generateAsc([Node(piter)], Node.next): if node.val > i: return i elif node.val == i: i += 2
def solve(): for (D, _, _, n) in generateAsc([(4, 1, 1, 1)], nextPents): if isPent(D) and isPent(2*pent(n) + D): return D
def solve(): for node in generateAsc([Node(990, 999)], Node.mknext): ns = str(node.x * node.y) if ns == ns[::-1]: return ns