金山1022笔试第三题有人100吗？测试案例全通过，结果0

bool isYuan(char c) {
    if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') return true;
    return false;
}
int main() {
    string s;
    cin >> s;
    int n = s.size(), yuan = 0, fu = 0;
    for (int i = 0; i < n; i++) {
        if (isYuan(s[i])) yuan++;
        else fu++;
    }
    if (fu >= yuan + 1) {
        cout << 2 * yuan + 1 << endl;
        return 0;
    }
    else {
        cout << yuan + fu << endl;
        return 0;
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<int>a(n);
    vector<char>ans(n, 'c');
    unordered_map<int, int>valToIndex;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        valToIndex[a[i]] = i;
    }
    sort(a.begin(), a.end());
    int flag = 1;
    char c = 'c';
    for (int i = n - 1; i >= 0; i--) {
        int id = valToIndex[a[i]];
        if (ans[id] != 'c') continue;
        if (flag == 1) c = 'A';
        else if (flag == -1) c = 'B';
        ans[id] = c;
        if (m != 0) {
            for (int j = id + 1, cnt = 0; j < n && cnt < m; j++) {
                if (ans[j] == 'c') {
                    ans[j] = c;
                    cnt++;
                }
            }
            for (int j = id - 1, cnt = 0; j >= 0 && cnt < m; j--) {
                if (ans[j] == 'c') {
                    ans[j] = c;
                    cnt++;
                }
            }
        }
        flag = -flag;
    }
    for (int i = 0; i < n; i++) {
        cout << ans[i];
    }
    return 0;
}

#include <iostream>
using namespace std;
#include <bits/stdc++.h>
using ll = long long;
int M = pow(10, 9) + 7;
int main() {
    ll h, x;
    cin >> h >> x;
    vector<ll>a(h);
    ll ans = 0;
    for (ll i = 0; i < h; i++) {
        cin >> a[i];
        ans += a[i] * pow(x, i + 1);
    }
    cout << ans % M << endl;
    return 0;
}