摘要： 博弈知识汇总有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意自然数，s≤m),那么先取者要拿. 阅读全文

摘要： 取石子问题有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的 法则：如果n=（m+1）r+s，（r为任意自然数，s≤m),那么先取者要拿走 阅读全文

摘要： Tiles of Tetris, NOT!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 569Accepted Submission(s): 229Problem DescriptionYou’ve really messed up this time. “Go buy some square tiles” your supervisor told you. But as usual, you were either busy reading 阅读全文

摘要： Probability OneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 301Accepted Submission(s): 224Problem DescriptionNumber guessing is a popular game between elementary-school kids. Teachers encourage pupils to play the game as it enhances their arithm 阅读全文

摘要： Not So Flat After AllTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 517Accepted Submission(s): 209Problem DescriptionAny positive integer v can be written as p1 a1 * p2 a2 * . . . pnan where pi is a prime number and ai >= 0. For example: 24 = 2 阅读全文

摘要： Power NetworkTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 15399Accepted: 8201DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 阅读全文

摘要： 题目链接：http://poj.org/problem?id=2723【题目大意】有2n把钥匙，分成2组，给你每组的钥匙信息，并且每组的钥匙只能用一个。有m个门，每个门有2个锁，只要打开一个锁这个门就开了。（顺序遇见m个门）问你最多能够打开多少个门。【解题思路】因为只能门只能按照顺序打开，所以很自然二分是个很好的选择。建图的依据：１、每对钥匙a,b有(a->!b),(b->!a) 也就是 a and b = 0　a被用b不被用，或b被用a不被用，或a,b都不被用２、每善门对应锁的钥匙a,b有(!a->b),(!b->a) 也就是 a or b = 1，用a能打开用b不能 阅读全文

摘要： 讲解见：http://hi.baidu.com/chinaeli/blog/item/dd00463cdb40eecf9f3d62c7.htmlhttp://blog.163.com/lfw2565295@126/blog/static/12200516201102012251212/代码：#include<stdio.h>#include<math.h>#include<iostream>using namespace std;const int MAXN=1005;const int MAXM=1000005;struct Node{ int l,r;} 阅读全文

摘要： Go DeeperTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 309Accepted Submission(s): 122Problem DescriptionHere is a procedure's pseudocode:go(int dep, int n, int m)beginoutput the value of dep.if dep < m and x[a[dep]] + x[b[dep]] != c[dep] t 阅读全文

摘要： Bomb GameTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1543Accepted Submission(s): 492Problem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each 阅读全文