我和我的三只猫

1041 竞赛游戏DescriptionA和B准备玩一个游戏，游戏是这样的，一开始桌面上面放了n堆石子，每次每个人能从任意一堆里面取走任意颗石子，直到某个人无法取走石子为止，游戏结束，不能再取石子的人就为输！A和B在这个游戏中都表现的足够优秀，且总是由A先开始。现在给定桌面上石子的初始状态，由你来编写程序确定最终获得胜利的是A还是B。Input输入包括多组测

Public SaleProblem Description虽然不想，但是现实总归是现实，Lele始终没有逃过退学的命运，因为他没有拿到奖学金。现在等待他的，就是像FarmJohn一样的农田生涯。要种田得有田才行，Lele听说街上正在举行一场别开生面的拍卖会，拍卖的物品正好就是一块20亩的田地。于是，Lele带上他的全部积蓄，冲往拍卖会。后来发现，整个拍卖会

kiki's gameTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/10000 K (Java/Others)Total Submission(s): 10592    Accepted Submission(s): 6419Problem DescriptionRecently kiki

Matrix Multiplication(zoj   2316)Let us consider undirected graph G =  which has N vertices and M edges. Incidence matrix of this graph is N * M matrix A = {a ij}, such that a ij is 1 if i-th vertex i...

Decimal integer conversion时间限制：1000 ms  |  内存限制：65535 KB难度：2描述XiaoMing likes mathematics, and he is just learning how to convert numbers between different bases , but he keeps making errors since he i...

题目描述There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). 输入描述:Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000). ...