任務1：
task1.cpp
// 現代C++標準庫、演算法庫體驗 // 本例用到以下內容: // 1. 字串string, 動態陣列容器類vector、迭代器 // 2. 演算法庫：反轉元素次序、旋轉元素 // 3. 函式模板、const引用作為形參 #include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; // 宣告 // 模板函式宣告 template<typename T> void output(const T &c); // 普通函式宣告 void test1(); void test2(); void test3(); int main() { cout << "測試1: \n"; test1(); cout << "\n測試2: \n"; test2(); cout << "\n測試3: \n"; test3(); } // 函式實現 // 輸出容器物件c中的元素 template <typename T> void output(const T &c) { for(auto &i: c) cout << i << " "; cout << endl; } // 測試1 // 組合使用演算法庫、迭代器、string反轉字串 void test1() { string s0{"0123456789"}; cout << "s0 = " << s0 << endl; string s1{s0}; reverse(s1.begin(), s1.end()); // 反轉指定迭代器區間的元素 cout << "s1 = " << s1 << endl; string s2{s0}; reverse_copy(s0.begin(), s0.end(), s2.begin()); // 將指定迭代區間的元素複製 到指定迭代器開始的目標區間，並且在複製過程中反轉次序 cout << "s2 = " << s2 << endl; } // 測試2 // 組合使用演算法庫、迭代器、vector反轉動態陣列物件vector內資料 void test2() { vector<int> v0{2, 0, 4, 9}; cout << "v0: "; output(v0); vector<int> v1{v0}; reverse(v1.begin(), v1.end()); cout << "v1: "; output(v1); vector<int> v2{v0}; reverse_copy(v0.begin(), v0.end(), v2.begin()); cout << "v2: "; output(v2); } // 測試3 // 組合使用演算法庫、迭代器、vector實現元素旋轉移位 void test3() { vector<int> v0{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; cout << "v0: "; output(v0); vector<int> v1{v0}; rotate(v1.begin(), v1.begin()+1, v1.end()); // 旋轉指定迭代器區間 [v1.begin(), v1.end())之間的資料項，旋轉後從迭代器v1.begin()+1位置的資料項開始 cout << "v1: "; output(v1); vector<int> v2{v0}; rotate(v2.begin(), v2.begin()+2, v2.end()); cout << "v2: "; output(v2); vector<int> v3{v0}; rotate(v3.begin(), v3.end()-1, v3.end()); cout << "v3: "; output(v3); vector<int> v4{v0}; rotate(v4.begin(), v4.end()-2, v4.end()); cout << "v4: "; output(v4); }
執行結果截圖：
任務2：
task2.cpp
#include <iostream> #include <vector> #include <string> #include <algorithm> #include <numeric> #include <iomanip> using namespace std; // 函式宣告 // 模板函式宣告 template<typename T> void output(const T &c); // 普通函式宣告 int rand_int_100(); void test1(); void test2(); int main() { cout << "測試1: \n"; test1(); cout << "\n測試2: \n"; test2(); } // 函式實現 // 輸出容器物件c中的元素 template <typename T> void output(const T &c) { for(auto &i: c) cout << i << " "; cout << endl; } // 返回[0, 100]區間內的一個隨機整數 int rand_int_100() { return rand() % 101; } // 測試1 // 對容器類物件指定迭代器區間進行賦值、排序 void test1() { vector<int> v0(10); // 建立一個動態陣列物件v0, 物件大小為10 generate(v0.begin(), v0.end(), rand_int_100); // 產生[0, 100]之間的隨機整數 賦值給指定迭代器區間[v0.begin(), v0.end())內的每個資料項 cout << "v0: "; output(v0); vector<int> v1{v0}; sort(v1.begin(), v1.end()); // 對指定迭代器區間[v1.begin(), v1.end())內資料 項進行升序排序 cout << "v1: "; output(v1); vector<int> v2{v0}; sort(v2.begin()+1, v2.end()-1); // 對指定迭代器區間[v1.begin()+1, v1.end()-1)內資料項進行升序排序 cout << "v2: "; output(v2); } // 測試2 // 對容器類物件指定迭代器區間進行賦值、計算最大值/最小值/均值 void test2() { vector<int> v0(10); generate(v0.begin(), v0.end(), rand_int_100); cout << "v0: "; output(v0); auto iter1 = min_element(v0.begin(), v0.end()); cout << "最小值: " << *iter1 << endl; auto iter2 = max_element(v0.begin(), v0.end()); cout << "最大值: " << *iter2 << endl; auto ans = minmax_element(v0.begin(), v0.end()); cout << "最小值: " << *(ans.first) << endl; cout << "最大值: " << *(ans.second) << endl; double avg1 = accumulate(v0.begin(), v0.end(), 0)/v0.size(); cout << "均值: " << fixed << setprecision(2) << avg1 << endl; cout << endl; vector<int> v1{v0}; cout << "v0: "; output(v0); sort(v1.begin(), v1.end()); double avg2 = accumulate(v1.begin()+1, v1.end()-1, 0)/(v1.size()-2); cout << "去掉最大值、最小值之後，均值: " << avg2 << endl; }
執行結果截圖：
任務3：
task3.cpp
#include <iostream> #include <string> #include <algorithm> bool is_palindrome(std::string s); int main() { using namespace std; string s; while(cin >> s) // 多組輸入，直到按下Ctrl+Z後結束測試 cout << boolalpha << is_palindrome(s) << endl; } // 函式is_palindrom定義 bool is_palindrome(std::string s){ using namespace std; bool a=false,b=true; string str = s; int len = s.size(); char temp; for(int i=0; i<len/2; i++){ temp = s[i]; s[i]=s[len-i-1]; s[len-i-1]=temp; } if(str==s) return true; else return false; }
執行結果截圖
任務4
task4.cpp
#include <iostream> #include <string> #include <algorithm> std::string dec2n(int x, int n = 2); int main() { using namespace std; int x; while(cin >> x) { cout << "十進位制: " << x << endl; cout << "二進位制: " << dec2n(x) << endl; cout << "八進位制: " << dec2n(x, 8) << endl; cout << "十六進位制: " << dec2n(x, 16) << endl << endl; } } // 函式dec2n定義 std::string dec2n(int x, int n) { if (x == 0) return "0"; const char digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; std::string result; while (x > 0) { result += digits[x % n]; x /= n; } std::reverse(result.begin(), result.end()); return result; }
執行結果截圖
任務5：
task5.cpp
#include<iostream> #include<iomanip> using namespace std; int main() { int count=1; int i,j; cout<<" "; for(i=97;i<97+26;i++) { cout<<setw(2)<<char(i); } cout<<endl; for(i=1;i<=26;i++) { cout<<setw(2)<<i; for(j=i+1;j<=26;j++) { cout<<setw(2)<<char(j+64); } for(j=1;j<=i;j++) { cout<<setw(2)<<char(j+64); } cout<<endl; } return 0; }
執行結果截圖
任務6：
task6.cpp
#include <iostream> #include <cstdlib> #include <ctime> #include <iomanip> using namespace std; int randomInRange(int min, int max) { return rand() % (max - min + 1) + min; } pair<int, int> generateDivisiblePair() { int divisor = randomInRange(1, 10); int dividend = divisor * randomInRange(1, 10); return {dividend, divisor}; } pair<int, int> generateSubtractPair() { int minuend = randomInRange(2, 10); int subtrahend = randomInRange(1, minuend - 1); return {minuend, subtrahend}; } double generateAndEvaluateQuestions() { srand(static_cast<unsigned>(time(0))); int correctAnswers = 0; for (int i = 0; i < 10; ++i) { int operation = randomInRange(0, 3); pair<int, int> operands; switch (operation) { case 0: operands = {randomInRange(1, 10), randomInRange(1, 10)}; cout << operands.first << " + " << operands.second << " = "; break; case 1: operands = generateSubtractPair(); cout << operands.first << " - " << operands.second << " = "; break; case 2: operands = {randomInRange(1, 10), randomInRange(1, 10)}; cout << operands.first << " * " << operands.second << " = "; break; case 3: operands = generateDivisiblePair(); cout << operands.first << " / " << operands.second << " = "; break; } int userAnswer; cin >> userAnswer; int correctAnswer; switch (operation) { case 0: correctAnswer = operands.first + operands.second; break; case 1: correctAnswer = operands.first - operands.second; break; case 2: correctAnswer = operands.first * operands.second; break; case 3: correctAnswer = operands.first / operands.second; break; } if (userAnswer == correctAnswer) { ++correctAnswers; } } double accuracy = static_cast<double>(correctAnswers) / 10 * 100; cout << fixed << setprecision(2) << "正確率: " << accuracy << "%" << endl; return accuracy; } int main() { generateAndEvaluateQuestions(); return 0; }
執行結果截圖
