blob: 609807ebfa4cff166259a915d13f3fcb14bdb03c (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
|
--- Part Two ---
Now that your FFT is working, you can decode the [1m[97mreal signal[0m.
The real signal is your puzzle input [1m[97mrepeated 10000 times[0m. Treat this new signal as a single input
list. Patterns are still calculated as before, and 100 phases of FFT are still applied.
The [1m[97mfirst seven digits[0m of your initial input signal also represent the [1m[97mmessage offset[0m. The message
offset is the location of the eight-digit message in the final output list. Specifically, the
message offset indicates [1m[97mthe number of digits to skip[0m before reading the eight-digit message. For
example, if the first seven digits of your initial input signal were 1234567, the eight-digit
message would be the eight digits after skipping 1,234,567 digits of the final output list. Or, if
the message offset were 7 and your final output list were 98765432109876543210, the eight-digit
message would be 21098765. (Of course, your real message offset will be a seven-digit number, not a
one-digit number like 7.)
Here is the eight-digit message in the final output list after 100 phases. The message offset given
in each input has been highlighted. (Note that the inputs given below are repeated 10000 times to
find the actual starting input lists.)
- [1m[97m0303673[0m2577212944063491565474664 becomes 84462026.
- [1m[97m0293510[0m9699940807407585447034323 becomes 78725270.
- [1m[97m0308177[0m0884921959731165446850517 becomes 53553731.
After repeating your input signal 10000 times and running 100 phases of FFT, [1m[97mwhat is the eight-digit
message embedded in the final output list?[0m
|
