Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
NP中的每个问题都可以归约为可满足性问题，这是计算复杂性理论的基石。
善良是无处不在的，你所需要做的就是去看，所以，我们只需要去看，我们一直都在寻找善良，其实善良是无处不在的。
我感激每一刻，每一次经历。
The only way of discovering the limits of the possible is to venture a little way past them into the impossible.
I'm not a businessman, I'm a business, man!
可持续性不是一种选择；它是我们对后代的责任。
"Tennis is a sport where you have to be strong mentally and physically, but the mental part is even more important."
预测未来的最好方法就是去发明它。