【补题】AcWing暑假每日一题2022

关键概念；

已于 2022-10-07 21:05:28 修改

阅读量388

点赞数 1

分类专栏：算法文章标签： c++ 算法

于 2022-10-06 19:51:50 首次发布

本文链接：https://blog.csdn.net/weixin_45206780/article/details/127186993

版权

算法专栏收录该内容

5 篇文章 0 订阅

订阅专栏

【补题】AcWing暑假每日一题2022

4268. 性感素数

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

int n;

bool is_prime(int x) {
    if (x < 2) return false;
    for (int i = 2; i <= x / i; i++) {
        if (!(x % i)) return false;
    }
    return true;
}

int another() {
    for (int i = n + 1;; i++) {
        if (is_prime(i) && (is_prime(i - 6) || is_prime(i + 6))) {
            return i;
        }
    }
}

int main() {
    cin >> n;
    if (is_prime(n) && (is_prime(n - 6) || is_prime(n + 6))) {
        puts("Yes");
        if (is_prime(n - 6)) {
            cout << n - 6 << endl;
        } else {
            cout << n + 6 << endl;
        }
    } else {
        puts("No");
        cout << another() << endl;
    }
    return 0;
}

4269. 校庆

#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <unordered_map>

using namespace std;
int n, m, cnt;

unordered_map<string, bool> map;


int main() {
    cin >> n;
    string a, ans1, ans2;
    int d = 99999999, d1 = 999999999;
    for (int i = 0; i < n; i++) {
        cin >> a;
        map[a] = true;
    }
    cin >> m;
    for (int i = 0; i < m; i++) {
        cin >> a;
        if (map[a]) {
            cnt++;
            if (d1 > stoi(a.substr(6, 8))) {
                d1 = stoi(a.substr(6, 8));
                ans2 = a;
            }
        }
        if (cnt == 0) {
           if (d > stoi(a.substr(6, 8))) {
                d = stoi(a.substr(6, 8));
                ans1 = a;
            } 
        }
    }
    cout << cnt << endl;
    if (cnt == 0) cout << ans1 << endl;
    else cout << ans2 << endl;
    return 0;
}

4273. 链表合并

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

typedef pair<int, int> PII;

const int N = 100010;

int v[N], ne[N];
int h1, h2, n;

vector<PII> a, b;

int main() {
    cin >> h1 >> h2 >> n;
    while (n--) {
        int a, b, c;
        cin >> a >> b >> c;
        v[a] = b, ne[a] = c;
    }
    for (int i = h1; i != -1; i = ne[i]) a.push_back({i, v[i]});
    for (int i = h2; i != -1; i = ne[i]) b.push_back({i, v[i]});
    
    if (a.size() < b.size()) swap(a, b);
    
    vector<PII> c;
    for (int i = 0, j = b.size() - 1; i < a.size(); i += 2, j--) {
        c.push_back(a[i]);
        if (i + 1 < a.size()) c.push_back(a[i+1]);
        if (j >= 0) c.push_back(b[j]);
    }
    
    for (int i = 0; i < c.size(); i++) {
        printf("%05d %d ", c[i].first, c[i].second);
        if (i + 1 < c.size()) printf("%05d\n", c[i+1].first);
        else puts("-1");
    }
    
    return 0;
}

4274. 后缀表达式

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 30;
int l[N], r[N];
bool f[N];
string v[N];

int n;

void dfs(int root) {
    putchar('(');
    if (l[root] != -1 && r[root] != -1) {
        dfs(l[root]);
        dfs(r[root]);
        cout << v[root];
    } else if (l[root] == -1 && r[root] != -1) {
        cout << v[root];
        dfs(r[root]);
    } else {
        cout << v[root];
    }
    putchar(')');
    return ;
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> v[i] >> l[i] >> r[i];
        if (l[i] != -1) f[l[i]] = true;
        if (r[i] != -1) f[r[i]] = true;
    }
    int root = 1;
    while (f[root]) root++;
    dfs(root);
    return 0;
}