CF1175B.Catch Overflow!

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given a function ff written in some basic language. The function accepts an integer value, which is immediately written into some variable xx . xx is an integer variable and can be assigned values from 00 to 23212^{32}-1 . The function contains three types of commands:

  • for nn — for loop;
  • end — every command between "for nn " and corresponding "end" is executed nn times;
  • add — adds 1 to xx .

After the execution of these commands, value of xx is returned.

Every "for nn " is matched with "end", thus the function is guaranteed to be valid. "for nn " can be immediately followed by "end"."add" command can be outside of any for loops.

Notice that "add" commands might overflow the value of xx ! It means that the value of xx becomes greater than 23212^{32}-1 after some "add" command.

Now you run f(0)f(0) and wonder if the resulting value of xx is correct or some overflow made it incorrect.

If overflow happened then output "OVERFLOW!!!", otherwise print the resulting value of xx .

输入格式

The first line contains a single integer ll ( 1l1051 \le l \le 10^5 ) — the number of lines in the function.

Each of the next ll lines contains a single command of one of three types:

  • for nn ( 1n1001 \le n \le 100 ) — for loop;
  • end — every command between "for nn " and corresponding "end" is executed nn times;
  • add — adds 1 to xx .

输出格式

If overflow happened during execution of f(0)f(0) , then output "OVERFLOW!!!", otherwise print the resulting value of xx .

输入输出样例

  • 输入#1

    9
    add
    for 43
    end
    for 10
    for 15
    add
    end
    add
    end
    

    输出#1

    161
    
  • 输入#2

    2
    for 62
    end
    

    输出#2

    0
    
  • 输入#3

    11
    for 100
    for 100
    for 100
    for 100
    for 100
    add
    end
    end
    end
    end
    end
    

    输出#3

    OVERFLOW!!!
    

说明/提示

In the first example the first "add" is executed 1 time, the second "add" is executed 150 times and the last "add" is executed 10 times. Note that "for nn " can be immediately followed by "end" and that "add" can be outside of any for loops.

In the second example there are no commands "add", thus the returning value is 0.

In the third example "add" command is executed too many times, which causes xx to go over 23212^{32}-1 .

首页