首页 > 其他分享 >oop实验1

oop实验1

时间:2024-10-09 09:34:38浏览次数:6  
标签:begin cout int v0 v1 实验 oop include

task1:

  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 }

 

实验结果截图:

 

task2:

 

 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     double avg1 = accumulate(v0.begin(), v0.end(), 0)/v0.size();
79     cout << "均值: " << fixed << setprecision(2) << avg1 << endl;
80 
81     cout << endl;
82 
83     vector<int> v1{v0};
84     cout << "v0: ";
85     output(v0);
86     sort(v1.begin(), v1.end());
87     double avg2 = accumulate(v1.begin()+1, v1.end()-1, 0)/(v1.size()-2);
88     cout << "去掉最大值、最小值之后,均值: " << avg2 << endl;
89 }

 

实验结果截图:

 

task3:

 

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

 

实验结果截图:

 

task4:

 

 1 #include <iostream>
 2 #include <string>
 3 #include <algorithm>
 4 
 5 std::string dec2n(int x, int n = 2)
 6 {
 7     std::string result;
 8     while(x>0)
 9     {
10         int remainder=x%n;
11         if(remainder<10)
12         {
13             result+=remainder+'0';
14         }
15         else
16         {
17             result+=remainder-10+'A';
18         }
19         x/=n;
20     }
21     std::reverse(result.begin(),result.end());
22     return result;
23 }
24 
25 int main() {
26     using namespace std;
27 
28     int x;
29     while(cin >> x) {
30         cout << "十进制: " << x << endl;
31         cout << "二进制: " << dec2n(x) << endl;
32         cout << "八进制: " << dec2n(x, 8) << endl;
33         cout << "十六进制: " << dec2n(x, 16) << endl << endl;
34     }
35 }

 

实验结果截图:

 

task5:

 

 1 #include<iostream>
 2 int main()
 3 {
 4     for(int i=1;i<=26;i++)
 5     {
 6         std::string encrypted_letters="";
 7         for(char letter='A';letter<='Z';letter++)
 8         {
 9             int new_index=((letter-'A'+i)%26);
10             encrypted_letters+=(char)('A'+new_index);
11         }
12         std::cout<<encrypted_letters<<std::endl;
13     }
14     return 0;
15 }

 

实验结果截图:

 

task6:

 

 1 #include <iostream>
 2 #include <cstdlib>
 3 #include <ctime>
 4 #include <iomanip>
 5 
 6 int generateRandomNumber(int min, int max) {
 7     return rand() % (max - min + 1) + min;
 8 }
 9 
10 void generateRandomOperation(int &num1, int &num2, char &op) {
11     int choice = rand() % 4;
12     switch (choice) {
13         case 0: 
14             num1 = generateRandomNumber(1, 10);
15             num2 = generateRandomNumber(1, 10);
16             op = '+';
17             break;
18         case 1: 
19             num1 = generateRandomNumber(2, 10);
20             num2 = generateRandomNumber(1, num1 - 1);
21             op = '-';
22             break;
23         case 2: 
24             num1 = generateRandomNumber(1, 10);
25             num2 = generateRandomNumber(1, 10);
26             op = '*';
27             break;
28         case 3: 
29             num1 = generateRandomNumber(1, 10);
30             num2 = generateRandomNumber(1, 10);
31             while (num1 % num2!= 0) {
32                 num2 = generateRandomNumber(1, 10);
33             }
34             op = '/';
35             break;
36     }
37 }
38 
39 int calculateResult(int num1, int num2, char op) {
40     switch (op) {
41         case '+':
42             return num1 + num2;
43         case '-':
44             return num1 - num2;
45         case '*':
46             return num1 * num2;
47         case '/':
48             return num1 / num2;
49     }
50     return 0;
51 }
52 
53 int main() {
54     srand(static_cast<unsigned int>(time(0)));
55     int correctCount = 0;
56     int totalCount = 10;
57 
58     for (int i = 0; i < totalCount; ++i) {
59         int num1, num2;
60         char op;
61         generateRandomOperation(num1, num2, op);
62 
63         std::cout << num1 << " " << op << " " << num2 << " = ";
64         int userAnswer;
65         std::cin >> userAnswer;
66 
67         int correctAnswer = calculateResult(num1, num2, op);
68         if (userAnswer == correctAnswer) {
69             correctCount++;
70         }
71     }
72 
73     double accuracy = (static_cast<double>(correctCount) / totalCount) * 100.0;
74     std::cout << "正确率:" << std::fixed << std::setprecision(2) << accuracy << "%" << std::endl;
75 
76     return 0;
77 }

 

实验结果截图:

 

标签:begin,cout,int,v0,v1,实验,oop,include
From: https://www.cnblogs.com/g055140/p/18453544

相关文章