摘要：
Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 660Accepted Submission(s): 468Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws 阅读全文
摘要：
MazeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1055Accepted Submission(s): 347Special JudgeProblem DescriptionWhen wake up, lxhgww find himself in a huge maze.The maze consisted by N rooms and tunnels connecting these rooms. Each pair of rooms 阅读全文
摘要：
飞行棋Time Limit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述飞行棋是在一个长度为n的棋盘上走动棋子的游戏。游戏开始时有一个棋子在棋盘的开始，位置是1。然后每一步玩家掷一次骰子，并将棋子往前跳骰子正面大小个格子。当棋子跳出飞行棋的棋盘时游戏结束。问游戏结束时玩游戏的人掷骰子次数的期望。输入第一行输入一个数T代表测试用例组数（T<=200），接下来T组测试用例，每组测试数据为棋盘大小。输出对于每个棋盘，输出玩家要掷骰子次数的期望(结果保留到小数点后4位)。每行输出一个结果。示例输入212示例输出1.00001.1667提示来源示例程序#in 阅读全文
摘要：
One Person GameTime Limit:1 Second Memory Limit:32768 KB Special JudgeThere is a very simple and interesting one-person game. You have 3 dice, namelyDie1,Die2andDie3.Die1hasK1faces.Die2hasK2faces.Die3hasK3faces. All the dice are fair dice, so the probability of rolling each value, 1 toK1,K2,K3is exa 阅读全文
摘要：
Collecting BugsTime Limit:10000MSMemory Limit:64000KTotal Submissions:1485Accepted:647Case Time Limit:2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he clas 阅读全文
摘要：
Scout YYF ITime Limit:1000MSMemory Limit:65536KTotal Submissions:3871Accepted:975DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficulties, YYF is now at the start of enemy's famous "mine roa 阅读全文
摘要：
Holiday's AccommodationTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 200000/200000 K (Java/Others)Total Submission(s): 1457Accepted Submission(s): 380Problem DescriptionNowadays, people have many ways to save money on accommodation when they are on vacation.One of these ways is exchanging 阅读全文
摘要：
The Ghost Blows LightTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1410Accepted Submission(s): 420Problem DescriptionMy name is Hu Bayi, robing an ancient tomb in Tibet. The tomb consists of N rooms (numbered from 1 to N) which are connected by s 阅读全文
摘要：
Python正则表达式操作指南 :http://wiki.ubuntu.org.cn/Python%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E6%93%8D%E4%BD%9C%E6%8C%87%E5%8D%97揭开正则表达式的神秘面纱[原创文章，转载请保留或注明出处：http://www.regexlab.com/zh/regref.htm]引言正则表达式（regular expression_r）就是用一个“字符串”来描述一个特征，然后去验证另一个“字符串”是否符合这个特征。比如 表达式“ab+” 描述的特征是“一个 'a' 阅读全文
摘要：
http://www.cnblogs.com/itech/archive/2009/12/15/1624120.htmlPython基本安装： *http://www.python.org/官方标准Python开发包和支持环境，同时也是Python的官方网站； *http://www.activestate.com/集成多个有用插件的强大非官方版本，特别是针对Windows环境有不少改进；Python文档： *http://www.python.org/doc/current/lib/lib.htmlPython库参考手册。 *http://www.byteofpython.info/... 阅读全文
摘要：
Information DisturbingTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1018Accepted Submission(s): 376Problem DescriptionIn the battlefield , an effective way to defeat enemies is to break their communication system.The information department told 阅读全文
摘要：
GeoDefenseTime Limit: 12000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 414Accepted Submission(s): 173Problem DescriptionTower defense is a kind of real-time strategy computer games. The goal of tower defense games is to try to stop enemies from reaching your b 阅读全文
摘要：
Find Metal MineralTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1744Accepted Submission(s): 774Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each of them wh 阅读全文
摘要：
The more, The BetterTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3784Accepted Submission(s): 2230Problem DescriptionACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多 阅读全文
摘要：
Strategic GameTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3580Accepted Submission(s): 1573Problem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is v 阅读全文
摘要：
Anniversary partyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2668Accepted Submission(s): 1192Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical stru 阅读全文
摘要：
Stern-Brocot TreeTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 251Accepted Submission(s): 159Problem Description 上图是一棵Stern-Brocot树，其生成规则如下： 从第1行到第n行，每行相邻两数a/b和c/d，产生中间数(a+c)/(b+d)，置于下一行中。将一行的分数（包括0/1,1/0），进行约分简化，则每一行（包括0/1,1/0,1/1），不会出现两个相... 阅读全文