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:
# joisinoお姉ちゃんは、A op B という式の値を計算したいと思っています。
# ここで、A, Bは整数で、op は、+ または - の記号です。
# あなたの仕事は、joisinoお姉ちゃんの代わりにこれを求めるプログラムを作ることです。

# 制約
# 1 ≦ A, B ≦ 1000000000
# op は、+ または - の記号である。

# 標準入力から A op B を取得する
a, op, b = map(str,input().split())

input_a = int(a)
input_b = int(b)

# opに従い、計算して出力する
result = 0
if op == "+":
    result = input_a + input_b
elif op == "-":
    result = input_a - input_b
else:
    result = "Error"

print(result)

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()
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 == "+":
    S = a + b
else:
    S = a - b

print(S)

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

# 処理
if op == '+':
    S = A + B
else:
    S = A - B
# 出力
print(S)

Submission status: Accepted

Solution code:
# A - Addition and Subtraction Easy

# A, op, B の入力を受け取り、演算結果を出力する


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

Submission status: Accepted

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

if op == "+":
    ans = A + B
else:
    ans = A - B

print(ans)

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:
# 入力
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:
s, o, t = input().split()
if o == '+':
    a = int(s) + int(t)
else:
    a = int(s) - int(t)
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

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

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)
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 == "+":
    print(int(a)+c)
else:
    print(a-c)

Submission status: Accepted

Solution code:
# 050a

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

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

print(result)

Submission status: Accepted

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

a = int(l[0])
b = int(l[2])

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

Submission status: Accepted

Solution code:
a_num_str, operator, b_num_str = map(str, input().split())

a_num_int = int(a_num_str)
b_num_int = int(b_num_str)

if operator == "+" :
    sum_a_b = a_num_int + b_num_int
    print(sum_a_b)
elif operator == "-" :
    sum_a_b = a_num_int - b_num_int
    print(sum_a_b)

Submission status: Accepted

Solution code:
#   AtCoder abc050 a
#   ストレッチ課題

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

#   処理
if op == "+":
    answer = int(a) + int(b)
else:
    answer = int(a) - int(b)

#   出力
print(answer)

Submission status: Accepted

Solution code:
# 入力
a, op, b = map(str, input().split())
a = int(a)
b = int(b)

# 処理
if op == '+':
    answer = a + b
elif op == '-':
    answer = a - b

# 出力
print(answer)

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

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

if op == "+":
    print(A + B)
if op == "-":
    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()
print(int(A) + int(B) if op == '+' else int(A) - int(B))

Submission status: Accepted

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

# A,Bにそれぞれの値を代入
A = int(A)
B = int(B)

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

Submission status: Accepted

Solution code:
# AとBに値を、opに"+"か"-"の記号を入力
A,op,B = input().split()
# AとBを整数に変換
A = int(A)
B = int(B)
# 記号が+ならA+B、記号が-ならA-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=="+":
  print(a+c)
else:
  print(a-c)

Submission status: Accepted

Solution code:
a, op, b = input().split()  #=input().split() : a, op, b 入力時はスペースあり
                            #a, op, b　入力時はスペースなし

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

Submission status: Accepted

Solution code:
# A - Addition and Subtraction Easy


# A op B という式の値を計算したい
# op ⇔ + or -

# A op B とstr型で標準入力する
A, op, B = map(str, input().split(maxsplit=3))
# print(A, op, B)

# A B を int型 に変換
A = int(A)
B = int(B)

# op が　+ の場合 A + B
# それ以外の時は   A -B

if op == "+":
    answer = A + B
else:
    answer = A - B

# 結果を出力
print(answer)

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 = eval(input())
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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:
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:
import sys,bisect

from sys  import stdin,stdout

from bisect import bisect_left,bisect_right,bisect,insort,insort_left,insort_right

from math import gcd,ceil,floor,sqrt

from collections import Counter,defaultdict,deque,OrderedDict

from queue import Queue,PriorityQueue

from string import ascii_lowercase


sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 998244353
mod = 10**9+7

def isPrime(n):
    if (n <= 1) :return False
    if (n <= 3) :return True
    if (n%2 == 0 or n%3 == 0):return False
    for i in range(5,ceil(sqrt(n))+1,6):
        if (n%i==0 or n%(i+2)==0):
            return False
    return True

def st():
    return list(stdin.readline().strip())

def inp():
    return int(stdin.readline())

def li():
    return list(map(int,stdin.readline().split()))

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")
    
def DFS(dictionary,vertex,visited):
    visited[vertex]=True
    stack=[vertex]
    print(vertex)
    while stack:
        a=stack.pop()
        for i in dictionary[a]:
            if not visited[i]:
                print(i)
                visited[i]=True
                stack.append(i)


def BFS(dictionary, vertex,visited):
    visited[vertex]=True
    q=deque()
    q.append(vertex)
    while q:
        a=q.popleft()
        for i in dictionary[a]:
            if not visited[i]:
                visited[i]=True
                q.append(i)
                print(i)

                


def soe(limit):
    l=[1]*(limit+1)
    l[0]=0
    l[1]=0
    prime=[]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0
    
    for i in range(2,limit+1):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)
                
def gcd(a,b):
    while b:
        a=a%b
        b,a=a,b
    return a

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r
            
    
def solve():
    s=input().split()
    if s[1]=='+':
        pr(int(s[0])+int(s[2]))
    else:
        pr(int(s[0])-int(s[2]))



for _ in range(1):
    solve()

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())
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:
#!/usr/bin/env python3
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:
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:
l = list(input().split())
a = int(l[0])
b = int(l[2])
if l[1] == "+":
    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=map(str,input().split())
A=int(A)
B=int(B)
if op=="+":
    ans=A+B
elif op=="-":
    ans=A-B
print(ans)

Submission status: Accepted

Solution code:
# 文字で出力する
a_num_str, operator, b_num_str = map(str, input().split())

# a_num_str と b_num_str を 整数にする。
a_num_int = int(a_num_str)
b_num_int = int(b_num_str)

# operator は 「+」「-」の２つがあるので場合わけし計算する。
if operator == '+':
    sum_a_b = a_num_int + b_num_int
    print(sum_a_b)
elif operator == '-':
    sub_a_b = a_num_int - b_num_int
    print(sub_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 = input().split()
if op == '+':
	ans = int(a)+int(b)
else:
	ans = int(a)-int(b)
print(ans)

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

Submission status: Accepted

Solution code:
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:
x = input()
y = x.split(' ')
if y[1] == '+':
  print(int(y[0]) + int(y[2]))
else:
  print(int(y[0]) - int(y[2]))

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

Submission status: Accepted

Solution code:
import sys
s = input()
print(eval(s))

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

Submission status: Accepted

Solution code:
# A - Addition and Subtraction Easy
def main():
    a, op, b = input().split()

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


if __name__ ==  "__main__":
    main()

Submission status: Accepted

Solution code:
new = input()
new_str = new.split(" ")
first = int(new_str[0])
oper = new_str[1]
last = int(new_str[2])
if oper == "+":
  print(first + last)
elif oper == "-":
  print(first - last)

Submission status: Accepted

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

if op == "+":
  print(num1+num2)
else:
  print(num1-num2)

Submission status: Accepted

Solution code:
a = input()
b = a.split()
first = int(b[0])
op = b[1]
second = int(b[2])

if(op == "-"):
  print(first-second)
elif(op == "+"):
  print(first + second)

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#too easy so need some comments
print(eval(input()))

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

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)
if op == '-':
  print(A-B)

Submission status: Accepted

Solution code:
li=input().split()
print(eval(li[0]+li[1]+li[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 = 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=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:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
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
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
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

print(eval(input().replace(",", " ")))

Submission status: Accepted

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

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,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:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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:
lst=list(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:
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,b = int(a), 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:
def resolve():
    A, op, B = input().split()
    if op == "+":
        result = int(A) + int(B)
    elif op == "-":
        result = int(A) - int(B)
    print(result)

resolve()

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():

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

    if op == '+':
        ans = int(A) + int(B)
    
    elif op == '-':
        ans = int(A) - int(B)

    print(ans)


if __name__ == "__main__":
    main()

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(' ')
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:
S = input()
print(eval(S))

Submission status: Accepted

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A, op, B = readline().split()
    A, B = int(A), int(B)
    if op == '+':
        print(A + B)
    else:
        print(A - B)

    return


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

a,b=int(A),int(B)
op=str(OP)

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

Submission status: Accepted

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

Submission status: Accepted

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

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 bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    a, op, b = LSS()
    a = int(a)
    b = int(b)

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

if __name__ == '__main__':
    resolve()

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 = input()
print(eval(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main(a,op,b):
  if op=='+':
    return int(a)+int(b)
  elif op=='-':
    return int(a)-int(b)
 
  
if __name__=='__main__':
  a,op,b=input().split()
  print(main(a,op,b))

Submission status: Accepted

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

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:
A, op, B = input().split()
print(eval(A + op + B))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
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 = input().split()
a,b = int(a),int(b)
if o=='+':
    print(a+b)
else:
    print(a-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:
inputs = list(map(str,input().split()))
a=int(inputs[0])
b=int(inputs[2])
if inputs[1]=="-":
    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,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=map(str,input().split())
a=A+op+B
print(eval(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

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,o,b = list(input().split())

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	print(eval(S()))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

print(eval(s))

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)