| CARVIEW |
Select Language
HTTP/2 200
date: Sun, 12 Oct 2025 03:53:25 GMT
content-type: text/html; charset=UTF-8
server: cloudflare
x-frame-options: DENY
x-content-type-options: nosniff
x-xss-protection: 1;mode=block
vary: accept-encoding
cf-cache-status: DYNAMIC
content-encoding: gzip
set-cookie: _csrf-frontend=c968efbbee63c641809beed9ab1e39b1f777465d0505a195be777dd8e6657cc9a%3A2%3A%7Bi%3A0%3Bs%3A14%3A%22_csrf-frontend%22%3Bi%3A1%3Bs%3A32%3A%22CBOMQx3zIkWTWXAllKWFH2_B5UxWwLkJ%22%3B%7D; HttpOnly; Path=/
cf-ray: 98d3a66b5dd0b22e-BLR
Day 6 - Pastebin.com
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- % This is true if the four-character sequence in Signal starting at MarkerPos could be a marker. Take the segment, turn it into a list, make it a set (removing duplicates), check that the length is 4.
- marker_at(Signal, MarkerPos) :- sub_atom(Signal, MarkerPos, 4, _, Segment), atom_chars(Segment, CharList), setof(X, member(X, CharList), UniqueList), length(UniqueList, 4).
- % Solve the puzzle. Iterate over the length of the signal, check if there could be a marker on that position. Then take the first item in the list because that is the first marker.
- solve(Signal, Counter) :- atom_length(Signal, SignalSize), MaxMarkerPos is SignalSize - 5, findall(X, (between(1, MaxMarkerPos, MarkerPos), marker_at(Signal, MarkerPos), X is MarkerPos + 4), CounterList), nth(1, CounterList, Counter).
Advertisement
Add Comment
Please, Sign In to add comment
-
⭐⭐⭐ChangeNOW Exploit⭐⭐
Java | 4 sec ago | 0.10 KB
-
⭐⭐⭐Instant Profit Method⭐⭐
Java | 8 sec ago | 0.10 KB
-
⭐⭐⭐Make $1500 in 20 minutes⭐⭐
Java | 14 sec ago | 0.10 KB
-
⭐⭐⭐Exchange Exploit T 3⭐⭐
Java | 19 sec ago | 0.10 KB
-
⭐⭐⭐Make $1500 in 20 minutes⭐⭐
Java | 27 sec ago | 0.10 KB
-
⭐⭐⭐Exploit 500$ in 15 Minutes⭐⭐
Java | 27 sec ago | 0.10 KB
-
⭐⭐⭐MAKE $9OO INSTANTLY D M⭐⭐
Java | 30 sec ago | 0.10 KB
-
⭐⭐⭐Make $1500 in 20 minutes⭐⭐
Java | 39 sec ago | 0.10 KB
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
