Description
We propose a drawing session!
The file tortuga-flag.txt
contains the flag drawn using only line segments.
The method to encode these line segments is simple.
We first set an initial starting point P(x, y)
initialized to any point in the plane, for example, (0, 0)
.
Then, each element (dx, dy)
in the list L
provided in the file tortuga.txt
allows reaching a new point Q(x + dx, y + dy)
, and the segment PQ
is drawn between these two points.
Once this segment has been drawn, the point P
is replaced by the point Q
, and this process is iterated over all elements from the list.
To allow multiple symbols, the special value (0, 0)
for (dx, dy)
is used to update P
as above using the following element from the list, but without drawing any segment.
We give the following example (tortuga-example.txt
) where the initial point P
is the one at the top left of the figure :
[
# Draw triangle pointing down (drawn clockwise)
(2, 0), (-1, 2), (-1, -2),
# Skip
(0, 0), (3, 0),
# Draw triangle pointing up (drawn counterclockwise)
(-1, 2), (2, 0), (-1, -2),
# Skip
(0, 0), (1, 0),
] * 6
And the associated image:
Note: the flag follows the format FCSC{[0-9]+}
.
Files
-
tortuga-flag.txt
825 B – 23f0cb0ededca266aa7de0205b7a23fe291e8f1054ca1aaced2a43ce588706de -
tortuga-example.txt
174 B – 9559bf2152de7e38392b9cda947a03dde945c564106caec7810828ced2c68ccb -
tortuga-example.png
1.23 KiB – 29c032d3a9a41268bd9ac5daee3589b7229c8b806ae5d6510479b36dbdc146f6
Author
Flag
Submit your solution
You can submit your writeup for this challenge. Read the FAQ to learn how to proceed.
You need to be logged in to submit a writeup.