第四章 函数与递归

/实验4-7 素性判定/

/*实验4-7  素性判定*/
#include<stdio.h>
#include<math.h>
int main()
{
	int isprime(int n);
	int n;
	scanf("%d",&n);
	if(n==1)
		printf("DATA ERROR\n");
	else if(isprime(n))
		printf("TRUE\n");
	else 
		printf("FALSE\n");  
}
int isprime(int n)
{
	int i;
	for(i=2;i<=sqrt(n);i++)
		if(n%i==0)
			return 0;
		return 1;
}

/实验4-8 最大公约数/

/*实验4-8  最大公约数*/
#include<stdio.h>
int main()
{
	int x,y;
	unsigned int gcd(unsigned x,unsigned y);
	scanf("%d%d",&x,&y);
   
	printf("%d",gcd(x,y));
}

	unsigned int gcd(unsigned n ,unsigned m)
	{
		int r;
	if(m<n)
	{
		r=m;
		m=n;
		n=r;
	}
		while(n!=0)
		{
			r=m%n;
			m=n;
			n=r;
		}
		return m;
	}

/*实验4-9 平方数判定 */

/*实验4-9  平方数判定 */
#include<stdio.h>
#include<math.h>
int IsSquare(long int n);
int main()
{
	int n,a;
	scanf("%d",&n);
	a=IsSquare(n);
	if(a)
		printf("TRUE");
	else 
		printf("FALSE");
	return 0;
}
int IsSquare(long int n)
{
	int i;
	for(i=1;n>0;i+=2)
		n-=i;
	if(n==0)
		return 1;
	else 
		return 0;
}

/实验4-10 级数求和/

/*实验4-10  级数求和*/
#include<stdio.h>
 int ComputeHarmonicSeries();
int main()
{

	double f;

//	double f(n);
	f=ComputeHarmonicSeries();
	printf("%f",f);
	return 0;
}
  int ComputeHarmonicSeries()
{
	int sum=0, i;
	double   precision=1e-7;
    while((1/i)>precision)
	{
		sum+=1/i;
	 i++;
	}
	return sum;
}

/*实验4-11 快速收敛的圆周率计算 */

/*实验4-11  快速收敛的圆周率计算  */
#include<stdio.h>
#include<math.h>
double ComputePi();
int main()
{
	printf("Pi=%lf\n",ComputePi());
	return 0;
}
double ComputePi()
{
	int i,n=10,sign=0;
	double sixth_Pi=0.0;
	for(i=1;i<n;i++)
	{
		sixth_Pi=sixth_Pi+(1*3*……*(2*n-1)/(2*4*……(2*n))*(1/(2*n+1))*(1/2)^(2*n+1);
	}
	sign+=sixth_Pi+1/2;
	return sixth_Pi*6;
}

/实验4-12 富翁与骗子/

/*实验4-12  富翁与骗子*/
#include<stdio.h>
long deposit(int n);
long withdraw(int n,int amount);
int main()
{
	int a,t,n=30,d,amount=30;
	long c,f;
	a=deposit(n);
	c=a;
	d=withdraw( n, amount);
	f=d;
	if(c>f)printf("亏损了%d",c-f);
	else
		printf("获利了%d",f-c);
}
long deposit(m)
{
	int i;
	long b=0,sum;
	for(i=0;i<m;i++)
		b+=2^i;
	sum=b/2;
	return sum;
}
long withdraw (int n,int amount)
{
	int i;
	long sum1=0;
	for(i=0;i<30;i++)
		sum1+=amount;
	return sum1;
}

/实验4-14 二项式系数/

/*实验4-14  二项式系数*/
#include<stdio.h>
int main()
{
	unsigned int computebinomialcoefficient(unsigned int n,unsigned int k);
		int n,k;
	int a;
	scanf("%d%d",&n,&k);
a= computebinomialcoefficient(n,k);
		printf("%d",a);
}

	unsigned int computebinomialcoefficient(unsigned int n,unsigned int k)
	{
		
		if(n==k||k==0)
			return 1;
		else
			return computebinomialcoefficient(n-1,k)+computebinomialcoefficient(n-1,k-1);
	}

/实验4-15 素因子分解/

/*实验4-15  素因子分解*/
#include<stdio.h>
int Isprime(int N)
{
	int i;
	if(N==1||N==2)
		return 1;
	for(i=2;i*i<=N;i++)
	{
		if(N%i==0)
			return 0;
		else
	        return i;
	}
}
int main()
{
int N,i,count,flag,temp;

	scanf("%d",&N);
if(Isprime(N))
printf("%d=%d\n",N);
else
{
	temp=N;
	count=0;
	flag=0;
	printf("%d=",N);
	while(temp%2==0)
	{
		temp=temp/2;
		count++;
		flag=1;
	}
	if(1==count)
		printf("2");
	else if(count>1)
		printf("2^%d",count);
		for(i=3;i*i<=N;i=i+2)
		{
			count=0;
			while(temp%i==0)
			{
				temp=temp/i;
				count++;
			}
			if(1==count)
			{
				if(0==count)
					flag=1;
				else
					printf("*");
				printf("%d",i);
			}
			else if(count>1)
			{
				if(0==flag)
					flag=1;
				else
					printf("*");
				printf("%d^%d",i,count);
			}
			printf("\n");
}
}
}

/实验4-16 斐波那切数列/

/*实验4-16  斐波那切数列*/
#include<stdio.h>
int main()
{
	int fib(int n);
	int i,n;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		printf("%5d",fib(i));
	if(i%5==0)
		printf("\n");
	}
}
int fib(int n)
{
	if(n==1||n==2)
		return 1;
	else 
		return fib(n-1)+fib(n-2);
}

/实验4-19 整数互质判定/

/*实验4-19  整数互质判定*/
#include<stdio.h>
int main()
{
	int mgcd(int x,int y);
	int m,n,z;
	scanf("%d%d",&m,&n);
	z=mgcd(m,n);
	if(z=1)
		printf("%d和%d互质",m,n);
	else
		printf("%d和%d不互质",m,n);
	return 0;
}
	int mgcd(int x,int y)
	{
		int t,a,b;
		a=x;
		b=y;
		if(a<b)
		{
		t=a;
		a=b;
		b=t;
	}
	while(a%b!=0)
		return 1;
	}