![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 69
Tsdmw&5t5
Emmmmmmm
展开
-
骨牌铺方格
骨牌铺方格 Time Limit: 1000MS Memory limit: 32768K 题目描述 在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数. 例如n=3时,为2× 3方格,骨牌的铺放方案有三种,如下图: 输入 输入数据由多行组成,每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (0 输出 对于每个原创 2014-01-26 18:20:09 · 720 阅读 · 0 评论 -
u Calculate e
Description A simple mathematical formula for e is where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.原创 2014-02-03 14:02:18 · 458 阅读 · 0 评论 -
Elevator
Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order.原创 2014-02-03 13:57:14 · 329 阅读 · 0 评论 -
Easier Done Than Said?
Description Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computer-generate原创 2014-02-03 14:54:22 · 415 阅读 · 0 评论 -
Biker's Trip Odometer
Description Most bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is attached to one of the spokes on the front wheel so that it will line原创 2014-02-03 14:51:01 · 309 阅读 · 0 评论 -
Number Sequence
B - Number Sequence Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description A number sequence i原创 2014-02-03 13:42:38 · 368 阅读 · 0 评论 -
吃糖果
Description HOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。 Input 第一行有一个整数T,接下来T组数据,每组数据占2行,第一行是一个原创 2014-02-03 15:23:39 · 401 阅读 · 0 评论 -
18岁生日
V - 18岁生日 Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description Gardon的18岁生日就要到了,他当然很开心,可是他突然原创 2014-02-03 15:21:19 · 466 阅读 · 0 评论 -
Climbing Worm
Description An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slip原创 2014-02-03 14:58:07 · 382 阅读 · 0 评论 -
Fibonacci Again
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). Input Input consists of a sequence of lines, each containing an integer n. (n原创 2014-02-03 14:38:40 · 302 阅读 · 0 评论 -
阿牛的EOF牛肉串
阿牛的EOF牛肉串 Time Limit: 1000MS Memory limit: 32768K 题目描述 今年的ACM暑期集训队一共有18人,分为6支队伍。其中有一个叫做EOF的队伍,由04级的阿牛、XC以及05级的COY组成。在共同的集训生活中,大家建立了深厚的友谊,阿牛准备做点什么来纪念这段激情燃烧的岁月,想了一想,阿牛从家里拿来了一块上等的牛肉干,准备在上面刻下一个原创 2014-01-26 18:22:43 · 458 阅读 · 0 评论 -
递归的函数
递归的函数 Time Limit: 1000MS Memory limit: 65536K 题目描述给定一个函数 f(a, b, c):如果 a ≤ 0 或 b ≤ 0 或 c ≤ 0 返回值为 1;如果 a > 20 或 b > 20 或 c > 20 返回值为 f(20, 20, 20);如果 a 其它情况返回 f(a−1, b, c) + f(a−1, b−1, c) + f(a−1,原创 2014-01-26 18:30:05 · 393 阅读 · 0 评论 -
三国佚事——巴蜀之危
三国佚事——巴蜀之危 Time Limit: 1000MS Memory limit: 65536K 题目描述 话说天下大势,分久必合,合久必分。。。却道那魏蜀吴三国鼎力之时,多少英雄豪杰以热血谱写那千古之绝唱。古人诚不我欺,确是应了那句“一将功成万骨枯”。 是夜,明月高悬。诸葛丞相轻摇羽扇,一脸愁苦。原来是日前蜀国战事吃紧,丞相彻夜未眠,奋笔急书,于每个烽火台写下安排书原创 2014-01-26 18:25:15 · 2038 阅读 · 0 评论 -
Digital Roots
E - Digital Roots Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description The digital root of a原创 2014-02-03 14:07:11 · 440 阅读 · 0 评论