Problem:


Score : 100 points

Problem Statement

Joisino wants to evaluate the formula "A op B".
Here, A and B are integers, and the binary operator op is either + or -.
Your task is to evaluate the formula instead of her.

Constraints

1≦A,B≦10^9

op is either + or -.

Input

The input is given from Standard Input in the following format:

A op B

Output

Evaluate the formula and print the result.

Sample Input 1

1 + 2

Sample Output 1

3

Since 1 + 2 = 3, the output should be 3.

Sample Input 2

5 - 7

Sample Output 2

-2



Sample input:
1 + 2


Sample output:
3

Submission status: Accepted

Solution code:
a,b,c=map(str,input().split())
print(int(a)+int(c) if b=='+' else int(a)-int(c))

Submission status: Accepted

Solution code:
a, c, b = input().split()
a = int(a)
b = int(b)
if c == "+":
    print(a + b)
if c == "-":
    print(a -b)

Submission status: Accepted

Solution code:
a, op, b = input().split()
print(eval(a+op+b))

Submission status: Accepted

Solution code:
s = list(map(str,input().split()))
ans = 0
if s[1]=='+':
  ans = int(s[0])+int(s[2])
else:
  ans = int(s[0])-int(s[2])
print(ans)

Submission status: Accepted

Solution code:
a, op, b = input().split()
if op == "+":
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Submission status: Accepted

Solution code:
a, op, b = input().split()
a = int(a)
b = int(b)

if op == "+":
    print(a + b)
elif op == "-":
    print(a - b)

Submission status: Accepted

Solution code:
o,p,q = map(str, input().split())
a = int(o);b=int(q)
print(a+b if p == "+" else a-b)

Submission status: Accepted

Solution code:
a,s,b = (input().split())
a1 = int(a)
b1 = int(b)
if(s == "+"):
    print(int(a1 + b1))
else:
    print(int(a1 - b1))

Submission status: Accepted

Solution code:
A,op,B = input().split()

a = int(A)
b = int(B)

if op == "+":
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split())

if b == '+':
  print(int(a) + int(c))
else:
  print(int(a) - int(c))

Submission status: Accepted

Solution code:
exec('print(' + input() + ')')

Submission status: Accepted

Solution code:
A,op,B = input().rstrip().split(" ")
if op == "+":
    print(int(A) + int(B))
else:
    print(int(A) - int(B))

Submission status: Accepted

Solution code:
a,op,b=input().split()
a=int(a)
b=int(b)
if op=="+":
  print(a+b)
if op=="-":
  print(a-b)

Submission status: Accepted

Solution code:
ABC = input().split()
A, B, C = int(ABC[0]), str(ABC[1]), int(ABC[2])

if ABC[1] == "+":
    print("{}".format(A+C))
    
elif ABC[1] == "-":
    print("{}".format(A-C))

Submission status: Accepted

Solution code:
A,op,B = list(input().split())
#print(A,op,B)

ans = A + op + B
print(eval(ans)) #eval:式として評価

Submission status: Accepted

Solution code:
A, op, B = map(str, input().split())
C = A + op + B
print(eval(C))

Submission status: Accepted

Solution code:
a,op,b = input().split()
if op == "+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    A, op, B = input().split()

    print(int(A) + int(B)) if op == '+' else print(int(A) - int(B))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a , op , b = input().split()
if op == '+':
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Submission status: Accepted

Solution code:
a, op, b = input().split()
if op == '+':
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Submission status: Accepted

Solution code:
A, op, B = input().split()

a = int(A)
b = int(B)

if (op == "+"):

    c = a + b

else:
    c = a - b

print(c)

Submission status: Accepted

Solution code:
def actual(A, op, B):
    if op == '+':
        return A + B

    return A - B

A, op, B = input().split()
A, B = int(A), int(B)

print(actual(A, op, B))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# evalで文字列を式として評価する

print(eval(input()))

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, x, b = M()
if x == '+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
def main():
    s = input().split(' ')
    if s[1] == '+':
        print(int(s[0]) + int(s[2]))
    else:
        print(int(s[0]) - int(s[2]))
main()

Submission status: Accepted

Solution code:
#                          JAI SHREE RAM

import math; from collections import *
import sys; from functools import reduce

def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())
def getlistofstring(): return list(input().strip().split())
def printxsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")

UGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)

# sys.setrecursionlimit(10**6)
# sys.stdin=open("input.txt","r");sys.stdout=open("output.txt","w")

# for _testcases_ in range(int(input())):
li = getlistofstring()
if li[1] == '+':
    print(int(li[0])+int(li[2]))
else:
    print(int(li[0])-int(li[2]))
'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )
Link may be copy-pasted here if it's taken from other source.
DO NOT PLAGIARISE.
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Submission status: Accepted

Solution code:
a,op,b=input().split();print([int(a)+int(b),int(a)-int(b)][op=='-'])

Submission status: Accepted

Solution code:
siki = input().split()
A = int(siki[0])
B = int(siki[2])

print(A + B if siki[1] == "+" else A - B)

Submission status: Accepted

Solution code:
lst = list(map(str,input().split()))
if lst[1] == '+':
    print(int(lst[0])+int(lst[2]))
else:
    print(int(lst[0])-int(lst[2]))

Submission status: Accepted

Solution code:
exec("print("+input()+")")

Submission status: Accepted

Solution code:
s = list(input().split())

if s[1] == '+':
  print(int(s[0]) + int(s[2]))
else:
  print(int(s[0]) - int(s[2]))

Submission status: Accepted

Solution code:
formula = ''.join(list(input().split()))
print(eval(formula))

Submission status: Accepted

Solution code:
A, op, B = map(str, input().split(' '))

if '+' == op:
    print(int(A) + int(B))
else:
    print(int(A) - int(B))

Submission status: Accepted

Solution code:
t = input().split()
a = int(t[0])
b = int(t[2])

if t[1] == "+":
    c = a + b
    print(c)
else:
    c = a - b
    print(c)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
"""
int #整数
float #小数

#標準入力
a=input()
a,b=map(int,input().split()) #入力は行ごと
#標準出力
print(a)
ptrint("Hello")
#for
for name in fruits: #fruitの頭から操作
    print(name)
#リスト
list0 = [] #リスト生成
list0 = [1,2,3,4] #初期化
list0 = [0]*10 #[0,0,0,0,0,0,0,0,0,0]
list1 = list(map(int, input().split()))　# 複数の入力をリストに入れる
list1 = list1 + [6, 7, 8] #リストの追加
list2.append(34) #リストの追加　最後に（）内が足される
list.insert(3,10) #リストの追加　任意の位置（追加したい位置,追加したい値）
len(list4) #リストの要素数
max(sa) #list saの最小値
list5.count(2) #リスト内の2の数
abs(a) #aの絶対値
max(a,b) min(a,b) #最大値　最小値

extension_1 = []
for i in range(10):
    extension_1.append(i)
extension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

comprehension_1= [i for i in range(10)]
comprehension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
"""
a,b,c= input().split()
a=int(a)
c=int(c)
if b=="+":
    print(a+c)
else:
    print(a-c)

Submission status: Accepted

Solution code:
c=list(input().split())
if c[1] =='+':
  print(int(c[0])+int(c[2]))
else:
  print(int(c[0])-int(c[2]))

Submission status: Accepted

Solution code:
a, op, b = input().split()
if(op == "+"):
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
a,op, b = input().split()

a = int(a)
b = int(b)

if op == "+":
    print(a + b)
else:
    print(a-b)

Submission status: Accepted

Solution code:

import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    fomula = input()
    print(eval(fomula))


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
A,op,B = input().split()

if op == '+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Submission status: Accepted

Solution code:
A,op,B=input().split()
if op=="+":
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Submission status: Accepted

Solution code:
A,op,B=input().split()

if op=='+':
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Submission status: Accepted

Solution code:
a,b,c=input().split()
print(int(a)+int(c) if b=="+" else int(a)-int(c))

Submission status: Accepted

Solution code:
a, op, b = input().split()
a = int(a)
b = int(b)
if op == '+':
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
a,b,c = map(str, input().split())
if (b=="+"):
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

Submission status: Accepted

Solution code:
f = input().replace(' ', '')
print(eval(f))

Submission status: Accepted

Solution code:
A,op,B = input().split()
if op == '+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Submission status: Accepted

Solution code:
a, op, b = input().split()
print(eval(a + op + b))

Submission status: Accepted

Solution code:
a, op, b = input().split()
a = int(a)
b = int(b)

if op == '+':
  print(a+b)
elif op == '-':
  print(a-b)

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc050/tasks/abc050_a
# simulation
A, op, B = input().split()

A = int(A)
B = int(B)

answer = 0
if op == '+':
    answer = A+B
else:
    answer = A-B

print(answer)

Submission status: Accepted

Solution code:
a,o,b=input().split();print(eval(a+o+b))

Submission status: Accepted

Solution code:
A, op, B = input().split()

a = int(A)
b = int(B)

if op == '+':
  print(a + b)
else:
  print(a - b)

Submission status: Accepted

Solution code:
ns=input()
nsl=ns.split(' ')

if nsl[1]=='+':
  print(int(nsl[0])+int(nsl[2]))
else:
  print(int(nsl[0])-int(nsl[2]))

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split())
if(b == "+"):
  print(int(a) + int(c))
else:
  print(int(a) - int(c))

Submission status: Accepted

Solution code:
a, op, b = map(str, input().split())
if op == "+":
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Submission status: Accepted

Solution code:
a  = input().split()
if a[1] == '+':
    print(int(a[0])+int(a[2]))
else:
    print(int(a[0])-int(a[2]))

Submission status: Accepted

Solution code:
A, op, B = list(map(str, input().split()))
if op == "-":
  print(int(A) - int(B))
else:
  print(int(A) + int(B))

Submission status: Accepted

Solution code:
a, op, b = map(str, input().split())
if op=='+': print(int(a)+int(b))
else: print(int(a)-int(b))

Submission status: Accepted

Solution code:
a,op,b=input().split()
if op=='+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
A,pm,B = input().split()

a = int(A)
b = int(B)
if pm == "+":
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
A,op,B=map(str,input().split())

if op=='+':
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Submission status: Accepted

Solution code:
a,op,b=input().split()
a=int(a)
b=int(b)
if op=='+':
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
a, op, b = input().split()
if op == '+':
  print(int(a) + int(b))
else:
  print(int(a) - int(b))

Submission status: Accepted

Solution code:
A, op, B = input().split()
A = int(A)
B = int(B)
if op == '+':
  print(A + B)
else:
  print(A - B)

Submission status: Accepted

Solution code:
a,o,b = input().split()
a = int(a)
b = int(b)
if o == "+":
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
A,op,B = input().split()
A = int(A)
B = int(B)
if op == '+':
    print(A + B)
else:
    print(A - B)

Submission status: Accepted

Solution code:
a,op,b=input().split()
if(op == "+"):
    print(int(a)+int(b))
elif(op == "-"):
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
A, B, C = map(str, input().split())
print(int(A)+int(C) if B=="+" else int(A)-int(C))

Submission status: Accepted

Solution code:
a, op, b = map(str, input().split())
if op == "+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
A,op,B = input().split()

if op == "+":
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Submission status: Accepted

Solution code:
s = input().split()
if s[1] == "+":
    print(int(s[0]) + int(s[2]))
else:
    print(int(s[0]) - int(s[2]))

Submission status: Accepted

Solution code:
l = input()
col = l.split(' ')
a = int(col[0])
op = col[1]
b = int(col[2])

if 1 <= a <= 10 ** 9 and 1 <= b <= 10 ** 9:
  if op == '+':
    print(a + b)
  elif op == '-':
    print(a - b)

Submission status: Accepted

Solution code:
a,op,b=input().split()
if op=='+':
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Submission status: Accepted

Solution code:
a, op, b = input().split()

if op == '+':
    ans = int(a) + int(b)
else:
    ans = int(a) - int(b)

print(ans)

Submission status: Accepted

Solution code:
a, op, b = input().split()
print(int(a)+int(b) if op == '+' else int(a)-int(b))

Submission status: Accepted

Solution code:
A,op,B = map(str,input().split())
if op =="+":
    print(int(A)+int(B))
elif op =="-":
    print(int(A)-int(B))

Submission status: Accepted

Solution code:
inputs = list(input().split())
a, op, b = int(inputs[0]), inputs[1], int(inputs[2])

print(a + b if op == '+' else a - b)

Submission status: Accepted

Solution code:
a, op, b = input().split()
if op == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Submission status: Accepted

Solution code:
a,op,b=input().split()
a=int(a)
b=int(b)
if op=="+":
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
s=input()
a = eval(s)
print(a)

Submission status: Accepted

Solution code:
a, op, b = input().split()

if op == '+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
a,o,b=map(str,input().split())
a=int(a)
b=int(b)
if o == '+':
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,op,b = map(str, input().split())
a = int(a)
b = int(b)
if op == '+':
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
A, op, B = input().split()

if op == '+':
  print(int(A) + int(B))
else:
  print(int(A) - int(B))

Submission status: Accepted

Solution code:
a,b,c=(str(x) for x in input().split())
if b=='+':
    print(int(a)+int(c))
elif b=='-':
    print(int(a)-int(c))

Submission status: Accepted

Solution code:
l = input()
print(eval(l))

Submission status: Accepted

Solution code:

siki=input()
print(eval(siki))

Submission status: Accepted

Solution code:
a,b,c = input().split()
if b == "+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[2])
if x[1] == '+':
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[2])
if x[1] == '+':
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
a, b, c = input().split()
print(int(a) + int(c) if b == "+" else int(a) - int(c))

Submission status: Accepted

Solution code:
a,op,b=input().split()
a=int(a)
b=int(b)
if op=='+':
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
a,o,b=map(str,input().split())
a=int(a)
b=int(b)
if o=='+':
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
a,op,b = input().split()
if op=='+':
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
x,cal,y = input().split()
print(int(x)+int(y) if cal == '+' else int(x)-int(y))

Submission status: Accepted

Solution code:
a = list(input().split())
if a[1]=='+':
  print(int(a[0]) + int(a[2]))
else:
  print(int(a[0]) - int(a[2]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, op, b = input().split()
    print(eval(a+op+b))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x, y, z = input().split()
if y == "+":
    print(int(x)+int(z))
else:
    print(int(x)-int(z))

Submission status: Accepted

Solution code:
a,b,c=[int(i)if i.isdigit() else i for i in input().split()]
print(a+c if b=="+" else a-c)

Submission status: Accepted

Solution code:
from sys import stdin
def LS(): return list(stdin.readline().rstrip().split())

l = LS()
ans = 0
if l[1] == '+':
    ans = int(l[0])+int(l[2])
else:
    ans = int(l[0])-int(l[2])
    
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    print(eval(input().replace(' ','')))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

a, op,  b = map(str, input().split())
if op =="+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
A, op, B = input().split()
print(eval(A+op+B))

Submission status: Accepted

Solution code:
a, b, c = input().split()

a = int(a)
c = int(c)

if b == "+":
    print(a + c)
else:
    print(a - c)

Submission status: Accepted

Solution code:
a,op,b=input().split()
print(eval(a+op+b))

Submission status: Accepted

Solution code:
a, op, b = input().split()

a = int(a)
b = int(b)

if op == '+':
    print(a + b)
else:
    print(a - b)

Submission status: Accepted

Solution code:
a,op,b = map(str, input().split())
a = int(a)
b = int(b)
if op == '+':
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
A,op,B=map(str,input().split())
if op=="+":
    print (int(A)+int(B))
else:
    print (int(A)-int(B))

Submission status: Accepted

Solution code:
A,op,B = input().split()
if op=='+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Submission status: Accepted

Solution code:
A,op,B=input().split()
if op=="+":
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Submission status: Accepted

Solution code:
A, op , B = map(str, input().split())
print(eval(A + op + B))

Submission status: Accepted

Solution code:
a,op,b=input().split()
a=int(a)
b=int(b)

if op=="+":
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
# a, op, b = input().split()
# a = int(a)
# b = int(b)
# if op == '+':
#     print(a + b)
# else:
#     print(a - b)

print(eval(input()))

Submission status: Accepted

Solution code:
A,op,B = input().split()
A = int(A)
B = int(B)
if op =="+":
  print(A+B)
else:
  print(A-B)

Submission status: Accepted

Solution code:
def main():
 str =input().split()
 if str[1] =='+' :
  print(int(str[0])+int(str[2]))
 else :
  print(int(str[0])-int(str[2]))
  
main()

Submission status: Accepted

Solution code:
A, op, B = input().split()
A = int(A)
B = int(B)
if op == "-":
    print(A-B)
else:
    print(A+B)

Submission status: Accepted

Solution code:
n = input().split()
if(n[1] == "+"): print(int(n[0]) + int(n[2]))
else: print(int(n[0]) - int(n[2]))

Submission status: Accepted

Solution code:
argList = input().split()

if argList[1] == '+':
    print(str(int(argList[0])+int(argList[2])))
elif argList[1] == '-':
    print(str(int(argList[0])-int(argList[2])))

Submission status: Accepted

Solution code:
A,op,B =map(str,input().split())
if op == '+':
    print(int(A)+int(B))
elif op =='-':
    print(int(A)-int(B))

Submission status: Accepted

Solution code:
A, op, B = input().split()
if op == '+':
    print(int(A) + int(B))
elif op == '-':
    print(int(A) - int(B))

Submission status: Accepted

Solution code:
A, Op, B = map(str, input().split())

def Main(A, Op, B):
    a = int(A)
    b = int(B)
    if Op == "+":
        return a+b
    if Op == '-':
        return a-b

print(Main(A, Op, B))

Submission status: Accepted

Solution code:
def main():
    AopB = input()
    ans = eval(AopB)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,s,b=input().split()
a,b=map(int,[a,b])
if s=="+":
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
a, op, b = input().split()
a, b = int(a), int(b)

if op == '+':
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
a, op, b = input().split()
a = int(a)
b = int(b)

[print(a+b) if op == '+' else print(a-b)]

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

s = inputSL()

if s[1]=="+":
  print(int(s[0])+int(s[2]))
else:
  print(int(s[0])-int(s[2]))

Submission status: Accepted

Solution code:
a, op, b = input().split()

print(eval(a+op+b))

Submission status: Accepted

Solution code:
A,B,C=map(str,input().split())
if B=="+":
  print(int(A)+int(C))
else:
  print(int(A)-int(C))

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    a, op, b = input().split()
    a = int(a)
    b = int(b)
    if op == '+':
        print(a + b)
    else:
        print(a - b)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, op, B = map(str, input().split())
print(int(A) + int(op + B))

Submission status: Accepted

Solution code:
A, op, B = input().split()

A = int(A)
B = int(B)

if op == '+':
  print(A + B)
else:
  print(A - B)

Submission status: Accepted

Solution code:
a,o,b = input().split()
a = int(a)
b = int(b)
print(a+b if o=='+' else a-b)

Submission status: Accepted

Solution code:
a,b,c=map(str,input().split())
if b=="+":
    print(int(a)+int(c))
else:
    print(int(a)-int(c))

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

a,op,b = input().split()
a = int(a)
b = int(b)
if op == "+":
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
a,op,b=map(str,input().split())
if op=="+":
  print(int(a)+int(b))
else:
  print(int(a)-int(b))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(str, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
import numpy as np

a = input()
print(eval(a))

Submission status: Accepted

Solution code:
s,t,u = input().split()
a = int(s)
b = int(u)
if t == '+': print(a+b)
elif t == '-': print(a-b)

Submission status: Accepted

Solution code:
A, op, B = input().split()
if op == '+':
    print(int(A) + int(B))
else:
    print(int(A) - int(B))

Submission status: Accepted

Solution code:
a,op,b = input().split()
if op == "+":
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Submission status: Accepted

Solution code:
calc = list(map(str,input().split()))
if calc[1] == '+':
    print(int(calc[0])+int(calc[2]))
else:
    print(int(calc[0])-int(calc[2]))

Submission status: Accepted

Solution code:
input_string = input().split()
num1 = int(input_string[0])
num2 = int(input_string[2])
operater = input_string[1]

result = 0
if operater == "+":
    result = num1 + num2
elif operater == "-":
    result = num1 - num2

print(result)

Submission status: Accepted

Solution code:
a,b,c=input().split()
a=int(a)
c=int(c)
if b=="+":
    print(a+c)
else:
    print(a-c)

Submission status: Accepted

Solution code:
A = list(input().split())
if A[1] == "-":
    print(int(A[0])-int(A[2]))
else:
    print(int(A[0])+int(A[2]))

Submission status: Accepted

Solution code:
def main():
    a,op,b = (x for x in input().split())
    if op == '+': print(int(a)+int(b))
    else: print(int(a)-int(b))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
print(eval(input().replace(" ","")))

Submission status: Accepted

Solution code:
a, b, c = input().split()
if b == '+':
  print(int(a) + int(c))
else:
  print(int(a) - int(c))

Submission status: Accepted

Solution code:
a, op, b = input().split()

if op is '+':
    print(int(a)+int(b))
elif op is '-':
    print(int(a)-int(b))

Submission status: Accepted

Solution code:
A, op, B = input().split()
if op == '+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Submission status: Accepted

Solution code:
A, B, C = input().split()
if B == '+':
    print(int(A) + int(C))
else:
    print(int(A) - int(C))

Submission status: Accepted

Solution code:
A,op,B=input().split()

if op=='+':
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Submission status: Accepted

Solution code:
a, op, b = map(str, input().split())
a = int(a)
b = int(b)
if op == "+":
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

a, op, b = input().split()

if op == "+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))