你越努力,就越幸运。
过去总是紧张的,而未来是完美的。
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
价格被遗忘后,质量仍会被长久记住。
If I'm honest I have to tell you I still read fairy-tales and I like them best of all.