ftx456789的博客

七夜雪寂，一世人心Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)Submit StatusNim游戏是一种传统的游戏，其套路也渐渐被人熟悉，大家都不喜欢这种一眼就看出输赢的游戏，因此有人修改了Nim游戏的规则：1.这仍然是一个二人游

GameiaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1003    Accepted Submission(s): 426Problem DescriptionAlice and Bob are pl

Alice and Bob are playing a strange game. The rules of the game are:Initially there are n piles.A pile is formed by some cells.Alice starts the game and they alternate turns.In each tern a playe...

Alice and Bob are playing a stone game. Initially there are n piles of stones and each pile contains some stone. Alice stars the game and they alternate moves. In each move, a player has to select any...

帽儿山奇怪的棋盘 帽儿山奇怪的棋盘 Problem:1356Time Limit:1000msMemory Limit:65535KDescription 军哥来到了帽儿山，发现有两位神人在顶上对弈。棋盘长成下图的模样： 每个点都有一个编号：由上到下，由左到右，依次编号为 1、2……12。两位神人轮流博 弈，每一轮操作的一方可以取走一个棋子，或者取走相邻的两个棋子（即在同...

题意有一堆数量为N的石子，石子编号从1⋯N1\cdots N1⋯N排成一列，两个人玩游戏，每次可以取1⋯K1\cdots K1⋯K个连续编号的石子，Adrien先手，如果有谁不能取了则他输，两个人为Adrien 和Austin思路当K为1时显然的和N的奇偶性有关，那么我们考虑一下K>1K>1K>1的情况对于先手的Adrien来说，他对任意的N颗石子，他都可...

A Simple NimTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1906 Accepted Submission(s): 1002Problem DescriptionTwo players take turns pi...

ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3721 Accepted Submission(s): 1519Problem DescriptionAlice and Bob are playing a spec...