People can be divided into these types: strangers, acquaintances, familiar people, friends, and close friends. True friendship isn't about compliments to your face, but whether you're mentioned when they talk about friends behind your back.
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
我喜欢狗。你总能知道狗在想什么。它们只有四种情绪：快乐、悲伤、生气和专注。而且狗很忠诚，它们不会说谎，因为它们不会说话。
竞争是一种顽强的野草，而非娇嫩的花朵。
失败只是宇宙告诉你下次不要做什么的方式。
这两者中间有着绝对的关联，一个告诉人们他们无所不能的社会，和缺乏自信有着绝对的关联。另一件好事也会带来坏影响的例子，还有一些其它原因造成我们对事业，对我们在世上的地位感到前所未有的焦虑，再一次地，它也和好的概念有关，这个好概念叫做“功绩主义”。
"I see everything. That is my problem."