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:
Deduction Queries
Operations on polynomials and series
Closest Equals
Topological Sorting
Berland SU Computer Network
Finding common tangents to two circles
Stars and bars
Chip Game
World Eater Brothers
Messy
Football
Berland Federalization
Disjoint Set Union
Tổng hợp các bài toán duyệt với gợi ý lời giải
Two Regular Polygons
Composite Coloring
Smallest Word
Magic Odd Square
Integration by Simpson's formula
Divisor Paths
Ebony and Ivory
Intersection Point of Lines
Double Elimination
Fence
Auto completion
Graph Decomposition
Delaunay triangulation and Voronoi diagram
New Year and Ascent Sequence
Design Tutorial: Learn from Math
Egor and an RPG game
Sieve of Eratosthenes Having Linear Time Complexity
Lattice points inside non-lattice polygon