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

Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
My past doesn't define me, it's just part of my story.
人情像纸一样十分脆薄,世界上的事如棋局一样变化万千。