M0ttii

def fuelle(grenze, inhalt, gegenstaende, loesungen):

    if loesungen==0 or grenze==0:
        return 0

    if (inhalt[loesungen-1] > grenze):
        return fuelle(grenze, inhalt, gegenstaende, (loesungen-1))
    else:
        return max(gegenstaende[loesungen-1] +
        fuelle(grenze - inhalt[loesungen-1], inhalt, gegenstaende, loesungen-1),

M0ttii

from tkinter import *
from tkinter import messagebox
import sys
import time

class KnightsTour:
    def __init__(self, xstart, ystart):

        self.board = []

M0ttii

from Tkinter import*

class DamenProblem:
    def __init__(self, groesse):
        self.liste=[]
        
        self.groesse = groesse
        self.loesungen = 0
        self.loese()
        #self.printList()

M0ttii

from Tkinter import *

class GUI:
    def __init__(self):
        self.root = Tk()
        self.root.geometry("900x1000")
        self.root.title("Knights Tour")
        self.root.configure(background="#353f4f")
        self.createWidgets()
        self.board.bind("<Motion>", func=self.displayHover)

M0ttii

class KnightsTour:
    def __init__(self, xstart, ystart):
        self.board = []
        self.poss = [
            (-2,-1), #1
            (-2,1),  #2
            (-1, 2), #3
            (1, 2),  #4
            (2, 1),  #5
            (2, -1), #6

M0ttii

    #!/usr/bin/python

from nikos_welt import *

    
class MeinRoboter(Roboter):
    def rechts(self):
        for i in range(0,3):
            self.links()
            

M0ttii

istdrinn::[Int]->Int->Bool
istdrinn [] a = False
istdrinn (x:xs) a
 |x==a=True
 |otherwise=istdrinn xs a
 
 
sort::[Int]->Int->[Int]
sort [] a = [a]
sort (x:xs) a

M0ttii

reverseList :: [Int] -> [Int]
reverseList [] = []
reverseList (x:xs) = reverseList xs ++ [x]

M0ttii

insert :: Int -> [Int] -> [Int]
insert x [] = [x]
insert x (y:ys) = if x < y
                 then x:y:ys
         else y : insert x ys

insertionSort :: [Int] -> [Int]
insertionSort [x] = [x]
insertionSort (x:xs) = insert x (insertionSort xs)

M0ttii

def quicksort(list, i, j):
    if i >= j:
        return
    pivot = list[j]
    left = i
    right = j - 1
    while left <= right:
        while left <= right and list[left] <= pivot:
            left += 1
        while left <= right and list[right] >= pivot: