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:
#Addition and Subtraction Easy
def ABC_50_A():
    A,B,C = map(str, input().split())

    if B[0] == '+':
        print(int(A)+int(C))
    else:
        print(int(A)-int(C))


if __name__ == '__main__':

    ABC_50_A()

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 = input().split()
A = int(A)
B = int(B)

if op=="+":
  Sum = A + B
elif op=="-":
  Sum = A - B

print(Sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,o,b=input().split()
print(int(a)+int(b) if o=="+" else 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 = 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:
s=input().split();print(int(s[0])+int(s[2]) if s[1]=='+' else int(s[0])-int(s[2]))

Submission status: Accepted

Solution code:
n,x,m=input().split()



if x=='+':
    print(int(n)+int(m))

if x=='-':
    print(int(n)-int(m))

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)
elif op =="-":
  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:
s=input().split()
print(int(s[0])+int(s[2]))if s[1]=="+"else print(int(s[0])-int(s[2]))

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)

Submission status: Accepted

Solution code:
s = input().split()
a = int(s[0])
b = int(s[2])
if s[1] == "+":
    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,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,o,b=input().split()
if o=="+":
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

Solution code:

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


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
a,o,b=input().split()
if o=='+':
    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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020-04-29
a, c, b = map(str, input().split())
a = int(a)
b = int(b)
if c == '+':
    print(a + b)
elif c == '-':
    print(a - b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

u=input().rstrip().split(" ")
a=int(u[0])
b=int(u[2])
if u[1]=="+":
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

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

Submission status: Accepted

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

print(eval("".join(S)))

Submission status: Accepted

Solution code:
a,op,b = input().split()
a = int(a)
b = int(b)
print(a+b if op=='+' else a-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:
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 = 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,C= input().split()

if op =="+":
    res = int(A)+int(C)

elif op =="-":
    res = int(A)-int(C)
    
print(res)

Submission status: Accepted

Solution code:
inp = input().split()
a=int(inp[0])
b=int(inp[2])
if inp[1]=='+':
  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:
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))
elif b=="-":
    print(int(a)-int(c))

Submission status: Accepted

Solution code:
a=[i for i in 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,b,c = input().split()
A=int(a)
B=int(c)
if b=='+':
  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:
a,b,c = input().split()
if str(b) == '+':
  print(int(a)+int(c))
else:
  print(int(a)-int(c))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    print(eval(iss()))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,OP,B = map(str,input().split())
AA = int(A)
BB = int(B)
if OP == '+':
  print(AA + BB)
else:
  print(AA - BB)

Submission status: Accepted

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

Submission status: Accepted

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

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,b=int(a),int(b)

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

Submission status: Accepted

Solution code:
def ope(ope, a, b):
    if ope == '+':
        return a+b
    
    elif ope == '-':
        return a-b

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

print(ope(op, int(a), int(b)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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,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()

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()
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:
a,b,c=input().split()
print (int(a) + int(c) if b =="+" else int(a)-int(c))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, op, b = input().split()
if op == '+':
    print(int(a) + int(b))
if op == '-':
    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:
# https://atcoder.jp/contests/abc050/tasks/abc050_a
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()
a1=int(a)
b1=int(c)
if b== "+":
    print(a1+b1)
else:
    print(a1-b1)

Submission status: Accepted

Solution code:
a,x,b=map(str,input().split())
if x=="+":
    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:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

p = nas()
a = int(p[0])
b = int(p[2])
if p[1] == '+':
    print(a + b)
else:
    print(a - b)

Submission status: Accepted

Solution code:
a, op, b = map(str, 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:
a,b,c = input().split()
if b == '+':
    print(int(a) + int(c))
else:
    print(int(a) - int(c))

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:
l=input().split()
print(int(l[0])+int(l[2]) if l[1] == '+' else int(l[0])-int(l[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:
icase=0
if icase==0:
    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:
x = [str(e) for e in input().split()]
if(x[1] == '+'):
  ans = int(x[0]) + int(x[2])
else:
  ans = int(x[0]) - int(x[2])
print(ans)

Submission status: Accepted

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

    if op == "+":
        print(A+B)
    elif op == "-":
        print(A-B)
main()

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()

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

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

Submission status: Accepted

Solution code:
a, b, c = input().split()
aa = int(a)
bb = str(b)
cc = int(c)

if bb == "+":
  print(aa + cc)

else: 
    print(aa - cc)

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 = 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:
import sys
input = sys.stdin.readline

AopB = input()
print(eval(AopB))

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 = input().split()
a = int(a)
c = int(c)

if b == '+':
    result = a + c
else:
    result = a - c

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    S = input().split()
    A = int(S[0])
    op = S[1]
    B = int(S[2])
    if op == "+":
        print(A + B)
    else:
        print(A - B)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c=list(map(str, 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(' ')
inta = int(a)
intb = int(b)

print((inta + intb) if (op == '+') else (inta - intb))

Submission status: Accepted

Solution code:
i = list(input().split())
if i[1] == '+':
    ans = int(i[0]) + int(i[2])
else:
    ans = int(i[0]) - int(i[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,b,c=input().split()
a=int(a)
c=int(c)
if b=="+":
  print(a+c)
else:print(a-c)

Submission status: Accepted

Solution code:
# coding: utf-8
ans = input().split()
if ans[1] == '+':
    print(int(ans[0]) + int(ans[2]))
else:
    print(int(ans[0]) - int(ans[2]))

Submission status: Accepted

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

Submission status: Accepted

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

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]))
elif a[1]=='-':
  print(int(a[0])-int(a[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()

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,b = int(a),int(b)
if op == '+':
  print(a+b)
else:
  print(a-b)

Submission status: Accepted

Solution code:
# ABC50_A

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 numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

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

    if op == '+':
        res = A + B
    else:
        res = A - B

    print(res)



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 = map(str,input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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,b,c =  input().split()
if b == "+":
    print(int(a) + int(c))
else:
    print(int(a) - int(c))

Submission status: Accepted

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

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:
n = list(map(str, input().split()))
a, b = int(n[0]),int(n[2])
if n[1]=='+':
  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=((x) for x in input().split())
if B == "+":
    n = int(A) + int(C)
    print(n)
elif B == "-":
    n = int(A) - int(C)
    print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = input().split()
if B == "+":
    n = int(A) + int(C)
    print(n)
elif B == "-":
    n = int(A) - int(C)
    print(n)

Submission status: Accepted

Solution code:
A,B,C = input().split()
if B is "+":
    n = int(A) + int(C)
    print(n)
elif B is "-":
    n = int(A) - int(C)
    print(n)

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

formula = sys.stdin.readline().rstrip()

def main():
    print(eval(formula))

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 050: A – Addition and Subtraction Easy
parts = [s for s in input().split()]
print(int(parts[0]) + int(parts[2]) if parts[1] == '+' else int(parts[0]) - int(parts[2]))

Submission status: Accepted

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

if line[1] == '+':
    print(a+b)
else:
    print(a-b)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    s=SI()
    s.replace(" ","")
    print(eval(s))

main()

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

a,op,b = ism()
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)
print(A+B if op=='+' 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:

a,b,c = map(str,input().split())
a = int(a)
c = int(c)

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

Submission status: Accepted

Solution code:
value = str(input())
data = value.split()
if(data[1] == "+"):
    m = int(data[0]) + int(data[2])
elif(data[1] == "-"):
    m = int(data[0]) - int(data[2])
print(m)

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,op,b = input().split(" ")
if(op=='+'):
    print(int(a)+int(b))
else:
    print(int(a)-int(b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a,b, c = map(str ,input().split())
    ans = 0
    if b == "+":
        ans = int(a)+int(c)
    else:
        ans = int(a)-int(c)

    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# A - Addition and Subtraction Easy
# 標準入力の取得
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:
a, op, b = map(str,input().split())
print(eval(a + op + 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:
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())
if op=="+":
  print(int(A)+int(B))
else:
  print(int(A)-int(B))

Submission status: Accepted

Solution code:
a,b,c=map(str,input().split())
a=int(a)
c=int(c)
print(a+c if (b=="+") else a-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 = input().split()
A = int(A)
op = str(op)
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,o,b = [x for x in input().split()]

if o == "+":
    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())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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:
a=list(map(str,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=input().split()

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

Submission status: Accepted

Solution code:
x,y,z=list(map(str, input().split()))
x=int(x)
z=int(z)
if y=='+':
	print(x+z)
else:
	print(x-z)

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=raw_input().split()
if op=="+":
  print int(a)+int(b)
else:
  print int(a)-int(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#050_A
print(eval(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
for i in range(len(a)):
	if a[i]=='+':
		a1=int(a[:i])
		a2=int(a[i+1:])
		print(a1+a2)
	elif a[i]=='-':
		a1=int(a[:i])
		a2=int(a[i+1:])
		print(a1-a2)

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, b = map(int, (a, b))

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

Submission status: Accepted

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

S = input().strip()
#-----

print(eval(S))

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:
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:
#ABC050.A
A,op,B = input().split()
if op =='+':
    print(int(A)+int(B))
else:
    print(int(A)-int(B))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    a,op,b=input().split()
    if op=="+":
        print(int(a)+int(b))
    else:
        print(int(a)-int(b))

main()

Submission status: Accepted

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

Submission status: Accepted

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

op = AopB[1]

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

Submission status: Accepted

Solution code:
l=input().split()
a=int(l[0])
x=l[1]
b=int(l[2])
if(x=='+'):
    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:
#abc050 a 
x=list(input().split())
if x[1]=="+":
    print(int(x[0])+int(x[2]))
else:
    print(int(x[0])-int(x[2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, op, b = [i for i in input().split()]

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

Submission status: Accepted

Solution code:
a,op,b = str(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()
d = int(a) + int(c)
e = int(a) - int(c)
if b == '+':
    print(d)
elif b == '-':
    print(e)

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())
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))
elif op == "-":
  print(int(a)-int(b))

Submission status: Accepted

Solution code:
S=input().split(" ")

if S[1] == "+":
    print(int(S[0]) + int(S[2]))
elif S[1] == "-":
    print(int(S[0]) - int(S[2]))