Leseratte
In this blog I talk about how this blog was built, developed, and transformed to the current state.
2011 年的夏天，刚刚结束中考的我与 AMA 一起由重庆朝天门码头乘船溯流而下，至湖北宜昌而终。其中经过的最美的景色是三峡中的小三峡，但我当时却无暇欣赏美景，只因眼神不好，看不清导游所指的许多悬棺。懊恼之际，上岸后偶然在一博物馆的玻璃展览柜中遇到一本讲述悬棺的书：重庆出版社于 1992 年出版的《中国悬棺葬》，顿生好奇。但因玻璃之隔，无法阅读，更是恼怒。
十年之后，今日在 GZ 图书馆观看拉斐尔画展，偶得此书于顶楼的 GZ 人文馆，喜不自胜。等到翻开，发现其中有关于三峡悬棺（原书 88-89 页）与悬棺升置技术（原书 138-151 页），更是喜笑颜开。得意忘形之中，索性将两部分摘录如下：
《谁是最可爱的人》
The question of whether a computer can think is no more interesting than the question of whether a submarine can swim.
Edsger Wybe Dijkstra
During the past summer, I worked at a friend's tech startup and established a course scheduling system. I served as a full stack engineer for backend, frontend, and algorithm. In the following I will share some ideas and insights on the algorithm.
A few weeks ago, I was invited to a friend's house. On the table I saw the Tower of Hanoi game. I immediately realized with intuition that the total number of steps to move should be exponential to the number of disks, but I could not think of a proof at the time. Thus, I write this blog about this interesting ancient problem.
今天偶然回想起高中时去听的一个凝聚态物理教授给学生们做的怀念黄昆先生的讲座，里面提到了杨振宁先生撰写的一篇关于黄昆先生