算法笔记学习笔记01

2.4 循环结构

 问题 G: 例题5-7 求圆周率pi的近似值

#include<stdio.h>
#include<math.h>

int main(){
	int s = 1;
	double p = 0, t = 1, a = 1;
	while(fabs(t) >= 1e-6){
		p += t;
		a += 2;
		s = -s;
		t = s/a;
	}
	p = 4*p;
	printf("PI=%10.8lf\n",p);
	return 0;
}

问题 H: 例题5-8 Fibonacci数列

#include<stdio.h>

int main(){
	int a = 1, b = 1, c;
	int i, n;
	scanf("%d",&n);
	for(i = 1; i < n; i++){
		c = b;
		b = a + b;
		a = c;
	}
	printf("%d\n",a);
	return 0;
}

 问题 I: 习题5-10 分数序列求和

#include<stdio.h>

int main(){
	double a = 1, b = 1, c, i;
	double n = 0;
	for(i = 1; i <= 20; i++){
		c = b;
		b = a + b;
		a = c;
		n += b/a;
	}
	printf("%.6lf\n",n);
	return 0;
}