$ cat writeup.md…
$ cat writeup.md…
CACTF2026
Task: coding challenge on a Flask/Werkzeug judge asking for the minimum number of intermediate nodes to remove to disconnect a directed source from a sink. Solution: recognize it as minimum s-t vertex cut, solve via Menger's theorem with node-splitting max-flow (Dinic's), submit through POST /run.
Permission denied (requires tier.pro)
Sign in with GitHub, Discord, or Google to continue. No email required.
$sign in$ grep --similar