实验1 现代C++编程初体验 - Haruto

Task1

code1.cpp

  1 // 现代C++标准库、算法库体验
  2 // 本例用到以下内容:
  3 // 1. 字符串string, 动态数组容器类vector、迭代器
  4 // 2. 算法库：反转元素次序、旋转元素
  5 // 3. 函数模板、const引用作为形参
  6 
  7 #include <iostream>
  8 #include <string>
  9 #include <vector>
 10 #include <algorithm>
 11 
 12 using namespace std;
 13 
 14 // 声明
 15 // 模板函数声明
 16 template<typename T>
 17 void output(const T& c);
 18 
 19 // 普通函数声明
 20 void test1();
 21 void test2();
 22 void test3();
 23 
 24 int main() {
 25     cout << "测试1: \n";
 26     test1();
 27 
 28     cout << "\n测试2: \n";
 29     test2();
 30 
 31     cout << "\n测试3: \n";
 32     test3();
 33 }
 34 
 35 // 函数实现
 36 // 输出容器对象c中的元素
 37 template <typename T>
 38 void output(const T& c) {
 39     for (auto& i : c)
 40         cout << i << " ";
 41     cout << endl;
 42 }
 43 
 44 // 测试1
 45 // 组合使用算法库、迭代器、string反转字符串
 46 void test1() {
 47     string s0{ "0123456789" };
 48     cout << "s0 = " << s0 << endl;
 49 
 50     string s1{ s0 };
 51     reverse(s1.begin(), s1.end()); // 反转指定迭代器区间的元素
 52     cout << "s1 = " << s1 << endl;
 53 
 54     string s2{ s0 };
 55     reverse_copy(s0.begin(), s0.end(), s2.begin()); // 将指定迭代区间的元素拷贝到指定迭代器开始的目标区间，并且在复制过程中反转次序
 56     cout << "s2 = " << s2 << endl;
 57 }
 58 
 59 // 测试2
 60 // 组合使用算法库、迭代器、vector反转动态数组对象vector内数据
 61 void test2() {
 62     vector<int> v0{ 2, 0, 4, 9 };
 63     cout << "v0: ";
 64     output(v0);
 65 
 66     vector<int> v1{ v0 };
 67     reverse(v1.begin(), v1.end());
 68     cout << "v1: ";
 69     output(v1);
 70 
 71     vector<int> v2{ v0 };
 72     reverse_copy(v0.begin(), v0.end(), v2.begin());
 73     cout << "v2: ";
 74     output(v2);
 75 }
 76 
 77 // 测试3
 78 // 组合使用算法库、迭代器、vector实现元素旋转移位
 79 void test3() {
 80     vector<int> v0{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
 81     cout << "v0: ";
 82     output(v0);
 83 
 84     vector<int> v1{ v0 };
 85     rotate(v1.begin(), v1.begin() + 1, v1.end()); // 旋转指定迭代器区间[v1.begin(), v1.end())之间的数据项，旋转后从迭代器v1.begin() + 1位置的数据项开始
 86     cout << "v1: ";
 87     output(v1);
 88 
 89     vector<int> v2{ v0 };
 90     rotate(v2.begin(), v2.begin() + 2, v2.end());
 91     cout << "v2: ";
 92     output(v2);
 93 
 94     vector<int> v3{ v0 };
 95     rotate(v3.begin(), v3.end() - 1, v3.end());
 96     cout << "v3: ";
 97     output(v3);
 98     
 99     vector<int> v4{ v0 };
100     rotate(v4.begin(), v4.end() - 2, v4.end());
101     cout << "v4: ";
102     output(v4);
103 }

View Code

result1:

Task2

code2.cpp

 1 #include <iostream>
 2 #include <vector>
 3 #include <string>
 4 #include <algorithm>
 5 #include <numeric>
 6 #include <iomanip>
 7 
 8 using namespace std;
 9 
10 // 函数声明
11 // 模板函数声明
12 template<typename T>
13 void output(const T& c);
14 
15 // 普通函数声明
16 int rand_int_100();
17 void test1();
18 void test2();
19 
20 int main() {
21     cout << "测试1: \n";
22     test1();
23 
24     cout << "\n测试2: \n";
25     test2();
26 }
27 
28 // 函数实现
29 // 输出容器对象c中的元素
30 template <typename T>
31 void output(const T& c) {
32     for (auto& i : c)
33         cout << i << " ";
34     cout << endl;
35 }
36 
37 // 返回[0, 100]区间内的一个随机整数
38 int rand_int_100() {
39     return rand() % 101;
40 }
41 
42 // 测试1
43 // 对容器类对象指定迭代器区间进行赋值、排序
44 void test1() {
45     vector<int> v0(10); // 创建一个动态数组对象v0, 对象大小为10
46     generate(v0.begin(), v0.end(), rand_int_100); // 产生[0, 100]之间的随机整数赋值给指定迭代器区间[v0.begin(), v0.end())内的每个数据项
47     cout << "v0: ";
48     output(v0);
49 
50     vector<int> v1{ v0 };
51     sort(v1.begin(), v1.end()); // 对指定迭代器区间[v1.begin(), v1.end())内数据项进行升序排序
52     cout << "v1: ";
53     output(v1);
54 
55     vector<int> v2{ v0 };
56     sort(v2.begin() + 1, v2.end() - 1); // 对指定迭代器区间[v1.begin()+1,v1.end() - 1)内数据项进行升序排序
57     cout << "v2: ";
58     output(v2);
59 }
60 
61 // 测试2
62 // 对容器类对象指定迭代器区间进行赋值、计算最大值/最小值/均值
63 void test2() {
64     vector<int> v0(10);
65     generate(v0.begin(), v0.end(), rand_int_100);
66     cout << "v0: ";
67     output(v0);
68 
69     auto iter1 = min_element(v0.begin(), v0.end());
70     cout << "最小值: " << *iter1 << endl;
71 
72     auto iter2 = max_element(v0.begin(), v0.end());
73     cout << "最大值: " << *iter2 << endl;
74 
75     auto ans = minmax_element(v0.begin(), v0.end());
76     cout << "最小值: " << *(ans.first) << endl;
77     cout << "最大值: " << *(ans.second) << endl;
78 
79     double avg1 = accumulate(v0.begin(), v0.end(), 0) / v0.size();
80     cout << "均值: " << fixed << setprecision(2) << avg1 << endl;
81     cout << endl;
82 
83     vector<int> v1{ v0 };
84     cout << "v0: ";
85     output(v0);
86     
87     sort(v1.begin(), v1.end());
88     double avg2 = accumulate(v1.begin() + 1, v1.end() - 1, 0) / (v1.size() - 2);
89     cout << "去掉最大值、最小值之后，均值: " << avg2 << endl;
90 }

View Code

result2:

Task3

code3.cpp

 1 #include <iostream>
 2 #include <string>
 3 #include <algorithm>
 4 
 5 bool is_palindrome(std::string s);
 6 
 7 int main() {
 8     using namespace std;
 9     string s;
10     while (cin >> s) // 多组输入，直到按下Ctrl+Z后结束测试
11         cout << boolalpha << is_palindrome(s) << endl;
12 }
13 
14 bool is_palindrome(std::string s) {
15     using namespace std;
16     
17     string re_s{ s };
18     reverse_copy(s.begin(), s.end(), re_s.begin());
19 
20     if (s == re_s)
21         return true;
22     else
23         return false;
24 }

result3:

Task4

code4.cpp

 1 #include <iostream>
 2 #include <string>
 3 #include <algorithm>
 4 
 5 std::string dec2n(int x, int n = 2);
 6 
 7 int main() {
 8     using namespace std;
 9     int x;
10     while (cin >> x) {
11         cout << "十进制: " << x << endl;
12         cout << "二进制: " << dec2n(x, 2) << endl;
13         cout << "八进制: " << dec2n(x, 8) << endl;
14         cout << "十六进制: " << dec2n(x, 16) << endl << endl;
15     }
16 }
17 
18 std::string dec2n(int x, int n) {
19     if (x == 0) return "0";
20 
21     std::string res;
22     if (n == 2) {
23         while (x) {
24             res += (x % 2) + '0';
25             x /= 2;
26         }
27 
28         reverse(res.begin(), res.end());
29         return res;
30     }
31 
32     else if (n == 8) {
33         while (x) {
34             res += (x % 8) + '0';
35             x /= 8;
36         }
37 
38         reverse(res.begin(), res.end());
39         return res;
40     }
41 
42     else {
43         char Hex[16] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F' };
44         
45         while (x) {
46             res += Hex[x % 16];
47             x /= 16;
48         }
49 
50         reverse(res.begin(), res.end());
51         return res;
52     }
53 
54 }

result4:

Task5

code5.cpp

 1 #include<iostream>
 2 #include<iomanip>
 3 
 4 using namespace std;
 5 
 6 int main() {
 7     int ch1{ 'a' };
 8 
 9     cout << setw(4) << " ";
10     for (int i = 0; i < 26; ++i)
11         cout << setw(4) << static_cast<char>(ch1++);
12     cout << endl;
13 
14     for (int num = 1; num <= 26; ++num) {
15         cout << setw(4) << num;
16         int begin = num + 'A';
17 
18         for (int i = 0; i < 26; ++i) {
19             if (begin > 'Z') begin = begin % 90 + 64;
20             cout << setw(4) << static_cast<char>(begin++);
21         }
22         cout << endl;
23     }
24 
25     return 0;
26 }

result5:

Task6

code6.cpp

  1 #include<iostream>
  2 #include<vector>
  3 #include<ctime>
  4 #include<cstdlib>
  5 #include<algorithm>
  6 #include<iomanip>
  7 
  8 #define M 10
  9 #define N 1
 10 
 11 using namespace std;
 12 
 13 template<typename T>
 14 void print(const T& x) {
 15     for (auto& i : x)
 16         cout << setw(4) << i;
 17     cout << endl;
 18 }
 19 
 20 class Quiz {
 21 public:
 22     Quiz(int num = 10) : quiz_num{ num } {}
 23     ~Quiz() = default;
 24 
 25     void generateQuiz();
 26     void calculate();
 27 
 28 private:
 29     int quiz_num;
 30     vector<int> operand1;
 31     vector<int> operand2;
 32     vector<int> operater;
 33     int rand_int_10();
 34     int rand_int_4();
 35 };
 36 
 37 void Quiz::generateQuiz() {
 38     srand(static_cast<unsigned>(time(0)));
 39 
 40     operand1.resize(quiz_num);
 41     operand2.resize(quiz_num);
 42     operater.resize(quiz_num);
 43     generate(operand1.begin(), operand1.end(), [this]() { return rand_int_10(); });
 44     generate(operand2.begin(), operand2.end(), [this]() { return rand_int_10(); });
 45     generate(operater.begin(), operater.end(), [this]() { return rand_int_4(); });
 46 
 47     for (int i = 0; i < quiz_num; ++i) {
 48         if (operater.at(i) == 2 && operand1.at(i) < operand2.at(i))
 49             swap(operand1.at(i), operand2.at(i));
 50 
 51         if (operater.at(i) == 4 && operand1.at(i) < operand2.at(i))
 52             swap(operand1.at(i), operand2.at(i));
 53 
 54         if (operater.at(i) == 4)
 55             while (operand1.at(i) % operand2.at(i) != 0)
 56                 operand2.at(i) = rand() % 10 + 1;
 57     }
 58 
 59 }
 60 
 61 void Quiz::calculate() {
 62     double rate = 0;
 63     int ans;
 64 
 65     for (int i = 0; i < quiz_num; ++i) {
 66         int corrrct_ans;
 67 
 68         cout << operand1.at(i) << " ";
 69         switch (operater.at(i)) {
 70         case 1:
 71             cout << "+ ";
 72             corrrct_ans = operand1.at(i) + operand2.at(i);
 73             break;
 74         case 2:
 75             cout << "- ";
 76             corrrct_ans = operand1.at(i) - operand2.at(i);
 77             break;
 78         case 3:
 79             cout << "* ";
 80             corrrct_ans = operand1.at(i) * operand2.at(i);
 81             break;
 82         case 4:
 83             cout << "/ ";
 84             corrrct_ans = operand1.at(i) / operand2.at(i);
 85             break;
 86         default:
 87             cout << "error";
 88             break;
 89         }
 90         cout << operand2.at(i) << " = ";
 91 
 92         cin >> ans;
 93 
 94         if (ans == corrrct_ans) rate++;
 95     }
 96     cout << "正确率: " << fixed << setprecision(2) << (rate / quiz_num) * 100 << "%";
 97 }
 98 
 99 int Quiz::rand_int_10() {
100     return rand() % (M - N + 1) + N;
101 }
102 
103 int Quiz::rand_int_4() {
104     return rand() % (4 - 1 + 1) + 1;
105 }
106 
107 int main() {
108     Quiz Q(10);
109     Q.generateQuiz();
110     Q.calculate();
111 
112     return 0;
113 }

result6:

posted on 2024-10-13 14:09 Haruto 阅读(12) 评论(0) 编辑收藏举报

刷新页面返回顶部