【CPE】一顆星選集(Part 5) | C++

TeX Quotes

題目：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=208

中文題目：https://zerojudge.tw/ShowProblem?problemid=c007

#include <iostream>
using namespace std;

string s;
int cnt, blk;

int main() {
    while (getline(cin, s)) {
        for (int i=0; i<s.length(); i++) {
            if (s[i] == '\"') {
                if (cnt % 2 == 0) cout << "``";
                else cout << "''";
                cnt++;
            }
            else cout << s[i];
        }
        cout << "\n";
    }
    return 0;
}​

A - Doom's Day Algorithm

#include <iostream>
using namespace std;
int doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};
string date[] = {"Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"};

int main() {
    int T, m, d;
    cin >> T;
    while (T--) {
        cin >> m >> d;
        int delta = (d - doom[m]) % 7;
        if (delta >= 0) {
            cout << date[delta] << "\n";
        } else {
            cout << date[7 + delta] << "\n";
        }
    }
    return 0;
}

Jolly Jumpers

題目：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=979

中文題目：https://zerojudge.tw/ShowProblem?problemid=d097

#include <iostream>
#include <cstring>
using namespace std;

int main() {
    int n;
    while (cin >> n) {
        int pre, now;
        int d[n];
        for (int i=0; i<n; i++) {
            d[i] = 0;
        }
        cin >> pre;
        for (int i=1; i<n; i++) {
            cin >> now;
            d[abs(now - pre)]++;
            pre = now;
        }
        bool flag = true;
        for (int i=1; i<n; i++) {
            if (d[i] != 1) {
                flag = false;
                break;
            }
        }
        if (flag) cout << "Jolly\n";
        else cout << "Not Jolly\n";
    }
    return 0;
}