Königsberg Delivery Problem — GPN CTF 2026
Reversing a 250-state control-flow-flattened automaton whose success check requires visiting every state — i.e. finding a Hamiltonian path through the transition graph.
Elf
No writeups match your filter.
No writeups match your filter.
Reversing a 250-state control-flow-flattened automaton whose success check requires visiting every state — i.e. finding a Hamiltonian path through the transition graph.