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:
Choosing Subtree is Fun
Marvolo Gaunt's Ring
Linear Congruence Equation
Refactoring
Aquarium decoration
E-mail Addresses
Burnside's lemma / Pólya enumeration theorem
Train Tracks
Three Blocks Palindrome
Long Beautiful Integer
Robot Sequence
Zuma
Bookshelves
Nested Rubber Bands
Minimum spanning tree - Prim's algorithm
Randomized Heap
Package Delivery
Let's Play Osu!
Arson In Berland Forest
Tidying Up
Coffee Varieties (hard version)
Drazil Likes Heap
Sereja ans Anagrams
The Evil Temple and the Moving Rocks
Declined Finalists
Can Bash Save the Day?
Flowers
Cartoons
Rotate Columns (easy version)
Minimum Euler Cycle
Good Subsets
Generate a String