BZOJ - #include <Seter> - using namespace Orz;
1005: [HNOI2008]明明的烦恼
http://www.zybbs.org/JudgeOnline/problem.php?id=1005
| RunID | User | Problem | Result | Memory | Time | Language | Code Length | Submit Time |
| 141673 | Seter | 1005 | Accepted | 756 kb | 28 ms | C/Edit | 885 B | 2011-08-12 21:15:51 |
这个题是裸的Pru(点点)ferCode……第一眼看过去就知道了……但是要写个高精度……不用longlong的话压6位还是可以的
就是用1~n填充n-2个空，对于确定度数x的点必须恰好出现x-1次C(n,x-1)//n是在变的。最后不缺定度数的x个点再填充剩下的y个空x^y。全部乘起来。
2423: [HAOI2010]最长公共子序列
http://www.zybbs.org/JudgeOnline/problem.php?id=2423
| RunID | User | Problem | Result | Memory | Time | Language | Code Length | Submit Time |
| 141235 | testSeter | 2423 | Accepted | 844 kb | 1008 ms | C | 1360 B | 2011-08-11 15:29:10 |
这是一道水题……直接DP+容斥原理乱搞就可以AC……但是我足足做了4小时，被Tim大神从头BS到脚才做出来……
这次我的程序写的不是很难看……所以不写题解了……直接看代码吧……
不过这个故事告诉我们几个道理：
1036: [ZJOI2008]树的统计Count
http://www.zybbs.org/JudgeOnline/problem.php?id=1036
| RunID | User | Problem | Result | Memory | Time | Language | Code Length | Submit Time |
| 141431 | Seter | 1036 | Accepted | 5064 kb | 1524 ms | C/Edit | 2456 B | 2011-08-12 10:20:45 |
用轻重边树链剖分写了下……由于已经写了QTREE3了所以这个很快就写出来了……而且速度也还理想……（真心懒得再写个树状数组……）囧……剖的东西看我的QTREE3代码罢……
1145: [CTSC2008]图腾totem
http://www.zybbs.org/JudgeOnline/problem.php?id=1145
| RunID | User | Problem | Result | Memory | Time | Language | Code Length | Submit Time |
| 141607 | testSeter | 1145 | Accepted | 6224 kb | 1020 ms | C/Edit | 837 B | 2011-08-12 18:39:59 |
| No. | RunID | User | Memory | Time | Language | Code Length | Submit Time |
| 1 | 141607(6) | testSeter | 6224 KB | 1020 MS | C | 837 B | 2011-08-12 18:39:59 |
R1……好高兴……