-
2008-09-21
[笔记]hrbeu的网络赛F题 - [武林秘籍]
1006 Counter StrikeTimeLimit : 1 Second Memorylimit : 32 Megabyte
Totalsubmit : 1471 Accepted : 119
Anti-terrorism is becomming more and more serious nowadays. The country now has n soldiers,and every ... -
2008-09-02
pku 3683 2-SAT求解 - [武林秘籍]
Priest John's Busiest DayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 446 Accepted: 103 Special JudgeDescription
John is the only priest in his town. September 1st is the John's busiest day in a year because there... -
2008-08-28
[笔记]POLYA计数法 - [武林秘籍]
//poj2154 Color Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1236 Accepted: 339Description
Beads of N colors are connected together into a circular necklace of N beads (N<=1000000000). Your job is to calculate ho... -
2008-08-23
[笔记]状态压缩TSP - [武林秘籍]
//poj 2288Islands and BridgesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 1935 Accepted: 495Description
Given a map of islands and bridges that connect these islands, a Hamilton path, as we all know, is a path alo... -
一些基本知识:
N:next出手的人胜,也叫必胜态
P:previous出手的人胜,也叫必败态
Sprague-Grundy定理:
1.SG[I]=所有可以推出它的状态的SG函数值中没有出现的最小值。
2.SG分解:如果同一局面有多种决策,那么结果是所有决策SG函数值的异或。
知道这个定理了以后,某些题就水起来了~
//poj 2234 SG分解的纯水
Matches Ga...







