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:
Walk on Matrix
Sum of Nestings
Cinema
Lazy Security Guard
Prefix-Suffix Palindrome (Hard version)
King Escape
Washer, Dryer, Folder
Finding the Eulerian path in $O(M)$
Little Artem and Grasshopper
Paint the String
Point location in O(log n)
Suns and Rays
Greenhouse Effect
Promocodes with Mistakes
Network Topology
Travelling Through the Snow Queen's Kingdom
Letters Removing
Dynamic Programming on Broken Profile
Playing on Graph
Restore Cube
Salazar Slytherin's Locket
Second price auction
Bear and Displayed Friends
Wonder Room
Yet Another Array Queries Problem
Let Them Slide
Context Advertising
Rotate Columns (easy version)
Two-gram
Levels and Regions
Yui and Mahjong Set
Helga Hufflepuff's Cup