绍兴回来，我的oi生涯就要暂时结束了

虽然一块铜牌告终，我也已经很满足了。至少我没有空手而归

现在开始转型Pho了，上了一周的实验课，坐在闷热的实验室里调叉丝，弄得我心烦意乱

算算回来的日子，也许是两个月后，也许是四个月后，最糟糕的话要等上一年。那就要看我的实力如何了

再见了，亲爱的朋友们!

祝你们好运！

太喜欢黑色，必须换一个明亮点的模板了

期末考完就高三，前两年因为成绩始终不好而过的十分郁闷

我要趁着这个假期奋斗了，背单词，学语文，做完尘封的金牌之路....还有oi

期末考试前十分迷信地买了只新笔，哎，我太渺小，太脆弱所以太不知所措

努力吧，否则就没有机会了

明天就要高考了，大家要加油啊！

祝snail、recruit、幼儿园时把我鼻子挠开花的蔡同学、竞祎、还有德强的学哥学姐们明天好运！

必胜！

【性质一】 若完全二叉树某一结点右子树深度为d，则其左子树深度为d或d+1

【性质二】 对任何一棵二叉树，叶结点个数n0，度为2的结点个数n2，则n0=n2+1

我的理解：把二叉树看做从叶结点开始合并，若父结点度为1则等同于没合并，若度为2相当于减少一个结点，结点数从n0到根结点1，共需减少（n0-1）次，即需要（n0-1）个度为2的结点，所以n0-1=n2

这么长时间，我竟然不会链表。

program style;
type l=^rec;
     rec=record
       data:integer;
       next:l;
     end;
var n,o:integer;
    head:l;
procedure build;  

大家都开学了，由于一再被误诊，我还得在家隔离一周。

也挺好的，这一周打算学一下数据结构，usaco暂时告一段落。

The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set of N digits into the positions marked with *. If the set of prime digits {2,3,5,7} is selected, the cryptarithm is called a PRIME CRYPTARITHM.

      * * *
   x    * *
    -------
      * * *
    * * *
    -------
    * * * 

It is said that if you give an infinite number of cows an infinite number of heavy-duty laptops (with very large keys), that they will ultimately produce all the world's great palindromes. Your job will be to detect these bovine beauties.

Ignore punctuation, whitespace, and case when testing for palindromes, but keep these extra characters around so that you can print them ou

It was a dark and stormy night that ripped the roof and gates off the stalls that hold Farmer John's cows. Happily, many of the cows were on vacation, so the barn was not completely full.

The cows spend the night in stalls that are arranged adjacent to each other in a long line. Some stalls have cows in them; some do not. All stalls are the same width.

Farmer John must quickly erec

已经打了7天针，终于好了！

这七天想了很多，想着自己依旧很弱的oi。又想起自认为不错的数学竞赛考砸的那个晚上。

老天是不是在考验我啊？  

真希望是CMO而不是NOI，哎。 虽然这么说，我是发自内心很喜欢oi，已经进了，我就好好准备吧！OI,MO并重。但愿MO功底能弥补我高中才开始OI的缺陷。