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:
Definite Game
Carrot Cakes
Composite Coloring
Maximum flow - Ford-Fulkerson and Edmonds-Karp
Huffman Coding on Segment
New Year and Conference
Perfect Pair
Extended Euclidean Algorithm
Round Marriage
Kay and Snowflake
Kuroni and Simple Strings
Road Repairs
Parliament of Berland
And Yet Another Bracket Sequence
Om Nom and Dark Park
Challenges in school №41
New Year and Finding Roots
Network Mask
XORinacci
Aquarium decoration
Largest Submatrix 3
Elections
Kaavi and Magic Spell
Table
String Hashing
Dima and Figure
Xor-Set
Vanya and Computer Game
Square Table
Cookie Clicker
Jordan Smiley
Work Group