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

Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
The writer must be a witness to history, even if history ignores him.
The difference between ordinary and extraordinary is that little extra.
The more one works, the more one discovers.