《算法笔记》2.4小节——C/C++快速入门->循环结构

Contest100000568 - 《算法笔记》2.4小节——C/C++快速入门->循环结构

//Contest100000568 - 《算法笔记》2.4小节——C/C++快速入门->循环结构
#include<stdio.h>

//25609 Problem  I
int main()
{
	double a=2.0,b=1.0,temp;
	double sum=0.0;
	int i;
	for(i=1;i<=20;i++)
	{
		sum += a/b;
		temp = a+b;
		b = a;
		a = temp;
	}
	printf("%.6f",sum);
	return 0;
}

#include<stdio.h>

//25609 Problem  H
int main()
{
	int a[50];
	int n,i;
	a[0]=1,a[1]=1;
	scanf("%d",&n);
	for(i=2;i<n;i++)
	{
		a[i] = a[i-2]+a[i-1];
	}
	printf("%d\n",a[n-1]);
	return 0;
}

#include<stdio.h>

//25609 Problem  G
int main()
{ 
    double pi=0,n=1;
    int i=0;
	while( (1/n) > 0.000001) 
	{   
	    if(i%2==0)
	    {
	    	pi += 1/n;
		}
		else
			pi += -(1/n);
		i++;
		n = n+2;
	}
	printf("PI=%10.8f",pi*4);
} 

#include<stdio.h>

//25609 Problem  F
int main()
{
	int i,j;
	int a[4][5] = {0};
	for(i=0;i<5;i++)
	{
		a[0][i] = i+1;
	}
	for(i=0;i<4;i++)
	{
		a[i][0] = i+1;
	}
	for(i=1;i<4;i++)
	{
		for(j=1;j<5;j++)
		{
			a[i][j] = a[i][0] *a[0][j];
		}
	}
	for(i=0;i<4;i++)
	{
		for(j=0;j<5;j++)
		{		
			printf("%3d",a[i][j]);		
		}
		printf("\n");
	}
	return 0;
}

#include<stdio.h>

//25609 Problem  E
int main()
{
	int i=1,n,sum=1;
	//scanf("%d",&n) ;
	while(i++)
	{
	
		sum += i; 
		if(sum>1000) break;
	//	printf("%d\n",sum);
		
	}
	printf("%d\n",i);
	return 0;
}