<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="http://wiki.vspace.one/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://wiki.vspace.one/feed.php">
        <title>vspace.one wiki - treffen:problemsolving</title>
        <description></description>
        <link>http://wiki.vspace.one/</link>
        <image rdf:resource="http://wiki.vspace.one/lib/exe/fetch.php?media=wiki:logo.png" />
       <dc:date>2026-04-13T06:13:42+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://wiki.vspace.one/doku.php?id=treffen:problemsolving:001_ps&amp;rev=1621589671&amp;do=diff"/>
                <rdf:li rdf:resource="http://wiki.vspace.one/doku.php?id=treffen:problemsolving:002_ps&amp;rev=1625945903&amp;do=diff"/>
                <rdf:li rdf:resource="http://wiki.vspace.one/doku.php?id=treffen:problemsolving:008_set&amp;rev=1642862332&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://wiki.vspace.one/lib/exe/fetch.php?media=wiki:logo.png">
        <title>vspace.one wiki</title>
        <link>http://wiki.vspace.one/</link>
        <url>http://wiki.vspace.one/lib/exe/fetch.php?media=wiki:logo.png</url>
    </image>
    <item rdf:about="http://wiki.vspace.one/doku.php?id=treffen:problemsolving:001_ps&amp;rev=1621589671&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-05-21T09:34:31+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>001_ps</title>
        <link>http://wiki.vspace.one/doku.php?id=treffen:problemsolving:001_ps&amp;rev=1621589671&amp;do=diff</link>
        <description>CC BY-SA 3.0 by David Lazich

001: Rummy Numbers
 Serie  treffen:problemsolving  Von  nopx  Datum  29.April 2021  Download  [Aufgabenbeschreibung [pdf]]  Schwierigkeit   
Weitere Informationen

	*  &lt;https://arxiv.org/pdf/1604.07553.pdf&gt;

Lösungen



nopx

[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[…</description>
    </item>
    <item rdf:about="http://wiki.vspace.one/doku.php?id=treffen:problemsolving:002_ps&amp;rev=1625945903&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-07-10T19:38:23+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>002_ps</title>
        <link>http://wiki.vspace.one/doku.php?id=treffen:problemsolving:002_ps&amp;rev=1625945903&amp;do=diff</link>
        <description>002: UVU
 Serie  treffen:problemsolving  Von  nopx  Datum  06.Juli 2021  Download  [Aufgabenbeschreibung [pdf,v2]]  Schwierigkeit   
Some unittests


#!/bin/python

import unittest

from main import eval

class Test(unittest.TestCase):

    def test(self):
        self.assertEqual(1, eval(&quot;aba&quot;))
        self.assertEqual(1, eval(&quot;abcbabc&quot;))
        self.assertEqual(1, eval(&quot;abcabc&quot;))
        self.assertEqual(1, eval(&quot;aa&quot;))
        self.assertEqual(0, eval(&quot;a&quot;))
        self.assertEqual(0, eval(&quot;…</description>
    </item>
    <item rdf:about="http://wiki.vspace.one/doku.php?id=treffen:problemsolving:008_set&amp;rev=1642862332&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2022-01-22T14:38:52+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>008_set</title>
        <link>http://wiki.vspace.one/doku.php?id=treffen:problemsolving:008_set&amp;rev=1642862332&amp;do=diff</link>
        <description>008: Set
 Serie  treffen:problemsolving  Von  nopx  Datum  15.Dez 2021  Download  [Aufgabenbeschreibung [pdf]]  Schwierigkeit   
Lösungen



----------

nopx

Stupide Brute Force Loesung in Python 3.8 hier zusammengefasst. Ausfuehrlicher Code kann [hier] runtergeladen werden.


import sys
import numpy as np
import itertools


num_properties = 4
setsize = 3

def solve_set(instr : str) -&gt; list:
    assert(len(instr) % num_properties == 0)
    num_cards = len(instr) // num_properties
    cards = np…</description>
    </item>
</rdf:RDF>
