我不是最靓仔的人,但我是最有魅力的人。
我比我想象的更强大。
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
当没有人相信你时,你必须相信自己。