碳酸钙的01妖精的博客

Cutting Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5342   Accepted: 1958 Description Urej loves to play various types of dull games. He usually asks other peop...

Football Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 389   Accepted: 147 Description Alice and Bob both love football very much, and both of them are vanguards....

Alice和Bob在玩这样一个游戏。给定k个数字a[1],a[2],…,a[k]。一开始，有x枚硬币，Alice和Bob轮流取硬币。每次所取硬币的枚数一定要在a[1],a[2],…,a[k]当中。Alice先取，取走最后一枚硬币的一方获胜。当双方都采取最优策略时，谁会获胜？题目假定a[1],a[2],…,a[k]中一定有1。 限制条件：  1<=x<=10000  1<=k...

A Funny Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6818   Accepted: 4260 Description Alice and Bob decide to play a funny game. At the beginning of the game th...

Euclid's Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10550   Accepted: 4295 Description Two players, Stan and Ollie, play, starting with two natural numbers. St...

Georgia and Bob Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 12208   Accepted: 4056 Description Georgia and Bob decide to play a self-invented game. They draw a row o...

在简单的情况下，一一枚举，发现S_ _S 这种情况 先进空格谁先输 所以当n为奇数的时候，先手 构S_ _S 后手防        当n为偶数的时候，先手防S_ _S 后手构 从中间开始构 ，从中间开始防 当 n 为 7 时 形成双头 防不住 所以 >=7的奇数 先手必赢 当 n为偶数 ， 从中间 开始防，当一边为7 ，则防不住， 这时n为15 ，但n==15先手必胜 所以...