C语言题目与详解.docVIP

目录 Climb the Taishan Mountain(II) 2.Peach 3.逆序输出数列 4.逆序数 5.计算高度 6.分解质因数 7.输出数字 8.Problem B:数字之与 9.换零钱 10.素数求与 11.求阶乘与 11.Problem F:求一批正整数中的偶数与 12.统计各种字符个数 13.求最大公约数 14.求最大公约数 15.零起点学算法101——统计字母数字等个数 16.网站泄密 17.老外买瓷砖 18.堆瓷砖 19.新年大酬宾 20.定制瓷砖 21.句子比较大小 22.鹦鹉学舌3——C语言初学者百题大战之十三 23.鹦鹉学舌2——C语言初学者百题大战之十二 24.百鸡问题 25.零起点学算法89——程序设计竞赛 26.零起点学算法89——程序设计竞赛 27.Problem A:计算数列与 28.找钱问题 29.Median 30.素月 31.输入任意N个数，求与 32.多项式求与 33.人口问题 34.数字菱形 Climb the Taishan Mountain(II) Time Limit:1000MS Memory Limit:65536KTotal 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 WangPengs 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 #includestdio.h int main() { int n,i,j,a[41]; while(scanf(%d,n)!=EOF) { a[0]=1; a[1]=2; for(i=2;i40;i++) { a[i]=a[i-1]+a[i-2]; } printf(%d\n,a[n-1]); } } Peach Time Limit:1000MS Memory Limit:65536KTotal 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