Educational Codeforces Round 66

B题 一道模拟 写了一个小时没写对
直接在线做就可以了

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cstdlib>
#include<string.h>
#include<iomanip>
#define ll long long
#define Max(a,b) ((a) > (b) ? (a) : (b))
#define INF 0x3f3f3f3f
const int mod = 1e9+7;
const int maxn = 1e5 + 10 ;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);} 
using namespace std;
const ll MAXV = (1ll<<32);

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

    int n;
    cin >> n;

    ll res = 0;
    vector<ll> stack;
    stack.push_back(1);
    for (int i = 0; i < n; ++i) {
        string str;
        cin >> str;         
        if (str == "add") {
            res += stack.back();
        } else if (str == "for") {
            ll k;
            cin >> k;
            stack.push_back(min(MAXV, k*stack.back()));
        } else if (str == "end") {
            stack.pop_back();
        }
    }
    if (res >= MAXV) cout << "OVERFLOW!!!\n";
    else cout << res << '\n';
    return 0;
 }