Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions algorithmic/problems/0/statement.txt
Original file line number Diff line number Diff line change
Expand Up @@ -91,9 +91,9 @@ Input
Output
```
3 3
2 0 0 0
2 2 2 0
0 0 0 0
2 0 1 0
1 1 0 0
```

This places the monomino at (0,0), rotates the triomino by 90° (R=1), and fits all shapes into a 3×3 rectangle. (Reflections are allowed, but not used in this example: F=0.)
Expand All @@ -104,4 +104,4 @@ This places the monomino at (0,0), rotates the triomino by 90° (R=1), and fits

Let $S$ be the set of all pieces from size 1-10. Each piece is chosen uniformly at random with replacement from $S$.

$n$ is chosen as $10^p$, where $p \sim U(2, 4)$.
$n$ is chosen as $10^p$, where $p \sim U(2, 4)$.
Loading