Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Parse the expression

    Given a string s that represents a mathematical expression that consists of numbers and basic operations (+-*/), you are asked to calculate the value of the expression.
    All the numbers are guaranteed to be smaller than 10000 by their absolute value. Using eval is not allowed.

    Input

    The input contains a single line representing s (1 ≤ |s| ≤ 1000).

    Output

    The program should print the resulting value of the expression.

    Examples

    Input
    Output
    -1+4*5
    19
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue