代码

#include <set>
#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <fstream>
#include <iostream>
#include <algorithm>
#define LLD "%lld"
#define ll long long
#define vi vector <int>
#define pii pair <int, int>
#define forall(x,c) for (auto x : c)
#define rep(i,n) for (int i = 0; i < int(n); ++ i)
using namespace std;

namespace IO {
	const int BUF_SIZE = 1 << 15;
	char IBUF[BUF_SIZE], OBUF[BUF_SIZE];
	char *PIBUF = IBUF + BUF_SIZE - 1, *POBUF = OBUF;
	
	inline int getchar() {
		if (++ PIBUF == IBUF + BUF_SIZE)
			fread(PIBUF = IBUF, 1, BUF_SIZE, stdin);
		return *PIBUF;
	}
	
	inline void putchar(int x) {
		*POBUF = x;
		if (++ POBUF == OBUF + BUF_SIZE)
			fwrite(POBUF = OBUF, 1, BUF_SIZE, stdout);
	}
	
	inline void flush() {
		if (POBUF != OBUF)
			fwrite(OBUF, 1, POBUF - OBUF, stdout);
	}
}

#define getchar()  IO :: getchar()
#define putchar(x) IO :: putchar(x)

inline
int getint() {
	int a = 0, c = getchar();
	for (;!isdigit(c); c = getchar());
	for (; isdigit(c); c = getchar()) a = (a<<3) + (a<<1) + (c^48);
	return a;
}

template <typename T>
inline void putint(T x) {
	if (x < 0) putchar('-');
	if (x >= 10) putint(x / 10);
	putchar(x - x / 10 * 10 + 48);
}

const int Maxn = 1 << 10;
int n, a[Maxn], b[Maxn];

void Read() {
	n = getint();
	rep(i, n) {
		a[i] = getint();
		b[i] = getint();
	}
}

void Init() {
}

void Solve() {
	rep(i, n) putint(a[i] + b[i]), putchar('\n');
}

int main() {
#ifdef DEBUG
	freopen("/home/denverjin/input",  "r", stdin);
	freopen("/home/denverjin/output", "w", stdout);
#endif
	Read();
	Init();
	Solve();
	IO :: flush();
	return 0;
}

评测结果