Climb the Taishan Mountain(II)
Peach
逆序输出数列
逆序数
计算高度
分解质因数
输出数字
Problem B:数字之和
换零钱
素数求和
求阶乘和
11.Problem F:求一批正整数中的偶数和
统计各种字符个数
求最大公约数
求最大公约数
零起点学算法 101——统计字母数字等个 数
网站泄密
老外买瓷砖
堆瓷砖
新年大酬宾
定制瓷砖
句子比较大小
鹦鹉学舌 3—— C 语言初学者百题大战之 十三
鹦鹉学舌 2—— C 语言初学者百题大战之 十二
百鸡问题
零起点学算法 89——程序设计竞赛
零起点学算法 89——程序设计竞赛
Problem A:计算数列和
找钱问题
Median
素月
输入任意 N 个数,求和
多项式求和
人口问题
数字菱形
Climb the Taishan Mountain(II)
Time Limit:1000MS Memory Limit:65536K
Total Submit:753 Accepted:495
Description
Labor day is coming.Since the holiday is long,Many students are planning to have a tour. The Taishan Mountain is very beautiful, so WangPeng and his classmates want to climb the Taishan Mountain. Mountaineering sports is WangPeng's avocation, so he is very excited. Suddenly, a very amusing idea comes to him. The Taishan Mountain has many stairs, and he can climb the mountain one step by 2 stairs or by 1 stairs. How many ways does he have to climb the mountain? For example, the stairs is 2, he has 2 ways.The first one is the first step by 1 stair, and the next step by 1 stair.And the second way is only one step by 2 stairs.
Input
The input is including many test cases. Every line is one test case with a integer number N(N<=40). N is the stairs of the Taishan Mountain.
Output
You should output how many ways WangPeng can climb the mountain, each case output a line.
Sample Input
1
2
3
Sample Output
1
2
3
#include
int main()
{
int n,i,j,a[41];
while(scanf("%d",&n)!=EOF)
{
a[0]=1;
a[1]=2;
for(i=2;i<40;i++)
{
a[i]=a[i-1]+a[i-2];
}
printf("%d\n",a[n-1]);
}
}
Peach
Time Limit:1000MS Memory Limit:65536K
Total Submit:689 Accepted:495
Description
Almost all young man know Monkey Sun whose name is Sun Wukong. One day he steals many peaches from the kingdom of heaven. First day, he ate a half of the peaches, then ate another one of the left peaches.The next day, he ate a half of the left peaches, then another one.Until the n-th day ,before he ate he found only one peach. Please help Sun Wukong to calculate how many peach