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:
Digits
Robbers' watch
Degenerate Matrix
Cinema
Bash's Big Day
Design Tutorial: Make It Nondeterministic
Neural Network country
Rusty String
Biridian Forest
Hongcow Builds A Nation
Chain Reaction
Power Tree
Magic Stones
Bulbo
Zip-line
Salazar Slytherin's Locket
K-th order statistic in O(N)
Optimal Point
Pumping Stations
Minimum stack / Minimum queue
Dima and Figure
Finding Intersection of Two Segments
Mystic Carvings
Wilbur and Swimming Pool
Berland SU Computer Network
Wise Men (Hard Version)
Minimum Euler Cycle
A Lot of Games
New Year and Castle Construction
Generate a String
Security
Decoding of Integer Sequences