6.c

来自「分而治之是一种使用递归解决问题的算法」· C语言 代码 · 共 26 行

#include<stdio.h>
int main()
{
	double r,h,s,c,v,x,a,b;
	r=2.5;
	h=4.5;
	printf("input r,h:");
	scanf("%lf%lf",&r,&h);

	s=3.14*r*r;
	c=2*3.14*r;
	v=4/3*3.14*r*r*r;
	x=4*3.14*r*r;
	a=2*3.14*r*r+2*3.14*r*h;
	b=3.14*r*r*h;

	printf("s=%lf\n",s);
	printf("c=%lf\n",c);
	printf("v=%lf\n",v);
	printf("x=%lf\n",x);
	printf("a=%lf\n",a);
	printf("b=%lf\n",b);

	return 0;
}