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:
Exploration plan
Product transformation
Noise Level
Cowboy Beblop at his computer
Treap (Cartesian tree)
Tree-Tac-Toe
Bus Video System
Love "A"
Finding area of simple polygon in $O(N)$
Egor and an RPG game
Tree Diameter
Arbitrary-Precision Arithmetic
Palindrome
Happy Cactus
Number of Ways
Depth First Search
Voting for Photos
Drazil Likes Heap
Primitive Root
Watching Fireworks is Fun
Tourism
Big Problems for Organizers
Maximum flow - Push-relabel method improved
Check if two segments intersect
Friends
New Year Shopping
New Year and the Permutation Concatenation
Prefix-Suffix Palindrome (Hard version)
And Yet Another Bracket Sequence
Counting labeled graphs
Circle-Circle Intersection
Counting Skyscrapers