提出 #65880118

---

ソースコード 拡げる

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;

typedef long long ll;
// typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>,
//             rb_tree_tag, tree_order_statistics_node_update>  ordered_set;
//member functions : order_of_key(k){no_of_ele < k} find_by_order(k){kth ele}

const ll M = 1e9 + 7;
const ll N = 1e5 + 69;
const ll lmax = 2e18;
const ll lmin = -2e18;

string multiplyStrings(string s1, string s2) {
    int n1 = s1.size(), n2 = s2.size();
    if (n1 == 0 || n2 == 0)
        return "0";
    int nn = 1, mm = 1;
    if (s1[0] == '-')
        nn = -1;
    if (s2[0] == '-')
        mm = -1;

    int isNeg = nn * mm;
    vector<int> result(n1 + n2, 0);
    int i1 = 0; 
    int i2 = 0; 
    for (int i = n1 - 1; i >= 0; i--) {
        if (s1[i] == '-')
            continue;
        int carry = 0;
        int n1 = s1[i] - '0';
        i2 = 0;
        for (int j = n2 - 1; j >= 0; j--) {
            if (s2[j] == '-')
                continue;
            int n2 = s2[j] - '0';
            int sum = n1 * n2 + result[i1 + i2] + carry;
            carry = sum / 10;
            result[i1 + i2] = sum % 10;
            i2++;
        }
        if (carry > 0)
            result[i1 + i2] += carry;
        i1++;
    }
    int i = result.size() - 1;
    while (i >= 0 && result[i] == 0)
        i--;
    if (i == -1)
        return "0";
    string s = "";

    while (i >= 0)
    s += to_string(result[i--]);
    if (isNeg == -1)
        s = "-" + s;

    return s;
}

string to_str(long long a) {
    string ans = "";
    while (a > 0) {
        char curr = (a % 10) + '0';
        ans += curr;
        a /= 10;
    }
    reverse(ans.begin(), ans.end());
    return ans;
}

void solve() {
    long long n, k, curr = 1;
    cin >> n >> k;
    vector<long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        string res = multiplyStrings(to_str(curr), to_str(a[i]));
        int limit = res.size();
        if(limit > k) {
            curr = 1;
        } else {
            curr = stoll(res);
        }
    }
    cout << curr;
    return;
}

int main() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("bunny_hopscotch_input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    solve();
    return 0;
}

提出情報

ジャッジ結果