知与谁i的博客

Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6879    Accepted Submission(s): 4165Problem Descr

  有2堆石子。A B两个人轮流拿，A先拿。每次可以从一堆中取任意个或从2堆中取相同数量的石子，但不可不取。拿到最后1颗石子的人获胜。假设A B都非常聪明，拿石子的过程中不会出现失误。给出2堆石子的数量，问最后谁能赢得比赛。例如：2堆石子分别为3颗和5颗。那么不论A怎样拿，B都有对应的方法拿到最后1颗。Input第1行：一个数T，表示后面用作输入测试的数的数量。（1 <...

   有2堆石子。A B两个人轮流拿，A先拿。每次可以从一堆中取任意个或从2堆中取相同数量的石子，但不可不取。拿到最后1颗石子的人获胜。假设A B都非常聪明，拿石子的过程中不会出现失误。给出2堆石子的数量，问最后谁能赢得比赛。例如：2堆石子分别为3颗和5颗。那么不论A怎样拿，B都有对应的方法拿到最后1颗。Input第1行：一个数T，表示后面用作输入测试的数的数量。（1 &...

Triple NimTime Limit: 2000MS Memory limit: 65536K题目描述Alice and Bob are always playing all kinds of Nim games and Alice always goes first. Here is the rule of Nim game:    There are s

JohnTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4714    Accepted Submission(s): 2725Problem DescriptionLittle John is playin

 1067 Bash游戏 V2基准时间限制：1 秒 空间限制：131072 KB 分值: 10 难度：2级算法题 收藏  关注有一堆石子共有N个。A B两个人轮流拿，A先拿。每次只能拿1，3，4颗，拿到最后1颗石子的人获胜。假设A B都非常聪明，拿石子的过程中不会出现失误。给出N，问最后谁能赢得比赛。例如N = 2。A只能拿1颗，所以B可以拿到最后1颗石子。Inpu...

Calendar GameTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4335    Accepted Submission(s): 2628Problem DescriptionAdam and Eve

Euclid's GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3434    Accepted Submission(s): 1599Problem DescriptionTwo players,

Game of Taking StonesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 458    Accepted Submission(s): 175Problem DescriptionTwo pe

Game!Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem DescriptionOne day, zbybr is playing a game with blankcqk, here are the rules of the game:There is a circ

题目链接：http://codeforces.com/problemset/problem/768/E题意：给定n堆石子，第i堆石子有a[i]个，两个玩家交替从n堆中取石子，不过如果一个玩家在第i堆中取过m个石子，则另一个玩家则不能在第i堆再取m个石子，最后不能取石子的人为输，jon赢则输出YES否则输出NO，jon为后手思路：对于玩家来说，第i堆石子不能拿以前拿过的数量，求出第i堆石子最

Euclid's GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9928 Accepted: 4063DescriptionTwo players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtr...

Beans GameTime Limit: 5 Seconds      Memory Limit: 32768 KBThere are three piles of beans. TT and DD pick any number of beans from any pile or the same number from any two piles by turns. Wh

Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10047    Accepted Submission(s): 4274Problem Description

Georgia and BobTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11346 Accepted: 3746DescriptionGeorgia and Bob decide to play a self-invented game. The

Cutting GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4794 Accepted: 1753DescriptionUrej loves to play various types of dull games. He usually a

Stone Game IITime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 401    Accepted Submission(s): 230Problem Description　　Stone Game I

题目链接：LA5059【题意】：有n堆石子，第i堆石子有ai个，两个玩家依次轮流取石子，每次从一堆中最少取一个，不能超过该堆石子数量的一半（1<=取石子数<=ai/2）；【思路】：sg打表，发现所有偶数的sg值都为该数的1/2,奇数的sg值是当/2是遇到的第一个偶数的1/2.【代码如下】 #include <cstdio>#include <c...

NimTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6393 Accepted: 3043DescriptionNim is a 2-player game featuring several piles of stones. Players a

S-NimTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4655 Accepted: 2438DescriptionArthur and his sister Caroll have been playing a game called Nim fo

Language:DefaultA Chess GameTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 4327 Accepted: 1747DescriptionLet's design a new chess game. There are N positions to hold M chesses in this game....

A New Stone GameTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6214 Accepted: 3394DescriptionAlice and Bob decide to play a new stone game.At the beg

Crosses and CrossesTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 4059 Accepted: 1591Case Time Limit: 2000MSDescriptionThe game of Crosses and Crosses is played on the field of 1 × n cells....

Football GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 362 Accepted: 125DescriptionAlice and Bob both love football very much, and both of them ar

C. Industrial Nimtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputThere are n stone quarries in Petrograd.

 1534 棋子游戏题目来源： CodeForces基准时间限制：1 秒 空间限制：131072 KB 分值: 20 难度：3级算法题波雷卡普和瓦西里喜欢简单的逻辑游戏。今天他们玩了一个游戏，这个游戏在一个很大的棋盘上进行，他们每个人有一个棋子。他们轮流移动自己的棋子，波雷卡普先开始。每一步移动中，波雷卡普可以将他的棋子从(x,y) 移动到 (x-1,y) 或者 (x,y-1)。而...

C. Pie or dietime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVolodya and Vlad play the following game. The

 B. Traintime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA stowaway and a controller play the following game.The train is re...

C. Beaver Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo beavers, Timur and Marsel, play the following game.There are n logs, each of exac...

C. Interesting Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo best friends Serozha and Gena play a game.Initially there is one pile consi...

 C. Zero-Onetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Petya very much likes playing with little Masha. Recently h...

 A. Win or Freezetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou can't possibly imagine how cold our friends are this wint...

 C. Naming Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOleg the client and Igor the analyst are good friends. Howev...