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:
Piet's Palette
Gena and Second Distance
Delivery Club
Minimum-cost flow - Successive shortest path algorithm
Cow and Message
Petr and Permutations
Serega and Fun
Arbitrary-Precision Arithmetic
New Year and Cake
The Tower is Going Home
New Year and the Acquaintance Estimation
Wonder Room
Heroes of Making Magic III
Om Nom and Candies
Ehab the Xorcist
Kay and Snowflake
Unusual Graph
Median on Segments
Lucky Days
Landmarks
Hongcow Builds A Nation
Big Problems for Organizers
Not Wool Sequences
Treasure
Place Your Ad Here
Lingua Romana
Three Integers Again
Bash's Big Day
Vanya and Lanterns
Processing Queries
Rabin-Karp Algorithm for string matching
Finding area of simple polygon in $O(N)$