—— 请按键盘 空白键 开始游戏 ——

Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
"You can't do anything about the length of your life, but you can do something about its width and depth."