2020-12-19

#include<iostream>
using namespace std;
class Point {
	double m_x = 0, m_y = 0;
public:
	Point(double x = 0, double y = 0) : m_x(x), m_y(y) {
		cout << "Constructor of Point" << endl;
	}
	Point(const Point &p) :m_x(p.m_x), m_y(p.m_y) {
		cout << "Copy constructor of Point" << endl;
	}
	~Point() {
		cout << "Destructor of Point" << endl;
	}
	double getx(const Point& a) {
		return a.m_x;
	}
	double gety(const Point& a) {
		return a.m_y;
	}
	friend double d(Point a, Point b);
};
double d(Point a, Point b) {
	return sqrt((a.m_x - b.m_x)*(a.m_x - b.m_x) + (a.m_y - b.m_y)*(a.m_y - b.m_y));
}
class Circle {
	Point m_center; double m_radius = 1.0;
public:
	Circle(double r = 1, const Point &p = Point()) :m_center(p), m_radius(r) {
		cout << "Constructor of Circle" << endl;
	}
	~Circle() {
		cout << "Destructor of Circle" << endl;
	}
	double s(Circle a) {
		return 3.14*a.m_radius*a.m_radius;
	}
	double c(Circle a) {
		return 3.14 * 2 * a.m_radius;
	}
};
int main(){
	Point b;
	cout << b.getx(b)<<endl;
	cout << b.gety(b)<<endl;
	Circle a(2, Point(1, 1));
	cout << a.s(a)<<" " << a.c(a)<<endl;
	cout << "end" << endl;
	return 0;
}

#include<iostream>
using namespace std;
int zuida(int a, int b) {
	if (a == b) {
		return a;
	}
	if (a > b) {
		int c;
		while (b != 0) {
			a = a % b;
			c = a;
			a = b;
			b = c;
		}
		return a;
	}
	if (b > a) {
		int c;
		while (a != 0) {
			b= b % a;
			c = a;
			a = b;
			b = c;
		}
		return b;
	}
}
int zuixiao(int a, int b) {
	int d = 0;
if (a = b) {
		return a;
	}
	if (a > b) {
		for (int n=1;n != 0; ) {
			d += a;
			n = d % b;
		}
		return d;
	}
	if (b > a) {
		for (int n = 1;n != 0; ) {
			d += b;
			n = d % a;
		}
		return d;
	}
}
class Fraction {
	//数据成员，访问控制属性默认是私有
	int m_numerator = 0; // 分子默认为0； C++11
	int m_denominator = 1; //分母默认为1；
public://公有成员函数
	Fraction(int above = 0, int below = 1) :
		m_numerator(above), m_denominator(below) {
		cout << "Constructor called" << endl;
	}
	Fraction(const Fraction& rhs) : m_numerator(rhs.m_numerator), 
		m_denominator(rhs.m_denominator) {
		cout << "Copy constructor called" << endl;
	}
	~Fraction()
	{
		cout << "已析构";
	}
	int getnumerator(const Fraction& a)const {
		return a.m_numerator;
	}
	int getdenominator(const Fraction& a)const {
		return a.m_denominator;
	}
	Fraction yuefen(Fraction a) {
		int n = zuida(a.m_numerator, a.m_denominator);
		a.m_numerator = a.m_numerator / n;
		a.m_denominator = a.m_denominator / n;
		return a;
	}
	void tongfen(Fraction& a,Fraction& b) {
		int n = zuixiao(a.m_denominator, b.m_denominator);
		a.m_denominator = n;
		b.m_denominator = n;
		a.m_numerator = (n / a.m_denominator)*a.m_numerator;
		b.m_numerator = (n / b.m_denominator)*b.m_numerator;
	}
};   
Fraction divide1( const Fraction& divident,  const Fraction& divisor) {
	return Fraction(divident.getnumerator(divident) * divisor.getdenominator(divisor), 
		divident.getdenominator(divident) * divisor.getnumerator(divisor));
}
Fraction divide2(Fraction divident, Fraction divisor) {
	Fraction result(divident.getnumerator(divident) * divisor.getdenominator(divisor), 
		divident.getdenominator(divident) * divisor.getnumerator(divisor));
	return result;
}
Fraction operator/(const Fraction& a, const Fraction& b) {
	return (a.getnumerator(a)*b.getdenominator(b)) / (a.getdenominator(a)*b.getnumerator(b));
}

#include<iostream>
#include<vector>
using namespace std;
int cesushu(int a) {
	int  b, c,n;
	n = sqrt(a);
	b = 2;
	while (b < n) {
		c = a % b;
		if (c == 0) {
			return 0;
		}
		b += 1;
	}
	return a;
}
int shunxu(int arr[],int b) {
	int n;
	cout << "输入要查找的数"<<endl;
	cin >> n;
	for (int a = 0;a < b;a++) {
		if (arr[a] == n) {
			cout << a<<endl;
			return 0;
		}
	}
	cout << "无此数"<<endl;
}
int zheban(int arr[], int b) {
	int n;
	cout << "输入要查找的数"<<endl;
	cin >> n;
	for (int c = (b + 1) / 2, a = 0;a != b;) {
		if (arr[c] == n) {
			cout << c<<endl;
			return 0;
		}
		if (arr[c] < n) {
			a = c;
			c = (a + b) / 2;
		}
		if (arr[c] > n) {
			b = c;
			c = (a + b) / 2;
		}
		if (a = b - 1) {
			if (arr[a] == n) {
				cout << a<<endl;
				return 0;
			}
			if (arr[b] == n) {
				cout << b<<endl;
				return 0;
			}
		}
	}
	cout << "无此数"<<endl;
	return 0;
}
int main() {
	int a[5]{ 19,67,24,11,17 };
	int b[5]{ 2,3,9,17,59 };
	shunxu(a,5);
	zheban(b, 5);
	vector <int>v1;
	for (int n = 0;n < 5;n++) {
		v1.push_back(cesushu(a[n]));
		v1.push_back(cesushu(b[n]));
	}
	for (int n = 0;n < v1.size();n++) {
		int b;
		for (int a = n;a < v1.size();a++) {
			if (a == n) {
				b = n;
			}
			if (v1.at(a) < v1.at(b)) {
				b = a;
			}
		}
		if  (b!=n) {
			int c = v1.at(n);
			v1.at(n) = v1.at(b);
			v1.at(b) = c;
		}
	}
	for (int n = 0;n < v1.size();n++) {
		int c = 1;
		if (v1.at(n) != 0) {
			for (int a = 0;a < n;a++) {
				if (v1.at(a) == v1.at(n)) {
					c=0;
					break;
				}
			}
			if (c) {
				cout << v1.at(n) << " ";
			}
		}
	}
	return 0;
}