001: Rummy Numbers

• https://arxiv.org/pdf/1604.07553.pdf

Mein Lösung. Spoiler Alert! [pdf]

import sys
import numpy as np
 
def solve():
    n = np.array(sys.argv[1:], dtype=int)
    assert(len(n) == 13)
 
    for i in range(13):
        minl = min(n[(i-1) % 13], n[(i-2) % 13])
        minr = min(n[(i+1) % 13], n[(i+2) % 13])
        if n[i % 13] - minl - minr > min(n[(i-1) % 13]-minl, n[(i+1) % 13]-minr):
            return 1
 
    return 0