A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?


-----Input-----

The input contains two integers a and b (0 ≤ a, b ≤ 10^3), separated by a single space.


-----Output-----

Output the sum of the given integers.


-----Examples-----
Input
5 14

Output
19

Input
381 492

Output
873

Source: codeforces | Difficulty: MEDIUM
Tags: Spanning trees

Complete search

Implementation

Constructive algorithms


Solutions:
print(sum(map(int, input().split())))


(a, b) = map(int, input().split())
print(a + b)


def iinput(string=''):
	print(string, end='')
	return int(input())

def dbg(*vartuple):
	return
	print('DBG:', *vartuple)
print(sum(map(int, input().split())))


print(sum([int(x) for x in input().strip().split()]))


(a, b) = map(int, input().split())
x = 3
print(str(a + b))


print(sum([int(i) for i in input().split()]))


(A, B) = map(int, input().split())
print(A + B - 0 - 0)


res = list(map(int, input().split()))
d = sum(res)
print(str(d))


(c, d) = map(int, input().split(' '))
print(c + d)


a = list(map(int, input().split()))
print(a[0] + a[1])
b = 0
c = 0
d = 0
h = 0
e = 0


numbers = input().strip().split()
print(int(numbers[0]) + int(numbers[1]))


(c, dd) = map(int, input().split(' '))
print(c + dd)


(a, q) = map(int, input().split())
print(a + q)


print(sum(list(map(int, input().split()))) - 0 + 0)


(a, b) = [int(i) for i in input().split()]
print(a + b + 0 + 0 + 0 + 0 + 0)


class InputHandlerObject(object):
	inputs = []

	def getInput(self, n=0):
		res = ''
		inputs = self.inputs
		if not inputs:
			inputs.extend(input().split(' '))
		if n == 0:
			res = inputs[:]
			inputs[:] = []
		while n > len(inputs):
			inputs.extend(input().split(' '))
		if n > 0:
			res = inputs[:n]
			inputs[:n] = []
		return res
InputHandler = InputHandlerObject()
g = InputHandler.getInput
(a, b) = g()
print(int(a) + int(b))


(m, n) = map(int, input().split())
print(m + n)


s = input().split()
a = int(s[0])
b = int(s[1])
print(a + b)


nums = input().split(' ')
print(int(nums[0]) + int(nums[1]))


a = list(map(int, input().split()))
x = a[0] + a[1]
print(x)


print(sum(map(int, input().split())))
x = 3


(d, a) = map(int, input().split())
print(d + a)


i = 0
i += 2
j = i + 1
a = list(map(str, input().split()))
a.insert(1, '+')
print(eval(''.join(a)))


import math as m
(a, b) = map(int, input().split())
print(a + b)


inp = input().split(' ')
l = []
a = int(inp[0])
b = int(inp[1])
k = 0
l = []
int(k)
for i in inp:
	l = i.split(' ')
m = a + b
print(m)


(As, b) = map(int, input().split())
print(As + b)


import math
s = input()
c = 0
arr = [int(x) for x in s.split()]
for i in arr:
	c = c + i
print(c)


(c, b) = map(int, input().split())
print(c + b)


(salam, b) = map(int, input().split())
print(salam + b)


(a, b) = list(map(int, input().split(' ')[:2]))
print(a + b)


s = input().split()
print(int(s[0]) + int(s[1]))


print(sum([int(z) for z in input().split()]))
while 0:
	res = 1


a = input().split()
(a, b) = (int(a[0]), int(a[1]))
print(str(a + b + 0))


nums = input().split()
sums = int(nums[1]) + int(nums[0])
print(str(sums) + ' ')


d = 'Pleaaase'
e = ':{'
(a, b) = map(int, input().split())
c = a * b
print(a + b)


from math import ceil

def mod_expo(n, p, m):
	result = 1
	while p != 0:
		if p % 2 == 1:
			result = result * n % m
		p //= 2
		n = n * n % m
	return result

def find_product(n, m, arr):
	product = 1
	if n <= m:
		for i in range(n):
			for j in range(i + 1, n):
				product = product * abs(arr[i] - arr[j]) % m
		return product
	return 0

def count_tables(l):
	count = 0
	l.sort()
	a = l[1] - l[0]
	b = l[2] - l[0]
	if a % 3 > 0 and a % 3 + (b - (a - a % 3)) >= 3:
		count += 1
	count += l[0] + 2 * a // 3
	return int(min(sum(l) / 3, l[0] + l[1]))

def no_vacancy(n, arr):
	hotel = {}
	for i in range(n):
		room = (i + arr[i]) % n
		if room in hotel:
			return False
		else:
			hotel[room] = 1
	return True
t = 1
while t:
	t = t - 1
	(a, b) = map(int, input().split())
	print(a + b)


(aa, bb) = map(int, input().split(' '))
print(sum([aa, bb]))


def get_arr(Len):
	buff = input().split()
	a = []
	for i in range(Len):
		a.append(int(buff[i]))
	return a
a = get_arr(2)
if a[0] == 0:
	print(a[1])
if a[1] == 0:
	print(a[0])
print(2 * a[0] * a[1] - (a[0] - 1) * a[1] - (a[1] - 1) * a[0])


__author__ = 'Utena'
(a, b) = map(int, input().split())
print('%d' % (a + b))


(a, b) = input().strip().split()
a = int(a)
b = int(b)
print(a + b)


(a, b) = input().split()
a = int(a)
b = int(b)
print(abs(a) + abs(b))


(m, n) = input().split()
n = int(n)
m = int(m)
k = m + n
print(3 * k - 2 * k)


(x, y) = map(int, input().split())
print(x + y)


(a, b) = input().split()
(a, b) = (int(a), int(b))
sum = a + b
print(sum)


print(eval(input().replace(*' +')))


import time
(a, b) = map(int, input().split())
print(a + b)


(i_hate_aubrey, i_hate_aubrey_so_much) = map(int, input().split())
print(i_hate_aubrey + i_hate_aubrey_so_much, end='')


__author__ = '78277'
rdl = list(map(int, input().split()))
(a, b) = rdl
print(a + b)


str = input().split(' ')
print(int(str[0]) + int(str[1]))


import sys
print(sum(list(map(int, sys.stdin.readline().split()))))


(a, b) = list(map(int, input().split()))
print((a + b) % 2000)


(a, b) = map(int, input().split())
x = 0
y = 0
z = 0
t = 0
v = 0
print(a + b)


from collections import defaultdict, Counter
from math import sqrt, log10, log2, log, gcd, floor, factorial
from bisect import bisect_left, bisect_right
from itertools import combinations, combinations_with_replacement
import sys, io, os
input = sys.stdin.readline
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
mod = 10 ** 9 + 7
inf = float('inf')

def get_list():
	return [int(i) for i in input().split()]
yn = lambda a: print('YES' if a else 'NO')
ceil = lambda a, b: (a + b - 1) // b
t = 1
for i in range(t):
	(a, b) = get_list()
	print(a + b)


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


(a, b) = [int(x) for x in input().split()]
print(a + b)


(a, b) = [int(aaa) for aaa in input().split()]
s4 = a + b
print(s4)


(a, e) = map(int, input().split())
print(a + e)


(e, f) = [int(i) for i in input().split()]
print(e + f)


(vaay, b) = map(int, input().split())
print(vaay + b)


(a, b) = map(int, input().split())
print(a + b)
f = 5


res = list(map(int, input().split()))
print(sum(res))


sex = input().split(' ')
a = int(sex[0])
b = int(sex[1])
print(a + b)


a = input().split()
print(int(a[0]) + int(a[1]))


(i_hate_aubrey, i_hate_so_much_aubrey) = map(int, input().split())
print(i_hate_aubrey + i_hate_so_much_aubrey, end='')


from decimal import Decimal
a = list(map(int, input().split()))
print(sum(a))


(e, f) = map(int, input().split(' '))
print(e + f)


print(sum((int(a) for a in input().split())))


import sys
(a, b) = list(map(int, sys.stdin.read().strip().split()))
sys.stdout.write(str(a + b))


def ii():
	return int(input())

def fi():
	return float(input())

def si():
	return input()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
g = 0
(a, b) = mi()
print(a + b)


a = input()
(a, b) = a.split(' ', 2)
(a, b) = (int(a), int(b))
print(a + b)


a = [int(i) for i in input().split(' ')]
print(sum(a) + 0)


inp = input().split()
a = int(inp[0])
b = int(inp[1])
print(b + a)


(f, g) = map(int, input().split())
print(f + g)


a = [int(x) for x in input().strip().split(' ')]
print(a[0] + a[1])


x = input().split()
print(int(x[0]) + int(x[1]))


(a, b2014) = map(int, input().split())
print(a + b2014)


in1 = input().split(' ')
a = int(in1[0])
b = int(in1[1])
print(a + b)


from sys import stdin, stdout

def main():
	inp = [int(i) for i in input().split(' ')]
	print(inp[0] + inp[1])
main()


(ye, do2) = map(int, input().split())
print(ye + do2)


(a, b) = (0, 0)
(a, b) = (1, 1)
(a, b) = (0, 0)
(a, b) = (1, 1)
(a, b) = map(int, input().split())
print(a + b)


(a, b) = list(map(int, input().split()))
print(a + b & 2047)


data = input().split()
(a, b) = (int(data[0]), int(data[1]))
print(a + b, end='')


print(str(sum(list(map(int, input().split())))))


import sys
import math
import collections
import heapq
import decimal
input = sys.stdin.readline
(a5, b5) = (int(i) for i in input().split())
print(a5 + b5)


a = 1
(a, b) = map(int, input().split())
print(str(a + b))


aaaa = input().split()
print(int(aaaa[0]) + int(aaaa[1]))


(n, m) = map(int, input().split())
r = 0
print(int(n) + int(m))


try:
	while True:
		line = input()
		(a, b) = line.split()
		print(int(a) + int(b))
except EOFError:
	pass


import sys
import os
(a, b) = input().split()
a = int(a)
b = int(b)
print(a + b)


__author__ = '78799'
rdl = list(map(int, input().split()))
(a, b) = rdl
print(a + b)


inp = input().split()
print(int(inp[0]) + int(inp[1]))


import sys
import time
from pprint import pprint
from sys import stderr
from itertools import combinations
INF = 10 ** 18 + 3
EPS = 1e-10
MAX_CACHE = 10 ** 9

def time_it(function, output=stderr):

	def wrapped(*args, **kwargs):
		start = time.time()
		res = function(*args, **kwargs)
		elapsed_time = time.time() - start
		print('"%s" took %f ms' % (function.__name__, elapsed_time * 1000), file=output)
		return res
	return wrapped

@time_it
def main():
	print(sum(map(int, input().split())))

def set_input(file):
	global input
	input = lambda : file.readline().strip()

def set_output(file):
	global print
	local_print = print

	def print(*args, **kwargs):
		kwargs['file'] = kwargs.get('file', file)
		return local_print(*args, **kwargs)
set_input(open('input.txt', 'r') if 'MINE' in sys.argv else sys.stdin)
set_output(sys.stdout)
main()


(num2, num3) = input().split()
num2 = int(num2)
num3 = int(num3)
print(num2 + num3)


lst = input().split()
answer = sum((int(x) for x in lst))
print(answer)