TQC+ 題庫「程式語言（第二版）」—— C++ 題解

由於題目可能涉及著作權等問題，此篇僅提供可 AC 的程式碼，相關題目內容請自行至 Code Judger 的程式語言（第二版）登入後閱覽（可使用學校的酷課雲帳號登入）。

第1類：基本認識

101

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int n;
    cin >> n;
    cout << n + 9;
}

102

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int n;
    cin >> n;
    cout << fixed << setprecision(2) << n*23.34;
}

103

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int a, b, c;
    cin >> a >> b >> c;
    int s = a + b + c;
    cout << a << '+' << b << '+' << c << '=' << s << '\n' << fixed << setprecision(2) << s / 3.0;
}

104

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    float a, b;
    cin >> a >> b;
    cout << "total=" << fixed << setprecision(2) << a + b;
}

105

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int a, b;
    cin >> a >> b;
    cout << "result=" << fixed << setprecision(2) << sqrt(a+b);
}

106

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    cout << fixed << setprecision(2) << sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));
}

107

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string a, b, c, d, e, f;
    cin >> a >> b >> c >> d >> e >> f;

    cout << right << setw(10) << a << ' '
         << setw(10) << b << ' '
         << setw(10) << c << '\n'
         << setw(10) << d << ' '
         << setw(10) << e << ' '
         << setw(10) << f << '\n'

         << left
         << setw(10) << a << ' '
         << setw(10) << b << ' '
         << setw(10) << c << '\n'
         << setw(10) << d << ' '
         << setw(10) << e << ' '
         << setw(10) << f << '\n';
}

108

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int rr;
    cin >> rr;
    float r = rr / 2.0;

    cout << left << setw(10) << rr << '\n'
         << fixed << setprecision(2) << left << setw(10) << r << '\n'
         << setprecision(4) << setw(10) << r * r * 3.1415;
}

109

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int s;
    cin >> s;

    if (s > 100) {
        cout << "error";
        return 0;
    }

    cout << ((s >= 60) ? "pass\n" : "fail\n") << ((s % 2) ? "odd" : "even");
}

110

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b, c;
    cin >> a >> b >> c;

    cout << (a >= 60 and a < 100) << '\n' << fixed << setprecision(2) << (b+1) / 10.0 << '\n' << max(a, c);
}

第2類：選擇敘述與迴圈

201

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int x;
    cin >> x;
    cout << ((x % 2) ? "odd" : "even");
}

202

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int x;
    cin >> x;

    if (x > 100 or x < 0) {
        cout << "error";
        return 0;
    }
    cout << ((x > 60) ? x + 10 : x + 5);
}

203

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s[4] = {"one", "two", "three", "four"};
    int x;
    cin >> x;
    cout << ((x > 0 and x < 5) ? s[x-1] : "error");
}

204

#include <bits/stdc++.h>
using namespace std;

int calc(int a, int b, char c) {
    if (c == '+') return a + b;
    else if (c == '-') return a - b;
    else if (c == '*') return a * b;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b;
    char c;
    cin >> a >> b >> c;
    
    if (c == '+' or c == '-' or c == '*') cout << a << c << b << '=' << calc(a, b, c);
    else cout << "error";    
}

205

#include <bits/stdc++.h>
using namespace std;

unordered_map<string, int> m;

void f(int x) {
    if (x == 1) m["number1"]++;
    else if (x == 2) m["number2"]++;
    else if (x == 3) m["number3"]++;
    else if (x == 4) m["number4"]++;
    else if (x == 5) m["number5"]++;
    else if (x == 6) m["number6"]++;
    else m["error"]++;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    for (int i = 0; i < 10; i++) {
        int x;
        cin >> x;
        f(x);
    }

    for (string k : {"number1", "number2", "number3", "number4", "number5", "number6", "error"})
    cout << k << ':' << m[k] << '\n';
}

206

#include <bits/stdc++.h>
using namespace std;

int calc(int n) {
    int cnt = (n+1) / 2;
    return cnt * cnt;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b;
    cin >> a >> b;
    cout << calc(b) - calc(a-1);
}

207

#include <bits/stdc++.h>
using namespace std;

bool prime(int n) {
    for (int i = 2; i*i <= n; i++) if (n % i == 0) return 0;
    return 1;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    string s = (prime(n)) ? "" : " not";
    cout << n << " is" << s << " a prime number";
}

208

#include <bits/stdc++.h>
using namespace std;

bool prime(int n) {
    for (int i = 2; i*i <= n; i++) if (n % i == 0) return 0;
    return 1;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    for (int i = 2; i < n; i++) if (prime(i)) cout << i << ' ';
}

209

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;

    if (n != 0 and n != 1) {
        cout << "error";
        return 0;
    }

    for (int i = 1; i <= 5; i++) {
        for (int j = 1; j <= 5; j++) {
            if (n == 0) cout << i << " x " << j << " = " << i * j << '\t';
            else cout << j << " x " << i << " = " << i * j << '\t';
        }
        cout << '\n';
    }
}

210

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b;
    cin >> a >> b;
    cout << gcd(a, b) << '\n' << lcm(a, b);
}

第3類：函式與陣列

301

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    //compute
    int a, b;
    cin >> a >> b;
    for (int i = 0; i < b; i++) {
        for (int j = 0; j < a; j++) cout << '*';
        cout << '\n';
    }
    cout << a * b;
}

302

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    //compute
    int n;
    cin >> n;
    
    if (n > 100 or n < 0) {
        cout << -1;
        return 0;
    }

    cout << ((n > 60) ? n + 5 : n + 10);
}

303

#include <bits/stdc++.h>
using namespace std;

bool compute(int n) {
    for (int i = 2; i*i <= n; i++) if (n % i == 0) return 0;
    return 1;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    string s = (compute(n)) ? "" : " not";
    cout << n << " is" << s << " a prime number";
}

304

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    //compute
    int cnt = 0;
    for (int i = 0; i < 6; i++) {
        int x;
        cin >> x;
        if (x % 3 == 0) cnt++;
    }
    cout << cnt;
}

305

#include <bits/stdc++.h>
using namespace std;

int compute(int a, int b ,int c) {
    if (c == 1) return a + b;
    else return a * b;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b, c;
    cin >> a >> c >> b;
    cout << compute(a, b, c);
}

306

#include <bits/stdc++.h>
using namespace std;

int compute(int n) {
    if (n == 0) return 1;
    return n * compute(n - 1);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    cout << n << "!=" << compute(n);
}

307

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    //compute
    int n[5];
    for (int i = 0; i < 5; i++) cin >> n[i];
    cout << *max_element(n, n+5);
}

308

#include <bits/stdc++.h>
using namespace std;

int compute(int n) {
    if (n < 2) return n;
    return compute(n-1) + compute(n-2);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    n++;
    
    while (--n) cout << "fib(" << n << ")=" << compute(n) << '\n';
}

309

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    //compute
    float a, b, c, d, e, f;
    cin >> a >> b >> c >> d >> e >> f;
    float x = a / d, y = b / e, z = c / f;
    cout << fixed << setprecision(3) << min(x, min(y, z));
}

310

#include <bits/stdc++.h>
using namespace std;

bool compute(int n) {
    int k = 0, t = n;
    while (t > 0) {
        k++;
        t /= 10;
    }

    int s = 0;
    t = n;
    while (t > 0) {
        s += pow(t%10, k);
        t /= 10;
    }

    return s == n;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n, a = 0;
    cin >> n;

    for (int i = 1; i < n; i++)
        if (compute(i)) {
            cout << i << '\n';
            a += i;
        }

    cout << a;
}

第4類：字串與檔案處理

401

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string a, b;
    cin >> a >> b;
    cout << a.size() << '\n' << b.size() << '\n' << a << b;
}

402

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s1, s2;
    int n;

    getline(cin, s1);
    getline(cin, s2);
    cin >> n;

    if (n > s1.size()) {
        cout << "error";
        return 0;
    }

    string a = s1.substr(0, n);
    string b = s2.substr(0, n);

    if (a == b) cout << s1 << " = " << s2;
    else if (a < b) cout << s1 << " < " << s2;
    else cout << s1 << " > " << s2;
}

403

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;

    for (char &c : s) {
        if (islower(c)) c = toupper(c);
        else c = tolower(c);
    }

    cout << s;
}

404

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;
    int arr[26] = {0};

    for (char c : s) arr[c-'a']++;
    int pos = max_element(arr, arr+26) - arr;
    cout << char(pos+'a') << '\n' << arr[pos];
}

405

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b, c;
    cin >> a >> b >> c;
    ifstream in("read.txt");
    string data[3];
    in >> data[0] >> data[1] >> data[2];

    cout << string(a, char(a+'0')) << data[0].substr(a) << '\n'
         << string(b, char(b+'0')) << data[1].substr(b) << '\n'
         << string(c, char(c+'0')) << data[2].substr(c);
}

406

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string lo = "qwertyuiopasdfghjklzxcvbnm";
    string up = "QWERTYUIOPASDFGHJKLZXCVBNM";

    string inp;
    cin >> inp;

    for (char c : inp) {
        if (c == 'p' or c == 'l' or c == 'm' or c == 'P' or c == 'L' or c == 'M') cout << c;
        else if (islower(c)) {
            int pos = lo.find(c);
            cout << lo[pos+1];
        }
        else {
            int pos = up.find(c);
            cout << up[pos+1];
        }
    }
}

407

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    ifstream in("read.txt");
    ofstream out("write.txt");
    char c;
    while (in.get(c)) if (c != '*') out << c;
}

408

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string a, b;
    cin >> a >> b;

    if (a.size() < 3 or a.size() > 20 or b.size() < 3 or b.size() > 20) {
        cout << "error";
        return 0;
    }

    string c = a + b;
    reverse(c.begin(), c.end());

    cout << a.size() << '\n' << b.size() << '\n' << c;
}

409

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    ifstream in("read.txt");
    ofstream out("write.txt");

    char c;
    while (in.get(c)) out << char(c+2);
}

410

#include <bits/stdc++.h>
using namespace std;

string capwords(string s) {
    stringstream ss(s);
    string word;
    string result = "";

    while (ss >> word) {
        word[0] = toupper(word[0]);
        for (int i = 1; i < word.size(); i++) word[i] = tolower(word[i]);

        if (!result.empty()) result += " ";
        result += word;
    }
    return result;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    ifstream in("read.txt");
    ofstream out("write.txt");
    string line;
    vector<string> lines;

    while (getline(in, line)) lines.push_back(line);

    for (int i = 0; i < n and i < lines.size(); i++) {
        out << capwords(lines[i]);
        if (i < n - 1 and i < lines.size() - 1) out << '\n';
    }
}

第5類：綜合應用一

501 字串轉換

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;
    cout << s << " change to " << stoi(s);
}

502 數字相乘

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;

    int ans = 1;
    string a = "";

    for (int i = 0; i < s.size(); i++) {
        int digit = s[i] - '0';
        ans *= digit;

        a += s[i];
        if (i != s.size() - 1) {
            a += "*";
        }
    }

    cout << a << '=' << ans;
}

503 區間運算

#include <bits/stdc++.h>
using namespace std;

#define EPS 1e-6

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b;
    cin >> a >> b;

    for (int i = 1; i < a; i++) {
        float s = sqrt(i);
        if (fabs(s - floor(s)) < EPS) cout << int(pow(s, b)) << '\n';
    }
}

504 迴文數

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;
    string a = s;
    reverse(a.begin(), a.end());
    cout << ((s == a) ? "Yes" : "No");
}

505 公式計算

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    float a, b, c, d, e, f;
    cin >> a >> b >> c >> d >> e >> f;
    cout << fixed << setprecision(2) << abs(a) * floor(b) + pow(c, d) * sqrt(e) + log10(f);
}

506 質因數分解

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;

    if (n < 2) {
        cout << -1;
        return 0;
    }
    
    vector<int> fs;
    while (n % 2 == 0) {
        fs.push_back(2);
        n /= 2;
    }

    int f = 3;
    while (f * f <= n) {
        while (n % f == 0) {
            fs.push_back(f);
            n /= f;
        }
        f += 2;
    }

    if (n > 2) fs.push_back(n);
    
    if (fs.size() == 1) cout << -1;
    else {
        for (int i = 0; i < fs.size()-1; i++) cout << fs[i] << '*';
        cout << fs[fs.size()-1];
    }
}

507 猜數字

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;

    for (int i = 0; i < 3; i++) {
        int a = 0, b = 0;
        string g;
        cin >> g;

        for (int j = 0; j < 4; j++) {
            if (s[j] == g[j]) a++;
            else if (count(s.begin(), s.end(), g[j])) b++;
        }

        cout << a << 'A' << b << "B\n";
    }
}

508 二進位運算

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string a, b;
    cin >> a >> b;

    int c = stoi(a, nullptr, 2),
        d = stoi(b, nullptr, 2),
        s = c + d;

    cout << c << " + " << d << " = " << s << '\n';

    if (s > 255) cout << "11111111";
    else {
        string ans = bitset<8>(s).to_string();
        cout << ans;
    }
}

509 字串拆解

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;

    stringstream ss(s);
    string part;

    vector<int> nums;
    int sum = 0;

    while (getline(ss, part, '/')) {
        int x = stoi(part);
        nums.push_back(x);
        sum += x;
    }

    for (int i = 0; i < nums.size(); i++) {
        if (i) cout << ' ';
        cout << nums[i];
    }

    cout << '\n' << sum;
}

510 星號輸出

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int h, w;
    cin >> h >> w;

    vector<vector<int>> m(h, vector<int>(w));

    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            cin >> m[i][j];
        }
    }

    for (int i = 0; i < h; i++) {
        string ans = "";

        for (int j = 0; j < w; j++) {
            if (m[i][j] == 0) ans += ' ';
            else {
                if (i == 0 or j == 0 or i == h - 1 or j == w - 1) ans += '*';
                else {
                    if (m[i - 1][j] == 0 or
                        m[i][j - 1] == 0 or
                        m[i + 1][j] == 0 or
                        m[i][j + 1] == 0) {
                        ans += '*';
                    }
                    else ans += ' ';
                }
            }
        }

        cout << ans << '\n';
    }
}

第6類：綜合應用二

601 大小寫轉換

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    int n;
    cin >> s >> n;
    char &c = s[n];

    if ('a' <= c and c <= 'z') c -= 'a' - 'A';
    else c += 'a' - 'A';

    cout << "The letter that was selected is: " << c << '\n' << s;
}

602 字串拆解

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s, cap, let;
    cin >> s;
    
    for (char c : s) {
        if ('a' <= c and c <= 'z') let.push_back(c);
        else cap.push_back(c);
    }

    cout << cap << '\n' << let << '\n' << cap.size();
}

603 多重迴圈

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m - 1; j++) {
            int x;
            cin >> x;
            cout << x << ',';
        }

        int x;
        cin >> x;
        cout << x << '\n';
    }
}

604 選擇排序

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    multiset<int> s;
    for (int i = 0; i < 9; i++) {
        int x;
        cin >> x;
        s.insert(x);
    }

    for (auto pt : s) cout << pt << '\n';
    cout << "sum = " << accumulate(s.begin(), s.end(), 0);
}

605 差值計算

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int arr[6];
    for (int i = 0; i < 6; i++) cin >> arr[i];
    sort(arr, arr+6);
    cout << (arr[3]+arr[4]+arr[5]) - (arr[0]+arr[1]+arr[2]);
}

606 檢驗學號

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    for (int i = 0; i < 3; i++) {
        string s;
        cin >> s;
        int a = s[0] - '0',
            b = s[1] - '0',
            c = s[2] - '0',
            d = s[3] - '0',
            e = s[4] - '0';
        char f = s[5];

        char check = ((a+c+e)+(b+d)*5 - 1) % 26 + 'A';
        cout << ((check == f) ? "Pass" : "Fail") << '\n';
    }
}

607 撲克排比大小

#include <bits/stdc++.h>
using namespace std;

int value(char c) {
    string cmp = "CDHS";
    return cmp.find(c);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string a, b;
    cin >> a >> b;

    if (a == b) cout << a << " = " << b;
    else if (a[0] == b[0]) {
        int x = stoi(a.substr(1)),
            y = stoi(b.substr(1));
        
        cout << a << ((x > y) ? " > " : " < ") << b;
    } else cout << a << ((value(a[0]) > value(b[0])) ? " > " : " < ") << b;
}

608 棒球計分

假解

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int sum = 0;

    for (int i = 0; i < 10; i++) {
        int x;
        cin >> x;
        sum += x;
    }

    cout << "score = " << sum % 10;
}

▶

假解的定義

假解指的是剛好可以通過測資但不正確的寫法
也就是沒有按題目的邏輯去寫只是剛好系統放的測資用這個程式跑得過
這題假解就是這種情況剛好跑得過這個網站的所有測資但其實根本不是這樣解的
由於我不確定最後TQC+測驗會不會用相同測資因此為求保險建議還是要理解一下真解的概念

真解

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    bool base[3] = {0}; // {一壘, 二壘, 三壘}
    int score = 0;

    for (int i = 0; i < 10; i++) {
        int hit;
        cin >> hit;

        if (hit == 0) continue;
        else if (hit == 1) {
            if (base[2]) score++;

            base[2] = base[1];
            base[1] = base[0];
            base[0] = 1;
        } 
        else if (hit == 2) {
            if (base[2]) score++;
            if (base[1]) score++;

            base[2] = base[0];
            base[1] = 1;
            base[0] = 0;
        } 
        else if (hit == 3) {
            score += base[0] + base[1] + base[2];

            base[0] = 0;
            base[1] = 0;
            base[2] = 1;
        } 
        else {
            score += base[0] + base[1] + base[2] + 1;

            base[0] = 0;
            base[1] = 0;
            base[2] = 0;
        }
    }

    cout << "score = " << score;
}

609 閏年

#include <bits/stdc++.h>
using namespace std;

bool leap(int y) {
    if (y % 400 == 0) return 1;
    if (y % 100 == 0) return 0;
    if (y % 4 == 0) return 1;
    return 0;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int y, m, d;
    cin >> y >> m >> d;
    int days[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

    if (y <= 0 or m < 1 or m > 12) {
        cout << "error";
        return 0;
    }

    if (leap(y)) days[2] = 29;
    

    if (d < 1 or d > days[m]) {
        cout << "error";
        return 0;
    }

    int ans = 0;
    for (int i = 1; i < m; i++) ans += days[i];

    cout << ans + d;
}

610 矩陣乘積

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int m, n;
    cin >> m >> n;

    vector<vector<int>> a(m, vector<int>(n));

    for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++)
            cin >> a[i][j];

    int p, q;
    cin >> p >> q;

    vector<vector<int>> b(p, vector<int>(q));

    for (int i = 0; i < p; i++)
        for (int j = 0; j < q; j++)
            cin >> b[i][j];

    // A 是 m*n，B 是 p*q
    // 矩陣可相乘的條件：n == p
    if (n != p) {
        cout << "error";
        return 0;
    }

    vector<vector<int>> ans(m, vector<int>(q, 0));

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < q; j++) {
            for (int k = 0; k < n; k++) {
                ans[i][j] += a[i][k] * b[k][j];
            }
        }
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < q; j++) {
            if (j) cout << ' ';
            cout << ans[i][j];
        }
        cout << '\n';
    }
}

第7類：綜合應用三

701 海龍公式

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int a, b, c;
    cin >> a >> b >> c;
    float s = (a+b+c) / 2.0;
    cout << fixed << setprecision(2) << sqrt(s * (s-a) * (s-b) * (s-c));
}

702 二進位轉十進位

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    string s;
    cin >> s;
    cout << stoi(s, nullptr, 2);
}

703 找零錢

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;

    if (n >= 50) {
        cout << n / 50 << "*$50 ";
        n %= 50;
    }
    if (n >= 10) {
        cout << n / 10 << "*$10 ";
        n %= 10;
    }
    if (n >= 5) {
        cout << n / 5 << "*$5 ";
        n %= 5;
    }

    cout << n << "*$1";
}

704 過半數

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int t;
    cin >> t;

    unordered_map<int, int> cnt;

    for (int i = 0; i < t; i++) {
        int x;
        cin >> x;
        cnt[x]++;
    }

    for (auto [k, v] : cnt) {
        if (v * 2 > t) {
            cout << k;
            return 0;
        }
    }

    cout << "error";
}

705 庫存函數

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    unordered_map<string, int> ar;

    for (int i = 0; i < 3; i++) {
        string k;
        int v;
        cin >> k >> v;
        ar[k] = v;
    }

    int t = 0;

    for (int i = 0; i < 5; i++) {
        string s;
        cin >> s;
        if (ar.count(s)) t += ar[s];
    }

    cout << t;
}

706 整數檔案讀寫

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    vector<int> arr;

    for (int i = 0; i < 4; i++) {
        int x;
        cin >> x;
        arr.push_back(x);
    }

    ifstream in("read.txt");
    ofstream out("write.txt");

    int x;
    while (in >> x) arr.push_back(x);    

    sort(arr.begin(), arr.end());

    for (int n : arr) out << n << '\n';
}

707 動態記憶體配置

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;

    vector<pair<int, string>> arr;

    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;

        int p = a * b;
        string s = to_string(a) + "x" + to_string(b) + "=";

        arr.push_back({p, s});
    }

    sort(arr.begin(), arr.end());

    for (auto p : arr) cout << p.second << p.first << '\n';
}

708 12小時制時間

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int c = 0;

    for (int i = 0; i < 3; i++) {
        int h, m;
        cin >> h >> m;

        if (h == 0) {
            cout << "AM 12:" << m << '\n';
            c++;
        } else if (h < 12) {
            cout << "AM " << h << ":" << m << '\n';
            c++;
        } else if (h == 12) {
            cout << "PM " << h << ":" << m << '\n';
        } else {
            cout << "PM " << h - 12 << ":" << m << '\n';
        }
    }

    cout << c;
}

709 圓面積計算

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n;
    cin >> n;
    float area = 0;
    int biggest[3] = {0}; // x, y, r

    for (int i = 0; i < n; i++) {
        int x, y, r;
        cin >> x >> y >> r;

        area += r * r * 3.14159;

        if (r > biggest[2]) {
            biggest[0] = x;
            biggest[1] = y;
            biggest[2] = r;
        }
    }

    cout << fixed << setprecision(2) << "Sum = " << area
         << "\nx: " << biggest[0] << ", y: " << biggest[1]
         << "\nradius: " << biggest[2];
}

710 FIFO分頁替換演算法

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int i = 0, arr[4] = {0};

    for (int j = 0; j < 10; j++) {
        int data;
        cin >> data;

        if (find(arr, arr + 4, data) == arr + 4) { // data not in arr
            arr[i] = data;
            i = (i + 1) % 4;
        }

        for (int k = 0; k < 4; k++) cout << arr[k] << ' ';
        cout << '\n';
    }
}

筆記與教學 > 程式 > 競程

#筆記 #程式 #題解 #競程 #TQC+ #Code Judger #C++

TQC+ 題庫「程式語言（第二版）」—— C++ 題解

https://chuen666666.com/TQC-題庫「程式語言（第二版）」——Cpp題解/

作者

淳

發布於

2026-05-10 02:37

更新於

2026-05-17 17:26

許可協議

致理科大全國程式力競賽——心得（和對TQC+的看法）上一篇

TQC+ 題庫「程式語言（第二版）」——Python 題解下一篇