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:
EKG
Load Testing
Point location in O(log n)
Not Same
Lowest Common Ancestor - Tarjan's off-line algorithm
Born This Way
Merging Two Decks
Civilization
King Moves
Linova and Kingdom
Coprime Permutation
Minimum Euler Cycle
Irreducible Anagrams
SMSC
New Year and Ancient Prophecy
Enduring Exodus
Captains Mode
New Year and the Permutation Concatenation
Keyboard
Strange Function
Wilbur and Points
Three Blocks Palindrome
LRU
Finding area of simple polygon in $O(N)$
Card Game
Finding bridges in a graph in $O(N+M)$
Tree Factory
Maximum Xor Secondary
Flowers
Paint the edges of the tree
Boolean Computer
Wheels