实验一 C++
实验任务1：
task1.cpp：
1 #include <iostream> 2 #include <string> 3 #include <vector> 4 #include <algorithm> 5 6 using namespace std; 7 8 // 声明 9 // 模板函数声明 10 template<typename T> 11 void output(const T &c); 12 13 // 普通函数声明 14 void test1(); 15 void test2(); 16 void test3(); 17 18 int main() { 19 cout << "测试1: \n"; 20 test1(); 21 22 cout << "\n测试2: \n"; 23 test2(); 24 25 cout << "\n测试3: \n"; 26 test3(); 27 } 28 29 // 函数实现 30 // 输出容器对象c中的元素 31 template <typename T> 32 void output(const T &c) { 33 for(auto &i: c) 34 cout << i << " "; 35 cout << endl; 36 } 37 38 // 测试1 39 // 组合使用算法库、迭代器、string反转字符串 40 void test1() { 41 string s0{"0123456789"}; 42 cout << "s0 = " << s0 << endl; 43 44 string s1{s0}; 45 reverse(s1.begin(), s1.end()); // 反转指定迭代器区间的元素 46 cout << "s1 = " << s1 << endl; 47 48 string s2{s0}; 49 reverse_copy(s0.begin(), s0.end(), s2.begin()); // 将指定迭代区间的元素拷贝到指定迭代器开始的目标区间，并且在复制过程中反转次序 50 cout << "s2 = " << s2 << endl; 51 } 52 53 // 测试2 54 // 组合使用算法库、迭代器、vector反转动态数组对象vector内数据 55 void test2() { 56 vector<int> v0{2, 0, 4, 9}; 57 cout << "v0: "; 58 output(v0); 59 60 vector<int> v1{v0}; 61 reverse(v1.begin(), v1.end()); 62 cout << "v1: "; 63 output(v1); 64 65 vector<int> v2{v0}; 66 reverse_copy(v0.begin(), v0.end(), v2.begin()); 67 cout << "v2: "; 68 output(v2); 69 } 70 71 // 测试3 72 // 组合使用算法库、迭代器、vector实现元素旋转移位 73 void test3() { 74 vector<int> v0{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; 75 cout << "v0: "; 76 output(v0); 77 78 vector<int> v1{v0}; 79 rotate(v1.begin(), v1.begin()+1, v1.end()); // 旋转指定迭代器区间[v1.begin(), v1.end())之间的数据项，旋转后从迭代器v1.begin()+1位置的数据项开始 80 cout << "v1: "; 81 output(v1); 82 83 vector<int> v2{v0}; 84 rotate(v2.begin(), v2.begin()+2, v2.end()); 85 cout << "v2: "; 86 output(v2); 87 88 vector<int> v3{v0}; 89 rotate(v3.begin(), v3.end()-1, v3.end()); 90 cout << "v3: "; 91 output(v3); 92 93 vector<int> v4{v0}; 94 rotate(v4.begin(), v4.end()-2, v4.end()); 95 cout << "v4: "; 96 output(v4); 97 }
运行结果：
实验任务2：
task2.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 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 }
运行结果：
实验任务3：
task3.cpp：
1 #include <iostream> 2 #include <string> 3 #include <algorithm> 4 5 bool is_palindrome(std::string s){ 6 std::string s1{s}; 7 reverse(s1.begin(),s1.end()); 8 if(s==s1){ 9 return true; 10 } 11 else{ 12 return false; 13 } 14 } 15 16 int main() { 17 using namespace std; 18 string s; 19 20 while(cin >> s) // 多组输入，直到按下Ctrl+Z后结束测试 21 cout << boolalpha << is_palindrome(s) << endl; 22 }
运行结果：
实验任务4：
task4.cpp：
1 #include <iostream> 2 #include <string> 3 #include <algorithm> 4 5 std::string dec2n(int x, int n = 2){ 6 std::string t; 7 int q; 8 char p; 9 if(x==0){ 10 t.push_back('0'); 11 } 12 while(x>0){ 13 q=x%n; 14 if(q>=10){ 15 switch(q){ 16 17 case 10:p='A';break; 18 case 11:p='B';break; 19 case 12:p='C';break; 20 case 13:p='D';break; 21 case 14:p='E';break; 22 case 15:p='F';break;} 23 } 24 else{ 25 p='0'+q; 26 } 27 t.push_back(p); 28 x=x/n; 29 } 30 reverse(t.begin(),t.end()); 31 return t; 32 } 33 34 int main() { 35 using namespace std; 36 37 int x; 38 while(cin >> x) { 39 cout << "十进制: " << x << endl; 40 cout << "二进制: " << dec2n(x) << endl; 41 cout << "八进制: " << dec2n(x, 8) << endl; 42 cout << "十六进制: " << dec2n(x, 16) << endl << endl; 43 } 44 }
运行结果：
实验任务5：
task5.cpp：
1 #include<iostream> 2 #include<string> 3 #include<algorithm> 4 using namespace std; 5 int main(){ 6 cout<<" "<<"a"<<" "<<"b"<<" "<<"c"<<" "<<"d"<<" "<<"e"<<" "<<"f"<<" "<<"g"<<" "<<"h"<<" "<<"i"<<" "<<"j"<<" "<<"k"<<" "<<"l"<<" "<<"m"<<" "<<"n"<<" "<<"o"<<" "<<"p"<<" "<<"q"<<" "<<"r"<<" "<<"s"<<" "<<"t"<<" "<<"u"<<" "<<"v"<<" "<<"w"<<" "<<"x"<<" "<<"y"<<" "<<"z"<<endl; 7 char t[26]={'B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','A'}; 8 int i,j; 9 char k; 10 for(i=1;i<=9;i++){ 11 cout<<" "<<i<<" "<<t[0]<<" "<<t[1]<<" "<<t[2]<<" "<<t[3]<<" "<<t[4]<<" "<<t[5]<<" "<<t[6]<<" "<<t[7]<<" "<<t[8]<<" "<<t[9]<<" "<<t[10]<<" "<<t[11]<<" "<<t[12]<<" "<<t[13]<<" "<<t[14]<<" "<<t[15]<<" "<<t[16]<<" "<<t[17]<<" "<<t[18]<<" "<<t[19]<<" "<<t[20]<<" "<<t[21]<<" "<<t[22]<<" "<<t[23]<<" "<<t[24]<<" "<<t[25]<<endl; 12 k=t[0]; 13 for(j=0;j<26;j++){ 14 t[j]=t[j+1]; 15 } 16 t[25]=k; 17 } 18 for(i=10;i<=26;i++){ 19 cout<<i<<" "<<t[0]<<" "<<t[1]<<" "<<t[2]<<" "<<t[3]<<" "<<t[4]<<" "<<t[5]<<" "<<t[6]<<" "<<t[7]<<" "<<t[8]<<" "<<t[9]<<" "<<t[10]<<" "<<t[11]<<" "<<t[12]<<" "<<t[13]<<" "<<t[14]<<" "<<t[15]<<" "<<t[16]<<" "<<t[17]<<" "<<t[18]<<" "<<t[19]<<" "<<t[20]<<" "<<t[21]<<" "<<t[22]<<" "<<t[23]<<" "<<t[24]<<" "<<t[25]<<endl; 20 k=t[0]; 21 for(j=0;j<26;j++){ 22 t[j]=t[j+1]; 23 } 24 t[25]=k; 25 } 26 return 0; 27 }
运行结果：
实验任务6：
task6.cpp：
1 #include<iostream> 2 #include<string> 3 #include<stdlib.h> 4 #include<time.h> 5 #include<ctype.h> 6 #include<string.h> 7 #define max 10 8 using namespace std; 9 int main(){ 10 int i,j,t,a,b,c,d,r=0; 11 char p; 12 srand((unsigned)time(NULL)); 13 for(j=0;j<10;j++){ 14 t=rand()%4; 15 16 switch(t){ 17 case 0: 18 p='+'; 19 a=rand()%max+1; 20 b=rand()%max+1; 21 c=a+b;break; 22 case 1: 23 p='-'; 24 a=rand()%max+1; 25 b=rand()%(a-1)+1; 26 c=a-b;break; 27 case 2: 28 p='*'; 29 c=rand()%max+1; 30 do{ 31 a=rand()%(c-1)+1; 32 }while(c%a!=0); 33 b=c/a;break; 34 case 3: 35 p='/'; 36 a=rand()%max+1; 37 do{ 38 b=rand()%(a-1)+1; 39 }while(a%b!=0); 40 c=a/b;break; 41 } 42 cout<<a<<p<<b<<"="; 43 cin>>d; 44 if(d==c){ 45 r++; 46 } 47 } 48 cout<<"正确率："<<r<<"0.00%"; 49 return 0; 50 }
运行结果：
