<b_jonas> `` set -e; f=/hackenv/bin/bfbotquine; d=/hackenv/bin/STOP; >$d echo $\'#!/bin/sh\\nrm -fv \'"$f"; >$f echo $\'#!/bin/sh\\nsleep 50; echo ":"="hackesoquine"; sleep 20\'; chmod -c a+x $d $f

NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.