commit 4e2bf47db00f7382a7284048a5a55c58dfb2969c
Author: Cx330 <1487537121@qq.com>
Date:   Sat Mar 29 23:02:48 2025 +0800

    2024年12月完成（补充提交）

diff --git a/Chapter 0/0-2.cpp b/Chapter 0/0-2.cpp
new file mode 100644
index 0000000..e923750
--- /dev/null
+++ b/Chapter 0/0-2.cpp	
@@ -0,0 +1,7 @@
+#include<iostream>
+
+int main()
+{
+	std::cout<<"This (\") is a quote , and this (\\) is a backlash."<<std::endl;
+        return 0;
+}
diff --git a/Chapter 1/1-6.cpp b/Chapter 1/1-6.cpp
new file mode 100644
index 0000000..2ca7404
--- /dev/null
+++ b/Chapter 1/1-6.cpp	
@@ -0,0 +1,15 @@
+#include<iostream>
+#include<string>
+
+int main()
+{
+	std::cout<<"What is your name? ";
+	std::string name;
+	std::cin>>name;
+	std::cout<<"Hello, "<<name
+		<<std::endl<<"And what is yours? ";
+        std::cin>>name;
+	std::cout<<"Hello, "<<name
+		<<"; nice to meet you too!"<<std::endl;
+	return 0;
+}
diff --git a/Chapter 2/2-5.cpp b/Chapter 2/2-5.cpp
new file mode 100644
index 0000000..87fd476
--- /dev/null
+++ b/Chapter 2/2-5.cpp	
@@ -0,0 +1,50 @@
+#include<iostream>
+int main()
+{
+	std::cout << "���������εı߳�:";
+	float a, b, c, d;
+	std::cin >> a;
+	std::cout << "���볤���εij��Ϳ�:";
+	std::cin >> b >> c;
+	std::cout << "���������εĸ�:";
+	std::cin >> d;
+
+	std::cout << "������:" << std::endl;
+	for (int i = 0; i < a; i++) {
+		for (int j = 0; j < a; j++) {
+			if (i == a - 1 || i == 0 || j == a - 1 || j == 0) {
+				std::cout << "*";
+			}
+			else {
+				std::cout << " ";
+			}
+		}
+		std::cout << std::endl;
+	}
+
+	std::cout << "������:" << std::endl;
+	for (int i = 0; i < c; i++) {
+		for (int j = 0; j < b; j++) {
+			if (i == c - 1 || i == 0 || j == b - 1 || j == 0) {
+				std::cout << "*";
+			}
+			else {
+				std::cout << " ";
+			}
+		}
+		std::cout << std::endl;
+	}
+
+	std::cout << "������:" << std::endl;
+	for (int i = 0; i < d; i++) {
+		for (int j = 0; j <= i; j++) {
+			if (j == 0 || j == i || i == 0 || i == d - 1) {
+				std::cout << "*";
+			}
+			else {
+				std::cout << " ";
+			}
+		}
+		std::cout << std::endl;
+	}
+}
\ No newline at end of file
diff --git a/Chapter 2/2-8.cpp b/Chapter 2/2-8.cpp
new file mode 100644
index 0000000..289b634
--- /dev/null
+++ b/Chapter 2/2-8.cpp	
@@ -0,0 +1,13 @@
+#include<iostream>
+
+int main()
+{
+	std::cout << "����Ҫ��������䷶Χ:";
+	float a, b, c;
+	c = 1;
+	std::cin >> a >> b;
+	for (float i = a; i < b; i++) {
+		c = i * c;
+	}
+	std::cout << c;
+}
\ No newline at end of file
diff --git a/Chapter 3/3-3.cpp b/Chapter 3/3-3.cpp
new file mode 100644
index 0000000..128f75f
--- /dev/null
+++ b/Chapter 3/3-3.cpp	
@@ -0,0 +1,48 @@
+#include<iostream>
+#include<string>
+#include<map>
+int main()
+{
+	std::cout << "�����뵥��:" << std::endl;
+	std::string word;
+	std::map<std::string, int>word_data;
+	while (std::cin >> word)
+		word_data[word] = word_data[word] + 1;
+	std::map<std::string, int>::iterator mp_next = word_data.begin();
+	while (mp_next != word_data.end())
+	{
+		std::cout << mp_next->first << " �ij��ִ���:" << mp_next->second << std::endl;
+		mp_next++;
+	}
+	
+}
+
+
+#include <iostream>   // �����׼�����������
+#include <string>     // �����ַ�����
+#include <map>        // ����map������
+
+int main()
+{
+    // �����ʾ��Ϣ
+    std::cout << "�����뵥��:" << std::endl;
+
+    std::string word; // ���ڴ洢�û�����ĵ���
+    std::map<std::string, int> word_data; // ����һ��map������keyΪ���ʣ�valueΪ���ʳ��ִ���
+
+    // ѭ����ȡ�û�����ĵ��ʣ�ֱ������������簴 Ctrl+D��
+    while (std::cin >> word)
+        word_data[word] = word_data[word] + 1; // ���µ��ʳ��ִ���
+
+    // ����һ�������������ڱ���map�е�����Ԫ��
+    std::map<std::string, int>::iterator mp_next = word_data.begin();
+
+    // ����map�����ÿ�����ʼ�����ִ���
+    while (mp_next != word_data.end())
+    {
+        std::cout << mp_next->first << " �ij��ִ���:" << mp_next->second << std::endl;
+        mp_next++; // �ƶ�����һ��Ԫ��
+    }
+
+    return 0; // �������
+}
diff --git a/Chapter 4/4-5.cpp b/Chapter 4/4-5.cpp
new file mode 100644
index 0000000..b930bf5
--- /dev/null
+++ b/Chapter 4/4-5.cpp	
@@ -0,0 +1,58 @@
+#include<iostream>
+#include<string>
+#include<map>
+int main()
+{
+	int a = 0;
+	std::cout << "�����뵥��:" << std::endl;
+	std::cout << "�˳���ctrl+z��س�" << std::endl;
+	std::string word;
+	std::map<std::string, int>word_data;
+	while (std::cin >> word) {
+		word_data[word] = word_data[word] + 1;
+		a = a + 1;
+	}
+	std::map<std::string, int>::iterator mp_next = word_data.begin();
+	std::cout << "����ĵ��ʸ���:" << a << std::endl;
+	while (mp_next != word_data.end())
+	{
+		std::cout << mp_next->first << " �ij��ִ���:" << mp_next->second << std::endl;
+		mp_next++;
+	}
+}
+
+
+#include <iostream>   // �����׼�����������
+#include <string>     // �����ַ�����
+#include <map>        // ����map������
+
+int main()
+{
+    int a = 0; // ����ͳ������ĵ�������
+    std::cout << "�����뵥��:" << std::endl; // ��ʾ�û����뵥��
+    std::cout << "�˳���ctrl+z��س�" << std::endl; // ��ʾ�û���ν�������
+
+    std::string word; // ����һ���ַ������������ڴ洢��������
+    std::map<std::string, int> word_data; // ����һ��map������keyΪ���ʣ�valueΪ���ʳ��ֵĴ���
+
+    // ѭ����ȡ�û�����ĵ��ʣ�ֱ���û����������Ctrl+Z��س���
+    while (std::cin >> word) {
+        word_data[word] = word_data[word] + 1; // ���µ��ʳ��ִ����������������ʼ��Ϊ1
+        a = a + 1; // ÿ��ȡһ�����ʣ���������1
+    }
+
+    // ����һ�������������ڱ���map����
+    std::map<std::string, int>::iterator mp_next = word_data.begin();
+
+    // ����ܵ����뵥������
+    std::cout << "����ĵ��ʸ���:" << a << std::endl;
+
+    // ����map���������ÿ�����ʼ�����ִ���
+    while (mp_next != word_data.end())
+    {
+        std::cout << mp_next->first << " �ij��ִ���:" << mp_next->second << std::endl; // ������ʺͶ�Ӧ����
+        mp_next++; // �ƶ�����������һ��Ԫ��
+    }
+
+    return 0; // �������
+}
diff --git a/Chapter 4/4-7.cpp b/Chapter 4/4-7.cpp
new file mode 100644
index 0000000..c596dc9
--- /dev/null
+++ b/Chapter 4/4-7.cpp	
@@ -0,0 +1,55 @@
+#include<iostream>
+
+int main()
+{
+    double a, b = 0, c = 0;
+    std::cout << "����������:" << std::endl << "�˳���ctrl+z��س�" << std::endl;
+    while (std::cin >> a) {
+        b = b + a;
+        c++;
+    }
+    b = b / c;
+    std::cout << "ƽ����Ϊ:" << b << std::endl;
+}
+
+
+/*
+CSDN����
+
+#include <iostream>
+#include <numeric>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    vector<double> nums;
+    double num;
+
+    while (cin >> num)
+        nums.push_back(num);
+
+    cout << accumulate(nums.begin(), nums.end(), 0.0) / nums.size() << endl;
+}
+*/
+
+#include <iostream>    // �����׼�����������
+#include <numeric>     // ����numeric�⣬����ʹ��accumulate����
+#include <vector>      // ����vector������
+
+using namespace std;
+
+int main() {
+    vector<double> nums; // ����һ����̬���飬���ڴ洢�û��������ֵ
+    double num;          // ���ڽ����û�����ĵ�����ֵ
+
+    // ѭ����ȡ�û��������ֵ��ֱ�����������Ctrl+Z �� Ctrl+D ��س���
+    while (cin >> num)
+        nums.push_back(num); // ���������ֵ���ӵ�vector��
+
+    // ʹ��accumulate����vector��������ֵ���ܺͣ���������ֵ�����Լ���ƽ��ֵ
+    // ��ʼֵ��Ϊ0.0�������������Ƶ��������ͳ�ʼֵ
+    cout << accumulate(nums.begin(), nums.end(), 0.0) / nums.size() << endl;
+
+    return 0; // �������
+}
diff --git a/Chapter 5/5-8例题改/5-8pics_main.cpp b/Chapter 5/5-8例题改/5-8pics_main.cpp
new file mode 100644
index 0000000..1dbf60b
--- /dev/null
+++ b/Chapter 5/5-8例题改/5-8pics_main.cpp	
@@ -0,0 +1,88 @@
+#include <algorithm>
+#include <iostream>
+#include <iterator>
+#include <string>
+#include <vector>
+
+#include "pics.h"
+
+using std::cout;
+using std::copy;
+using std::endl;
+using std::ostream_iterator;
+using std::string;
+using std::vector;
+
+int main()
+{
+	vector<string> p;
+	p.push_back("this is an");
+	p.push_back("example");
+	p.push_back("to");
+	p.push_back("illustrate");
+	p.push_back("framing");
+
+	ostream_iterator<string>ofile(cout, "\n");
+	copy(p.begin(), p.end(), ofile);
+	cout << endl;
+
+	vector<string> f = frame(p);
+	copy(f.begin(), f.end(), ofile);	cout << endl;
+
+	vector<string> h = hcat(p,frame(p));
+	copy(h.begin(), h.end(), ofile);
+	cout << endl;
+
+	return 0;
+}
+
+
+#include <algorithm>    // �����׼�㷨�⣨����std::copy���㷨��
+#include <iostream>     // �����׼�����������
+#include <iterator>     // ����������⣨����std::ostream_iterator��
+#include <string>       // �����ַ�����
+#include <vector>       // ���붯̬���飨vector��������
+
+#include "pics.h"       // �����Զ���ͷ�ļ����ṩframe��hcat����������
+
+using std::cout;                    // �����׼�������
+using std::copy;                    // �����׼�����㷨
+using std::endl;                    // �����׼���з�
+using std::ostream_iterator;        // ���������������
+using std::string;                  // �����׼�ַ�����
+using std::vector;                  // �����׼������
+
+int main()
+{
+    // ����һ���洢�ַ�����vector�������������Ӷ����ַ���
+    vector<string> p;
+    p.push_back("this is an");      // �����ַ�����vector
+    p.push_back("example");
+    p.push_back("to");
+    p.push_back("illustrate");
+    p.push_back("framing");
+
+    // ��������������������ڽ�vector�����������׼���
+    ostream_iterator<string> ofile(cout, "\n");
+
+    // ���vector p�����ݵ��ն�
+    copy(p.begin(), p.end(), ofile);
+    cout << endl; // ���һ�����зָ�����
+
+    // ����frame����Ϊvector p���ӱ߿򣬲�������vector
+    vector<string> f = frame(p);
+
+    // ������߿��vector����
+    copy(f.begin(), f.end(), ofile);
+    cout << endl; // ���һ�����зָ�����
+
+    // ����hcat��������ԭʼvector p����߿��vector fˮƽ����
+    vector<string> h = hcat(p, frame(p));
+
+    // ���ˮƽ���Ӻ��vector����
+    copy(h.begin(), h.end(), ofile);
+    cout << endl; // ���һ�����зָ�����
+
+    return 0; // �������
+}
+
diff --git a/Chapter 5/5-8例题改/pics.cpp b/Chapter 5/5-8例题改/pics.cpp
new file mode 100644
index 0000000..5eac46d
--- /dev/null
+++ b/Chapter 5/5-8例题改/pics.cpp	
@@ -0,0 +1,108 @@
+#include <algorithm>
+#include <string>
+#include <vector>
+
+#include "pics.h"
+
+using std::string;
+using std::vector;
+using std::max;
+
+#ifdef _MSC_VER
+//#include "../minmax.h"
+#else
+//using std::max;
+#endif
+
+string::size_type width(const vector<string>& v)
+{
+	string::size_type maxlen = 0;
+#ifdef _MSC_VER
+	for(std::vector<string>::size_type i = 0; i != v.size(); ++i)
+#else
+	for(vector<string>::size_type i = 0; i != v.size(); ++i)
+#endif
+		maxlen = max(maxlen, v[i].size());
+	return maxlen;
+}
+
+vector<string> frame(const vector<string>& v)
+{
+	vector<string> ret;
+	string::size_type maxlen = width(v);
+	string border(maxlen + 4, '*');
+
+	// write the top border
+	ret.push_back(border);
+
+	// write each interior row, bordered by an asterisk and a space
+#ifdef _MSC_VER
+	for (std::vector<string>::size_type i = 0; i != v.size(); ++i) {
+#else
+	for (vector<string>::size_type i = 0; i != v.size(); ++i) {
+#endif
+		ret.push_back("* " + v[i] +
+		              string(maxlen - v[i].size(), ' ') + " *");
+	}
+
+	// write the bottom border
+	ret.push_back(border);
+	return ret;
+}
+
+vector<string> vcat(const vector<string>& top,
+                    const vector<string>& bottom)
+{
+	// copy the `top' picture
+	vector<string> ret = top;
+
+	// copy entire `bottom' picture
+#ifdef _MSC_VER
+	for (std::vector<string>::const_iterator it = bottom.begin();
+#else
+	for (vector<string>::const_iterator it = bottom.begin();
+#endif
+	     it != bottom.end(); ++it)
+		ret.push_back(*it);
+
+	return ret;
+}
+
+vector<string>
+hcat(const vector<string>& left, const vector<string>& right)
+{
+	vector<string> ret;
+
+	// add 1 to leave a space between pictures
+	string::size_type width1 = width(left) + 1;
+
+	// indices to look at elements from `left' and `right' respectively
+#ifdef _MSC_VER
+	std::vector<string>::size_type i = 0, j = 0;
+#else
+	vector<string>::size_type i = 0, j = 0;
+#endif
+	string s;
+	// continue until we've seen all rows from both pictures
+	while (i != left.size() || j != right.size()) {
+		// construct new `string' to hold characters from both pictures
+		//string s;
+
+		// copy a row from the left-hand side, if there is one
+		if (i != left.size())
+			s = left[i++];
+
+		// pad to full width
+		s += string(width1 - s.size(), ' ');
+
+		// copy a row from the right-hand side, if there is one
+		if (j != right.size())
+			s += right[j++];
+
+		// add `s' to the picture we're creating
+		ret.push_back(s);
+	}
+
+	return ret;
+}
+
diff --git a/Chapter 5/5-8例题改/pics.h b/Chapter 5/5-8例题改/pics.h
new file mode 100644
index 0000000..ee976c2
--- /dev/null
+++ b/Chapter 5/5-8例题改/pics.h	
@@ -0,0 +1,17 @@
+#ifndef GUARD_pics_h
+#define GUARD_pics_h
+
+#include <string>
+#include <vector>
+
+std::string::size_type width(const std::vector<std::string>& v);
+
+std::vector<std::string> frame(const std::vector<std::string>& v);
+
+std::vector<std::string> vcat(const std::vector<std::string>& top,
+                              const std::vector<std::string>& bottom);
+
+std::vector<std::string> hcat(const std::vector<std::string>& left,
+                              const std::vector<std::string>& right);
+
+#endif
diff --git a/Chapter 6/6.1.cpp b/Chapter 6/6.1.cpp
new file mode 100644
index 0000000..257a5f2
--- /dev/null
+++ b/Chapter 6/6.1.cpp	
@@ -0,0 +1,238 @@
+#include <iostream>
+#include <string>
+#include <vector>        //��̬����
+#include <list>
+#include <algorithm>
+#include <cctype>
+
+using std::cin;
+using std::cout;
+using std::endl;
+using std::string;
+using std::vector;
+using std::max;
+
+
+vector<string> split(const string& s) {        //�ָ��ַ��������ո�ָ�ɵ��ʣ����洢��vector<string>��
+    vector<string> ret;
+    typedef string::size_type string_size;
+    string_size  i = 0;
+
+    while (i != s.size()) {
+        //����ǰ�εĿհף�[��ǰ��i,i)��ȫ���ַ����ǿո�
+        while (i != s.size() && isspace(s[i])) {
+            i++;
+        }
+        //�ҳ���һ�����ʵ��ս��
+        string_size j = i;
+        //[��ǰ��j,j)�е������ַ������ǿո�
+        while (j != s.size() && !isspace(s[j])) {
+            j++;
+        }
+        //�ҵ���һЩ�ǿհ׷�
+        if (i != j) {
+            ret.push_back(s.substr(i, j - i));
+            i = j;
+        }
+    }
+    return ret;
+}
+
+
+//�ҳ���������ַ����ij���
+string::size_type width(const vector<string>& v) {   //�����ַ�����������ַ����ij���
+    string::size_type  maxlen = 0;
+    for (vector<string>::size_type i = 0; i != v.size(); ++i) {
+        maxlen = max(maxlen, v[i].size());
+    }
+    return maxlen;
+}
+
+vector<string> frame(const vector<string>& v) {
+    vector<string> ret;
+    string::size_type maxlen = width(v);    //����ÿ����ַ�������
+    //��������߿�
+    string border(maxlen + 4, '*');
+
+    //����ڲ����У�ÿ�ж���һ���Ǻź�һ���ո���������
+    ret.push_back(border);
+    //ʹ�õ�����ʵ��
+    vector<string>::const_iterator iter = v.begin();
+    while (iter != v.end()) {    //ÿ������м���ַ������������ո�ʹ�����һ��
+        ret.push_back("* " + (*iter) + string(maxlen - iter->size(), ' ') + " *");
+        iter++;
+    }
+    ret.push_back(border);
+    return  ret;
+}
+
+//��������
+vector<string> vcat(const vector<string>& top, const vector<string>& bottom) {
+    vector<string> ret = top;
+    ret.insert(ret.end(), bottom.begin(), bottom.end());
+    return  ret;
+}
+
+//��������
+vector<string> hcat(const vector<string>& left, const vector<string>& right) {
+    vector<string>ret;
+    //������ͼ��֮�����ո�
+    string::size_type width1 = width(left) + 1;
+    //���ڱ���left��right������
+    //ʹ�õ�����
+    vector<string>::const_iterator i, j;
+    i = left.begin();
+    j = right.begin();
+    while (i != left.end() || j != right.end()) {
+        string s;
+        if (i != left.end()) {
+            s = *i++;
+        }
+
+        s += string(width1 - s.size(), ' ');
+
+        if (j != right.end()) {
+            s += *j++;
+        }
+        ret.push_back(s);
+    }
+
+    return  ret;
+}
+
+int main(int argc, const char* argv[]) {
+    string s;
+    while (getline(cin, s)) {
+        vector<string> v = split(s);
+        vector<string> fra = frame(v);  //����frame�Էָ��ĵ������ӿ��
+        vector<string> col, row;
+        col = vcat(v, fra);  
+        row = hcat(v, fra);  //ͨ��hcat���ָ��ı��Ϳ�ܻ��ı�������ʾ���������Ļ��
+        for (vector<string>::size_type j = 0; j != row.size(); ++j) {
+            cout << row[j] << endl;
+        }
+    }
+    return 0;
+}
+
+
+#include <iostream>     // �����׼�����������
+#include <string>       // �����ַ�����
+#include <vector>       // ���붯̬���飨vector��������
+#include <list>         // �������������⣨δʹ�ã�
+#include <algorithm>    // �����㷨�⣨����std::max��
+#include <cctype>       // �����ַ����������⣨����std::isspace��
+
+using std::cin;
+using std::cout;
+using std::endl;
+using std::string;
+using std::vector;
+using std::max;
+
+// ���ո�ָ��ַ��������طָ��ĵ�������
+vector<string> split(const string& s) {
+    vector<string> ret;                      // �洢�ָ���
+    typedef string::size_type string_size;   // �����ַ������ȵ�����
+    string_size i = 0;
+
+    while (i != s.size()) {
+        // �����ո�
+        while (i != s.size() && isspace(s[i])) {
+            i++;
+        }
+
+        // �ҵ���һ�����ʵĽ���λ��
+        string_size j = i;
+        while (j != s.size() && !isspace(s[j])) {
+            j++;
+        }
+
+        // ����ҵ����ʣ��������ӵ������
+        if (i != j) {
+            ret.push_back(s.substr(i, j - i)); // ��ȡ���ʲ���������
+            i = j; // ���������
+        }
+    }
+    return ret;
+}
+
+// �ҳ���������ַ����ij���
+string::size_type width(const vector<string>& v) {
+    string::size_type maxlen = 0; // ��ʼ����󳤶�Ϊ0
+    for (vector<string>::size_type i = 0; i != v.size(); ++i) {
+        maxlen = max(maxlen, v[i].size()); // ������󳤶�
+    }
+    return maxlen;
+}
+
+// Ϊ�����е��ַ������ӿ�ܣ��߿�
+vector<string> frame(const vector<string>& v) {
+    vector<string> ret;                      // �洢��ܻ�����ַ���
+    string::size_type maxlen = width(v);     // ������ַ�������
+    string border(maxlen + 4, '*');          // ����߿��ַ���
+
+    ret.push_back(border);                   // ���Ӷ����߿�
+    vector<string>::const_iterator iter = v.begin();
+
+    while (iter != v.end()) {
+        // ÿ���������ұ߿���ʵ������
+        ret.push_back("* " + (*iter) + string(maxlen - iter->size(), ' ') + " *");
+        iter++;
+    }
+    ret.push_back(border);                   // ���ӵײ��߿�
+    return ret;
+}
+
+// �������������ַ�������
+vector<string> vcat(const vector<string>& top, const vector<string>& bottom) {
+    vector<string> ret = top;                // ��ʼ�����Ϊ��������
+    ret.insert(ret.end(), bottom.begin(), bottom.end()); // ���ӵײ�����
+    return ret;
+}
+
+// �������������ַ�������
+vector<string> hcat(const vector<string>& left, const vector<string>& right) {
+    vector<string> ret;
+    string::size_type width1 = width(left) + 1; // Ϊ�������һ���ո�Ŀ���
+    vector<string>::const_iterator i = left.begin(), j = right.begin();
+
+    // ͬʱ������������
+    while (i != left.end() || j != right.end()) {
+        string s;
+
+        if (i != left.end()) {
+            s = *i++; // ��ȡ����ַ���
+        }
+
+        s += string(width1 - s.size(), ' '); // ���ո��Զ���
+
+        if (j != right.end()) {
+            s += *j++; // �����Ҳ��ַ���
+        }
+
+        ret.push_back(s); // ��ƴ�Ӻ���ַ������ӵ����
+    }
+
+    return ret;
+}
+
+int main(int argc, const char* argv[]) {
+    string s;
+    while (getline(cin, s)) {
+        // ���ո�ָ������ַ���
+        vector<string> v = split(s);
+        // Ϊ�ָ����ַ������ӿ��
+        vector<string> fra = frame(v);
+        // ��������ԭʼ�ַ����Ϳ�ܻ��ַ���
+        vector<string> col = vcat(v, fra);
+        // ��������ԭʼ�ַ����Ϳ�ܻ��ַ���
+        vector<string> row = hcat(v, fra);
+
+        // ����������Ӻ�Ľ��
+        for (vector<string>::size_type j = 0; j != row.size(); ++j) {
+            cout << row[j] << endl;
+        }
+    }
+    return 0;
+}
diff --git a/Chapter 6/6.9.cpp b/Chapter 6/6.9.cpp
new file mode 100644
index 0000000..a89fd4c
--- /dev/null
+++ b/Chapter 6/6.9.cpp	
@@ -0,0 +1,48 @@
+#include <iostream>
+#include <vector>     //��̬����
+#include <numeric>
+#include <string>
+
+using std::cin;
+using std::endl;
+using std::cout;
+using std::vector;
+using std::accumulate;    //accumulate()��������������Ԫ�ص��ۻ�ֵ
+using std::string;
+
+int main(int argc, const char* argv[]) {
+    vector<string> v = { "zhang", "meng", "nan" , "1220310013"};
+    string str;     //�������ַ���
+    str = accumulate(v.begin(), v.end(), str);   //��v�������ַ�����str��
+    cout << str;
+    return 0;
+}
+
+
+#include <iostream>      // �����׼�����������
+#include <vector>        // ���붯̬���飨vector��������
+#include <numeric>       // ����numeric�⣬�ṩaccumulate����
+#include <string>        // �����ַ�����
+
+using std::cin;
+using std::endl;
+using std::cout;
+using std::vector;
+using std::accumulate;  // ����accumulate�����������ۼ������ڵ�Ԫ��
+using std::string;
+
+int main(int argc, const char* argv[]) {
+    // ��ʼ��һ�������ַ���������
+    vector<string> v = { "zhang", "meng", "nan", "1220310013" };
+
+    string str; // ����һ�����ַ��������ڴ洢�ۻ��Ľ��
+
+    // ʹ��accumulate������vector v�е������ַ�����������
+    // accumulate�ĵ������������ۻ��ij�ʼֵ�����ַ���str���ڿ�ʼ�ۻ�
+    str = accumulate(v.begin(), v.end(), str);
+
+    // ����ۻ�����ַ���
+    cout << str;  // �����"zhangmengnan1220310013"
+
+    return 0;  // �������
+}
diff --git a/Chapter 7/7-3/7-3xref.cpp b/Chapter 7/7-3/7-3xref.cpp
new file mode 100644
index 0000000..14f9d38
--- /dev/null
+++ b/Chapter 7/7-3/7-3xref.cpp	
@@ -0,0 +1,148 @@
+#include <map>
+#include <iostream>
+#include <string>
+#include <vector>
+#include <set>
+
+#include "split.h"
+
+using std::cin;            using std::cout;
+using std::endl;           using std::getline;
+using std::istream;        using std::string;
+using std::vector;         using std::map;
+using std::set;
+
+// find all the lines that refer to each word in the input
+map<string, set<int> >
+	xref(istream& in,
+	     vector<string> find_words(const string&) = split)
+{
+	string line;
+	int line_number = 0;
+	map<string, set<int> > ret;
+
+	// read the next line
+	while (getline(in, line)) {
+		++line_number;
+
+		// break the input line into words
+		vector<string> words = find_words(line);
+
+		// remember that each word occurs on the current line
+#ifdef _MSC_VER
+		for (std::vector<string>::const_iterator it = words.begin();
+#else
+		for (vector<string>::const_iterator it = words.begin();
+#endif
+		     it != words.end(); ++it)
+			ret[*it].insert(line_number);
+	}
+	return ret;
+}
+
+int main()
+{
+	// call `xref' using `split' by default
+	map<string, set<int> > ret = xref(cin);
+
+	// write the results
+#ifdef _MSC_VER
+	for (std::map<string, set<int> >::const_iterator it = ret.begin();
+#else
+	for (map<string, set<int> >::const_iterator it = ret.begin();
+#endif
+	     it != ret.end(); ++it) {
+		// write the word
+		cout << it->first << " occurs on line(s): ";
+
+		// followed by one or more line numbers
+#ifdef _MSC_VER
+		std::set<int>::const_iterator line_it = it->second.begin();
+#else
+		set<int>::const_iterator line_it = it->second.begin();
+#endif
+		cout << *line_it;	// write the first line number
+
+		++line_it;
+		// write the rest of the line numbers, if any
+		while (line_it != it->second.end()) {
+			cout << ", " << *line_it;
+			++line_it;
+		}
+		// write a new line to separate each word from the next
+		cout << endl;
+	}
+
+	return 0;
+}
+
+
+
+#include <map>           // ����ӳ�������⣨map�����ڴ洢ÿ������������������Ķ�Ӧ��ϵ
+#include <iostream>      // �����׼�����������
+#include <string>        // �����ַ�����
+#include <vector>        // ���붯̬���飨vector��������
+#include <set>           // ���뼯�������⣨set�����ڴ洢�к�
+
+#include "split.h"       // �����Զ���ͷ�ļ�split.h������split����������
+
+using std::cin;            // �����׼������
+using std::cout;           // �����׼�����
+using std::endl;           // ���뻻�з�
+using std::getline;        // ����getline�������������ж�ȡ����
+using std::istream;        // ������������
+using std::string;         // �����ַ�����
+using std::vector;         // ���붯̬������
+using std::map;            // ����ӳ��������
+using std::set;            // ���뼯��������
+
+// xref ����������ÿ�������������г��ֵ��к�
+map<string, set<int> >
+xref(istream& in,               // ��������Ĭ��Ϊcin��
+	vector<string> find_words(const string&) = split) // ʹ��split�����ָ�ʣ�Ĭ�ϣ�
+{
+	string line;                 // ���ڴ洢ÿ�е��ı�
+	int line_number = 0;         // ��ǰ�к�
+	map<string, set<int>> ret;   // �洢���ʼ�����ֵ��кţ�ʹ��map<����, set<�к�>>�ṹ
+
+	// ���ж�ȡ����
+	while (getline(in, line)) {
+		++line_number;  // �����
+
+		// ����ǰ�в��Ϊ���ʣ�ʹ��find_words������Ĭ����split��
+		vector<string> words = find_words(line);
+
+		// ������ǰ���е�ÿ�����ʣ������Ӧ���кŲ��뵽map��
+		for (vector<string>::const_iterator it = words.begin(); it != words.end(); ++it)
+			ret[*it].insert(line_number);  // �����ʼ����кŴ���map
+	}
+	return ret;  // ����map������ÿ�����ʼ�����ֵ��к�
+}
+
+int main()
+{
+	// ����xref������Ĭ��ʹ��split�������е��ʲ�֣���������cin
+	map<string, set<int>> ret = xref(cin);
+
+	// ��������ÿ�����ʼ�����ֵ��к�
+	for (map<string, set<int>>::const_iterator it = ret.begin(); it != ret.end(); ++it) {
+		// �������
+		cout << it->first << " occurs on line(s): ";
+
+		// ����õ��ʳ��ֵ������к�
+		set<int>::const_iterator line_it = it->second.begin();
+		cout << *line_it;    // �����һ���к�
+
+		++line_it;
+		// ��������к�
+		while (line_it != it->second.end()) {
+			cout << ", " << *line_it;
+			++line_it;
+		}
+
+		// ������з����Էָ�ÿ�����ʵ����
+		cout << endl;
+	}
+
+	return 0;  // �������
+}
diff --git a/Chapter 7/7-3/split.cpp b/Chapter 7/7-3/split.cpp
new file mode 100644
index 0000000..2d7e05f
--- /dev/null
+++ b/Chapter 7/7-3/split.cpp	
@@ -0,0 +1,43 @@
+#include <cctype>
+#include <string>
+#include <vector>
+
+#include "split.h"
+
+using std::vector;
+using std::string;
+
+#ifndef _MSC_VER
+using std::isspace;
+#endif
+
+vector<string> split(const string& s)
+{
+	vector<string> ret;
+	typedef string::size_type string_size;
+	string_size i = 0;
+
+	// invariant: we have processed characters `['original value of `i', `i)'
+	while (i != s.size()) {
+		// ignore leading blanks
+		// invariant: characters in range `['original `i', current `i)' are all spaces
+		while (i != s.size() && isspace(s[i]))
+			++i;
+
+		// find end of next word
+		string_size j = i;
+		// invariant: none of the characters in range `['original `j', current `j)' is a space
+		while (j != s.size() && !isspace(s[j]))
+			++j;
+
+		// if we found some nonwhitespace characters
+		if (i != j) {
+			// copy from `s' starting at `i' and taking `j' `\-' `i' chars
+			ret.push_back(s.substr(i, j - i));
+			i = j;
+		}
+
+	}
+	return ret;
+}
+
diff --git a/Chapter 7/7-3/split.h b/Chapter 7/7-3/split.h
new file mode 100644
index 0000000..7d49a45
--- /dev/null
+++ b/Chapter 7/7-3/split.h	
@@ -0,0 +1,8 @@
+#ifndef GUARD_split_h
+#define GUARD_split_h
+
+#include <vector>
+#include <string>
+std::vector<std::string> split(const std::string&);
+
+#endif
diff --git a/Chapter 8/8-5gen_sentence/8-5grammar.cpp b/Chapter 8/8-5gen_sentence/8-5grammar.cpp
new file mode 100644
index 0000000..5348fe6
--- /dev/null
+++ b/Chapter 8/8-5gen_sentence/8-5grammar.cpp	
@@ -0,0 +1,251 @@
+#ifdef _MSC_VER
+#pragma warning(disable:4503)      // `silence compiler complaints about generated names being too long'
+#endif
+
+#include <algorithm>
+#include <cstdlib>
+#include <iostream>
+#include <map>
+#include <stdexcept>
+#include <string>
+#include <vector>
+
+#include "split.h"
+#include <time.h>
+
+using std::istream;           using std::cin;
+using std::copy;              using std::cout;
+using std::endl;              using std::find;
+using std::getline;           using std::logic_error;
+using std::map;               using std::string;
+using std::vector;            using std::domain_error;
+using std::rand;
+
+typedef vector<string> Rule;
+typedef vector<Rule> Rule_collection;
+typedef map<string, Rule_collection> Grammar;
+
+// read a grammar from a given input stream
+Grammar read_grammar(istream& in)
+{
+	Grammar ret;
+	string line;
+
+	// read the input
+	while (getline(in, line)) {
+
+		// `split' the input into words
+		vector<string> entry = split(line);
+
+		if (!entry.empty())
+			// use the category to store the associated rule
+			ret[entry[0]].push_back(
+				Rule(entry.begin() + 1, entry.end()));
+	}
+	return ret;
+}
+
+void gen_aux(const Grammar&, const string&, vector<string>&);
+
+int nrand(int);
+
+vector<string> gen_sentence(const Grammar& g)
+{
+	vector<string> ret;
+	gen_aux(g, "<sentence>", ret);
+	return ret;
+}
+
+bool bracketed(const string& s)
+{
+	return s.size() > 1 && s[0] == '<' && s[s.size() - 1] == '>';
+}
+
+void
+gen_aux(const Grammar& g, const string& word, vector<string>& ret)
+{
+
+	if (!bracketed(word)) {
+		ret.push_back(word);
+	} else {
+		// locate the rule that corresponds to `word'
+		Grammar::const_iterator it = g.find(word);
+		if (it == g.end())
+			throw logic_error("empty rule");
+
+		// fetch the set of possible rules
+		const Rule_collection& c = it->second;
+
+		// from which we select one at random
+		const Rule& r = c[nrand(c.size())];
+
+		// recursively expand the selected rule
+		for (Rule::const_iterator i = r.begin(); i != r.end(); ++i)
+			gen_aux(g, *i, ret);
+	}
+}
+
+int main()
+{
+	// generate the sentence
+	vector<string> sentence = gen_sentence(read_grammar(cin));
+
+	// write the first word, if any
+#ifdef _MSC_VER
+	std::vector<string>::const_iterator it = sentence.begin();
+#else
+	vector<string>::const_iterator it = sentence.begin();
+#endif
+	if (!sentence.empty()) {
+		cout << *it;
+		++it;
+	}
+
+	// write the rest of the words, each preceded by a space
+	while (it != sentence.end()) {
+		cout << " " << *it;
+		++it;
+	}
+
+	cout << endl;
+	return 0;
+}
+
+// return a random integer in the range `[0,' `n)'
+int nrand(int n)
+{
+	if (n <= 0 || n > RAND_MAX)
+		throw domain_error("Argument to nrand is out of range");
+
+	const int bucket_size = RAND_MAX / n;
+	int r;
+
+	do r = rand() / bucket_size;
+	while (r >= n);
+
+	return r;
+}
+
+
+
+#ifdef _MSC_VER
+#pragma warning(disable:4503)      // �رձ��������棬��������ɵ����ƹ����ı�Թ
+#endif
+
+#include <algorithm>      // �����㷨�⣬�ṩ���õ��㷨
+#include <cstdlib>        // ����C��׼�⣬����rand()����
+#include <iostream>       // �����׼�����������
+#include <map>            // ����ӳ��������map����
+#include <stdexcept>      // �����׼�쳣�⣬�ṩ�߼�������������쳣
+#include <string>         // �����ַ�����
+#include <vector>         // ���붯̬���飨vector����
+#include "split.h"        // �����Զ����split.hͷ�ļ����ٶ��ṩ���ַ�����ֹ��ܣ�
+#include <time.h>         // ����ʱ��⣬֧�����������
+
+using std::istream;           using std::cin;
+using std::copy;              using std::cout;
+using std::endl;              using std::find;
+using std::getline;           using std::logic_error;
+using std::map;               using std::string;
+using std::vector;            using std::domain_error;
+using std::rand;              // ����rand����
+
+// ��������ַ������ϣ����﷨�����򼯺ϣ�������
+typedef vector<string> Rule;  // һ���������ַ����ļ���
+typedef vector<Rule> Rule_collection;  // ���򼯺��ǹ���ļ���
+typedef map<string, Rule_collection> Grammar;  // �﷨��һ��ӳ�䣺��� -> ���򼯺�
+
+// ���������ж�ȡ�﷨������
+Grammar read_grammar(istream& in) {
+	Grammar ret;  // ���ڴ洢�﷨
+	string line;
+
+	// ������ȡÿһ��
+	while (getline(in, line)) {
+		// ����ǰ�в�ֳɵ���
+		vector<string> entry = split(line);
+
+		// �����ֳ��ĵ��ʲ�Ϊ�գ���������洢����
+		if (!entry.empty())
+			ret[entry[0]].push_back(
+				Rule(entry.begin() + 1, entry.end()));  // ʹ�������Ϊkey��������Ϊvalue
+	}
+	return ret;  // �����﷨
+}
+
+// �ݹ����ɾ��ӵĸ�������
+void gen_aux(const Grammar&, const string&, vector<string>&);
+
+// ����һ����Χ��[0, n)�ڵ��������
+int nrand(int);
+
+// ����һ�����ӣ�����gen_aux���еݹ�����
+vector<string> gen_sentence(const Grammar& g) {
+	vector<string> ret;
+	gen_aux(g, "<sentence>", ret);  // ��<sentence>��ʼ���ɾ���
+	return ret;
+}
+
+// �ж�һ���ַ����Ƿ��DZ������Ű�Χ��
+bool bracketed(const string& s) {
+	return s.size() > 1 && s[0] == '<' && s[s.size() - 1] == '>';
+}
+
+// �ݹ�����ɾ����е�һ����
+void gen_aux(const Grammar& g, const string& word, vector<string>& ret) {
+	if (!bracketed(word)) {
+		ret.push_back(word);  // ������DZ������Ű�Χ�ĵ��ʣ�ֱ�Ӽ������
+	}
+	else {
+		// ���Ҷ�Ӧ�Ĺ���
+		Grammar::const_iterator it = g.find(word);
+		if (it == g.end())  // ���û���ҵ������׳��쳣
+			throw logic_error("empty rule");
+
+		// ��ȡ�õ��ʵĹ��򼯺�
+		const Rule_collection& c = it->second;
+
+		// �ӹ��򼯺������ѡ��һ������
+		const Rule& r = c[nrand(c.size())];
+
+		// ��ѡ�еĹ����е�ÿ�����ʽ��еݹ鴦��
+		for (Rule::const_iterator i = r.begin(); i != r.end(); ++i)
+			gen_aux(g, *i, ret);
+	}
+}
+
+int main() {
+	// ���ɾ���
+	vector<string> sentence = gen_sentence(read_grammar(cin));
+
+	// �����һ�����ʣ�����У�
+	vector<string>::const_iterator it = sentence.begin();
+	if (!sentence.empty()) {
+		cout << *it;
+		++it;
+	}
+
+	// ���ʣ��ĵ��ʣ�ÿ������ǰ��һ���ո�
+	while (it != sentence.end()) {
+		cout << " " << *it;
+		++it;
+	}
+
+	cout << endl;  // �������
+	return 0;
+}
+
+// ����һ�������������Χ��[0, n)
+int nrand(int n) {
+	if (n <= 0 || n > RAND_MAX)
+		throw domain_error("Argument to nrand is out of range");
+
+	const int bucket_size = RAND_MAX / n;  // ����������ȷֲ�
+	int r;
+
+	// ȷ�����������Ч��Χ��
+	do r = rand() / bucket_size;
+	while (r >= n);
+
+	return r;
+}
diff --git a/Chapter 8/8-5gen_sentence/split.cpp b/Chapter 8/8-5gen_sentence/split.cpp
new file mode 100644
index 0000000..2d7e05f
--- /dev/null
+++ b/Chapter 8/8-5gen_sentence/split.cpp	
@@ -0,0 +1,43 @@
+#include <cctype>
+#include <string>
+#include <vector>
+
+#include "split.h"
+
+using std::vector;
+using std::string;
+
+#ifndef _MSC_VER
+using std::isspace;
+#endif
+
+vector<string> split(const string& s)
+{
+	vector<string> ret;
+	typedef string::size_type string_size;
+	string_size i = 0;
+
+	// invariant: we have processed characters `['original value of `i', `i)'
+	while (i != s.size()) {
+		// ignore leading blanks
+		// invariant: characters in range `['original `i', current `i)' are all spaces
+		while (i != s.size() && isspace(s[i]))
+			++i;
+
+		// find end of next word
+		string_size j = i;
+		// invariant: none of the characters in range `['original `j', current `j)' is a space
+		while (j != s.size() && !isspace(s[j]))
+			++j;
+
+		// if we found some nonwhitespace characters
+		if (i != j) {
+			// copy from `s' starting at `i' and taking `j' `\-' `i' chars
+			ret.push_back(s.substr(i, j - i));
+			i = j;
+		}
+
+	}
+	return ret;
+}
+
diff --git a/Chapter 8/8-5gen_sentence/split.h b/Chapter 8/8-5gen_sentence/split.h
new file mode 100644
index 0000000..7d49a45
--- /dev/null
+++ b/Chapter 8/8-5gen_sentence/split.h	
@@ -0,0 +1,8 @@
+#ifndef GUARD_split_h
+#define GUARD_split_h
+
+#include <vector>
+#include <string>
+std::vector<std::string> split(const std::string&);
+
+#endif
diff --git a/Chapter 8/8-5gen_sentence/例题改/pics.cpp b/Chapter 8/8-5gen_sentence/例题改/pics.cpp
new file mode 100644
index 0000000..5eac46d
--- /dev/null
+++ b/Chapter 8/8-5gen_sentence/例题改/pics.cpp	
@@ -0,0 +1,108 @@
+#include <algorithm>
+#include <string>
+#include <vector>
+
+#include "pics.h"
+
+using std::string;
+using std::vector;
+using std::max;
+
+#ifdef _MSC_VER
+//#include "../minmax.h"
+#else
+//using std::max;
+#endif
+
+string::size_type width(const vector<string>& v)
+{
+	string::size_type maxlen = 0;
+#ifdef _MSC_VER
+	for(std::vector<string>::size_type i = 0; i != v.size(); ++i)
+#else
+	for(vector<string>::size_type i = 0; i != v.size(); ++i)
+#endif
+		maxlen = max(maxlen, v[i].size());
+	return maxlen;
+}
+
+vector<string> frame(const vector<string>& v)
+{
+	vector<string> ret;
+	string::size_type maxlen = width(v);
+	string border(maxlen + 4, '*');
+
+	// write the top border
+	ret.push_back(border);
+
+	// write each interior row, bordered by an asterisk and a space
+#ifdef _MSC_VER
+	for (std::vector<string>::size_type i = 0; i != v.size(); ++i) {
+#else
+	for (vector<string>::size_type i = 0; i != v.size(); ++i) {
+#endif
+		ret.push_back("* " + v[i] +
+		              string(maxlen - v[i].size(), ' ') + " *");
+	}
+
+	// write the bottom border
+	ret.push_back(border);
+	return ret;
+}
+
+vector<string> vcat(const vector<string>& top,
+                    const vector<string>& bottom)
+{
+	// copy the `top' picture
+	vector<string> ret = top;
+
+	// copy entire `bottom' picture
+#ifdef _MSC_VER
+	for (std::vector<string>::const_iterator it = bottom.begin();
+#else
+	for (vector<string>::const_iterator it = bottom.begin();
+#endif
+	     it != bottom.end(); ++it)
+		ret.push_back(*it);
+
+	return ret;
+}
+
+vector<string>
+hcat(const vector<string>& left, const vector<string>& right)
+{
+	vector<string> ret;
+
+	// add 1 to leave a space between pictures
+	string::size_type width1 = width(left) + 1;
+
+	// indices to look at elements from `left' and `right' respectively
+#ifdef _MSC_VER
+	std::vector<string>::size_type i = 0, j = 0;
+#else
+	vector<string>::size_type i = 0, j = 0;
+#endif
+	string s;
+	// continue until we've seen all rows from both pictures
+	while (i != left.size() || j != right.size()) {
+		// construct new `string' to hold characters from both pictures
+		//string s;
+
+		// copy a row from the left-hand side, if there is one
+		if (i != left.size())
+			s = left[i++];
+
+		// pad to full width
+		s += string(width1 - s.size(), ' ');
+
+		// copy a row from the right-hand side, if there is one
+		if (j != right.size())
+			s += right[j++];
+
+		// add `s' to the picture we're creating
+		ret.push_back(s);
+	}
+
+	return ret;
+}
+
diff --git a/Chapter 8/8-5gen_sentence/例题改/pics.h b/Chapter 8/8-5gen_sentence/例题改/pics.h
new file mode 100644
index 0000000..ee976c2
--- /dev/null
+++ b/Chapter 8/8-5gen_sentence/例题改/pics.h	
@@ -0,0 +1,17 @@
+#ifndef GUARD_pics_h
+#define GUARD_pics_h
+
+#include <string>
+#include <vector>
+
+std::string::size_type width(const std::vector<std::string>& v);
+
+std::vector<std::string> frame(const std::vector<std::string>& v);
+
+std::vector<std::string> vcat(const std::vector<std::string>& top,
+                              const std::vector<std::string>& bottom);
+
+std::vector<std::string> hcat(const std::vector<std::string>& left,
+                              const std::vector<std::string>& right);
+
+#endif
diff --git a/Chapter 8/8-5gen_sentence/例题改/pics_main.cpp b/Chapter 8/8-5gen_sentence/例题改/pics_main.cpp
new file mode 100644
index 0000000..b994600
--- /dev/null
+++ b/Chapter 8/8-5gen_sentence/例题改/pics_main.cpp	
@@ -0,0 +1,85 @@
+#include <algorithm>
+#include <iostream>
+#include <iterator>
+#include <string>
+#include <vector>
+
+#include "pics.h"
+
+using std::cout;
+using std::copy;
+using std::endl;
+using std::ostream_iterator;
+using std::string;
+using std::vector;
+
+int main()
+{
+	vector<string> p;
+	p.push_back("this is an");
+	p.push_back("example");
+	p.push_back("to");
+	p.push_back("illustrate");
+	p.push_back("framing");
+
+	ostream_iterator<string>ofile(cout, "\n");
+	copy(p.begin(), p.end(), ofile);
+	cout << endl;
+
+	vector<string> f = frame(p);
+	copy(f.begin(), f.end(), ofile);	cout << endl;
+
+	vector<string> h = hcat(p,frame(p));
+	copy(h.begin(), h.end(), ofile);
+	cout << endl;
+
+	return 0;
+}
+
+
+
+#include <algorithm>      // �����㷨�⣬�ṩ���õ��㷨
+#include <iostream>       // �����׼�����������
+#include <iterator>       // �����������
+#include <string>         // �����ַ�����
+#include <vector>         // ���붯̬���飨vector����
+
+#include "pics.h"         // �����Զ���� pics.h �⣨����˿����������ɺ�ƴ����صĹ��ܣ�
+
+using std::cout;           // ʹ�ñ�׼�����
+using std::copy;           // ����copy�㷨
+using std::endl;           // ���뻻�з�
+using std::ostream_iterator; // ����������������������������������
+using std::string;         // ʹ���ַ�������
+using std::vector;         // ʹ��vector����
+
+int main() {
+    // ����һ��vector<string>���͵����� p���洢�ַ���
+    vector<string> p;
+    p.push_back("this is an");    // ����һ���ַ���
+    p.push_back("example");       // ����һ���ַ���
+    p.push_back("to");            // ����һ���ַ���
+    p.push_back("illustrate");    // ����һ���ַ���
+    p.push_back("framing");       // ����һ���ַ���
+
+    // �����������������ָ������� cout������ÿ��Ԫ���������
+    ostream_iterator<string> ofile(cout, "\n");
+
+    // ʹ��copy�㷨����vector p�е�����������
+    copy(p.begin(), p.end(), ofile);
+    cout << endl;  // ������з�
+
+    // ��vector pӦ�ÿ�ܲ���������һ���µ�vector f
+    vector<string> f = frame(p);
+    // ʹ��copy�㷨����vector f�е�����������
+    copy(f.begin(), f.end(), ofile);
+    cout << endl;  // ������з�
+
+    // ��vector p��vector f���к���ƴ�ӣ�����һ���µ�vector h
+    vector<string> h = hcat(p, frame(p));
+    // ʹ��copy�㷨����vector h�е�����������
+    copy(h.begin(), h.end(), ofile);
+    cout << endl;  // ������з�
+
+    return 0;  // ������������
+}
diff --git a/Chapter 8/8-5xref/8-5xref.cpp b/Chapter 8/8-5xref/8-5xref.cpp
new file mode 100644
index 0000000..97cd07a
--- /dev/null
+++ b/Chapter 8/8-5xref/8-5xref.cpp	
@@ -0,0 +1,145 @@
+#include <map>
+#include <iostream>
+#include <string>
+#include <vector>
+
+#include "split.h"
+
+using std::cin;            using std::cout;
+using std::endl;           using std::getline;
+using std::istream;        using std::string;
+using std::vector;         using std::map;
+
+// find all the lines that refer to each word in the input
+map<string, vector<int> >
+	xref(istream& in,
+	     vector<string> find_words(const string&) = split)
+{
+	string line;
+	int line_number = 0;
+	map<string, vector<int> > ret;
+
+	// read the next line
+	while (getline(in, line)) {
+		++line_number;
+
+		// break the input line into words
+		vector<string> words = find_words(line);
+
+		// remember that each word occurs on the current line
+#ifdef _MSC_VER
+		for (std::vector<string>::const_iterator it = words.begin();
+#else
+		for (vector<string>::const_iterator it = words.begin();
+#endif
+		     it != words.end(); ++it)
+			ret[*it].push_back(line_number);
+	}
+	return ret;
+}
+
+int main()
+{
+	// call `xref' using `split' by default
+	map<string, vector<int> > ret = xref(cin);
+
+	// write the results
+#ifdef _MSC_VER
+	for (std::map<string, vector<int> >::const_iterator it = ret.begin();
+#else
+	for (map<string, vector<int> >::const_iterator it = ret.begin();
+#endif
+	     it != ret.end(); ++it) {
+		// write the word
+		cout << it->first << " occurs on line(s): ";
+
+		// followed by one or more line numbers
+#ifdef _MSC_VER
+		std::vector<int>::const_iterator line_it = it->second.begin();
+#else
+		vector<int>::const_iterator line_it = it->second.begin();
+#endif
+		cout << *line_it;	// write the first line number
+
+		++line_it;
+		// write the rest of the line numbers, if any
+		while (line_it != it->second.end()) {
+			cout << ", " << *line_it;
+			++line_it;
+		}
+		// write a new line to separate each word from the next
+		cout << endl;
+	}
+
+	return 0;
+}
+
+
+
+#include <map>            // ���� map ���������ڴ洢ÿ�����ʼ�����ֵ��к�
+#include <iostream>       // �����׼�����������
+#include <string>         // �����ַ�����
+#include <vector>         // ���붯̬����⣬���ڴ洢ÿһ�еĵ���
+
+#include "split.h"        // �����Զ���� split.h �⣬����������ڷָ��ַ����ĺ���
+
+using std::cin;            // ʹ�ñ�׼������
+using std::cout;           // ʹ�ñ�׼�����
+using std::endl;           // ʹ�û��з�
+using std::getline;        // ʹ��getline������ȡ��������
+using std::istream;        // ʹ��������
+using std::string;         // ʹ���ַ�������
+using std::vector;         // ʹ��vector����
+using std::map;            // ʹ��map����
+
+// xref��������������ÿ���������ı��г��ֵ��к�
+// ������������ in ��һ������ָ�� find_words�����ڷָ�ÿ�еĵ��ʣ�Ĭ��Ϊ split ������
+map<string, vector<int> >
+xref(istream& in,
+	vector<string> find_words(const string&) = split)
+{
+	string line;             // �����洢ÿһ�е��ı�
+	int line_number = 0;     // �к�
+	map<string, vector<int> > ret;  // ��map���洢ÿ�����ʼ����Ӧ���к�
+
+	// ���ж�ȡ����
+	while (getline(in, line)) {
+		++line_number;  // �����к�
+
+		// ����find_words������һ���ı��ָ�ɵ���
+		vector<string> words = find_words(line);
+
+		// ����ǰ�к����ӵ�ÿ�����ʵĶ�Ӧλ��
+		for (vector<string>::const_iterator it = words.begin(); it != words.end(); ++it)
+			ret[*it].push_back(line_number);  // �����ʺ��кŶ�Ӧ����
+	}
+	return ret;  // ���ذ���ÿ�����ʼ����кŵ�map
+}
+
+int main()
+{
+	// ���� xref ������Ĭ��ʹ�� split ���ָ��
+	map<string, vector<int> > ret = xref(cin);
+
+	// ������
+	for (map<string, vector<int> >::const_iterator it = ret.begin(); it != ret.end(); ++it) {
+		// �������
+		cout << it->first << " occurs on line(s): ";
+
+		// ��ȡ��������ʳ��ֵ��к�
+		vector<int>::const_iterator line_it = it->second.begin();
+		cout << *line_it;    // �����һ���к�
+
+		++line_it;
+		// ���������к�
+		while (line_it != it->second.end()) {
+			cout << ", " << *line_it;
+			++line_it;
+		}
+		// ����
+		cout << endl;
+	}
+
+	return 0;  // �������
+}
+
diff --git a/Chapter 8/8-5xref/split.cpp b/Chapter 8/8-5xref/split.cpp
new file mode 100644
index 0000000..2d7e05f
--- /dev/null
+++ b/Chapter 8/8-5xref/split.cpp	
@@ -0,0 +1,43 @@
+#include <cctype>
+#include <string>
+#include <vector>
+
+#include "split.h"
+
+using std::vector;
+using std::string;
+
+#ifndef _MSC_VER
+using std::isspace;
+#endif
+
+vector<string> split(const string& s)
+{
+	vector<string> ret;
+	typedef string::size_type string_size;
+	string_size i = 0;
+
+	// invariant: we have processed characters `['original value of `i', `i)'
+	while (i != s.size()) {
+		// ignore leading blanks
+		// invariant: characters in range `['original `i', current `i)' are all spaces
+		while (i != s.size() && isspace(s[i]))
+			++i;
+
+		// find end of next word
+		string_size j = i;
+		// invariant: none of the characters in range `['original `j', current `j)' is a space
+		while (j != s.size() && !isspace(s[j]))
+			++j;
+
+		// if we found some nonwhitespace characters
+		if (i != j) {
+			// copy from `s' starting at `i' and taking `j' `\-' `i' chars
+			ret.push_back(s.substr(i, j - i));
+			i = j;
+		}
+
+	}
+	return ret;
+}
+
diff --git a/Chapter 8/8-5xref/split.h b/Chapter 8/8-5xref/split.h
new file mode 100644
index 0000000..7d49a45
--- /dev/null
+++ b/Chapter 8/8-5xref/split.h	
@@ -0,0 +1,8 @@
+#ifndef GUARD_split_h
+#define GUARD_split_h
+
+#include <vector>
+#include <string>
+std::vector<std::string> split(const std::string&);
+
+#endif
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/main.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/main.cpp
new file mode 100644
index 0000000..2bed64a
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/main.cpp	
@@ -0,0 +1,45 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+#include "split.h"
+
+using std::cin;
+using std::cout;
+using std::endl;
+using std::string;
+using std::vector;
+
+// ��������ת�ַ���
+string reverseString(const string& s) {
+    return string(s.rbegin(), s.rend());
+}
+
+int main() {
+    // ��ȡ�����ı�
+    cout << "����һ���ı�: ";
+    string input;
+    std::getline(cin, input);
+
+    // ����ı�Ϊ����
+    vector<string> words = split(input);
+
+    // ��ÿ�����ʽ��з�ת
+    for (auto& word : words) {
+        word = reverseString(word);
+    }
+
+    // ���շ�ת��ĵ�������
+    std::sort(words.begin(), words.end());
+
+    // ��������ĵ��ʣ�������ԭ�����ʽһ��
+    for (size_t i = 0; i < words.size(); ++i) {
+        if (i > 0) {
+            cout << " "; // ���ʼ�ӿո�
+        }
+        cout << words[i];
+    }
+    cout << endl;
+
+    return 0;
+}
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/split.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/split.cpp
new file mode 100644
index 0000000..2d7e05f
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/split.cpp	
@@ -0,0 +1,43 @@
+#include <cctype>
+#include <string>
+#include <vector>
+
+#include "split.h"
+
+using std::vector;
+using std::string;
+
+#ifndef _MSC_VER
+using std::isspace;
+#endif
+
+vector<string> split(const string& s)
+{
+	vector<string> ret;
+	typedef string::size_type string_size;
+	string_size i = 0;
+
+	// invariant: we have processed characters `['original value of `i', `i)'
+	while (i != s.size()) {
+		// ignore leading blanks
+		// invariant: characters in range `['original `i', current `i)' are all spaces
+		while (i != s.size() && isspace(s[i]))
+			++i;
+
+		// find end of next word
+		string_size j = i;
+		// invariant: none of the characters in range `['original `j', current `j)' is a space
+		while (j != s.size() && !isspace(s[j]))
+			++j;
+
+		// if we found some nonwhitespace characters
+		if (i != j) {
+			// copy from `s' starting at `i' and taking `j' `\-' `i' chars
+			ret.push_back(s.substr(i, j - i));
+			i = j;
+		}
+
+	}
+	return ret;
+}
+
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/split.h b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/split.h
new file mode 100644
index 0000000..7d49a45
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 1/split.h	
@@ -0,0 +1,8 @@
+#ifndef GUARD_split_h
+#define GUARD_split_h
+
+#include <vector>
+#include <string>
+std::vector<std::string> split(const std::string&);
+
+#endif
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/main.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/main.cpp
new file mode 100644
index 0000000..90d86a2
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/main.cpp	
@@ -0,0 +1,41 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+#include "urls.h"
+
+using std::cin;
+using std::cout;
+using std::endl;
+using std::sort;
+using std::string;
+using std::vector;
+
+int main() {
+    // �����ı�
+    cout << "����һ���ı�: ";
+    string input;
+    std::getline(cin, input);
+
+    // ��ȡ���� URL
+    vector<string> urls = find_urls(input);
+
+    // ɸѡ���� http:// �� https:// ��ͷ�� URL
+    vector<string> http_urls;
+    for (const string& url : urls) {
+        if (url.find("http://") == 0 || url.find("https://") == 0) {
+            http_urls.push_back(url);
+        }
+    }
+
+    // ����ĸ˳������
+    sort(http_urls.begin(), http_urls.end());
+
+    // ������
+    cout << "������ HTTP URLs:" << endl;
+    for (const string& url : http_urls) {
+        cout << url << endl;
+    }
+
+    return 0;
+}
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/urls.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/urls.cpp
new file mode 100644
index 0000000..5585b77
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/urls.cpp	
@@ -0,0 +1,101 @@
+#include <algorithm>
+#include <cctype>
+#include <string>
+#include <vector>
+
+#include "urls.h"
+
+using std::find;
+using std::find_if;
+
+#ifndef _MSC_VER
+using std::isalnum;
+using std::isalpha;
+using std::isdigit;
+#endif
+
+using std::search;
+using std::string;
+using std::vector;
+
+bool not_url_char(char);
+
+string::const_iterator
+url_end(string::const_iterator, string::const_iterator);
+
+string::const_iterator
+url_beg(string::const_iterator, string::const_iterator);
+vector<string> find_urls(const string& s)
+{
+	vector<string> ret;
+	typedef string::const_iterator iter;
+	iter b = s.begin(), e = s.end();
+
+	// look through the entire input
+	while (b != e) {
+
+		// look for one or more letters followed by `://'
+		b = url_beg(b, e);
+
+		// if we found it
+		if (b != e) {
+			// get the rest of the \s-1URL\s0
+			iter after = url_end(b, e);
+
+			// remember the \s-1URL\s0
+			ret.push_back(string(b, after));
+
+			// advance `b' and check for more \s-1URL\s0s on this line
+			b = after;
+		}
+	}
+	return ret;
+}
+
+string::const_iterator
+url_end(string::const_iterator b, string::const_iterator e)
+{
+	return find_if(b, e, not_url_char);
+}
+
+bool not_url_char(char c)
+{
+	// characters, in addition to alphanumerics, that can appear in a \s-1URL\s0
+	static const string url_ch = "~;/?:@=&$-_.+!*'(),";
+
+	// see whether `c' can appear in a \s-1URL\s0 and return the negative
+	return !(isalnum(c) ||
+	         find(url_ch.begin(), url_ch.end(), c) != url_ch.end());
+}
+
+string::const_iterator
+url_beg(string::const_iterator b, string::const_iterator e)
+{
+	static const string sep = "://";
+
+	typedef string::const_iterator iter;
+
+	// `i' marks where the separator was found
+	iter i = b;
+
+	while ((i = search(i, e, sep.begin(), sep.end())) != e) {
+
+		// make sure the separator isn't at the beginning or end of the line
+		if (i != b && i + sep.size() != e) {
+
+			// `beg' marks the beginning of the protocol-name
+			iter beg = i;
+			while (beg != b && isalpha(beg[-1]))
+				--beg;
+
+			// is there at least one appropriate character before and after the separator?
+			if (beg != i && !not_url_char(i[sep.size()]))
+				return beg;
+		}
+
+		// the separator we found wasn't part of a \s-1URL\s0; advance `i' past this separator
+		i += sep.size();
+	}
+	return e;
+}
+
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/urls.h b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/urls.h
new file mode 100644
index 0000000..3b881c5
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 2/urls.h	
@@ -0,0 +1,9 @@
+#ifndef GUARD_urls_h
+#define GUARD_urls_h
+
+#include <vector>
+#include <string>
+
+std::vector<std::string> find_urls(const std::string& s);
+
+#endif
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/Student_info.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/Student_info.cpp
new file mode 100644
index 0000000..2da2db9
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/Student_info.cpp	
@@ -0,0 +1,37 @@
+// source file for `Student_info'-related functions
+#include "Student_info.h"
+
+using std::istream;  using std::vector;
+
+bool compare(const Student_info& x, const Student_info& y)
+{
+	return x.name < y.name;
+}
+
+istream& read(istream& is, Student_info& s)
+{
+	// read and store the student's name and midterm and final exam grades
+	is >> s.name >> s.midterm >> s.final;
+
+	read_hw(is, s.homework);  // read and store all the student's homework grades
+	return is;
+}
+
+// read homework grades from an input stream into a `vector<double>'
+istream& read_hw(istream& in, vector<double>& hw)
+{
+	if (in) {
+		// get rid of previous contents
+		hw.clear();
+
+		// read homework grades
+		double x;
+		while (in >> x)
+			hw.push_back(x);
+
+		// clear the stream so that input will work for the next student
+		in.clear();
+	}
+	return in;
+}
+
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/Student_info.h b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/Student_info.h
new file mode 100644
index 0000000..65c7257
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/Student_info.h	
@@ -0,0 +1,19 @@
+#ifndef GUARD_Student_info
+#define GUARD_Student_info
+
+// `Student_info.h' header file
+#include <iostream>
+#include <string>
+#include <vector>
+
+struct Student_info {
+	std::string name;
+	double midterm, final;
+	std::vector<double> homework;
+};
+
+bool compare(const Student_info&, const Student_info&);
+std::istream& read(std::istream&, Student_info&);
+std::istream& read_hw(std::istream&, std::vector<double>&);
+#endif
+
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/grade.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/grade.cpp
new file mode 100644
index 0000000..43d757f
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/grade.cpp	
@@ -0,0 +1,41 @@
+#include <stdexcept>
+#include <vector>
+#include "grade.h"
+#include "median.h"
+#include "Student_info.h"
+
+using std::domain_error;  using std::vector;
+
+
+// compute a student's overall grade from midterm and final exam grades and homework grade
+double grade(double midterm, double final, double homework)
+{
+	return 0.2 * midterm + 0.4 * final + 0.4 * homework;
+}
+
+// compute a student's overall grade from midterm and final exam grades
+// and vector of homework grades.
+// this function does not copy its argument, because `median' does so for us.
+double grade(double midterm, double final, const vector<double>& hw)
+{
+	if (hw.size() == 0)
+		throw domain_error("student has done no homework");
+	return grade(midterm, final, median(hw));
+}
+
+double grade(const Student_info& s)
+{
+	return grade(s.midterm, s.final, s.homework);
+}
+
+// predicate to determine whether a student failed
+bool fgrade(const Student_info& s)
+{
+	return grade(s) < 60;
+}
+
+bool pgrade(const Student_info& s)
+{
+	return !fgrade(s);
+}
+
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/grade.h b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/grade.h
new file mode 100644
index 0000000..df1e0f5
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/grade.h	
@@ -0,0 +1,14 @@
+#ifndef GUARD_grade_h
+#define GUARD_grade_h
+
+#include <vector>
+#include "Student_info.h"
+
+double grade(double, double, double);
+double grade(double, double, const std::vector<double>&);
+double grade(const Student_info&);
+
+bool pgrade(const Student_info&);
+bool fgrade(const Student_info&);
+
+#endif
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/main.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/main.cpp
new file mode 100644
index 0000000..727e5da
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/main.cpp	
@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include "Student_info.h"
+#include "grade.h"
+
+using std::cin;
+using std::cout;
+using std::endl;
+using std::string;
+using std::vector;
+
+// ���峣�����������
+const double PASS_GRADE = 60.0;
+
+int main() {
+    vector<Student_info> students;
+    Student_info record;
+
+    // ��ȡѧ����Ϣ
+    cout << "���гɼ�ռ��20%����ĩ�ɼ�ռ��40%��ƽʱ�ɼ�ռ��40%��:" << endl;
+    cout << "����ѧ����Ϣ�����������гɼ�����ĩ�ɼ���ƽʱ�ɼ���:" << endl;
+    cout << "����Ctrl+z��س��˳���" << endl;
+
+    while (read(cin, record)) {
+        students.push_back(record);
+    }
+
+    // ��ѧ����Ϊ����Ͳ���������
+    vector<Student_info> pass, fail;
+    for (const auto& student : students) {
+        if (grade(student) >= PASS_GRADE) {
+            pass.push_back(student);
+        }
+        else {
+            fail.push_back(student);
+        }
+    }
+
+    // ����������
+    std::sort(pass.begin(), pass.end(), compare);
+    std::sort(fail.begin(), fail.end(), compare);
+
+    // �������ѧ����Ϣ
+    cout << "�ϸ�ѧ��:" << endl;
+    for (const auto& student : pass) {
+        cout << student.name << ": �ܳɼ� = " << grade(student) << endl;
+    }
+
+    // ���������ѧ����Ϣ
+    cout << "���ϸ�ѧ��:" << endl;
+    for (const auto& student : fail) {
+        cout << student.name << ": �ܳɼ� = " << grade(student) << endl;
+    }
+
+    return 0;
+}
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/median.cpp b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/median.cpp
new file mode 100644
index 0000000..04515a1
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/median.cpp	
@@ -0,0 +1,30 @@
+// source file for the `median' function
+#include <algorithm>    // to get the declaration of `sort'
+#include <stdexcept>    // to get the declaration of `domain_error'
+#include <vector>       // to get the declaration of `vector'
+
+using std::domain_error;   using std::sort;   using std::vector;
+
+#include "median.h"
+
+// compute the median of a `vector<double>'
+// note that calling this function copies the entire argument `vector'
+double median(vector<double> vec)
+{
+#ifdef _MSC_VER
+	typedef std::vector<double>::size_type vec_sz;
+#else
+	typedef vector<double>::size_type vec_sz;
+#endif
+
+	vec_sz size = vec.size();
+	if (size == 0)
+		throw domain_error("median of an empty vector");
+
+	sort(vec.begin(), vec.end());
+
+	vec_sz mid = size/2;
+
+	return size % 2 == 0 ? (vec[mid] + vec[mid-1]) / 2 : vec[mid];
+}
+
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/median.h b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/median.h
new file mode 100644
index 0000000..10d2c4f
--- /dev/null
+++ b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/Curriculum design 3/median.h	
@@ -0,0 +1,9 @@
+#ifndef GUARD_median_h
+#define GUARD_median_h
+
+// `median.h'--final version
+#include <vector>
+double median(std::vector<double>);
+
+#endif
+
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/张梦南 1220310013 高级语言程序课程设计.docx b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/张梦南 1220310013 高级语言程序课程设计.docx
new file mode 100644
index 0000000..b174c2a
Binary files /dev/null and b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/张梦南 1220310013 高级语言程序课程设计.docx differ
diff --git a/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/张梦南 1220310013 高级语言程序课程设计.pdf b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/张梦南 1220310013 高级语言程序课程设计.pdf
new file mode 100644
index 0000000..9719fcf
Binary files /dev/null and b/Curriculum Design and Report/张梦南 1220310013 高级语言程序课程设计/张梦南 1220310013 高级语言程序课程设计.pdf differ