Laskutoimitus

input/code.cpp: In function 'int stomodi(std::string)':
input/code.cpp:12:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for (int i = 0; i < s.size(); ++i) {
      |                     ~~^~~~~~~~~~
input/code.cpp: In function 'int laske(std::string)':
input/code.cpp:23:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int i = 0; i < s.size(); ++i) {
      |                         ~~^~~~~~~~~~
input/code.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::__cxx11::basic_string<char> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for (int i = 0; i < l.size(); ++i) {
      |                     ~~^~~~~~~~~~
input/code.cpp:48...

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int mod = 1000000007;

int stomodi(string s) {
    ll ret = 0;
    for (int i = 0; i < s.size(); ++i) {
        ret = ((10 * ret) + (s[i] - '0')) % mod;
    }
    return (int)ret;
}

int laske(string s) {
    vector<vector<string>> l;
    if (1) {
        l.push_back({""});
        string luku;
        for (int i = 0; i < s.size(); ++i) {
            if (s[i] == '+') {
                l.push_back({""});
                continue;
            }
            if (s[i] == '*') {
                l.rbegin()->push_back("");
                continue;
            }
            *l.rbegin()->rbegin() += s[i];
        }
        for (auto& p: l) {
            while (p.size() && p.rbegin()->size() == 0) {
                p.pop_back();
            }
        }
        while (l.size() && l.rbegin()->size() == 0) {
            l.pop_back();
        }
    }

    vector<vector<int>> modl;
    ll res = 0;
    for (int i = 0; i < l.size(); ++i) {
        ll mul = 1;
        for (int j = 0; j < l[i].size(); ++j) {
            mul = (mul * stomodi(l[i][j])) % mod;
        }
        res = (res + mul) % mod;
    }
    return res;
}

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

    string s;
    cin >> s;

    if (s.size() <= 100) {
        ll result = 0;
        for (int a = 0; a < s.size(); ++a) {
            for (int b = a+1; b <= s.size(); ++b) {
                auto t = s.substr(a, b-a);
                if (t[0] == '+' || t[0] == '*' || t[t.size()-1] == '+' || t[t.size()-1] == '*') {
                    continue;
                }
                int tmp = laske(t);
                result = (result + tmp) % mod;
            }
        }
        cout << result << endl;
        return 0;
    }
    return 0;
}

Test 1

Group: 1, 2, 6

Verdict: ACCEPTED

Test 2

Group: 1, 2, 6

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 4

Group: 2, 6

Verdict: WRONG ANSWER

Test 5

Group: 2, 6

Verdict: WRONG ANSWER

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 6

Verdict: WRONG ANSWER

Test 8

Group: 6

Verdict: WRONG ANSWER

Test 9

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 4, 6

Verdict: WRONG ANSWER

Test 11

Group: 4, 6

Verdict: WRONG ANSWER

Test 12

Group: 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 5, 6

Verdict: WRONG ANSWER