思考题 featuring Hikari again! Guess the string Hikari and her master Ninetail are playing a game. Hikari thinks of a string S with lower-case letters, and Ninetail asks her to make q modifications one by one. Each modification can only be one of t……

（提醒：本游记体量较大，字数超过21500，图片数量超过100，可以考虑在WiFi环境下阅读）   “慢下来，一倍速生活” ——大理市公益广告标语   在眼前一闪而过的文字，是身处大城市遥不可及的幻想，或许只有一片无比纯净而美丽的山水与天地，才能承载得住这样温暖又令人动……

Dieudonne的题, 真实难度不好说, 回顾一下发现其实挺简单的. 题面 Let E be a Hilbert space, F a dense linear subspace of E, distinct from E. (For example E space of l^2 sum of a suitable countable linear independent set and F space of finite sum of thi……

It's a well known fact that Euclidean domains are principal ideal domain by taking the element in a certain ideal with smallest \varphi value. Yet the converse is false, and one counterexample just lies among our familiar algebraic integer rings, \……

题目背景 为证一个非零吃大师 题面 Assuming AC, prove that for a integral domain R, if any nonzero prime ideal P contains a nonzero prime (p), R is UFD. 先想再看提示哦 提示 Let S be the set of elements that are prime factori……

This proof is due to Choudum. A sequence of nonnegative integers (d_1,...,d_n) is called graphic if there is a simple graph G with V(G)=\lbrace v_1,...,v_n\rbrace and d(v_i)=d_i. It's very easy to show that if a nonincreasing sequence, i.e. d_1\ge ……

飞机上半昏迷状态下以为无法调整, 暴力算出来的搞笑解答. 非常具有统计色彩 (nod) 题面 A simple graph G is called complete k-partite if there's a partion of V(G): A_1,..., A_k s.t. for all i there's no edge with both vertices in A_i , and for any v\in A……

概括 原文为英文，本文是回忆版，具体数据可能有误。考完收试卷、草稿纸。可以携带一张A4手写笔记。不可以带计算器。 期中传送门 120分钟5题. P1 有一根长为2a的均匀杆子竖立在光滑水平面上，由于扰动开始倒下，问： 快接触地面时的角速度 快接触地面时的质心速度 P……

笔者第一次考试破防，故记录题目如下，希冀后人能够免除高程的烦恼 概念解释（20pt） 数据抽象与封装和过程抽象与封装的区别是什么？ C++中代码复用的例子？ 虚函数是什么？有什么作用？有什么缺点？ C++中创建对象的方式有哪些？他们有什么区别？ 改错和读程序……

120分钟满分100，闭卷。手写代码C++。 P1 (10pts) public protected private成员对（类内部、子类、外部、友元）的可见性？ P2 (15pts) 有形如这样的单链表： struct Node{int data; Node* link;} 满足data在链表上严格递增。 给出两个链表头first和second，判断这两……