https://wiki.bzz.ch/ 2026-05-29T21:08:18+00:00 https://wiki.bzz.ch/ https://wiki.bzz.ch/_media/wiki/logo.png text/html 2025-06-23T05:45:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.bzz.ch/de/modul/m319/learningunits/lu99/loesungen/3und5mal?rev=1750657506&do=diff LU99.L03: Vielfache von 3 und 5 def main(): limit = int(input('')) total = 0 number = 1 while number < limit: if number % 3 == 0 or number % 5 == 0: total += number number += 1 print(total) text/html 2025-10-27T08:14:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.bzz.ch/de/modul/m319/learningunits/lu99/loesungen/chiffre?rev=1761552871&do=diff Lösung: Transpositions Chiffre Die Lösung zeigt das vollständige Programm. """Simple Block Cipher Encryption Example.""" def encrypt(): """ Encrypts a string using a simple transposition """ blocks = [] # List to hold the blocks of text DO NOT CHANGE plaintext = input('Klartext: ').upper().replace(' ', '') blocksize = int(input('Blockgrösse: ')) padding = ' ' * blocksize plaintext += padding line_count = 0 position = 0 while (position + blocksize… text/html 2025-06-23T05:45:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.bzz.ch/de/modul/m319/learningunits/lu99/loesungen/fakultaet?rev=1750657506&do=diff LU99.L04: Fakultät def main(): number = int(input('')) result = 1 for counter in range(2, number+1): result = result * counter print (result) text/html 2025-06-23T05:45:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.bzz.ch/de/modul/m319/learningunits/lu99/loesungen/fibonacci?rev=1750657506&do=diff LU99.L02: Fibonacci-Folge def main(): position = int(input('')) number1 = 0 number2 = 1 counter = 3 while counter <= position: next_number = number1 + number2 number1 = number2 number2 = next_number counter += 1 print(number2) text/html 2025-06-23T05:45:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.bzz.ch/de/modul/m319/learningunits/lu99/loesungen/start?rev=1750657506&do=diff LU99 - Lösungen Lösungen * LU99.L01: Kleines Einmaleins * LU99.L02: Fibonacci-Folge * LU99.L03: Vielfache von 3 und 5 * LU99.L04: Fakultät * Lösung: Transpositions Chiffre * Lösung: X-mas tree text/html 2025-06-23T05:45:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.bzz.ch/de/modul/m319/learningunits/lu99/loesungen/vielfache?rev=1750657506&do=diff LU99.L01: Kleines Einmaleins def main(): number = int(input('')) for counter in range(0,11): print (number*counter) text/html 2025-10-27T08:12:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.bzz.ch/de/modul/m319/learningunits/lu99/loesungen/xmas?rev=1761552772&do=diff Lösung: X-mas tree Die einzelnen Lösungsschritte sind jeweils in einer eigenen Funktion realisiert. Zum Testen einer bestimmten Funktion, ändern Sie den Aufruf in make_tree(). def make_tree(): """ prints an Xmas tree :return: None """ step3() def step1(): height = int(input('Höhe des Baums')) lines = 1 while lines <= height: print() lines += 1 def step2(): height = int(input('Höhe des Baums')) lines = 1 while lines <= height: …