谭浩强C++ 第四章

第四章课后习题

1、最大公约数最小公倍数函数实现

#include<iostream>
using namespace std;
int gcd(int m,int n){
   
	if(m<n){
   
		int t=m;
		m=n;
		n=t;
	}
	while(m%n!=0){
   //同第三章15题，辗转相除
		int t=m;
		m=n;
		n=t%n;
	}
	return n;
} 
int lcm(int m,int n){
   
	return m*n/gcd(m,n);
}
int main(){
   
    int m,n;
    cout<<"input two integers:"<<endl;
    cin>>m>>n;
    cout<<"the greatest common divisor is:  "<<gcd(m,n)<<endl;
	cout<<"the least common multiple is:    "<<lcm(m,n)<<endl;
    return 0;
}

2、求方程的根

#include<iostream>
#include<cmath>
using namespace std;
void f0(double a,double b,double c){
   //b^2-4*a*c=0
	cout<<"x1=x2="<<(-b)/(2*a)<<endl;
}
void f1(double a,double b,double c){
   //b^2-4*a*c>0
	cout<<"x1="<<(-b+sqrt(b*b-4*a*c))/(2*a)<<"  ,  ";
	cout<<"x2="<<(-b-sqrt(b*b-4*a*c))/(2*a)<<endl;
}
void f2(double a,double b,double c){
   //b^2-4*a*c<0
	cout<<"x1="<<(-b)/(2*a)<<"+"<<sqrt(-(b*b-4*a*c))/(2*a)<<"i  ,  ";
	cout<<"x2="<<(-b)/(2*a)<<"-"<<sqrt(-(b*b-4*a*c))/(2*a<