Submission #2586714

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
using ll = long long;
using pii = pair<int,int>;
/*
 
 <expr> ::= number | "("<expr>","<expr>")" | "("<expr>"*"<expr>")"
 <number> ::= <digit> | <number><digit>
 <digit> ::= "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9"
 
 
 */


ll mod = 998244353;
string s;
int pos = 0;
struct A{
    ll x,y;
    bool f;
    A(ll a,ll b){
        x = a;
        y = b;
        f = true;
    }
    A(ll a){
        x = a;
        y = 0;
        f = false;
    }
};
A operator*(A &X,A &Y){
    if(X.f == Y.f){
        return A((X.x*Y.x+X.y*Y.y)%mod);
    }else{
        if(X.f){
            return A((X.x*Y.x)%mod,(X.y*Y.x)%mod);
        }else{
            return A((Y.x*X.x)%mod,(Y.y*X.x)%mod);
        }
        
    }
}
A number(){
    ll res = 0;
    while(isdigit(s[pos])){
        res *= 10;
        res += s[pos] -'0';
        res %= mod;
        pos++;
    }
    return A(res);
}
A cal(){
    if(isdigit(s[pos])){
        return number();
    }
    assert(s[pos] == '(');
    pos++;
    A a = cal();
    char op = s[pos];
    pos++;
    A b = cal();
    assert(s[pos] == ')');
    pos++;
    if(op == ','){
        assert(!a.f and !b.f);
        return A(a.x,b.x);
    }else{
        assert(op == '*');
        return a*b;
    }
}
int main(){
    cin >> s;
    A ans = cal();
    cout << ans.x << endl;
}

Submission Info

Judge Result