48 lines
1.3 KiB
Typst
48 lines
1.3 KiB
Typst
#import "@preview/clean-sheets:0.3.0": Cal, chevrons, computer-science-template, def, ex_box, qed, satz
|
|
|
|
#show: body => computer-science-template(
|
|
[Exemplarische Grundlagen I],
|
|
(
|
|
([Max Mustermann], [1234567]),
|
|
([Erika Musterfrau], [7654321]),
|
|
),
|
|
[Wintersemester 2025/26],
|
|
[Beispiel-Universität Musterstadt],
|
|
[Institut für Exemplarisches],
|
|
sheetnumber: 1,
|
|
subtitle: lorem(5),
|
|
department: [Abteilung Beispiel],
|
|
submit_until: datetime(day: 1, month: 1, year: 2026, hour: 14, minute: 0, second: 0),
|
|
testats_from: datetime(day: 1, month: 1, year: 2026, hour: 18, minute: 0, second: 0),
|
|
testats_until: datetime(day: 8, month: 1, year: 2026, hour: 10, minute: 0, second: 0),
|
|
group-digits: true,
|
|
decimal-comma: true,
|
|
body,
|
|
)
|
|
|
|
|
|
= Aufgabe 1
|
|
|
|
#ex_box(
|
|
heading: [Aufgabe 1],
|
|
points: [10 Punkte],
|
|
)[
|
|
Zeigen Sie eine einfache Aussage über Listen.
|
|
]
|
|
|
|
```pseudo
|
|
DEF magic_recursive(string s, string p):
|
|
IF len(p) == 0 THEN return TRUE
|
|
IF len(s) == 0 OR p[0] != s[0] THEN return FALSE
|
|
return magic_recursive(s[1:], p[1:])
|
|
```
|
|
|
|
#table(
|
|
columns: 6,
|
|
|
|
[Heading 1], [Heading 2], [Heading 3], [Heading 4], [Heading 5], [Heading 6],
|
|
|
|
[Cell 1], [Cell 2], [Cell 3], [Cell 4], [Cell 5], [Cell 6],
|
|
[Cell 7], [Cell 8], [Cell 9], [Cell 10], [Cell 11], [Cell 12],
|
|
)
|