update

Author: chiuchiuuu

3.C++程序设计/week9/编程练习/1.cpp

@@ -0,0 +1,15 @@
+sort(v.begin(), v.end());
+	for (i = v.begin(); i < v.end() - 1; i++)
+	{
+		for (j = i + 1; j < v.end(); j++)
+		{
+			if (binary_search(v.begin(), v.end(), Point(j->x, i->y)) &&
+				binary_search(v.begin(), v.end(), Point(i->x, j->y)) &&
+				i->x != j->x &&
+				i->y != j->y )
+			{
+				nTotalNum++;
+			}
+		}
+	}
+	cout << nTotalNum / 2;

3.C++程序设计/week9/编程练习/2.cpp

@@ -0,0 +1,20 @@
+template<class T>
+class CMyistream_iterator
+{
+private:
+	T content;
+	istream &is;
+public:
+	CMyistream_iterator(istream &i):is(i)
+	{
+		i >> content;
+	}
+	T operator*()
+	{
+		return content;
+	}
+	void operator++(int)
+	{
+		is >> content;
+	}
+};

3.C++程序设计/week9/编程练习/istream_iterator.cpp

@@ -0,0 +1,46 @@
+#include <iostream>
+#include <string>
+using namespace std;
+
+// 在此处补充你的代码
+template<class T>
+class CMyistream_iterator
+{
+private:
+	T content;
+	istream &is;
+public:
+	CMyistream_iterator(istream &i):is(i)
+	{
+		i >> content;
+	}
+	T operator*()
+	{
+		return content;
+	}
+	void operator++(int)
+	{
+		is >> content;
+	}
+};
+
+int main()
+{
+	CMyistream_iterator<int> inputInt(cin);
+	int n1, n2, n3;
+	n1 = *inputInt; //读入 n1
+	int tmp = *inputInt;
+	cout << tmp << endl;
+	inputInt++;
+	n2 = *inputInt; //读入 n2
+	inputInt++;
+	n3 = *inputInt; //读入 n3
+	cout << n1 << "," << n2 << "," << n3 << endl;
+	CMyistream_iterator<string> inputStr(cin);
+	string s1, s2;
+	s1 = *inputStr;
+	inputStr++;
+	s2 = *inputStr;
+	cout << s1 << "," << s2 << endl;
+	return 0;
+}

3.C++程序设计/week9/编程练习/set操作.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+#include <set>
+#include <string>
+using namespace std;
+
+multiset<int> int_multiset;
+set<int> mySet;
+
+void add(int x)
+{
+	int_multiset.insert(x);
+	mySet.insert(x);
+	cout << int_multiset.count(x) << endl;
+}
+
+void del(int x)
+{
+	int tmp = int_multiset.count(x);
+	int_multiset.erase(x);
+	cout << tmp << endl;
+}
+
+void ask(int x)
+{
+	set<int>::iterator i = mySet.find(x);
+	cout << (int)(i != mySet.end()) << " " << int_multiset.count(x) << endl;
+}
+
+int main()
+{
+	int n;
+	cin >> n;
+	while (n--)
+	{
+		string op;
+		int x;
+		cin >> op >> x;
+		if (op == "add")
+		{
+			add(x);
+		}
+		else if (op == "del")
+		{
+			del(x);
+		}
+		else if (op == "ask")
+		{
+			ask(x);
+		}
+	}
+	return 0;
+}

3.C++程序设计/week9/编程练习/标准矩形.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+struct Point
+{
+	int x;
+	int y;
+	Point(int x_, int y_) :x(x_), y(y_) { }
+};
+
+bool operator < (const Point & p1, const Point & p2)
+{
+	if (p1.y < p2.y)
+		return true;
+	else if (p1.y == p2.y)
+		return p1.x < p2.x;
+	else
+		return false;
+}
+
+int main()
+{
+	int t;
+	int x, y;
+	cin >> t;
+	vector<Point> v;
+	while (t--)
+	{
+		cin >> x >> y;
+		v.push_back(Point(x, y));
+	}
+	vector<Point>::iterator i, j;
+	int nTotalNum = 0;
+	// ÔÚ´Ë´¦²¹³äÄãµÄ´úÂë
+	sort(v.begin(), v.end());
+	for (i = v.begin(); i < v.end() - 1; i++)
+	{
+		for (j = i + 1; j < v.end(); j++)
+		{
+			if (binary_search(v.begin(), v.end(), Point(j->x, i->y)) &&
+				binary_search(v.begin(), v.end(), Point(i->x, j->y)) &&
+				i->x != j->x &&
+				i->y != j->y )
+			{
+				nTotalNum++;
+			}
+		}
+	}
+	cout << nTotalNum / 2;
+	return 0;
+}