# FZU 1016 无归之室

无归之室Time Limit:1sMemory limit:32MAccepted Submit:376Total Submit:4103金字塔中有一个房间名叫“无归之室”。房间地面完全由相同的矩形瓷砖覆盖。房间里布满无数的机关和陷阱，这正是其名字的由来。考古队花了几年时间研究对策，最后他们想出了一个方案。一...

# HDU 3007 Buried memory

Buried memoryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 261    Accepted Submission(s): 139Problem DescriptionEach person had do somet...

Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1914    Accepted Submission(s): 628Problem DescriptionThere are N villag...

# FZU 1147 Tiling

TilingTime Limit:1sMemory limit:32MAccepted Submit:197Total Submit:496In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles? Here is a sample til...

# FZU 1084 Three powers

Three powersTime Limit:1sMemory limit:32MAccepted Submit:96Total Submit:217Consider the set of all non-negative integer powers of 3.  S = { 1, 3, 9, 27, 81, ....

# HDU 1907 John

JohnTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 258    Accepted Submission(s): 130Problem DescriptionLittle John is playing very fu...

# 三种博弈问题

有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。    ...

# HDU 1908 Double Queue

Double QueueTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 116    Accepted Submission(s): 68Problem DescriptionThe new founded Balk...

# HDU 1913 Computers

ComputersTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 248    Accepted Submission(s): 73Problem DescriptionEverybody is fond of computer...

# FZU 1046 Tempter of the Bone

Tempter of the BoneTime Limit:1sMemory limit:32MAccepted Submit:305Total Submit:1026The doggie found a bone in an ancient maze, which...

# 2~10进制内转换到10进制

2~10进制内转换到10进制转换是可以从最后一位开始的，每次我的第一直觉都是按公式从前面开始，发现很经常错。从后面开始比较简洁而且不易错误。/************************************************************************//* a是要转换的数，bit是原本的进制（2~10） ...

42条 共3页1 2 3 下一页 尾页
个人资料
• 访问：3507835次
• 积分：35820
• 等级：
• 排名：第138名
• 原创：400篇
• 转载：88篇
• 译文：5篇
• 评论：3419条
个人说明
联系方式：
文章存档
最新评论