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 ≤ 103), separated by a single space.
Output
Output the sum of the given integers.
Examples
input
5 14
output
19
input
381 492
output
873
Solution:
#include <iostream> #include <iomanip> #include <cstdio> #include <set> #include <vector> #include <map> #include <cmath> #include <algorithm> #include <memory.h> #include <string> #include <cstring> #include <sstream> #include <cstdlib> #include <ctime> #include <cassert> using namespace std; int main() { int a, b; cin >> a >> b; cout << a + b << endl; return 0; }
Related posts:
Preparing for Merge Sort
Startup Funding
Scaygerboss
Topological Sorting
The Holmes Children
Prefix Enlightenment
Command Line Arguments
Exercising Walk
Length of the union of segments
Dreamoon Likes Strings
Tennis Rackets
Black and White Tree
Distinct Paths
AND Segments
Intersecting Subtrees
Petr and Permutations
Half-plane intersection - S&I Algorithm in O(Nlog N)
Meeting Her
Irreducible Anagrams
Huffman Coding on Segment
Packmen
Balanced bracket sequences
Andrey and Problem
Polygons
Bear and Displayed Friends
New Year Permutation
Minimum Euler Cycle
Ternary Search
Place Your Ad Here
Ilya and a Colorful Walk
Counting labeled graphs
Bad Ugly Numbers