{{:treffen:problemsolving:rummy.jpg?400|}}

[[https://creativecommons.org/licenses/by-sa/3.0/|CC BY-SA 3.0]] by [[https://en.wikipedia.org/wiki/Rummy#/media/File:A_Game_of_Rummy.JPG|David Lazich]]

====== 001: Rummy Numbers ======

| Serie | [[treffen:problemsolving|treffen:problemsolving]] | 
| Von | [[user:nopx|nopx]] |
| Datum | 29.April 2021 |
| Download | {{ :treffen:001_problemsolving_rummy_numbers_v1.pdf |Aufgabenbeschreibung [pdf]}} |
| Schwierigkeit | {{:treffen:problemsolving:progress3.png?nolink&160 |}} | 


===== Weitere Informationen =====
  * [[https://arxiv.org/pdf/1604.07553.pdf]]

===== Lösungen =====
{{:treffen:problemsolving:spoileralert.png?200|}}
==== nopx ====
{{ :treffen:problemsolving:001_problemsolving_rummy_numbers_solution_.pdf |Mein Lösung. Spoiler Alert! [pdf]}}
<code Python>
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
</code>

~~DISCUSSION~~