1988的博客

C - Game of Taking Stones   import java.math.BigDecimal; import java.util.Scanner; public class Main { public static void main(String[] args) { BigDecimal TWO = BigDecimal.valu

John Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 63 Accepted Submission(s): 43   Problem Description Little J

Being a Good Boy in Spring Festival Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 54 Accepted Submission(s): 47  

Rabbit and Grass Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 44 Accepted Submission(s): 42   Problem Description

Fibonacci again and again Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 140 Accepted Submission(s): 86   Problem D

SG函数入门 sg[i]为0表示i节点先手必败。 首先定义mex(minimal excludant)运算，这是施加于一个集合的运算，表示最小的不属于这个集合的非负整数。例如mex{0,1,2,4}=3、mex{2,3,5}=0、mex{}=0。 对于一个给定的有向无环图，定义关于图的每个顶点的Sprague-Grundy函数g如下：g(x)=mex{ g(y) | y是

博弈知识汇总 有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个 人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏 ，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够 取胜。 （一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规 定每次至少取一个，最多取m个。最后取光者得胜

Good Luck in CET-4 Everybody! Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 92 Accepted Submission(s): 75   Proble

Brave Game Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 87 Accepted Submission(s): 75   Problem Description 十年

Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 54 Accepted Submission(s): 48   Problem Description Bob and