摘要： FibonacciTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7752Accepted: 5501DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative formul 阅读全文

摘要： 矩阵的快速幂是用来高效地计算矩阵的高次方的。将朴素的o（n）的时间复杂度，降到log（n）。这里先对原理（主要运用了矩阵乘法的结合律）做下简单形象的介绍：一般一个矩阵的n次方，我们会通过连乘n-1次来得到它的n次幂。但做下简单的改进就能减少连乘的次数，方法如下：把n个矩阵进行两两分组，比如：A*A*A*A*A*A => (A*A)*(A*A)*(A*A)这样变的好处是，你只需要计算一次A*A，然后将结果(A*A)连乘自己两次就能得到A^6，即(A*A)^3=A^6。算一下发现这次一共乘了3次，少于原来的5次。其实大家还可以取A^3作为一个基本单位。原理都一样：利用矩阵乘法的结合律，来减少 阅读全文

摘要： The Farnsworth Parabox Professor Farnsworth, a renowned scientist that lives in year 3000 working at Planet Express Inc., performed a failed experiment that nearly killed him. As a sub-product, some strange boxes were created. Farnsworth gave one of the boxes to Leela, who accidentally discovered .. 阅读全文

摘要： A New Tetris GameTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 929Accepted Submission(s): 422 Problem Description曾经，Lele和他姐姐最喜欢，玩得最久的游戏就是俄罗斯方块(Tetris)了。 渐渐得，Lele发觉，玩这个游戏只需要手快而已，几乎不用经过大脑思考。 所以，Lele想出一个新的玩法。Lele和姐姐先拿出一块长方形的棋盘，这个棋盘有些格子是不可用的，剩下的都是可用 阅读全文

摘要： A Chess GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1100 Accepted Submission(s): 504 Problem DescriptionLet's design a new chess game. There are N positions to hold M chesses in this game. Multiple chesses can be located in the same p 阅读全文

摘要： S-NimProblem DescriptionArthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows:The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.The players take turns chosing a heap and removing a positive. 阅读全文

摘要： 以下是我从网上收集的关于组合博弈的资料汇总：有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意. 阅读全文

摘要： MineTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 352 Accepted Submission(s): 94 Problem DescriptionHave you ever played a game in Windows: Mine? This game is played on a n*m board, just like the Pic(1) On the board, Under some grids there ar.. 阅读全文

摘要： Phone ListTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7343Accepted Submission(s): 2525 Problem DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone ca 阅读全文

摘要： 统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 13831Accepted Submission(s): 5938 Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatiu 阅读全文