递归、变量生存期

2021.5.5

1.输出斐波那契数列

/*Fibonacci数列 0,1,1,2,3,5,8
赵佳琪2020510754
2021.5.5*/
#include<stdio.h>
long Fib(int n);
int main()
{
	int i,n;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		printf("%5d",Fib(i));
	}
	printf("\n");
	return 0;
} 
long Fib(int n)
{
	long f;
	if(n==0)
	   f=0;
	else if(n==1)
	   f=1;
	else
	   f=Fib(n-1)+Fib(n-2);
	return f;
}

手写过程为

2.汉诺塔

/*汉诺塔
赵佳琪2020510754
2021.5.5*/
#include<stdio.h>
int main()
{
	void hanoi(int n,char one,char two,char three);
	int m;
	scanf("%d",&m);
	hanoi(m,'A','B','C');
	return 0;
}
void hanoi(int n,char one,char two,char three)
{
	void move(char x,char y);
	if(n==1)
	   move(one,three);
	else
	{
		hanoi(n-1,one,three,two);
		move(one,three);
		hanoi(n-1,two,one,three);
	}
}
void move(char x,char y)
{
	printf("%c-->%c\n",x,y);
}

手写过程为

3.求长方体体积及三个面面积

/*求长方体体积及三个面的面积
赵佳琪2020510754
2021.5.5*/
#include<stdio.h>
int s1,s2,s3;///面积
int vs(int a,int b,int c)
{
	int v;//体积
	v=a*b*c;
	s1=a*b;
	s2=b*c;
	s3=a*c;
	return v; 
 } 
int main()
{
	int v,length,width,height;
	printf("Input length,width and height:");
	scanf("%d %d %d",&length,&width,&height);
	v=vs(length,width,height);
	printf("v=%d,s1=%d,s2=%d,s3=%d\n",v,s1,s2,s3);
	return 0;
}