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:
New Year Letter
Wilbur and Strings
Distributed Join
Maximum Flow
Sharti
Valid BFS?
The Child and Binary Tree
Parallel Programming
Running with Obstacles
Wilbur and Array
Haar Features
Limak and Shooting Points
Finding strongly connected components - Building condensation graph
Wrong Answer on Test 233 (Easy Version)
Lowest Common Ancestor - Tarjan's off-line algorithm
Number of divisors / sum of divisors
To Play or not to Play
Deleting from a data structure in $O(T(n)\log n)$
New Year and the Sphere Transmission
Suffix Tree. Ukkonen's Algorithm
Producing Snow
Rusty String
Search for connected components in a graph
Oriented area of a triangle
Kate and imperfection
Check if point belongs to the convex polygon in $O(\log N)$
Flawed Flow
Jongmah
Watchmen
Maze
Orchestra
Treap (Cartesian tree)