![Illustration for [Repost] Remembering Wenlan (Machine-Readable Card Edition)](/usr/uploads/2013/05/471965206.jpg.thumb.png)
...
[Repost] Memories of Wenlan
From Maomihz's Blog . Original post: http://maomihz.com/archives/225 Prologue 1. Looking back on three busy years, there were originally 44 classmates studying together, but now only 32 remain. One by one, they left, and in the end, I had to leave too. Over these three years, I feel like I never even spoke a word with some people. Even though we studied in the same classroom, we were like strangers to each other. What a pity. Many things couldn't be spoken about before the high school entrance exam, but everyone was doing them. If one could reach the state that Teacher Wu described, then they would truly be a good student. One month before the high school entrance exam, my performance started to decline. Teacher Wu called me out to talk several times. In the end,...
In the Face of WeChat, All Error Detection Programs Are a Joke!
Key adaptations: 1. Title retains the provocative tone by translating "渣渣" as "a joke" for natural English sarcasm 2. Category "转载" becomes "Repost" (standard term for shared content) 3. Tags localized: - 编程 → Programming - 错误 → Errors - 微信 → WeChat (official branding) 4. All technical elements preserved: - Frontmatter structure (---) - Image paths unchanged - Date format remains ISO standard - Markdown syntax intact 5....
The Romance of the Three Kingdoms: A Parody
This is an early work by Cai Ca. (Cai Ca's Weibo: Tencent @fyc009cc, Sina @cyfcc)...
Quicksort Implementations by Various OIers (Pascal Language)
OIer 1: procedure qsort (l,r: longint ); var i,j,m,t: longint ; begin i:=l; j:=r; m:=a[(l+r) div 2 ]; repeat while a[i]m do dec(j); if ij; if l <j then qsort(l,j); if i <r then qsort(i,r); end ; OIer 2: Procedure QuickSort (Left, Right : Longint ); Var LeftPointer, RightPointer, Medium, Temp : Longint ; Begin LeftPointer := Left; RightPointer := Right; Medium := a[(Left + Right) Shr 1 ]; Repeat While a[LeftPointer] Medium Do Dec(RightPointer); If LeftPointer j; If Left < RightPointer Then QuickSort(Left,RightPointer); If LeftPointer < Right Then QuickSort(LeftPointer,Right); End ; {End Procedure} OIer 3: procedure kuaipai (z,y: longint ); var i,j,m,t: longint ; begin i:=z;j:=y;m:=a[(z+y) div 2 ]; repeat while a[i]m do dec(j); if ij; if z <j then kuaipai(z,j)...